Abstract: A real-time data transport protocol directed to aggregating multiple packets of a real-time protocol session and transmitting redundant copies of the packets as defined by a sliding window. In particular implementations, a method comprising accessing a plurality of packets of a real-time protocol session; aggregating, over a sliding window, a contiguous sequence of packets in the plurality of packets into real-time data transport packets, and transmitting the real-time data transport packets to a receiving node.

Abstract: In one embodiment, one or more routing trees may be determined based on corresponding root nodes to reach a particular receiving node in a computer network. A delay value may be calculated at each node of the routing tree, the delay value inversely proportional to a distance between each respective node and the root node of the tree. Upon detecting a trigger at a particular node of the tree to transmit a stormed message to the particular receiving node (e.g., an alarm), the particular node may initiate a timer to count down the delay value in order to receive any upstream node stormed messages prior to expiration of the timer. The particular node may then coalesce the upstream node stormed messages with the stormed message of the particular node, and may transmit the coalesced stormed message downstream along the tree toward the particular receiving node upon expiration of the timer.

Abstract: In one embodiment, a node in a computer network may receive data of a particular type at a first frequency (e.g., a sensor in a sensor network), and may correspondingly determine whether there is at least one interested subscriber for the data of the particular type, where the interested subscriber desires the data at a second frequency. If there is an interested subscriber, buffered data publishing may be dynamically activated at the node in response to a ratio between the second and first frequencies being less than a configured threshold. In particular, buffered data publishing comprises buffering the received data and transmitting a latest received data to the interested subscriber at the second frequency.

Abstract: In one embodiment, a clustering device may determine one or more sensor clusters having a plurality of sensor devices that report similar data of a same data type in a sensor network. Accordingly, the clustering device may select a subset of the sensor devices in each respective sensor cluster as one or more representative devices, such that a sensor sink obtains data from only the representative devices.

