Decentralized peer-to-peer advertisement

Electrical computers and digital processing systems: multicomput – Computer-to-computer data routing

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C709S228000, C709S229000, C709S230000, C709S238000, C709S243000

Reexamination Certificate

active

10231544

ABSTRACT:
Embodiments of a shared resource distributed index mechanism that peers in a peer-to-peer network may utilize to distribute index entries corresponding to resources to indexes of shared resources among one or more other peers. These indexes may be used to direct queries to peers where the queries are most likely to be answered. When a query is received by a rendezvous peer including one or more indexes, contents of the query may be “looked up” in the index to find matches. The results of the lookup may include information on one or peer(s) that may hold advertisement(s) to the resource requested by the query. The query may then be forwarded to one or more peers that may hold the advertisement for the resource. Embodiments may provide “loosely-coupled” distribution of index entries for use in querying for resources in the peer-to-peer network.

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: 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: 6032175 (2000-02-01), Fletcher et al.
patent: 6061734 (2000-05-01), London
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: 6408341 (2002-06-01), Feeney et al.
patent: 6456600 (2002-09-01), Rochberger et al.
patent: 6477590 (2002-11-01), Habusha et al.
patent: 6574655 (2003-06-01), Libert et al.
patent: 6591310 (2003-07-01), Johnson
patent: 6611872 (2003-08-01), McCanne
patent: 6633761 (2003-10-01), Singhal et al.
patent: 6636854 (2003-10-01), Dutta et al.
patent: 6651105 (2003-11-01), Bhagwat et al.
patent: 6658540 (2003-12-01), Sicola et al.
patent: 6671746 (2003-12-01), Northrup
patent: 6681282 (2004-01-01), Golden et al.
patent: 6721286 (2004-04-01), Williams et al.
patent: 6732180 (2004-05-01), Hale et al.
patent: 6742023 (2004-05-01), Fanning 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: 6810259 (2004-10-01), Zhang
patent: 6816461 (2004-11-01), Scrandis et al.
patent: 6826763 (2004-11-01), Wang et al.
patent: 6845091 (2005-01-01), Ogier et al.
patent: 6865600 (2005-03-01), Brydon et al.
patent: 6892230 (2005-05-01), Gu et al.
patent: 7065587 (2006-06-01), Huitema et al.
patent: 7136927 (2006-11-01), Traversat et al.
patent: 2001/0042204 (2001-11-01), Blaker et al.
patent: 2002/0062375 (2002-05-01), Teodosiu et al.
patent: 2002/0073075 (2002-06-01), Dutta et al.
patent: 2002/0073204 (2002-06-01), Dutta et al.
patent: 2002/0107935 (2002-08-01), Lowery et al.
patent: 2002/0161821 (2002-10-01), Narayan et al.
patent: 2003/0067912 (2003-04-01), Mead 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
Clarke, I., Sandberg, O., Wiley, B., and Hong, T.W. Freenet: A distributed anonymous information storage and retrieval system. In Proceedings of the ICSI Workshop on Design Issues in Anonymity and Unobservability (Berkeley, California, Jun. 2000). http://freenet.sourceforge.net.
S. Botros and S. Waterhouse, “Search in JXTA and other Distributed Networks,” Proc. 2001 Int'l Conf. Peer-to-Peer Computing, 2001; available online at http://people.jxta.org/stevew/BotrosWaterhouse2001.pdf.
S. Waterhouse, “JXTA Search: Distributed Search for Distributed Networks”, Sun Microsystems, May 2001.
Waterhouse, S., Doolin, D.M., Kan G., Faybishenko, Y. 2002. Distributed Search in P2P Networks. IEEE Internet Computing 6(1):68-72. Jan.-Feb.
Cederqvist, et al., “What is CVS?”, 1993, 6 pages.
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.
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.
Microsoft Computer Dictionary, 1999, Microsoft, 4thEdition, p. 252.

LandOfFree

Say what you really think

Search LandOfFree.com for the USA inventors and patents. Rate them and share your experience with other people.

Rating

Decentralized peer-to-peer advertisement does not yet have a rating. At this time, there are no reviews or comments for this patent.

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

Rate now

     

Profile ID: LFUS-PAI-O-3873731

  Search
All data on this website is collected from public sources. Our data reflects the most accurate information available at the time of publication.