Electrical computers and digital processing systems: multicomput – Computer-to-computer data addressing
Reexamination Certificate
2006-06-20
2006-06-20
Dinh, Dung C. (Department: 2152)
Electrical computers and digital processing systems: multicomput
Computer-to-computer data addressing
C709S217000, C709S243000, C709S238000, C370S252000, C370S389000
Reexamination Certificate
active
07065587
ABSTRACT:
A serverless name resolution protocol ensures convergence despite the size of the network, without requiring an ever-increasing cache and with a reasonable numbers of hops. This convergence is ensured through a multi-level cache and a proactive cache initialization strategy. The multi-level cache is built based on a circular number space. Each level contains information from different levels of slivers of the circular space. A mechanism is included to add a level to the multi-level cache when the node determines that the last level is full. A peer-to-peer name resolution protocol (PNRP) includes a mechanism to allow resolution of names which are mapped onto the circular number space through a hash function. Further, the PNRP may also operate with the domain name system by providing each node with an identification consisting of a domain name service (DNS) component and a unique number.
REFERENCES:
patent: 5933849 (1999-08-01), Srbljic et al.
patent: 5987376 (1999-11-01), Olson et al.
patent: 6081845 (2000-06-01), Kanemaki et al.
patent: 6205481 (2001-03-01), Heddaya et al.
patent: 6269099 (2001-07-01), Borella et al.
patent: 6532217 (2003-03-01), Alkhatib et al.
patent: 6636854 (2003-10-01), Dutta et al.
patent: 6654796 (2003-11-01), Slater et al.
patent: 6683865 (2004-01-01), Garcia-Luna-Aceves et al.
Adam Langley,The Freenet Protocol,The Free Network Project, at http://freenet.sourceforge.net/index.php?page=protocol (last visited May 21, 2001).
Philip J. Erdelsky,The Birthday Paradox,EFG, at http://www.efgh.com/math/birthday.htm (last visited Mar. 8, 2002).
Red-Black Tree,National Institute of Standards and Technology, at http://www.nist.gov/dads/HTML/redblack.html (last visited Mar. 5, 2002).
Lai, Kevin, and Mary Baker,Measuring Link Bandwidths Using a Deterministic Model of Packet Delay,at Department of Computer Science at Stanford University, 13 pages.
Rowstron, Antony, and Peter Druschel,Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems,at Microsoft Research, Ltd., St. George House and Rice University, 20 pages.
Druschel, Peter, and Antony Rowston,PAST: A large-scale, persistent peer-to-peer storage utility,at Rice University and Microsoft Research, 6 pages.
Rowstron, Antony, and Peter Druschel,Storage management and caching in PAST, a large-scale, persistent peer-to-peer storage utility,at Microsoft Research, Ltd., St. George House and Rice University, 14 pages.
Rowstron, Antony, Anne-Marie Kermarrec, Peter Druschel and Miguel Castro,SCRIBE: The design of a large-scale event notification infrastructure,at Microsoft Research, Ltd., St. George House and Rice University, 20 pages.
Dabek, Frank, Emma Brunskill, M.Frans Kaashoek, David Karger, Robert Morris, Ion Stoica, and Hari Balakrishnan,Building Peer-to-Peer Systems With Chord, a Distributed Lookup Service,at MIT Laboratory for Computer Science, 6 pages, at http://pdos.lcs.mit.edu/chord.
Ellison, C.,SPKI Requirements,(The Internet Society 1999), at http://www.ietf.org/rfc/rfc2692.txt?number=2692 (last visited Aug. 6, 2001).
Ellison, Carl, Bill Frantz, Butler Lampson, Ron Rivest, Brian M. Thomas, and Tatu Ylonen,Simple Public Key Certificate,(Internet Draft 1999), at http://www.world.std.com/˜cme/spki.txt (last visited Aug. 6, 2001).
Ellison, C., B. Frantz, B. Lampson, R. Rivest, B. Thomas, and T. Ylonen,SPKI Certificate Theory,(The Internet Society 1999), at http://www.ietf.org/rfc/rfc2693.txt?number=2693 (last visited Aug. 6, 2001).
European Search Report; EP 02 00 5770; Munich; Aug. 9, 2005; Examiner: E. Bertolossi.
Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, and Hari Balakrishnan; A Scalable Peer-to-Peer Lookup Service for Internet Applications; MIT Technical Report; Mar. 23, 2001; http//www.Ics.mit.edu/publictions/pubs/ps/MIT-LCS-TR-819.ps>.
Oram Andy (ED); Peer-to-Peer: Harnessing the Benefits of a Disruptive Technology Passage; Peer-to-Peer: Harnessing the Benefits of a Disruptive Technology; Mar. 15, 2001; pp. 94-122.
Scholl: Napster Message; Internet Citation; Apr. 7, 2000.
Sedgewick, R.; Algorithms in C —Third Edition —Part of Chapter XVI; Algorithms in C —Third Edition, 1998; pp. 662-691.
John Morris; Data Structures and Algorithms —Sections 8.3; Online Publication 1998; http://clips.ee.uwa.edu.au/{morris/Year2/PLDS210/hash-tables.html.>: Aug. 8, 2005.
Sedgewick, R.; Algorithms in C —Third Edition —Chapter XIV; Algortims in C++; 1998; pp. 573-608; Section 14.4.
Partial European Search Report; EP 02 00 5770; Mar. 27, 2005; Examiner: E. Bertolissi.
Huitema Christian
Miller John L.
Dinh Dung C.
Microsoft Corporation
Microsoft Corporation
Nguyen Trong-Nhan Phuoc
LandOfFree
Peer-to-peer name resolution protocol (PNRP) and multilevel... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Peer-to-peer name resolution protocol (PNRP) and multilevel..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Peer-to-peer name resolution protocol (PNRP) and multilevel... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3640745