Bandwidth allocation algorithm for peer-to-peer packet...

Multiplex communications – Data flow congestion prevention or control – Control of data admission to the network

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C370S230100, C370S235000

Reexamination Certificate

active

07995476

ABSTRACT:
Method and system for altering a sending rate of media packets in a peer-to-peer network that includes a client node and a plurality of serving peer nodes.

REFERENCES:
patent: 5442637 (1995-08-01), Nguyen
patent: 6317714 (2001-11-01), Del Castillo et al.
patent: 7376121 (2008-05-01), Dunagan et al.
patent: 2001/0053127 (2001-12-01), Horioka et al.
patent: 2002/0080721 (2002-06-01), Tobagi et al.
patent: 2002/0118639 (2002-08-01), Chintada et al.
patent: 2002/0176361 (2002-11-01), Wu et al.
patent: 2003/0026207 (2003-02-01), Loguinov
patent: 2003/0084108 (2003-05-01), Syed
patent: 2005/0068894 (2005-03-01), Yu et al.
patent: 2005/0128951 (2005-06-01), Chawla et al.
patent: 2005/0254420 (2005-11-01), Wager et al.
patent: 2006/0053209 (2006-03-01), Li
patent: 2006/0092836 (2006-05-01), Kwan et al.
patent: 2006/0146875 (2006-07-01), Yang
patent: 2006/0187874 (2006-08-01), Zaki
patent: 2006/0209898 (2006-09-01), Abdelilah et al.
patent: 2008/0112315 (2008-05-01), Hu et al.
patent: 2009/0113069 (2009-04-01), Prabhakar et al.
Banerjee, et al., “A Comparative Study of Application Layer Multicast Protocols”, retrieved on Oct. 13, 2008 at <<http://wmedia.grnet.gr/P2PBackground/a-comparative-study-ofALM.pdf>>, under submission, 2006, pp. 1-9.
Banerjee, et al., “Resilient Multicast using Overlays”, retrieved on Oct. 13, 2008 at <<http://www.cs.umd.edu/˜slee/pubs/prm-sigmetrics03.pdf>>, ACM (1-58113-664-1/03/0006, SIGMETRICS 03), 2003, pp. 1-12.
Banerjee, et al., “Scalable Application Layer Multicast”, retrieved on Oct. 13, 2008 at <<http://www.cs.umd.edu/users/suman/pubs/sigcomm02.pdf>>, ACM (1-58113-570-X/02/0008, SIGCOMM 02), 2002, pp. 1-13.
Bolot, “Characterizing End-to-End Packet Delay and Loss in the Internet”, retrieved on Oct. 13, 2008 at <<http://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.40.3609&rep=rep1&type=pdf>>, Journal of High-Speed Networks, vol. 2, No. 3, pp. 305-323.
Castro, et al., “SplitStream: High-Bandwidth Multicast in Cooperative Environments”, retrieved on Oct. 13, 2008 at <<http://research.microsoft.com/˜antr/PAST/SplitStrearm-sosp.pdf>>, ACM (1-58113-757-5/03/0010, SOSP 03), 2003, pp. 1-16.
Cen, et al., “Flow and Congestion Control for Internet Media Streaming Applications”, retrieved on Oct. 13, 2008 at <<http://reference.kfupm.edu.sa/content/f/l/flow—and—congestion—control—for—internet—132268.pdf>>, Oregon Graduate Institute of Science and Technology (CSE-97-003), 1997, pp. 1-14.
Chawathe, et al., “An Architecture for Internet Content Distribution as an Infrastructure Service”, retrieved on Oct. 13, 2008 at <<http://citeseerx.ist.psu.edu/viewdoc/download;jsessionid=65F2661CBC1E345DA1C1A4F577ACA52C?doi=10.1.1.35.1680&rep=rep1&type=pdf>>, unpublished, 2000, pp. 1-14.
Chen, et al., “Real Time Video and Audio in the World Wide Web”, retrieved Oct. 13, 2008 at <<https://eprints.kfupm.edu.sa/60948/1/60948.pdf>>, World Wide Web Journal , 1995, pp. 1-12.
Chiu, et al, “Analysis of the Increase and Decrease Algorithms for Congestion Avoidance in Computer Networks”, retrieved on Oct. 13, 2008 at <<http://www.cs.rice.edu/˜eugeneng/teaching/f05/comp529/papers/cj89.pdf>>, Elsevier Science Publishers B.V. (0169-7552/89) 1989, pp. 1-14.
Chu, et al., “A Case for End System Multicast”, retrieved on Oct. 13, 2008 at <<http://www.cs.virginia.edu/˜cs757/papers/Narada-paper.pdf>>, ACM (1-58113-194-1/00/0006, SIGMETRICS 00), 2000, pp. 1-12.
Chu, et al., “Early Experience with an Internet Broadcast System Based on Overlay Multicast”, retrieved on Oct. 13, 2008 at <<http://www.cs.cmu.edu/˜sanjay/Papers/techreport.pdf>>, USENIX Technical Conference, 2004, pp. 1-15.
Cui, et al., “Layered Peer-to-Peer Streaming”, retrieved on Oct. 13, 2008 at <<http://cairo.cs.uiuc.edu/publications/papers
ossdav2003-yicui.pdf>>, ACM (1-58113-694-3/03/0006, NOSSDAV 03), 2003, pp. 1-10.
Cui, et al., “oStream: Asynchronous Streaming Multicast in Application-Layer Overlay Networks”, retrieved on Oct. 13, 2008 at <<http://www.eecg.utoronto.ca/˜bli/papers/jsac-ostream.pdf>>, IEEE Journal, vol. 22, No. 1, 2004, pp. 1-13.
Deshpande, et al., “Streaming Live Media over Peer-to-Peer Network”, retrieved on Oct. 13, 2008 at <<http://dbpubs.stanford.edu:8090/cgi-bin/makehtml.cgi?document=2001/31&format=0&page=1>>, Stanford University Technical Report, 2001, pp. 1-15.
Eugster, et al., “From Epidemics to Distributed Computing”, retrieved on Oct. 13, 2008 at http://se.inf.ethz.ch/people/eugster/papers/gossips.pdf>>, IEEE Computer, vol. 37, No. 5, 2004, pp. 60-67.
Fall, et al., “Simulation-based Comparison of Tahoe, Reno and SACK TCP”, retrieved on Oct. 13, 2008 at <<http://delivery.acm.org/10.1145/240000/235162/p5-fall.pdf?key1=235162&key2=3620693221&coll=GUIDE&dI=GUIDE&CFID=6331466&CFTOKEN=79005673>> ACM (SIGCOMM 96), vol. 26, Issue 3, 1996, pp. 5-21.
Floyd, et al., “Connections with Multiple Congested Gateways in Packet-Switched Networks Part 1: One-way Traffic”, retrieved on Oct. 13, 2008 at <<http://delivery.acm.org/10.1145/130000/122434/p30-floyd.pdf?key1=122434&key2=5401693221&coll=GUIDE&dI=GUIDE&CFID=6332439&CFTOKEN=36906736>> ACM (SIGCOMM 91), vol. 21, Issue 5, 1991, pp. 30-47.
Floyd, et al., “On Traffic Phase Effects in Packet-Switched Gateways”, retrieved Oct. 13, 2008 at <<http://www-nrg.ee.lbl.gov/papers/phase.pdf>>, Internetworking: Research and Experience, vol. 3, No. 3, 1992, pp. 115-156.
Floyd, et al., “Random Early Detection Gateways for Congestion Avoidance”, retrieved on Oct. 13, 2008 at <<http://delivery.acm.org/10.1145/170000/169935/p397-floyd.pdf?key1=169935&key2=9290693221&coll=GUIDE&dl=GUIDE&CFID=6332406&CFTOKEN=78370309>>, IEEE/ACM (1063,6692/93), vol. 1, No. 4, 1993, pp. 397-413.
Gafni, et al., “Dynamic Control of Session Input Rates in Communication Networks”, retrieved on Oct. 13, 2008 at <<http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=1103431&isnumber=24208>>, IEEE (0018-9286/84/1100-1009), vol. AC-29, No. 11, 1984, pp. 1009-1016.
Ganesh, et al., “Peer-to-Peer Membership Management for Gossip-based Protocols”, retrieved on Oct. 14, 2008 at <<http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=1176982&isnumber=26428>>, IEEECS (0018-9340/03), vol. 52, No. 2, 2003, pp. 139-149.
Guo, et al., “P2Cast: Peer-to-Peer Patching Scheme for VoD Service”, retrieved on Oct. 13, 2008 at <<P2Cast: Peer-to-Peer Patching Scheme for VoD Service>>, ACM (1-58113-680-03/03/0005, WWW2003), 2003, pp. 1-9.
Guo, et al., “PROP: A Scalable and Reliable P2P Assisted Proxy Streaming System”, retrieved Oct. 14, 2008 at <<http://ieeexplore.ieee.org/stamp/stamp.jsp?arnumber=1281646&isnumber=28619>>, IEEE (1063-6927/04, ICDCS 04), 2004, pp. 1-9.
Handley, et al., “TCP Friendly Rate Control (TFRC): Protocol Specification”, retrieved on Oct. 13, 2008 at <<http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.12.24>>, Network Working Group (Internet Official Protocol Standards, STD 1, RFC 3448), 2003, pp. 1-25.
Hefeeda, et al., “A Hybrid Architecture for Cost-Effective On-Demand Media Streaming”, retrieved on Oct. 13, 2008 at <<http://wmedia.grnet.gr/P2PBackground/CHECKjcn.pdf>>, Computer Network

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

Bandwidth allocation algorithm for peer-to-peer packet... does not yet have a rating. At this time, there are no reviews or comments for this patent.

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

Rate now

     

Profile ID: LFUS-PAI-O-2684715

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