System and method for resource discovery

Details System and method for resource discovery System and method for resource discovery

2007-11-13

2007-11-13

Ryman, Daniel J. (Department: 2616)

Multiplex communications

Network configuration determination

C370S400000

Reexamination Certificate

active

09576676

ABSTRACT:
In distributed networks of cooperating nodes, it is useful to perform resource discovery in a manner that is efficient but that also minimizes communication complexity. A system and method in which nodes in a network efficiently are provided with information about the presence of, and other information about, other nodes in the network provides tangible benefits. In general, in one aspect, a system and method according to the invention features a distributed method for communicating information among a plurality of nodes. The method includes communicating from the first node to the second node information about the first node and nodes that the first node is aware of. The method further includes adding or merging, by the second node, the information about the first node and nodes that the first node is aware of with information about nodes that the second node is aware of.

REFERENCES:
patent: 5007052 (1991-04-01), Flammer
patent: 5051987 (1991-09-01), Conlon
patent: 5914939 (1999-06-01), Serkowski
patent: 6041049 (2000-03-01), Brady
Agrawal et al., “Epidemic Algorithms in Replicated Databases”,Proceedings of the Sixteenth ACM SIGACT-SIGMOD-SIGART Symposium on Principles of Database Systems, pp. 161-172, May 12-15, 1997.
Assmann et al., “The Number of Rounds Needed to Exchange Information Within a Graph”,SIAM Discrete Applied Math, vol. 6, No. 2, pp. 117-125, Jul. 1983.
Demers et al., “Epidemic Algorithms for Replicated Database Maintenance”,Proceedings of the Sixth Annual ACM Symposium on Principles of Distributed Computing, pp. 1-12, Aug. 10-12, 1987.
Even et al., “On the Number of Rounds Necessary to Disseminate Information”,Proceedings of the ACM Symposium on Parallel Algorithms and Architectures, pp. 318-327, 1989.
Hayden et al., “Probabilistic Broadcast”,Cornell CS Technical Report TR96-1606, 15 pages, 1998.
Hedetniemi et al., “A Survey of Gossiping and Broadcasting in Communication Networks”,Networks, vol. 18, No. 4, pp. 319-349, winter 1988.
Moy, “RFC 1583: OSPF Version 2”,printed Oct. 25, 2000 fromhttp://rfc.asuka.net/rfc/rfc1583.html, 213 pages, Mar. 1994.
Oppen et al., “The Clearinghouse: A Decentralized Agent for Locating Named Objects in a Distributed Environment”,ACM Transactions on Office Information Systems, vol. 1, No. 3, pp. 230-253, Jul. 1983.
Pelc, “Fault-Tolerant Broadcasting and Gossiping in Communication Networks”,Networks, vol. 28, pp. 143-156, Oct. 1996.
Van Renesse et al, “A Gossip-Style Failure Detection Service”, pp. 55-70, 1998.

Affiliated with

Also associated with

Rating

System and method for resource discovery does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with System and method for resource discovery, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for resource discovery will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-3884451