Abstract: In one embodiment, a more capable device (MCD) in a computer network may determine one or more a critical destinations (CDs), and may transmit an unsolicited reactive routing route request (RREQ) message to each CD. The MCD may then receive a route reply (RREP) message from the CDs having a route from the MCD to the CD, and may store the route at the MCD. Subsequently, the MCD may transmit a RREP message of its own to one or more less capable devices (LCDs) to provide the route from each respective LCD to the CD via the MCD.

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: Methods and apparatus for registering with a Home Agent are disclosed. The network device sends a registration request having a home address field including an IP address to a Home Agent associated with the IP address. The registration request indicates one or more ports of the network device via which data packets or server requests addressed to the IP address are to be received. The ports may be specified in a port extension to the registration request. In addition, the registration request may indicate a priority to be associated with the registration. The Home Agent updates its mobility binding table with the IP address and care-of address, as well as other information specified in the registration request, such as port and/or priority information. The Home Agent then sends a registration reply to the network device. When the registration request is not sent directly by the network device (e.g.

Abstract: Each network node having at least one destination-oriented link toward a directed acyclic graph (DAG) destination can receive a corresponding set of path performance metrics via the destination-oriented link. The set of path performance metrics, initiated by the DAG destination outputting initial link metrics on each of its source-connecting links, identifies aggregate link metrics for a corresponding path to the DAG destination via the corresponding destination-oriented link. The network node outputs a corresponding updated set of path performance metrics on each of its source-connecting links based on the received set of path performance metrics and the corresponding link metric for the corresponding source-connecting link. Hence, each network node in the DAG can assess the performance of each connected path to the DAG destination, and forward a data packet via a selected destination-oriented link based on the corresponding path performance metrics and forwarding policies for the forwarded data packet.

Abstract: Each mobile ad hoc node has an assigned hierarchy position within an identified tree-based aggregation group. Each ad hoc node is configured for selectively attaching to one of a plurality of available ad hoc nodes based on identifying a best match, for the assigned hierarchy position within the identified aggregation group, from among identifiable hierarchy positions of identifiable aggregation groups. Each ad hoc node also is configured for selectively attaching to any available ad hoc node based on a determined absence of any available ad hoc node advertising the identified aggregation group of the ad hoc node, or an aggregation group containing the identified aggregation group. Hence, a root node of an aggregation group can filter group-specific routing information from packets destined toward a network clusterhead, resulting in a scalable routing protocol that is not adversely affected by added nodes.

Abstract: Each network node in a network is configured for calculating a directed acyclic graph that provides at least one path from all the other network nodes toward the one network node. The network node performs a modified shortest path first calculation by identifying next-hop nodes adjacent to the network node, and orienting the link of each next-hop node toward itself (i.e., the origin). The network node also identifies secondary adjacent nodes, adjacent to each of the next hop nodes, and extends paths from next-hop nodes to the associated secondary adjacent nodes while orienting each of the links of the path between adjacent nodes and next-hop nodes toward the next hop nodes. The paths of the nodes form a directed acyclic graph from any other network node toward the origin, enabling distribution of the directed acyclic graph to the other network nodes for optimized reachability to the network node.

Abstract: A mobile router is configured for attaching to a selected router in a clustered network (e.g., a mobile ad hoc network) based on identifying a network topology model of the clustered network from received router advertisement messages that include tree information option fields specifying attributes of the network topology model. The mobile router selects which router advertisement originator to attach to based on correlating the attributes of the router advertisement originators relative to identified priorities, and orders the router advertisement originators within a default router list based on the identified priorities. If the mobile router detects a router from a second clustered network, the mobile router advertises to the attachment router that the second clustered network is reachable, enabling the two clustered networks to communicate using a point-to-point link between the respective attachment routers.

Abstract: Disclosed are, inter alia, methods, apparatus, computer-storage media, mechanisms, and means associated with determining and distributing routing paths for nodes in a network. For each route computational node of multiple route computational nodes in a network: a tree of paths between itself and each of multiple nodes in the network is determined. A particular tree of paths is determined for a particular node of these multiple nodes to the other nodes based on at least two of the determined trees of paths for the route computational nodes. The particular node then sends a packet towards a destination based on the particular tree of paths determined for the particular node.

Abstract: An IPv4 host is able to maintain connectivity within an access network while moving among access points of the access network, based on receiving a unique assigned IPv4 address from a clusterhead of the access network. Any DHCP request by the IPv4 host is sent via the connecting access point to the clusterhead. The clusterhead, providing connectivity for hosts in the access network to a wide area network based on respective entries, assigns the IPv4 address to the IPv4 host, based on storing an entry including the IPv4 address and an IP-based identifier of the connecting access point, and sends a DHCP response to the IPv4 host via the connecting access point. A second DHCP request from the IPv4 host to a second access point causes the clusterhead to update the entry with the second access point identifier, enabling the IPv4 host to continue use of the assigned IPv4 address.

Abstract: In one embodiment, a received data packet is delivered by a routing resource to a tunnel interface resource in response to determining that the received data packet specifies a destination address starting with a prescribed aggregation prefix. The tunnel interface resource computes a home address for a mobile router based on a second address prefix from a start of the destination address, the second address prefix within the prescribed aggregation prefix and having been assigned as reachable by the mobile router, at least a portion of the second address prefix applied to a prescribed mapping function. The tunnel interface resource determines a care-of address for reaching the mobile router based on the corresponding home address calculated by the tunnel interface resource, and encapsulates the received data packet into an encapsulated packet having a destination address field specifying the care-of address, for output of the encapsulated packet toward the mobile router.

Abstract: The present disclosure generally provides techniques for establishing a unique, ephemeral home address (hoa)/home agent address (ha?) address pair that may be limited to use in a session having a defined lifetime. Limiting the use of this dynamic address pair to a session lifetime and by preventing a mobile node from knowing the static address of a home agent may help protect the home agent from attacks.

Abstract: A network includes network nodes and a gateway. Each network node has a corresponding unique in-site IPv6 address for communication within a prescribed site, each in-site IPv6 address having a first IPv6 address prefix that is not advertised outside of the prescribed site. Network nodes can obtain from within the prescribed site a unique extra-site IPv6 address for mobile or extra-site communications. The extra-site IPv6 address has a second IPv6 address prefix, distinct from the first IPv6 address prefix, advertised by the gateway to the prescribed site and the wide area network. The gateway establishes a secure connection (e.g., tunnel) with each corresponding IPv6 node using its corresponding extra-site IPv6 address, and creates a corresponding binding cache entry specifying the corresponding extra-site IPv6 address and in-site IPv6 address. Hence, the gateway provides wide area network access while maintaining secrecy of the in-site IPv6 addresses.

Abstract: A clusterhead of a tree-based, mobile ad hoc network includes a mobile IP proxy resource for registering a received binding update request from a mobile ad hoc router within the network, creating a first mobile IP tunnel with the mobile ad hoc router, sending a second binding update request to a remote home agent of the mobile ad hoc router, and initiating a second mobile IP tunnel between the clusterhead and the home agent. If a packet received from the mobile ad hoc router specifies a destination determined as reachable within the mobile ad hoc network, use of the second mobile IP tunnel is minimized by outputting the packet toward the destination according to the mobile ad hoc routing protocol. If the packet is not reachable within the mobile ad hoc network, the packet is forwarded via the second mobile IP tunnel to ensure packet transmission is topologically correct.

Abstract: In one embodiment, a reactive routing computer network may be partitioned into diverse logical topologies, and a source node may transmit route request (RREQ) messages toward a destination node on each logical topology. In response, the source node may receive route reply (RREP) messages indicating routes to the destination node in each logical topology. The source node may thus select a route for each logical topology to reach the destination node, accordingly. In another embodiment, if partitioned logical topologies do not produce two or more routes or as a standalone embodiment, the source node may transmit RREQ messages toward the destination node without any corresponding logical topology. The destination node receives RREQ messages, and two or more routes from the source node to the destination node may be determined (e.g., by the destination or source node) based on the received RREQ messages at the destination node and path selection criteria.

Abstract: Each router in a network is configured for executing a link state routing protocol based on outputting a corresponding first link state advertisement message describing a connected link of the router and that specifies a first dynamic routing metric identifying a first cost of the connected link, and a corresponding variation metric identifying a statistical variation of the dynamic routing metric. Each router also is configured for selectively outputting a corresponding second link state advertisement message describing the connected link and that specifies the corresponding variation metric and an updated dynamic routing metric identifying an updated cost of the connected link relative to the first cost, the second link state advertisement message selectively output based on the updated dynamic routing metric differing from the first dynamic routing metric by more than the variation metric, or the router having received another link state advertisement from another router in the network.

Abstract: In one embodiment, a method comprises detecting by a mesh access point a number of wireless network nodes that are attached to the mesh access point within a mesh network; calculating by the mesh access point an attachment preference factor that enables at least one other wireless network node to determine whether to attach to the mesh access point, wherein the mesh access point increases the attachment preference factor based on a corresponding increase in the number of wireless network nodes that are attached to the mesh access point; and outputting by the mesh access point the attachment preference factor, enabling the at least one other wireless network node to determine whether to attach to the mesh access point.