Cisco Technology, Inc.

Stanley M Ratliff

Russell Ivan White

Alvaro E Retana

Kaartik Viswanath

Michael Barnes

Alan Patrick Sheridan

Donnie Van Savage

Mihail L Sichitiu

Alvaro Retano

One embodiment identifies all one-hop neighbor nodes and two-hop neighbor nodes of a node; determines an active set of one-hop neighbor nodes for the node, comprising: includes in the active set each one-hop neighbor node that is either an edge node or connected with at least one two-hop neighbor node with which no other one-hop neighbor nodes are connected; and if the active set is not yet complete, then: determine all combinations of one-hop neighbor nodes that are not already in the active set; and tests each combination in order of each combination's total-energy value to determine whether a specific combination is able to complete the active set; if no combination is able to complete the active set, then including all one-hop neighbor nodes in the active set; and communicates a message to each one-hop neighbor node in the active set indicating that it is in the active set.

Network topologies for energy efficient networks

In one embodiment, a method for using a two-hop relay includes receiving an update message for a distance vector routing protocol from a first neighbor. The update message is sent to a different neighbor. Often, it is first determined whether the receiving node is a relay node for the first neighbor in the protocol. The relay node is a node preferred to update a particular node two hops from the first neighbor. In another embodiment, a method for serving as the two-hop relay includes receiving from each neighbor a first message that includes neighbor data that indicates nodes that are in direct communication with the neighbor. A relay set of fewer than all neighbors is determined. Every node two hops from the first node is updated using only the relay set of neighbors. The relay set is sent in a second message for the protocol.

Two-hop relay for reducing distance vector routing information

A system and method are described for generating a unique name for a particular subordinate resource of a computer system having a plurality of subordinate resources associated with superior resources. A superior resource is identified that is associated with the particular subordinate resource, and the name of that superior resource is ascertained. A portion of the superior resource name is selected and combined with a unique counter value from a global counter, where the global counter provides a different counter value to each subordinate resource of the plurality of subordinate resources. In this manner, the generated subordinate resource name for the particular subordinate resource is unique across all subordinate resources of all superior resources, not only across subordinate resources of one of the superior resources.

System using truncated superior resource name and unique number obtained from global counter maintained by a server for generating unique subordinate resource name

A method for generating a unique subordinate resource name is disclosed where the method includes the steps of identifying a subordinate resource and the name of a related superior resource, truncating the superior resource name to form a truncated name, obtaining a counter number from a global counter, and appending the counter number to the truncated name to form an appended name which is assigned to the subordinate resource.

System using truncated superior resource name and unique counter number obtained from a global counter for generating a unique subordinate resource name

Growing community of inventors

Raleigh, NC, United States of America

Stanley M Ratliff