Node discovery involving multiple node enumerators

Details Node discovery involving multiple node enumerators Node discovery involving multiple node enumerators

2011-01-11

2011-01-11

Srivastava, Vivek (Department: 2445)

Electrical computers and digital processing systems: multicomput

Computer network managing

Computer network monitoring

C370S222000, C370S248000

Reexamination Certificate

active

07870247

ABSTRACT:
A network node discovery method allows multiple enumerators to concurrently accept and interpret the same enumeration responses from responder nodes on a network. In this manner, the responder nodes do not have to issue individual responses for each enumerator. Each responder maintains a discovery state and one or more per-enumerator session states to manage when the responder should transmit enumeration responses. The enumeration, therefore, proceeds at a target network load, irrespective of the number of enumerators present, and completes in a short time by making efficient use of the network capacity available. Furthermore, an enumerator can determine that it need only wait for responses solicited by other enumerators, rather than requesting them, thereby reducing network traffic in the presence of many concurrently enumerating nodes.

REFERENCES:
patent: 5859835 (1999-01-01), Varma et al.
patent: 5948064 (1999-09-01), Bertram et al.
patent: 6233611 (2001-05-01), Ludtke et al.
patent: 6246409 (2001-06-01), Veghte et al.
patent: 6952396 (2005-10-01), Cottreau et al.
patent: 7319671 (2008-01-01), Mohan
patent: 2002/0152299 (2002-10-01), Traversat
patent: 2003/0097438 (2003-05-01), Bearden et al.
patent: 2004/0174829 (2004-09-01), Ayyagari
patent: 2005/0125529 (2005-06-01), Brockway
patent: 2005/0157720 (2005-07-01), Chandhok et al.
patent: 2006/0075113 (2006-04-01), Black
patent: 2006/0124720 (2006-06-01), Burbridge et al.
patent: 2006/0168276 (2006-07-01), Black
International Search Report, PCT/US2006/046472. Dated Apr. 27, 2007. 10 Pages. [This reference has been submitted as a Non-Patent Literature Document in an IDS for a Parent Case Bearing U.S Appl. No. 10/955,938, filed Sep. 30, 2004. Hence a copy is not submitted herewith].
International Search Report dated Apr. 27, 2007 for Application No. PCT/US2006/046471, 10 pages.
Black, R. et al., “Fast Scalable Robust Node Enumeration”, Lectures Notes in Computer Science—Networking 2005, May 2, 2005, 12 pages.
Extended European Search Report, dated Mar. 18, 2009 for Application No. 06844861.2, 9 pages.

Affiliated with

Also associated with

Rating

Node discovery involving multiple node enumerators does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Node discovery involving multiple node enumerators, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Node discovery involving multiple node enumerators will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2645416