Electrical computers and digital processing systems: multicomput – Network computer configuring
Reexamination Certificate
2003-02-03
2009-11-03
Pwu, Jeffrey (Department: 2446)
Electrical computers and digital processing systems: multicomput
Network computer configuring
C709S221000, C709S222000
Reexamination Certificate
active
07613796
ABSTRACT:
A system and method for using skip nets to build and maintain overlay networks for peer-to-peer systems. A skip net is a distributed data structure that can be used to avoid some of the disadvantages of distributed hash tables by organizing data by key ordering. Skip nets can use logarithmic state per node and probabilistically support searches, insertions and deletions in logarithmic time.
REFERENCES:
patent: 4142069 (1979-02-01), Stover
patent: 5970489 (1999-10-01), Jacobson et al.
patent: 5978364 (1999-11-01), Melnik
patent: 5991828 (1999-11-01), Horie et al.
patent: 6029168 (2000-02-01), Frey
patent: 6134553 (2000-10-01), Jacobson et al.
patent: 6249813 (2001-06-01), Campion et al.
patent: 6430527 (2002-08-01), Waters et al.
patent: 6522632 (2003-02-01), Waters et al.
patent: 6611872 (2003-08-01), McCanne
patent: 6636854 (2003-10-01), Dutta et al.
patent: 6667957 (2003-12-01), Corson et al.
patent: 6836463 (2004-12-01), Garcia-Luna-Aceves et al.
patent: 6975631 (2005-12-01), Kastenholz
patent: 7043644 (2006-05-01), DeBruine
patent: 7089323 (2006-08-01), Theimer et al.
patent: 7096228 (2006-08-01), Theimer et al.
patent: 7149797 (2006-12-01), Weller et al.
patent: 7194552 (2007-03-01), Schneider
patent: 7310666 (2007-12-01), Benfield et al.
patent: 2002/0038296 (2002-03-01), Margolus et al.
patent: 2002/0107934 (2002-08-01), Lowery et al.
patent: 2002/0116533 (2002-08-01), Holliman et al.
patent: 2003/0110252 (2003-06-01), Yang-Huffman
patent: 2003/0140051 (2003-07-01), Fujiwara et al.
patent: 2003/0196024 (2003-10-01), Frank
patent: 2003/0212771 (2003-11-01), Kwon et al.
patent: 2004/0042403 (2004-03-01), Xu et al.
patent: 2004/0047350 (2004-03-01), Zhang et al.
patent: 0 465 090 (1992-01-01), None
patent: 0 598 969 (1994-06-01), None
patent: 1 113 372 (2001-07-01), None
patent: 1 248 441 (2002-10-01), None
patent: WO 99/66681 (1999-12-01), None
Dunagan et al., “SkipNet: A scalable overlay network with practical ocality properties,” Microsoft Research Technical Report MSR-TR-2002-92.
Ratnasamy et al., “Routing algorithms for DHTs: some open questions,” Electronic Proceedings for the 1st International Workshop on Peer-to-peer systems (IPTPS '02), Mar. 7-8, 2002, MIT Faculty Club, Cambridge, MA (2002).
Rowstron et al., “Pastry: Scalable, distributed object location and routing for large scale peer-to-peer systems,” IFIP/ACM International Conference on Distributed Systems Platforms (Middleware), Heidelberg, Germany, pp. 329-350, (Nov. 2001).
Stoica, I. et al., Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications, 2001, ACM Press, Proceedings of the 2001 Conference on Applications, Technologies, Architectures, and Protocols for Computer Communications, p. 149-160.
Hildrum, K., et al., Distributed Object Location in a Dynamic Network, Aug. 10-13, 2002, ACM, Proceedings of the Fourteenth Annual ACM Symposium on Parallel Algorithms and Architectures, pp. 41-52.
Castro, Miguel et al., “Topology-aware routing in structured peer-to-peer overlay networks,”Microsoft Corporation, http://research.microsoft.com/scripts/pubs/view.asp?TR—ID=MSR-TR-2002-82 (Sep. 2002) pp. 1-18.
Pugh, “Skip Lists: A Probabilistic Alternative to Balanced Trees”,Communications of the ACM, 33(6), 668-676 (Jun. 1990).
Tannenbaum, “Network Layer Design Issues”,Computer Networks, 289-309 (Jun. 1992) XP 002017557.
Aspnes et al., “Skip graphs,”Fourteenth Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 384-393 (Jan. 2003).
Bozanis et al. “DSL: Accommodating skip lists in the SDDS model,”Proceedings 3rd Workshop on Distributed Data and Structures(WDAS 2000), L'Aquila, Italy (2000).
Harvey et al., “SkipNet: A scalable overlay network with practical ocality properties,”Microsoft Research Technical Report MSR-TR-2002-92(2003).
Keleher et al., “Are virtualized overlay networks too much of a good thing?”Electronic Proceedings for the 1st International Workshop on Peer-to-Peer Systems(IPTPS '02), Mar. 7-8, 2002, MIT Faculty Club, Cambridge, MA (2002).
Munro et al., “Deterministic skip lists,”Proc. 3rd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 367-375 (1992).
Pugh, “A skip list cookbook,”University of Maryland Technical Report CS-TR-2286.1(Jul. 1989).
Ratnasamy et al., “A scalable content-addressable network,”Proceedings of ACM SIGCOMM, San Diego, CA, pp. 161-172 (Aug. 2001).
Ratnasamy et al., “Routing algorithms for DHTs: some open questions,”Electronic Proceedings for the 1st International Workshop on Peer-to-Peer Systems(IPTPS '02), Mar. 7-8, 2002, MIT Faculty Club, Cambridge, MA (2002).
Rowstron et al., “Pastry: Scalable, distributed object location and routing for large-scale peer-to-peer systems,”IFIP/ACM International Conference on Distributed Systems Platforms(Middleware), Heidelberg, Germany, pp. 329-350 (Nov. 2001).
Stoica et al., “Chord: A scalable peer-to-peer lookup service for Internet applications,”Proc. ACM SIGCOMM '01, San Diego, CA (Aug. 2001).
Zhao et al. “Tapestry: An infrastructure for fault-tolerant wide-area location and routing,”University of California-Berkeley Technical Report UCB/CSD-01-1141(Apr. 2001).
F. Ergun, S. Mittra, S. C. Sahinalp, J. Sharp and R. K. Sinha, “A Dynamic Lookup Scheme for Bursty Access Patterns,”IEEE INFOCOM 2001, pp. 1444-1453.
Final Office Action for Japanese Patent Application No. 2003-316039 mailed Feb. 3, 2009.
W. Pugh, “A Skip List Cookbook,” Jun. 1990, pp. 2-14.
W. Pugh, “Skip Lists: A Probabilistic Alternative to Balanced Trees,”Communications of the ACM, Jun. 1990, pp. 668-675, vol. 33, No. 6.
Adya Atul
Harvey Nicholas J.
Jones Michael B.
Saroiu Stefan
Theimer Marvin M.
Baturay Alicia
Microsoft Corporation
Pwu Jeffrey
Wolf Greenfield & Sacks P.C.
LandOfFree
System and method for creating improved overlay network with... 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 creating improved overlay network with..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and System and method for creating improved overlay network with... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4067268