Patent application number | Description | Published |
20080204199 | Method And System For Remotely Provisioning And/Or Configuring A Device - A method and system for remotely configuring and/or provisioning a device that is nonoperational is provided. The device may be, in general, any electronic device that includes at least one setting (“device setting”) that can be programmatically or otherwise established or adjusted to configure and/or provision the device for its operation. The method includes detecting, via a radio frequency identification (“RFID”) tag, a state of a device that is communicatively coupled to the RFID tag; and providing the device setting via the RFID tag when the state signifies that the device is nonoperational. | 08-28-2008 |
20080205313 | Route optimization between a mobile router and a correspondent node using reverse routablility network prefix option - In one embodiment, a method includes generating by a mobile router a home test message that includes a prefix option field specifying at least one mobile network prefix claimed to be owned by the mobile router. The method also includes outputting the home test message by the mobile router to a correspondent node via a prescribed home agent assigned to the mobile router, for initiation of a reverse routability test between the mobile router and the correspondent node that verifies the mobile router owns the at least one mobile network prefix. In another embodiment, the home agent is configured for forwarding a route optimization message, for example the home test message, to the correspondent node if the home agent determines that the at least one mobile network prefix is owned by the mobile router. | 08-28-2008 |
20080212494 | Ad hoc network formation and mangement based on aggregation of ad hoc nodes according to an aggregation hierarchy - 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. | 09-04-2008 |
20080219237 | Multicast support by mobile routers in a mobile ad hoc network - In one embodiment, a mobile router receives a multicast-supported router advertisement message from an attachment mobile router in a mobile ad hoc network, the multicast-supported router advertisement message specifying an attachment prefix and a multicast-capable identifier. The mobile router attaches to the attachment mobile router in response to the multicast-supported router advertisement message and according to a protocol requiring establishment in the mobile ad hoc network of a tree topology having a single multicast clusterhead, and selects a default attachment address within an address space of the attachment prefix. The mobile router receives a multicast request, from an attached node, for receiving a multicast stream, and the mobile router outputs a neighbor advertisement message with multicast extension, to the attachment router, that specifies that access to the multicast stream is requested via the default attachment address. | 09-11-2008 |
20080225804 | Real-Time Sessions for Wireless Mesh Networks - 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. | 09-18-2008 |
20080228940 | Joining tree-based networks into an autonomous system using peer connections between the tree-based networks - In one embodiment, a first router attaches to an attachment router based on detecting a first router advertisement message specifying an attachment prefix and a first tree information option. The first tree information option includes a first IP host address of a first clusterhead having established a first tree topology. The first router receives a second advertisement from a second router specifying a second address prefix, distinct from the attachment prefix and the first address prefix of the first router, and a second tree information option specifying a second IP host address of a second clusterhead having established a second distinct tree topology. If the first and second routers are at equal depths relative to the respective first and second clusterheads, routing information is shared, including first address prefix reachable via the first router, and a host route for reaching the first IP host address via the first router. | 09-18-2008 |
20080240078 | Path shortening in a wireless mesh network - In one embodiment, a method includes a mesh point receiving mesh advertisement messages from advertising mesh points of a wireless mesh network having a mesh portal with a wired connection to a wired network. Each mesh advertisement message specifies a corresponding metric for reaching the mesh portal and has a corresponding signal strength indicator. An ordered group of parent access points, ordered based on the respective metrics, is generated from among the advertising mesh points, starting with a first parent access point having a corresponding optimum metric for reaching the mesh portal and independent of the corresponding signal strength indicator. A registration message is sent to each of the parent access points identifying a corresponding specified priority based on a corresponding position in the ordered group, for use by the corresponding parent access point in selecting a minimum interframe spacing for forwarding a wireless packet received from the mesh point. | 10-02-2008 |
20080263353 | AUTOCONFIGURED PREFIX DELEGATION BASED ON DISTRIBUTED HASH - In one embodiment, a method comprises detecting, by a router, an unsolicited first router advertisement message from an attachment router that provides an attachment link used by the router, the first router advertisement message specifying a first IPv6 address prefix owned by the attachment router and usable for address autoconfiguration on the attachment link; detecting, by the router, an unsolicited delegated IPv6 address prefix from the attachment router and that is available for use by the router; and automatically selecting by the router a second IPv6 address prefix based on concatenating a suffix to the delegated IPv6 address prefix, including dynamically generating the suffix based on a prescribed distributed hash operation executed by the router, the second IPv6 address prefix for use on at least one ingress link of the router. | 10-23-2008 |
20080304457 | Secure mobile IPv6 registration - In one embodiment, a method comprises receiving by an agent a request from a network node for generation of a secure IPv6 address for use by the network node, the request including a selected subset of parameters selected by the network node and required for generation of the secure IPv6 address according to a prescribed secure address generation procedure, the selected subset including at least a public key owned by the network node; dynamically generating by the agent at least a second of the parameters required for generation of the secure IPv6 address; generating by the agent the secure IPv6 address based on the selected subset and the second of the parameters required for generation of the secure IPv6 address; and outputting, to the network node, an acknowledgment to the request and that includes the secure IPv6 address, and the parameters required for generation of the secure IPv6 address. | 12-11-2008 |
20080307516 | Secure neighbor discovery router for defending host nodes from rogue routers - In one embodiment, a method comprises receiving, by a router in a network, a router advertisement message on a network link of the network; detecting within the router advertisement message, by the router, an advertised address prefix and an identified router having transmitted the router advertisement message within the network; determining, by the router, whether the identified router is authorized to at least one of advertise itself as a router, or advertise the advertised address prefix on the network link; and selectively initiating, by the router, a defensive operation against the identified router based on the router determining the identified router is not authorized to advertise itself as a router, or advertise the advertised address prefix on the network link. | 12-11-2008 |
20090024758 | Detecting neighbor discovery denial of service attacks against a router - In one embodiment, a method comprises initiating neighbor discovery in response to detecting an absence of an IP destination address of a received data packet within a neighbor cache, including outputting a neighbor solicitation message targeting the IP destination address into a network served by the router, generating a hash index value based on the IP destination address combined with a randomized token stored in the router, and storing the data packet in a selected one of a plurality of pending message queues in the router based on the corresponding hash index value, each pending message queue configured for storing stored data packets having the corresponding hash index value and awaiting respective solicited neighbor advertisement messages from the network; and detecting whether the router is encountering a neighbor discovery denial of service attack based on a determined distribution of the stored data packets among the pending message queues. | 01-22-2009 |
20090085769 | AGGREGATION AND PROPAGATION OF SENSOR DATA WITHIN NEIGHBOR DISCOVERY MESSAGES IN A TREE-BASED AD HOC NETWORK - In one embodiment, a method comprises attaching, by a mobile router, to an attachment router according to a protocol requiring establishment of a tree topology having a single clusterhead, the attaching by the mobile router based on the mobile router receiving, from the attachment router, an advertisement message specifying an attachment prefix; outputting a second advertisement message specifying availability of a prescribed address prefix used by the mobile router, and further specifying attributes of the mobile router relative to the tree topology; receiving a plurality of sensor data messages from at least one attached sensor host node, each sensor data message specifying at least one sensor data element specifying a detected sensor parameter; aggregating the sensor data elements from the sensor data messages into aggregated sensor data; and generating and outputting a neighbor advertisement message to the attachment router, the neighbor advertisement message specifying the aggregated sensor data. | 04-02-2009 |
20090122797 | ROUTING OPERATIONS USING SENSOR DATA - In one embodiment, a method comprises an Internet Protocol (IP) router receiving sensor data from at least one of a second IP router or an attached host sensor node, the sensor data distinct from link data of a network link; the IP router generating sensor information based on storing the sensor data with metadata describing reception of the sensor data by the IP router in a routing information base; and the IP router executing a routing operation based on the sensor information stored in the routing information base. | 05-14-2009 |
20090129309 | Retransmitting lost packet with subsequent received packet - In one embodiment, a method comprises transmitting onto a wireless connection, by a device, a first wireless data packet destined for a second device; in response to a determined absence by the device of a required acknowledgment of the first wireless data packet from the second device, queuing by the device the first wireless data packet while waiting for a second wireless data packet; receiving by the device the second wireless data packet; and transmitting, by the device, the first wireless data packet with the second wireless data packet to the second device via the wireless connection in response to the device receiving the second wireless data packet and before any other device can send a data frame on the wireless connection. | 05-21-2009 |
20090175208 | Automatic Clustering of Wireless Network Nodes Toward Selected Mesh Access Points - 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. | 07-09-2009 |
20090285216 | MAINTAINING SECRECY OF ASSIGNED UNIQUE LOCAL ADDRESSES FOR IPV6 NODES WITHIN A PRESCRIBED SITE DURING ACCESS OF A WIDE AREA NETWORK - 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. | 11-19-2009 |
20090300217 | METHOD AND APPARATUS FOR DYNAMICALLY ASSIGNING UNIQUE ADDRESSES TO ENDPOINTS - 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. | 12-03-2009 |
20090323709 | Determining and Distributing Routing Paths for Nodes in a Network - 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. | 12-31-2009 |
20100125437 | DISTRIBUTED SAMPLE SURVEY TECHNIQUE FOR DATA FLOW REDUCTION IN SENSOR NETWORKS - 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. | 05-20-2010 |
20100125674 | SELECTIVE A PRIORI REACTIVE ROUTING - 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. | 05-20-2010 |
20100188979 | FORWARDING PACKETS TO A DIRECTED ACYCLIC GRAPH DESTINATION USING LINK SELECTION BASED ON RECEIVED LINK METRICS - 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. | 07-29-2010 |
20110080853 | DIRECTED ACYCLIC GRAPH DISCOVERY AND NETWORK PREFIX INFORMATION DISTRIBUTION RELATIVE TO A CLUSTERHEAD IN AN AD HOC MOBILE NETWORK - 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. | 04-07-2011 |
20110133924 | ALARM REORDERING TO HANDLE ALARM STORMS IN LARGE NETWORKS - In one embodiment, a sensor device in a network detects an alarm condition. The sensor device generates an alarm message based on the detected alarm condition and waits for a delay whose length is inversely proportional to a distance between the sensor device and a downstream destination device for which the alarm message is destined. During the delay, the sensor device receives one or more additional alarm messages from one or more upstream sensor devices. The sensor device coalesces the one or more received alarm messages from the one or more upstream sensor devices with the alarm message generated at the sensor device, to form a coalesced alarm message, and transmits the coalesced alarm message downstream towards the downstream destination device, after expiration of the delay. | 06-09-2011 |
20110228788 | ALTERNATE DOWN PATHS FOR DIRECTED ACYCLIC GRAPH (DAG) ROUTING - In one embodiment, a node “N” within a computer network utilizing directed acyclic graph (DAG) routing selects a parent node “P” within the DAG, and, where P is not a DAG root, may determine a grandparent node “GP” as a parent node to the parent node P. The node N may then also select an alternate parent node “P′” that has connectivity to GP and N. N may then inform P and P′ about prefixes reachable via N, and also about P′ as an alternate parent node to P to reach the prefixes reachable via N. Also, in one embodiment, P may be configured to inform GP about the prefixes reachable via N and also about P′ as an alternate parent node to P to reach the prefixes reachable via N, and P′ may be configured to store the prefixes reachable via N without informing other nodes about those prefixes. | 09-22-2011 |
20110231573 | DYNAMIC DIRECTED ACYCLIC GRAPH (DAG) ADJUSTMENT - In one embodiment, a root device may request that one or more devices of a computer network build a directed acyclic graph (DAG) for routing traffic within the computer network based on an objective function (OF), where the OF has one or more metrics to optimize the DAG against and optionally certain constraints. Particular devices that receive the request may then build the DAG based on the OF, and may determine and report OF feedback to the root device. Upon receiving the reports regarding OF feedback, the root device may then adjust the OF based on the feedback, and request a rebuild of the DAG from the devices based on the adjusted OF. | 09-22-2011 |
20120063436 | AGGREGATION AND PROPAGATION OF SENSOR DATA WITHIN NEIGHBOR DISCOVERY MESSAGES IN A TREE-BASED AD HOC NETWORK - In one embodiment, a method comprises attaching, by a mobile router, to an attachment router according to a protocol requiring establishment of a tree topology having a single clusterhead, the attaching by the mobile router based on the mobile router receiving, from the attachment router, an advertisement message specifying an attachment prefix; outputting a second advertisement message specifying availability of a prescribed address prefix used by the mobile router, and further specifying attributes of the mobile router relative to the tree topology; receiving a plurality of sensor data messages from at least one attached sensor host node, each sensor data message specifying at least one sensor data element specifying a detected sensor parameter; aggregating the sensor data elements from the sensor data messages into aggregated sensor data; and generating and outputting a neighbor advertisement message to the attachment router, the neighbor advertisement message specifying the aggregated sensor data. | 03-15-2012 |
20120093037 | PATH SHORTENING IN A WIRELESS MESH NETWORK - In one embodiment, a method includes a mesh point receiving mesh advertisement messages from advertising mesh points of a wireless mesh network having a mesh portal with a wired connection to a wired network. Each mesh advertisement message specifies a corresponding metric for reaching the mesh portal and has a corresponding signal strength indicator. An ordered group of parent access points, ordered based on the respective metrics, is generated from among the advertising mesh points, starting with a first parent access point having a corresponding optimum metric for reaching the mesh portal and independent of the corresponding signal strength indicator. A registration message is sent to each of the parent access points identifying a corresponding specified priority based on a corresponding position in the ordered group, for use by the corresponding parent access point in selecting a minimum interframe spacing for forwarding a wireless packet received from the mesh point. | 04-19-2012 |
20120117208 | Dynamic Address Assignment for Address Aggregation in Low Power and Lossy Networks - A node in a Low power and Lossy Network (LLN) is managed by monitoring a routing configuration on a node in a LLN. A triggering parameter that is used to invoke an address change on a child node is tracked and a threshold against which to compare the triggering parameter is accessed. The triggering parameter is compared to the threshold. Based on results of comparing the triggering parameter to the threshold, it is determined that an address change at the child node is appropriate. An address change of a child node appearing in the routing configuration is invoked based on the determination that an address change is appropriate. | 05-10-2012 |
20120257624 | ROUTING OPERATIONS USING SENSOR DATA - In one embodiment, a method comprises an Internet Protocol (IP) router receiving sensor data from at least one of a second IP router or an attached host sensor node, the sensor data distinct from link data of a network link; the IP router generating sensor information based on storing the sensor data with metadata describing reception of the sensor data by the IP router in a routing information base; and the IP router executing a routing operation based on the sensor information stored in the routing information base. | 10-11-2012 |
20120300668 | GENERATING A LOOP-FREE ROUTING TOPOLOGY USING ROUTING ARCS - In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching a destination device, each routing arc comprising a first network device as a first end of the routing arc, a second network device as a second end of the routing arc, and at least a third network device configured for routing any network traffic along the routing arc toward the destination device via any one of the first or second ends of the routing arc; and causing the network traffic to be forwarded along at least one of the routing arcs to the destination device. | 11-29-2012 |
20130088999 | ROUTE PREFIX AGGREGATION USING REACHABLE AND NON-REACHABLE ADDRESSES IN A COMPUTER NETWORK - In one embodiment, a network device determines a set of routes to one or more reachable addresses and also a set of no-routes to one or more non-reachable addresses in a computer network. The routes and no-routes may then be aggregated into one or more reachable route prefixes with one or more corresponding non-reachable no-route prefix exceptions. As such, the aggregated combination of route prefixes and no-route prefix exceptions may be utilized by the network device. | 04-11-2013 |
20130128773 | ALTERNATE DOWN PATHS FOR DIRECTED ACYCLIC GRAPH (DAG) ROUTING - In one embodiment, a node N, within a computer network that utilizes a directed acyclic graph (DAG) to route packets, may select a parent node P that is a parent to the node N in the DAG. The node N may determine a grandparent node GP within the computer network that is a parent of the parent node P in the DAG. The node N may select an alternate parent node P′ within the computer network that has connectivity to the grandparent node GP and the node N. A sibling connection may be established within the computer network between the parent node P and the alternate parent node P′. The sibling connection may provide a path for reaching prefixes reachable via the node N. | 05-23-2013 |
20130191463 | MANAGING ADDRESS VALIDATION STATES IN SWITCHES SNOOPING IPV6 - In one embodiment, a particular device (e.g., switch) receives a neighbor discovery (ND) message from a non-trusted non-switch device, the ND message having an associated address, and creates a corresponding binding entry for the address in a temporary tentative state without forwarding the ND message. In addition, the switch then generates and forwards a first duplicate address detection (DAD) message on behalf of the non-trusted non-switch device. In response to receiving a second DAD message from a non-owner device, the switch may either drop the second DAD message when a corresponding second address of the second DAD message is stored as a tentative-state entry, or else forward the second DAD message to a corresponding owner device of the second address for neighbor advertisement (NA) defense when the second address is not stored as a tentative-state entry. | 07-25-2013 |
20130208594 | RECURSIVE LOAD BALANCING IN A LOOP-FREE ROUTING TOPOLOGY USING ROUTING ARCS - In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching a destination device, each routing arc comprising a first network device as a first end of the routing arc, a second network device as a second end of the routing arc, and at least a third network device configured for routing any network traffic along the routing arc toward the destination device via any one of the first or second ends of the routing arc; and load balancing the network traffic along the routing arcs based on traffic metrics obtained at the first and second ends of the routing arcs, including selectively sending a backpressure command to a first one of the routing arcs supplying at least a portion of the network traffic to a congested one of the routing arcs. | 08-15-2013 |
20130291117 | PROTECTING ADDRESS RESOLUTION PROTOCOL NEIGHBOR DISCOVERY CACHE AGAINST DENIAL OF SERVICE ATTACKS - In one embodiment, a device (e.g., switch or registry) maintains a binding table for all internet protocol (IP) addresses in a particular subnet associated with the device, and in response to receiving a neighbor solicitation (NS) lookup message from a router for a particular address, determines whether the particular address is within the binding table. When the particular address is not within the binding table, the device causes the router to not store the particular address in a neighbor discovery (ND) cache at the router (e.g., by responding to clear the cache, or ignoring to prevent state from being created). In another embodiment, the ND-requesting router ensures that the particular address is not kept in an ND cache at the router in response to the device indicating that the particular address is not within its binding table (e.g., an explicit response to clear, or absence of instruction to store state). | 10-31-2013 |
20130301470 | GENERATING A LOOP-FREE ROUTING TOPOLOGY BASED ON MERGING BUTTRESSING ARCS INTO ROUTING ARCS - In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching a destination device, each routing arc routing any network traffic along the routing arc toward the destination device via any one of first or second ends of the corresponding routing arc, the creating including forming a buttressing arc having an originating end joined to a first of the routing arcs and a terminating end joined to a second of the routing arcs, the buttressing arc inheriting from the first routing arc a first height to the destination device, the first height of the first routing arc higher than a corresponding second height of the second routing arc; and causing the network traffic to be forwarded, to the destination device, via the buttressing arc and at least one of the first routing arc or the second routing arc. | 11-14-2013 |
20140029445 | ROUTING USING CACHED SOURCE ROUTES FROM MESSAGE HEADERS - In one embodiment, an intermediate node of a computer network can receive a message intended for a destination. The message can include a header indicating a source route. The intermediate node can determine a routing entry for a routing entry for the destination associated with a next hop based on the source route and cache the routing entry. The intermediate node can further receive a second message intended for the destination that does not indicate the next hop, and transmit the second message according to the cached routing entry. | 01-30-2014 |
20140036729 | LABEL DISTRIBUTION AND ROUTE INSTALLATION IN A LOOP-FREE ROUTING TOPOLOGY USING ROUTING ARCS - In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology for reaching a destination device, the loop-free routing topology comprising distinct paths for reaching the destination device; generating a set of serialized representations describing the loop-free routing topology, each serialized representation describing a corresponding one of the paths; and propagating the set of serialized representations from the destination device to network nodes in the computing network, enabling the network nodes to establish loop-free label switched paths for reaching the destination device via the loop-free routing topology. | 02-06-2014 |
20140068105 | COMPUTING DISJOINT PATHS FOR REACTIVE ROUTING MESH NETWORKS - 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. | 03-06-2014 |
20140078927 | HIERARCHAL LABEL DISTRIBUTION AND ROUTE INSTALLATION IN A LOOP-FREE ROUTING TOPOLOGY USING ROUTING ARCS AT MULTIPLE HIERARCHAL LEVELS FOR RING TOPOLOGIES - In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching a destination network node, each routing arc comprising a first network node as a first end of the routing arc, a second network node as a second end of the routing arc, and at least a third network node configured for routing any network traffic along the routing arc toward the destination node via any one of the first or second ends of the routing arc, at least one of the first, second, or third network nodes are implemented as a ring-based network having a prescribed ring topology; and establishing loop-free label switched paths for reaching the destination network node via the routing arcs of the loop-free routing topology, the label switched paths independent and distinct from any attribute of the prescribed ring topology. | 03-20-2014 |
20140098711 | BICASTING USING NON-CONGRUENT PATHS IN A LOOP-FREE ROUTING TOPOLOGY HAVING ROUTING ARCS - In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching a destination network node, each routing arc comprising a first network node as a first end of the routing arc, a second network node as a second end of the routing arc, and at least a third network node configured for routing any network traffic along the routing arc toward the destination node via any one of the first or second ends of the routing arc, the loop-free routing topology providing first and second non-congruent paths; and forwarding bicasting data, comprising a data packet in a first direction from a network node and a bicasted copy of the data packet in a second direction from the network node, concurrently to the destination node respectively via the first and second non-congruent paths. | 04-10-2014 |
20140122673 | Dynamic Address Assignment for Address Aggregation in Low Power and Lossy Networks - A node in a Low power and Lossy Network (LLN) is managed by monitoring a routing configuration on a node in a LLN. A triggering parameter that is used to invoke an address change on a child node is tracked and a threshold against which to compare the triggering parameter is accessed. The triggering parameter is compared to the threshold. Based on results of comparing the triggering parameter to the threshold, it is determined that an address change at the child node is appropriate. An address change of a child node appearing in the routing configuration is invoked based on the determination that an address change is appropriate. | 05-01-2014 |
20140122741 | MULTIPLE PATH AVAILABILITY BETWEEN WALKABLE CLUSTERS - In one embodiment, a method comprises creating, in a computing network, a hierarchal routing topology for reaching a destination, the hierarchal routing topology comprising a single parent supernode providing reachability to the destination, and a plurality of child supernodes, each child supernode comprising one or more exit network devices each providing a corresponding link to the parent supernode; receiving, in one of the child supernodes, a data packet for delivery to the destination; causing the data packet to traverse along any available data link in the one child supernode independent of any routing topology established by network devices in the one child supernode, until the data packet reaches one of the exit network devices; and the one exit network device forwarding the data packet to the parent supernode, via the corresponding link, for delivery to the destination. | 05-01-2014 |
20140123278 | DENIAL-OF-SERVICE ATTACK PROTECTION - In one embodiment, a device detects a denial-of-service attack and generates a message in response to the detection of the denial-of-service attack. The message is then virally distributed to a plurality of subscribed devices. | 05-01-2014 |
20140215491 | SYSTEM AND METHOD FOR INTERNAL NETWORKING, DATA OPTIMIZATION AND DYNAMIC FREQUENCY SELECTION IN A VEHICULAR ENVIRONMENT - A system includes an on-board unit (OBU) in communication with an internal subsystem in a vehicle on at least one Ethernet network and a node on a wireless network. A method in one embodiment includes receiving a message on the Ethernet network in the vehicle, encapsulating the message to facilitate translation to Ethernet protocol if the message is not in Ethernet protocol, and transmitting the message in Ethernet protocol to its destination. Certain embodiments include optimizing data transmission over the wireless network using redundancy caches, dictionaries, object contexts databases, speech templates and protocol header templates, and cross layer optimization of data flow from a receiver to a sender over a TCP connection. Certain embodiments also include dynamically identifying and selecting an operating frequency with least interference for data transmission over the wireless network. | 07-31-2014 |
20140233375 | PRIORITIZED QUEUEING IN A MESH NETWORK BASED ON AGE OF PAYLOAD DATA - In one embodiment, a method comprises identifying an age of payload data in a data packet by a wireless network node configured for transmitting the data packet to a multi-hop destination via a wireless mesh network; determining by the wireless network node a schedule for the data packet reaching the multi-hop destination; and the wireless network node prioritizing queuing of the data packet for Collision Sense with Multiple Access and Collision Avoidance (CSMA-CA) based wireless transmission in the wireless mesh network based on the corresponding age, relative to the schedule and respective ages of other data packets awaiting transmission by the wireless network node to the destination, where a higher-aged data packet relative to the schedule is granted have a higher priority than a lower-aged data packet relative to the schedule. | 08-21-2014 |
20140233422 | FLOODING AND MULTICASTING IN A LOOP-FREE ROUTING TOPOLOGY USING ROUTING ARCS - In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching multicast listeners from a multicast source, each routing arc comprising a first network device as a first end of the routing arc, a second network device as a second end of the routing arc, and at least a third network device configured for receiving from each of the first and second network devices a copy of a multicast packet originated from the multicast source; and causing the multicast packet to be propagated throughout the loop-free routing topology based on the first and second ends of each routing arc forwarding the corresponding copy into the corresponding routing arc. | 08-21-2014 |
20140269717 | IPV6/IPV4 RESOLUTION-LESS FORWARDING UP TO A DESTINATION - In one embodiment, a switch in a computer network intercepts a packet to a destination target, the packet having a solicited node multicast address of the target as a destination media access control (MAC) address of the packet. As such, the switch may determine whether the solicited node multicast address is a hit or miss within a switch hardware table of the switch, and in response to a hit, re-writes the destination MAC address with a known value of the destination target from the table, and unicasts the packet to the destination target. In one or more additional embodiments, in response to a miss, and in response to a single-switch architecture, the switch drops the packet, while in response to a miss, and in response to a multi-switch architecture, the switch may compute a repository switch for the solicited multicast destination, and unicasts the packet to the computed repository switch. | 09-18-2014 |
20140269759 | SCHEDULE-BASED PRIORITIZATION IN CONTENTION-BASED SHARED-MEDIA COMPUTER NETWORKS - In one embodiment, an intermediate node in a contention-based shared-media computer network determines a scheduled window within which a packet (with an assigned priority) should be transmitted by the intermediate node. In particular, the intermediate node may specifically determine whether an actual transmission time is prior to, during, or after the window, and sets a priority of the packet as either i) a reduced priority when the actual transmission time is prior to the window, ii) the assigned priority when the actual transmission time is during the window, or iii) an augmented priority when the actual transmission time is after the window. As such, the intermediate node may then transmit the packet from the intermediate node with the set priority at the actual transmission time. | 09-18-2014 |
20140282864 | THROTTLING AND LIMITING THE SCOPE OF NEIGHBOR SOLICITATION (NS) TRAFFIC - In one embodiment, a switch in a computer network may receive a neighbor solicitation (NS) message for a target node for which no neighbor authentication (NA) reply has been received at the switch. The switch may then determine whether to forward the NS message to only non-constrained links of the switch, or to both non-constrained links and constrained links of the switch. The determining may be configured to intermittently result in forwarding the NS message for the target node to both the non-constrained links and the constrained links. The switch may then forward the NS message according to the determination. | 09-18-2014 |
20150023186 | EFFICIENT NETWORK PROBING FOR DETERMINISTIC WIRELESS NETWORKS - In one embodiment, a device (e.g., path computation device) informs a network management device of a plurality of possible probing profiles, where nodes of a computer network receive the plurality of possible probing profiles from the network management device. Based on determining that particular information is desired from one or more particular nodes of the nodes of the computer network, the device may then select one or more particular probing profiles of the plurality of possible probing profiles based on the particular information, and instructs the one or more particular nodes to probe one or more particular destination nodes according to the one or more particular probing profiles. | 01-22-2015 |
20150023205 | PATH COMPUTATION ELEMENT PROXYING FOR DETERMINISTIC WIRELESS NETWORKS - In one embodiment, an agent device discovers a set of path computation elements (PCEs) and corresponding available capabilities and resources, and determines particular capabilities and resources of interest in a particular computer network. Upon building a simplified view of the available capabilities and resources of the set of PCEs based on the particular capabilities and resources of interest, the agent device advertises the simplified view of the available capabilities and resources into the particular computer network. | 01-22-2015 |
20150023313 | Exclusive and Overlapping Transmission Unit Allocation and Use in a Network - One embodiment allocates and uses exclusive and overlapping transmission units in a network. One embodiment includes sending information, from a first network node in a network, during an exclusive transmission unit, wherein the exclusive transmission unit includes one or more wireless time slot-frequency pairings assigned to the first network node to send info nation without another assigned network transmission unit providing overlapping time slot-frequency interference from another network node communicating in the network. One embodiment includes sending information, from the first network node, during an overlapping transmission unit, wherein the overlapping transmission unit includes one or more wireless time slot-frequency pairings assigned to the first network node to send information, with the overlapping transmission unit overlapping in time slot-frequency with one or more other assigned network transmission units that will cause interference if simultaneously used. | 01-22-2015 |
20150023314 | Reassignment of Unused Portions of a Transmission Unit in a Network - One embodiment includes signaling, by a first network node to a transmission unit owner node, identifying one or more remaining wireless time slot-frequency pairings of a current transmission unit assigned to the first network node that will not be used by the first network node during the current transmission unit. The transmission unit owner node reassigns one or more of the remaining wireless time slot-frequency pairings to a second network node in the network to use during the current transmission unit. One embodiment includes communicating information between a first network node and a second network node using a particular time slot-frequency pairing, including a particular frame time from the second network node to the first network node, a particular acknowledgement time from the first network node to the second network node, and a particular acknowledgment of the acknowledgment time from the second network node to the first network node. | 01-22-2015 |
20150023325 | Configuring New Paths in a Wireless Deterministic Network - In one embodiment, a first node in a wireless deterministic network communicates to a second node configuration information identifying a destination-facing path portion of a particular one-way path traversing from a source node to a destination node within the wireless deterministic network. The destination-facing portion includes a path traversing from the second node over one or more additional nodes to the destination node over which to forward packets received over a first portion of the particular one-way path from the source node to the second node. The configuration information includes a particular time slot for the second node to receive packets being sent over the particular one-way path. In one embodiment, the first node receives from the second node an acknowledgement message in the particular time slot that the destination-facing portion of the particular one-way path was configured and activated. | 01-22-2015 |
20150023326 | Installation of Time Slots for Sending a Packet through an ARC Chain Topology Network - One embodiment includes: determining, by a particular networked device, sending and receiving time slots for progressively communicating a particular packet among nodes of an arc of an Available Routing Construct (ARC) chain topology network in both directions on the arc to reach each edge node of the arc; and determining, by the particular networked device, for each edge node of the arc a predetermined respective time slot for communicating the particular packet to a respective child node on a second arc of the ARC chain topology network. One embodiment includes respectively installing said determined time slots in said nodes of the arc. In one embodiment, the network is a wireless deterministic network. In one embodiment, the predetermined respective time slot for each particular edge node is after all time slots in which the particular packet could be received by said particular edge node. | 01-22-2015 |
20150023327 | Resilient Forwarding of Packets in an ARC Chain Topology Network - One embodiment includes: forwarding a particular packet through an Available Routing Construct (ARC) chain topology network. In one embodiment, this forwarding includes: sending the particular packet by each particular non-edge node on an arc of the plurality of arcs receiving the particular packet to each sibling on the arc that did not send the particular packet to said particular non-edge node, while not sending the particular packet if it was received from both siblings of said particular edge node; and sending the particular packet to a respective child node on a second arc of the plurality of arcs by each particular edge node of two edge nodes on the arc after receiving the particular packet. In one embodiment, the network is a wireless deterministic network with pre-assigned time slots for receiving and subsequently sending a same particular packet by each node of the network. | 01-22-2015 |
20150023328 | OAM and Time Slot Control in a Deterministic ARC Chain Topology Network - In one embodiment, a network of nodes is configured to communicate according to a configuration of Available Routing Construct (ARC) chains as well as monitoring communication in the network, and/or selectively controls whether or not provisioned particular links will be used. One embodiment colors nodes of the network (e.g., a wireless deterministic network) along different paths through the network and marks packets with the color of each traversed node to track a path taken by a packet. One embodiment sends a particular packet through the network and marks over which links the packet traverses and aggregates these traversed links of other copies of the particular packet. One embodiment controls whether or not the provisioned time slots are used based on flooding a control packet through the network with enable or disable information for each of these links. | 01-22-2015 |
20150036507 | RECURSIVE LOAD BALANCING IN A LOOP-FREE ROUTING TOPOLOGY USING ROUTING ARCS - In one embodiment, a method comprises creating, in a computing network, a loop-free routing topology comprising a plurality of routing arcs for reaching a destination device, each routing arc comprising a first network device as a first end of the routing arc, a second network device as a second end of the routing arc, and at least a third network device configured for routing any network traffic along the routing arc toward the destination device via any one of the first or second ends of the routing arc; and load balancing the network traffic along the routing arcs based on traffic metrics obtained at the first and second ends of the routing arcs, including selectively sending a backpressure command to a first one of the routing arcs supplying at least a portion of the network traffic to a congested one of the routing arcs. | 02-05-2015 |
20150071255 | Sensor Data Transport and Consolidation Within Communication Nodes in a Network - In one embodiment, sensor data is transported in a network to a rendezvous point network node, which consolidates the information into a consolidated result which is communicated to the destination. Such consolidation by a network node reduces the number of paths required in the network between the sensors and the destination. One embodiment includes acquiring, by each of a plurality of originating nodes in a wireless deterministic network, external data related to a same physical event; communicating through the network said external data from each of the plurality of originating nodes to a rendezvous point network node (RP) within the network; processing, by the RP, said external data from each of the plurality of originating nodes to produce a consolidated result; and communicating the consolidated result to a destination node of the network. In one embodiment, the network is a low power lossy network (LLN). | 03-12-2015 |
20150078204 | DOMINATING SET IDENTIFICATION FOR PATH COMPUTATION BASED ON DIRECTED ACYCLIC GRAPH MEMBERSHIP - In one embodiment, a method comprises a path computation device receiving device information from member network devices, each member network device belonging to a directed acyclic graph to a destination in a low power lossy network; and the path computation device classifying each member network device belonging to a directed acyclic graph as belonging to a dominating set, for generation of optimized routes distinct from any directed acyclic graph, for reaching any one of the member network devices of the dominating set. | 03-19-2015 |
20150089081 | CO-EXISTENCE OF A DISTRIBUTED ROUTING PROTOCOL AND CENTRALIZED PATH COMPUTATION FOR DETERMINISTIC WIRELESS NETWORKS - In one embodiment, a device both communicates with a network operating a distributed proactive routing protocol, and participates in a centralized path computation protocol. The device communicates routing characteristics of the distributed proactive routing protocol for the network from the network to the centralized path computation protocol, and also communicates one or more computed paths from the centralized path computation protocol to the network, where the computed paths from the centralized path computation protocol are based on the routing characteristics of the distributed proactive routing protocol for the network. | 03-26-2015 |