Multiplex communications – Pathfinding or routing
Reexamination Certificate
2005-07-01
2010-10-05
Juntima, Nittaya (Department: 2416)
Multiplex communications
Pathfinding or routing
C370S395320, C370S400000, C709S238000
Reexamination Certificate
active
07808971
ABSTRACT:
In a distributed hash table (DHT), a participating node has a routing cache associating nodes in the DHT with their respective network addresses. Messages can be routed with the routing table using prefix-matching or numerical-closeness without requiring rigid structuring of the node's cache. Entries in the cache may be replaced using routing information obtained from en route messages. Entries in the routing cache may be replaced without regard for the nodeIDs in or entering the routing cache, and/or without structuring the routing cache according to the nodeIDs placed therein. Cache entries may be replaced randomly.
REFERENCES:
patent: 7263560 (2007-08-01), Abdelaziz et al.
patent: 2002/0143989 (2002-10-01), Huitema et al.
patent: 2004/0249970 (2004-12-01), Castro et al.
patent: 2008/0310340 (2008-12-01), Isozu
Eng Keong Lua, Jon Crowcroft, Marcelo Pias, Ravi Sharma, and Steven Lim, A Survey and Comparison of Peer-to-Peer Overlay Network Schemes, IEEE Communication Survey and Tutorial, Mar. 2004; revised Nov. 2004.
Stephanos Androutsellis-Theotokis and Diomidis Spinellis, A Survey of Peer-to-Peer Content Distribution Technologies, ACM Computing Surveys, 36(4):335-371, Dec. 2004.
Introduction The Beehive System, http://www.cs.cornell.edu/people/egs/beehive/beehive-nsdi04
odel.html, Feb. 11, 2004.
Ion Stoica, Robert Morris, David Karger, M. Frans Kaashoek, and Hari Balakrishnan, Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications, SIGCOMM'01, Aug. 27-31, 2001, USA, Copyright 2001 ACM.
Joseph Davies, Todd Manion, Ravi Rao, John Miller, and Xiaohai Zhang, Introduction to Windows Peer-to-Peer Networking, http://www.microsoft.com/technet/prodtechnol/winxppro/deploy/p2pintro.mspx, Published: Jan. 1, 2003, Updated: Jul. 30, 2004.
Marvin Theimer and Michael B. Jones, Overlook: Scalable Name Service on an Overlay Network, Apr. 2002, Proceedings of the 22ndInternational Conference on Distributed Computing Systems, Vienna, Austria, IEEE Computer Society, Jul. 2002.
Antony Rowstron and Peter Druschel, Pastry: Scalable, decentralized object location and routing for large-scale peer-to-peer systems, Proceedings of the 18thIFIP/ACM International Conference on Distributed Systems Plat forms (Middleware 2001). Heidelberg, Germany, Nov. 2001.
Karl Aberer, Anwitaman Datta, and Manfred Hauswirth, Route maintenance overheads in DHT overlays, EFPL Technical Report IC/ 2003/ 67.
Gurmeet Singh Manku, Routing Networks for Distributed Hash Tables, PODC'03, Jul. 13-16, 2003, USA. Copyright 2003 ACM.
Ben Y. Zhao, John Kubiatowicz, and Anthony D. Joseph, Tapestry: An Infrastructure for Fault-tolerant Wide-area Location and Routing, Computer Science Division University of California, Report No. UCB/CSD01-1141 Apr. 2001.
Nima Sarshar and Vwani Roychowdhury, A Random Structure for Optimum Cache Size Distributed Hash Table (DHT) Peer-to-Peer Design, Department of Electrical Engineering, University of California, Oct. 14, 2004, USA.
Himabindu Pucha, Saumitra M. Das, and Y. Charlie Hu, Ekta: An Efficient DHT Substrate for Distributed Applications in Mobile Ad Hoc Networks, In Proceedings of the 6thIEEE Workshop on Mobile computing Systems and Applications (WMCSA 2004), UK, Dec. 2-3, 2004.
Sitaram Lyer, Antony Rowstron, and Peter Druschel, Squirrel: A decentralized peer-to-peer web cache, PODC-21 Jul. 2002 USA, © 2002 ACM.
Dahlia Malhi, Moni Naor, and David Ratajczak, Viceroy: A Scalable and Dynamic Emulation of the Butterfly, PODC 2002, Jul. 21-24, 2002, USA, Copyright 2002 ACM.
Jussi Kangasharju, Keith W. Ross, and David A. Turner, “Adaptive content management in structured P2P communities”, ACM International Conference Proceeding Series; vol. 152 archive, Proceedings of the 1st International Conference on Scalable Information Systems 2006, Hong Kong May 30-Jun. 1, 2006.
Miguel Castro, Manuel Costa, and Antony Rowstron, “Debunking some myths about structured and unstructured overlays”, Proceedings of the 2nd conference on Symposium on Networked Systems Design & Implementation—vol. 2, May 2-4, 2005.
Ferreira, R.A. et al., “An IP address based caching scheme for peer-to-peer networks”, Global Telecommunications Conference, 2003. GLOBECOM '03. IEEE, vol. 7, pp. 3845-3850; Dec. 1-5, 2003.
Sarshar, N. et al., “Percolation search in power law networks: making unstructured peer-to-peer networks scalable”, Proceedings of the Fourth International Conference on Peer-to-Peer Computing, 2004; pp. 2-9; Aug. 25-27, 2004.
Bogdan Carbunar, Ananth Grama, and Jan Vitek, “Distributed and Dynamic Voronoi Overlays for Coverage Detection and Distributed Hash Tables in Ad-Hoc Networks”, Proceedings of the Parallel and Distributed Systems, Tenth International Conference 2004; Jul. 7-9, 2004.
N. Ambastha, I. et al.,“A cache-based resource location approach for unstructured P2P network architectures,” In Graduate Research Conference, Department of Computer Science, Stony Brook University; May 2003.
Hung-Chang Hsiao et al., “Resource Discovery in Peer-to-Peer Infrastructure,” In the book of “High Performance Computing: Paradigm and Infrastructure”, John Wiley & Sons Ltd, Nov. 2005, pp. 551-572.
Stefan Saroiu, P. Krishna Gummadi, and Steven D. Gribble, “A Measurement Study of Peer-to-Peer File Sharing Systems” , Proceedings of the Multimedia Computing and Networking (MMCN), San Jose, Jan. 18-25, 2002.
LandOfFree
Routing cache for distributed hash tables does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Routing cache for distributed hash tables, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Routing cache for distributed hash tables will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4196583