Fitness based routing

Details Fitness based routing Fitness based routing

2011-06-14

2011-06-14

Ryman, Danniel J (Department: 2466)

Multiplex communications

Pathfinding or routing

C370S400000, C370S406000

Reexamination Certificate

active

07961711

ABSTRACT:
The present invention extends to methods, systems, and computer program products for fitness based routing. Embodiments of the invention significantly improve the likelihood that routing nodes contained in routing table have adequate (or even relatively increased) ability to transfer and process messages in an overlay network. Thus, when the node is to make a routing decision for a message, the node has some assurances that any selected routing node is adequate (or is at least the best currently available). Further, a sending node can take preference to routing nodes with higher fitness values when sending a message. Preference to higher fitness metric values further insures that messages are adequately transferred and processed. Accordingly, embodiments of the invention can be used to route messages in a manner that optimizes bandwidth and provides efficient routing capability.

REFERENCES:
patent: 6415323 (2002-07-01), McCanne et al.
patent: 6563823 (2003-05-01), Przygienda et al.
patent: 7133928 (2006-11-01), McCanne
patent: 7230949 (2007-06-01), Bharali et al.
patent: 7257646 (2007-08-01), Jonsson
patent: 7266125 (2007-09-01), Xu et al.
patent: 7539771 (2009-05-01), de Castro et al.
patent: 2003/0236870 (2003-12-01), Boivie et al.
patent: 2004/0047350 (2004-03-01), Zhang et al.
patent: 2004/0054807 (2004-03-01), Harvey et al.
patent: 2004/0085329 (2004-05-01), Xu et al.
patent: 2004/0185845 (2004-09-01), Abhishek et al.
patent: 2005/0015511 (2005-01-01), Izmailov et al.
patent: 2005/0060429 (2005-03-01), Massoulie et al.
patent: 2005/0083848 (2005-04-01), Shao et al.
patent: 2006/0039371 (2006-02-01), Castro et al.
patent: 2006/0268871 (2006-11-01), Van Zijst
patent: 2007/0002869 (2007-01-01), Miller
patent: 2007/0028002 (2007-02-01), McCanne
patent: 2007/0153782 (2007-06-01), Fletcher
patent: 2009/0092144 (2009-04-01), Wepiwe et al.
patent: 1164754 (2000-06-01), None
patent: 1164753 (2001-12-01), None
patent: 2006-246205 (2006-09-01), None
patent: 2007030742 (2007-03-01), None
patent: 2007034313 (2007-03-01), None
Zhi Li and Prasant Mohapatra, “QRON: QoS-Aware Routing in Overlay Networks,” IEEE Journal on Selected Areas in Communications, vol. 22, No. 1, pp. 29-39, Jan. 2004.
Castro, Miguel, et al., “Peer-to-peer overlays: structured, unstructured, or both?”, Technical report, 2004. Microsoft Research, Cambridge, Technical Report MSR-TR-2004-73, 15 pages.
Castro, Miguel, et al., “Performance and dependability of structured peer-to-peer overlays”, Dec. 2003, 10 pages.
Chimera, copyright CURRENT Lab, U.C. Santa Barbara 2006, 1 page.
Castro, Miguel, et al., “Secure routing for structured peer-to-peer overlay networks”, Appears in Proc. of the 5th Usenix Symposium on Operating Systems Design and Implementation, Boston, MA, Dec. 2002, 16 pages.
Stoica, Ion, et al., “Chord: A Scalable Peer-to-peer Lookup Service for Internet Applications”, SIGCOMM'01, Aug. 27-31, 2001, San Diego, CA, Copyright 2001 ACM, 12 pages.
Prudich, Philip M., “Dynamic Routing Using an Overlay Network of Relays”, Aug. 2005, 90 pages.
Bhargava, Ankur, et al., “Pagoda: A Dynamic Overlay Network for Data Management, Routing and Multicasting”, 2004, 22 pages.
Zhu, Yong, “Routing, Resource Allocation and Network Design for Overlay Networks”, Dec. 2006, 133 pages.
Dabek,Frank, et al. “Building peer-to-peer systems with Chord, a distributed lookup service,” Proc. 8 Wshop, Hot Topics in Operating Syst., (HOTOSVIII) , May 2001, 6 pages.
Rowstron, Anthony, et al. “Pastry: Scalable, distributed object location and routing for largescale peer-to-peer systems,” Proc. 18th IFIP/ACM Intl. Conf. Distributed Systems Platforms (Middleware), 2001, 23 pages.
Zhao, Ben Y., et al., “Tapestry: An infrastructure for fault-tolerant wide-area location and routing,” Technical Report UCB/CSD-01-1141, UC Berkeley, Apr. 2001, 27 pages.
Zhao,Ben Y., et al., “Tapestry: A Resilient Global-scale Overlay for Service Deployment,” IEEE Journal on Selected Areas on Communications, vol. 22, No. 1, Jan. 2004, 15 pages.
Ratnasamy, Sylvia, et al., “A scalable content-addressable network. In SIGCOMM,” Aug. 2001, pp. 161-172.
Maymounkov, Petar, et al.,“Kademlia: A peer-to-peer informatic system based on the XOR metric,” Proceedings of IPTPS'02, (Cambridge, MA), Mar. 2002, 35 pages.
Kubiatowicz, John, et al., “Oceanstore: An architecture for global-scale persistent storage,” ASPLOS, 2000, 12 pages.

Affiliated with

Also associated with

Rating

Fitness based routing does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Fitness based routing, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Fitness based routing will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFUS-PAI-O-2718900