Abstract:
In one embodiment, a device in a network determines whether a destination address of a packet received by the device is within a neighbor discovery (ND) cache of the device. The device determines whether the destination address is not in a set of addresses used to generate an address lookup array or possibly in the set of addresses used to generate the address lookup array, in response to determining that the destination address of the packet is not within the ND cache. The device performs address resolution for the destination address of the packet, in response to determining that the destination address of the packet is possibly in the set of addresses used to generate the address lookup array.
Abstract:
In one embodiment, the locations of a plurality of network devices in a low power and lossy network (LLN) are determined along an intelligent wire. One or more neighboring devices for each network device in the plurality are identified based on the locations of the network devices along the intelligent wire. A communication schedule for the network devices is determined that prevents neighboring devices along the intelligent wire from transmitting on the same frequency. The network devices are assigned to communication time slots based on the communication schedule. The network devices are also assigned frequency offsets based on the communication schedule.
Abstract:
Each mobile router in an ad hoc mobile network is configured for concurrently attaching to multiple parents advertising respective parent depths relative to a clusterhead of the ad hoc mobile network. The mobile router selects an advertised depth relative to the clusterhead based on adding a prescribed increment to a maximum one of the parent depths, enabling the mobile routers to form a directed acyclic graph relative to the clusterhead. Each mobile router sends to each of its parents a neighbor advertisement message specifying at least one reachable prefix, a corresponding cost for reaching the reachable prefix, and a corresponding sequence identifier that enables the parents to validate the neighbor advertisement message relative to stored router entries . Hence, mobile routers automatically can form a directed acylic graph relative to the clusterhead, and can distribute routing information with minimal overhead.
Abstract:
A system for providing a tree topology for a network having an interior gateway protocol. A first router receives a hello message from all connected routers in the network. The hello messages include tree topology information. The first router then uses the tree topology information to determine a parent of the router. The first router then establishes connections with directly connected routers at the same level in the tree topology. The first router also generates link messages that include all of the prefixes for children of the first router and broadcasts the link messages.
Abstract:
One embodiment includes tracking utilization of the backhaul wireless bandwidth of a mesh network related to time sensitive packet data, receiving a call admission request for a call from a client station of a first mesh access point of the mesh, ascertaining using the tracked utilization whether to approve the call admission request using a backhaul call admission control method, and approving the call by sending a positive call admission response if the backhaul call admission control method approves the call and if an access level call admission control method ascertains to approve the call admission request at the access level.
Abstract:
Each mobile router in an ad hoc mobile network is configured for concurrently attaching to multiple parents advertising respective parent depths relative to a clusterhead of the ad hoc mobile network. The mobile router selects an advertised depth relative to the clusterhead based on adding a prescribed increment to a maximum one of the parent depths, enabling the mobile routers to form a directed acyclic graph relative to the clusterhead. Each mobile router sends to each of its parents a neighbor advertisement message specifying at least one reachable prefix, a corresponding cost for reaching the reachable prefix, and a corresponding sequence identifier that enables the parents to validate the neighbor advertisement message relative to stored router entries . Hence, mobile routers automatically can form a directed acylic graph relative to the clusterhead, and can distribute routing information with minimal overhead.
Abstract:
Gateways providing connectivity for respective private IPv4 networks to an IPv6 network establish communications between IPv4 nodes in the private network. Network address translation-protocol translation (NAT-PT) state entries are created by gateway pairs enabling translation of IPv4 packets between first and second IPv4 nodes in respective first and second IPv4 private networks into IPv6 packets for transmission via the IPv6 network. Each NAT-PT state entry specifies the IPv6 addresses for the first and second IPv4 nodes, and the IPv4 addresses used to identify the first and second IPv4 nodes in the corresponding private IPv4 network. Each gateway is configured for generating the IPv6 address for each local IPv4 node based on prepending its corresponding assigned private IPv4 address with a corresponding prescribed IPv6 prefix assigned to the gateway. Hence, gateways can dynamically establish communications between private networks without tunneling protocols, enabling deployment of latency-sensitive applications such as Voice over IP.