Path optimizer for peer to peer networks

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

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C709S230000

Reexamination Certificate

active

07571251

ABSTRACT:
The invention disclosed is a path optimizer for Peer to Peer (P2P) networks. Large amounts of P2P file exchanges increase the costs to maintain a network. Network service providers typically pay for the amount of data they exchange with other network service providers. The present invention examines P2P messages between and within networks and provides a cost efficient path to handle each P2P message.

REFERENCES:
patent: 5617539 (1997-04-01), Ludwig et al.
patent: 5946316 (1999-08-01), Chen et al.
patent: 6029195 (2000-02-01), Herz
patent: 6185598 (2001-02-01), Farber et al.
patent: 6246669 (2001-06-01), Chevalier et al.
patent: 6256309 (2001-07-01), Daley et al.
patent: 6415280 (2002-07-01), Farber et al.
patent: 6542964 (2003-04-01), Scharber
patent: 6567856 (2003-05-01), Steele et al.
patent: 6631128 (2003-10-01), Lemieux
patent: 6653933 (2003-11-01), Raschke et al.
patent: 6801905 (2004-10-01), Andrei
patent: 6813631 (2004-11-01), Pouchak et al.
patent: 6850965 (2005-02-01), Allen
patent: 6877034 (2005-04-01), Machin et al.
patent: 6938095 (2005-08-01), Basturk et al.
patent: 6981055 (2005-12-01), Ahuja et al.
patent: 6993475 (2006-01-01), McConnell et al.
patent: 7065579 (2006-06-01), Traversat et al.
patent: 7080030 (2006-07-01), Eglen et al.
patent: 7174382 (2007-02-01), Ramanathan et al.
patent: 7333482 (2008-02-01), Johansson et al.
patent: 2002/0073088 (2002-06-01), Beckmann et al.
patent: 2002/0133534 (2002-09-01), Forslow
patent: 2002/0143855 (2002-10-01), Traversat et al.
patent: 2002/0143944 (2002-10-01), Traversat et al.
patent: 2002/0145981 (2002-10-01), Klinker et al.
patent: 2002/0152299 (2002-10-01), Traversat et al.
patent: 2002/0194108 (2002-12-01), Kitze
patent: 2003/0009587 (2003-01-01), Harrow et al.
patent: 2003/0041095 (2003-02-01), Konda et al.
patent: 2003/0158958 (2003-08-01), Chiu
patent: 2003/0172059 (2003-09-01), Andrei
patent: 2003/0174648 (2003-09-01), Wang et al.
patent: 2003/0191558 (2003-10-01), Arellano
patent: 2004/0095907 (2004-05-01), Agee et al.
patent: 2005/0021862 (2005-01-01), Schroeder et al.
patent: 2005/0233759 (2005-10-01), Anvekar et al.
patent: WO 02/15035 (2002-02-01), None
patent: 0221378 (2002-03-01), None
patent: WO/02/31615 (2002-04-01), None
patent: WO 02/097557 (2002-12-01), None
Developing a query optimizer for a federated database system Zhao-Ping Yu; Egyhazy, C.; Intelligent Information Systems, 1997. IIS '97. Proceedings Dec. 8-10, 1997 pp. 420-427.
Protocol Support for Optimized, Context Sensitive..—Kümmel, Hutschenreuther ; ATM, a physical peer-to-peer throughput of 155 Mbit/s wwwrn.inf.tu-dresden.de/lsrn/Ps-Files/ICODP97.ps.
Cost-based Query Scrambling for Initial Delays—Urhan, Franklin, Amsaleg (1998) www.cs.umd.edu/users/urhan/cbscramb-camera.ps.
Cache-Conscious Data Placement—Calder, Krintz, John, Austin (1998) www.cse.ucsd.edu/˜calder/papers/ASPLOS-98-CCDP.ps.Z.
Sandvine—Managing P2P traffic on DOCSIS Networks, Feb. 2002.
Sandvine—Sandvine to Present Business Case at Investor Forum.

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

Path optimizer for peer to peer networks does not yet have a rating. At this time, there are no reviews or comments for this patent.

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

Rate now

     

Profile ID: LFUS-PAI-O-4101588

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