Data processing: database and file management or data structures – Database design – Data structure types
Reexamination Certificate
2007-12-25
2007-12-25
Lu, Kuen S. (Department: 2167)
Data processing: database and file management or data structures
Database design
Data structure types
C707S793000, C707S793000, C707S793000
Reexamination Certificate
active
10782527
ABSTRACT:
A data overlay is described which is built as a data structure on top of a logical space defined by a distributed hash table (DHT) in a peer-to-peer (P2P) network environment. The data overlay can assume a topology of a tree having a plurality of tree nodes. Each of the tree nodes has a zone allocated to it that maps to a corresponding zone associated with a DHT node in the logical space of the DHT. Procedures are described for “growing” this tree structure, such that the tree structure is self-organizing and self-healing on the same scale as the underlying DHT. Other procedures are described for using the tree structure to gather information from the DHT nodes and to disseminate information to the DHT nodes.
REFERENCES:
patent: 7054867 (2006-05-01), Bosley et al.
patent: 2004/0064693 (2004-04-01), Pabla et al.
patent: 2005/0219929 (2005-10-01), Navas
Ming Xie: B2P Systems Based on Distributed Hash Table, Ming Xie, Computer Science, University of Ottawa, Sep. 26, 2003.
Vinod Muthusamy: An Introduction to Peer-to-Peer Networks, Presentation for MIE456—Information Systems Infrastructure II, Oct. 30, 2003.
Mathkour, Hassan, “An Intelligent Tool for Boosting Database Performance,” Journal of King Saud University Computer and Information Sciences, vol. 10, 1998, pp. 81-106.
Zhao, Ben Y., et al., “Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing,” Report No. UCB/CSD-01-1141, Computer Science Division, University of California, Berkeley, Apr. 2001, pp. 1-27.
Xu, Zhichen, et al., “Building Low-maintenance Expressways for P2P Systems,” Hewlett-Packard Technical Report, HPL-2002-41, Mar. 1, 2002, pp. 1-14.
Zhang, Zheng, et al., “Self-Balanced P2P Expressway: When Marxism Meets Confucian,” Microsoft Report MSR-TR-2002-72, Jul. 2002, 12 pages.
Hartman, Hans, “Tools for Dynamic Web Sites: ASP vs. PHP vs. ASP.NET,” Seybold Report Analyzing Publishing Technologies, vol. 1, No. 12, Sep. 17, 2001, pp. 8-13.
Poliashenko, Max, et al., “Globalized Web Applications & ASP.NET,” Dr. Dobb's Journal, vol. 27, No. 4, Apr. 2002, pp. 67-72.
El Fattah, Yousri et al., “Structured Modeling Language for Automated Modeling in Causal Networks,” Qualitative Reasoning and Diagnosis, Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence, vol. 16, No. 2, 1999, pp. 1108-1114.
Bertino, Elisa, “Sistemi di Gestione de Basi di Dati Orientate Agli Oggetti,” Revista di Informatica, vol. 21, No. 4, Oct. 1991, pp. 395-431.
Adamic, Lada A., et al., “Search in power-law networks,” Physical Review E, vol. 64, 2001, pp. 046135-1 to 046135-8.
Ratnasamy, Sylvia, et al., “A Scalable Content-Addressable Network,” Proceedings of ACM SIGCOMM'01 Conference, San Diego, CA, Aug. 2001, pp. 161-172.
Castro, Miguel, et al., “Scribe: A Large-Scale and Decentralized Application-Level Multicast Infrastructure,” IEEE Journal on Selected Areas in Communications, vol. 20, No. 8, Oct. 2002.
Stoica, Ion, et al., “Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications,” Proceedings of ACM SIGCOMM'01 Conference, San Diego, CA, Aug. 2001, pp. 149-160.
Ratnasamy, Sylvia, et al., “Topologically-Aware Overlay Construction and Server Selection,” Proceedings of IEEE INFOCOMM 2002, pp. 1190-1199.
Zhuang, Shelley Q., et al., “Bayeux: An Architecture for Scalable and Fault-tolerant Wide-area Data Dissemination,” Proceedings of the International Workshop on Network and Operating Systems Support for Digital Audio and Video (NOSSDAV '01), Port Jefferson, NY, 2001, pp. 11-20.
Madden, Samuel, et al., “TAG: a Tiny Aggregation Service for Ad-Hoc Sensor Networks,” Proceedings of the Fifth Symposium on Operating Systems Design and Implementation (OSDI '02), 2002, pp. 131-146.
Clarke, Ian, et al., “Freenet: A Distributed Anonymous Information Storage and Retrieval System,” Lecture Notes in Computer Science, 2001, vol. 2009, pp. 46-66.
Saroiu, Stefan, et al., “A Measurement Study of Peer-to-Peer File Sharing Systems,” Proceedings of the Multimedia Computing and Networking, San Jose, CA, Jan. 2002, 16 pages.
LV, Qin, et al., “Can Heterogeneity Make Gnutella Scalable?” Lecture Notes in Computer Science, LNCS 2429, 2002, pp. 94-103.
Van Renesse, Robbert, et al., “Scalable Management and Data Mining Using Astrolabe,” Lecture Notes in Computer Science, LNCS 2429, 2002, pp. 280-294.
Zhao, Ben Y., et al., “Brocade: Landmark Routing on Overlay Networks,” IPTPS 2002, LNCS 2429, 2002, pp. 34-44.
Maymounkov, Petar, et al., “Kademlia: A Peer-to-Peer Infomration System Based on the XOR Metric,” IPTPS 2002, LNCS 2429, 2002, pp. 53-65.
Rowstron, Antony, et al., “Pastry: Scalable, Decentralized Object Location, and Routing for Large-Scale Peer-to-Peer Systems,” Middleware 2001, Nov. 2001, LNCS 2218, 2001, pp. 329-350.
Zhang, Zheng, et al., “SOMO: Self-Organized Metadata Overlay for Resource Management in P2P DHT,” IPTPS 2003, Conference held Feb. 20-21, 2003, available at <http://iptps03.cs.berkeley.edu/final-papers/somo.pdf>, accessed on Apr. 22, 2004, 6 pages.
Gupta, Indranil, et al., “Kelips: Building an Efficient and Stable P2P DHT Through Increased Memory and Background Overhead,” published in IPTPS 2003, available at <http://iptps03.cs.berkeley.edu/final-papers/kelips.pdf>, accessed on Apr. 22, 2004, 6 pages.
Dabek, Frank, et al., “Towards a Common API for Structured Peer-to-Peer Overlays,” published in Proceedings of the 2ndInternational Workshop on Peer-to-Peer Systems (IPTPS '03), available at <http://www.cs.berkeley.edu/˜ravenben/publications/pdf/apis.pdf>, accessed on Apr. 22, 2004, 6 pages.
Druschel, Peter, et al., “Structured peer-to-peer overlays: A new platform for distributed systems?” Presentation, available at <http://www.umiacs.umd.edu/docs/Presentation—Nov10.pdf>, accessed on Apr. 22, 2004, 62 pages.
Kaashoek, Frans, “Distributed Hash Tables: simplifying building robust Internet-scale applications,” Presentation, Apr. 15, 2003, available at <http://www.media.mit.edu/events/2003-04-15-ec/kaashoek.pdf>, accessed on Apr. 22, 2004, 29 pages.
Milojicic, Dejan S., et al., “Peer-to-Peer Computing,” Technical Report HPL-2002/57, HP Lab, Mar. 8, 2002, available at <http://citeseer.ist.psu.edu/milojicic02peertopeer.html> accessed on Apr. 22, 2004, pp. 1-51.
Liben-Nowell, David, et al., “Analysis of the Evolution of Peer-to-Peer Systems,” published in Proceedings of the Twenty-First Annual Symposium on Principles of Distributed Computing, pp. 233-242. ACM Press, 2002. Available at <http://citeseer.ist.psu.edu/liben-nowell02analysis.html> accessed on Apr. 22, 2004, 10 pages.
Shi Shu-Ming
Zhang Zheng
Lee & Hayes PLLC
Lu Kuen S.
Microsoft Corporation
LandOfFree
Data overlay, self-organized metadata overlay, and... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Data overlay, self-organized metadata overlay, and..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Data overlay, self-organized metadata overlay, and... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-3839242