Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing
Reexamination Certificate
2002-01-22
2009-08-11
Abdullahi, Salad (Department: 2457)
Electrical computers and digital processing systems: multicomput
Computer-to-computer data routing
C709S227000
Reexamination Certificate
active
07574523
ABSTRACT:
A system and method for allowing peers to exchange messages with other peers independently of their network location in a peer-to-peer environment. Messages may be transparently routed, potentially traversing partitions (e.g. firewalls and NATs), and using different protocols to reach the destination peers. In one embodiment, any peer node may serve as a relay peer that allows peers inside a partition to have a presence outside the partition and provides a mechanism for peers outside partitions to discover and communicate with peers inside the partitions. In one embodiment, a relay peer may maintain information on routes to other peers and assist in relaying messages to other peers. In one embodiment, any peer may query a relay peer for route information. In one embodiment, messages may include routing information as part of their payloads.
REFERENCES:
patent: 5109483 (1992-04-01), Baratz et al.
patent: 5224205 (1993-06-01), Dinkin et al.
patent: 5442637 (1995-08-01), Nguyen
patent: 5517622 (1996-05-01), Ivanoff et al.
patent: 5675629 (1997-10-01), Raffel et al.
patent: 5675782 (1997-10-01), Montague et al.
patent: 5719861 (1998-02-01), Okanoue
patent: 5729682 (1998-03-01), Marquis et al.
patent: 5758087 (1998-05-01), Aaker et al.
patent: 5768527 (1998-06-01), Zhu et al.
patent: 5805820 (1998-09-01), Bellovin et al.
patent: 5831975 (1998-11-01), Chen et al.
patent: 5896503 (1999-04-01), Badovinatz et al.
patent: 5931916 (1999-08-01), Barker et al.
patent: 5941988 (1999-08-01), Bhagwat et al.
patent: 5999530 (1999-12-01), LeMaire et al.
patent: 6003084 (1999-12-01), Green et al.
patent: 6061734 (2000-05-01), London
patent: 6061794 (2000-05-01), Angelo et al.
patent: 6105064 (2000-08-01), Davis et al.
patent: 6182136 (2001-01-01), Ramanathan et al.
patent: 6212558 (2001-04-01), Antur et al.
patent: 6269099 (2001-07-01), Borella et al.
patent: 6324580 (2001-11-01), Jindal et al.
patent: 6392997 (2002-05-01), Chen
patent: 6408341 (2002-06-01), Feeney et al.
patent: 6456600 (2002-09-01), Rochberger et al.
patent: 6477590 (2002-11-01), Habusha et al.
patent: 6512768 (2003-01-01), Thomas
patent: 6591310 (2003-07-01), Johnson
patent: 6618393 (2003-09-01), Chiles et al.
patent: 6671746 (2003-12-01), Northrup
patent: 6680942 (2004-01-01), Mead et al.
patent: 6721286 (2004-04-01), Williams et al.
patent: 6732180 (2004-05-01), Hale et al.
patent: 6778491 (2004-08-01), Fourcand et al.
patent: 6782527 (2004-08-01), Kouznetsov et al.
patent: 6795917 (2004-09-01), Yionen
patent: 6802068 (2004-10-01), Guruprasad
patent: 6810259 (2004-10-01), Zhang
patent: 6816461 (2004-11-01), Scrandis et al.
patent: 6826182 (2004-11-01), Parthasarathy
patent: 6826763 (2004-11-01), Wang et al.
patent: 6865600 (2005-03-01), Brydon et al.
patent: 6870817 (2005-03-01), Dolinar et al.
patent: 6880085 (2005-04-01), Balczewski et al.
patent: 6880089 (2005-04-01), Bommareddy et al.
patent: 6954790 (2005-10-01), Forslow
patent: 6961641 (2005-11-01), Forth et al.
patent: 6980524 (2005-12-01), Lu et al.
patent: 6985959 (2006-01-01), Lee
patent: 2002/0062375 (2002-05-01), Teodosiu et al.
patent: 2002/0073075 (2002-06-01), Dutta et al.
patent: 2002/0161821 (2002-10-01), Narayan et al.
patent: 2003/0067912 (2003-04-01), Mead et al.
patent: 2003/0105812 (2003-06-01), Flowers et al.
patent: 2004/0068477 (2004-04-01), Gilmour et al.
patent: 2005/0053093 (2005-03-01), Fukushima et al.
patent: 993 163 (2000-04-01), None
patent: 022 876 (2000-07-01), None
Ratnasamy, et al., “A Scalable Content-Addressable Network,” SIGCOMM'01, San Diego, CA, Aug. 27-31, 2001, pp. 161-172.
Stoica, et al., “Chord: A Scalable Peer-to-Peer Lookup Service for Internet Applications,” SIGCOMM'01, San Diego, CA, Aug. 27-31, 2001, pp. 1-12.
Kalt, C., “RFC 2812 Internet Relay Chat: Client Protocol,” Request for Comments, Apr. 2000, pp. 1-63, XP002242624.
Marmor, M.S., “Make the P2P Leap with Toadnode,” Web Technologies, Miller Freeman, US, vol. 5, No. 12, Dec. 2000, pp. 44-49, XP008000376, ISSN: 1086-556X, *Section “How the Gnutella Protocol Works,” on pp. 46-46*.
Krikorian, R., “Hello JXTA,” The O'Reilly Network, Online!, Apr. 25, 2001, pp. 1-9, XP002249288.
DRSCHOLL@USERS.SOURCEFORGE.NET: “Napster Messages,” Open Source Napster Server, ′Online!, Apr. 7, 2000, pp. 1-25, XP002249287.
Cederqvist, et al., “What is CVS?”, 1993, 6 pages.
Abdelaziz Mohamed M.
Clary Michael J.
Duigou Michael J.
Gong Li
Hugly Jean-Christophe
Abdullahi Salad
Kowert Robert C
Meyertons Hood Kivlin Kowert & Goetzel P.C.
Nano Sargon N
Sun Microsystems Inc.
LandOfFree
Relay peers for extending peer availability in a... does not yet have a rating. At this time, there are no reviews or comments for this patent.
If you have personal experience with Relay peers for extending peer availability in a..., we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Relay peers for extending peer availability in a... will most certainly appreciate the feedback.
Profile ID: LFUS-PAI-O-4069216