Patent classifications
H04L12/753
PACKET TRANSMISSION METHOD AND APPARATUS
An embodiment of a Network Virtualization Edge (NVE) device for transmitting packets receives a packet including a source address and a destination address. The NVE device obtains an active-active access configuration information list including a first entry and a second entry, where the first entry includes an identifier of a first active-active group, a Virtual Network Instance (VNI), and an identifier of the NVE device, and the second entry includes an identifier of a second active-active group, a VNI, and identifiers of at least two NVE devices that belong to the second active-active group. The NVE device obtains the VNI according to the identifier of the NVE device, searches for one active-active group corresponding to the VNI, selects a second NVE device from the at least two NVE devices; and encapsulates the packet using an identifier of the second NVE device and the VNI, and sends the packet.
Apparatus and method for processing alternately configured longest prefix match tables
A network switch includes a memory configurable to store alternate table representations of an individual trie in a hierarchy of tries. A prefix table processor accesses in parallel, using an input network address, the alternate table representations of the individual trie and searches for a longest prefix match in each alternate table representation to obtain local prefix matches. The longest prefix match from the local prefix matches is selected. The longest prefix match has an associated next hop index base address and offset value. A next hop index processor accesses a next hop index table in the memory utilizing the next hop index base address and offset value to obtain a next hop table pointer. A next hop processor accesses a next hop table in the memory using the next hop table pointer to obtain a destination network address.
System and method for auto-discovery and mapping of networked modules
A method of performing automated discovery and mapping of the topology of a network is provided, wherein the networked modules include discovery and mapping-enabled modules and standard modules that are not discovery and mapping-enabled and wherein the network connections include both data connections and power connections. The method comprises the following steps: a) powering up all discovery and mapping-enabled modules on the network with current trips set to maximum level; b) powering up all standard modules; c) determining what modules are on the network; d) determine the topology of the network, including where the modules are connected within the network; e) using the determined topology to determine power requirements for the modules on the network; and f) adjusting the power distribution on the network to accommodate the identified power needs of the network.
Chirp networks
A network combining wireless and wired elements is described, using a multi-slot modular mesh node to house diverse transceiver elements (e.g. IR, Wi-Fi, Powerline). A radio agnostic tree based mesh network is formed, based on what type of wireless links are formed on the uplink and downlink of the backhaul and what type of radios are used for the Access Points AP. In addition to servicing IP based clients (e.g. Wi-Fi, WiMax, Bluetooth), the modular mesh nodes APs may also serve as receivers/collectors for low cost chirp devices. The method of transport is standard IP based packets yet security is inherent in this chirp-based implementation: only mesh nodes are privy to the routing tables that indicate that packet addresses are not IP. Multiple methods to obfuscate packet flow are presented. An organic approach to providing category/class based form of data type identification is proposed, to support a (dynamic) M2M Social Network Applications in-device discovery, registration and control are presented.
MODULAR ARCHITECTURE FOR COMPUTER NETWORK OPERATIONS
Disclosed embodiments include a method of operation of a distributed network system. The method includes nodes of the network system that send messages over a protocol-independent message bus, and other nodes that receive the messages. Content from the received messages can be stored in a database distributed among nodes of the network system. At least some of the content stored in the database is published. The published content can be accessed by one or more applications to perform one or more functions.
Wireless mesh network including resilient backhaul links and WLAN traffic local switching
A wireless mesh network includes mesh access points (mesh APs) and a root access point (RAP) forming a root of a tree of the mesh APs in which the mesh APs are linked back to the RAP through parent-child relationships over wireless backhaul links. A mesh AP provides access to the mesh network via connections to wireless clients in one or more wireless local area networks (WLANs) served by the mesh AP. The mesh AP stores mappings between the one or more WLANs served by the mesh AP and one or more virtual local area networks (VLANs) configured on a wired network and to which the WLANs are assigned. The mesh AP receives mappings between the VLANs configured on the wired network and WLANs served by the mesh AP as known by the RAP. If the stored mappings and the received mappings differ, the mesh AP updates the stored mappings with the received mappings that differ from the stored mappings.
HANDLING SOURCE ROUTED CONTENT
Methods for handling source-routed content are provided, together with apparatuses for performing the methods. A method at a receiving network node includes receiving a data transmission. The data transmission has control information and a content payload. The receiving node determines whether the control information includes an instruction to execute an action. This determination may involve determining that the instruction is directed to the receiving node. In response, the receiving node performs the action. The action may include caching the content at the receiving node. The receiving node also forwards the content payload in accordance with the control information.
Apparatus and method for generating routing data used in a tree-shaped connection
An apparatus generates routing data that defines, in a system in which a plurality of switches are connected to each other in a tree-shaped structure, a communication route between a plurality of end switches located at a lower level in the tree-shaped structure and a plurality of upper-level switches located at a level higher than the plurality of end switches in the tree-shaped structure, so that a first upper-level switch that switches communication data from a first node connected to a first end switch among the plurality of end switches to a second node connected to a second end switch among the plurality of end switches is identical with a second upper-level switch that switches communication data from the second node to the first node. The apparatus stores the generated routing data in a memory provided for the apparatus.
PROCESSING INTER-VLAN TRAFFIC IN AN ETHERNET TREE
A device may receive, from a first device associated with a first LAN, network traffic destined for a second LAN. The device may provide the first LAN with access to a core network. The device may not provide the second LAN with access to the core network. The device may identify, based on the network traffic, a Layer 3 address associated with a second device. The second device may be associated with the second LAN. The device may determine that the first device is categorized as a leaf device within an Ethernet Tree provided by the device. The device may determine, based on the Layer 3 address, that the second device is categorized as a leaf device within the Ethernet Tree. The device may drop the network traffic based on determining that the first device and the second device are categorized as leaf devices within the Ethernet Tree.
Non-isolated topologies in computing network environments
Example implementations relate to management of network topologies. A primary tree having multiple connection graphs is generated for each node in the network. Each connection graph has at least one ordered list of one or more network node connections and the generated connection graphs provide a full network fit for each node in the network. The connection graphs are stored in at least one network switch to be used for network switch functionality. Additional connection graphs are generated for one or more network nodes connections based at least on network link capacity and provide for sharing of one or more of network links between multiple network node connections. The additional connection graphs are stored in the at least one network switch to be used for subsequent network switch functionality.