Methods and systems for streaming data

Multiplex communications – Data flow congestion prevention or control

Reexamination Certificate

Rate now

  [ 0.00 ] – not rated yet Voters 0   Comments 0

Details

C709S235000

Reexamination Certificate

active

07400577

ABSTRACT:
A technique is disclosed that can efficiently control congestion, while supporting heterogeneity for streaming data among multiple computers in a network. A plurality of nodes is divided into a plurality of distribution trees within a computer network, wherein the data is divided into a plurality of prioritized layers. When a node experiences packet loss, the location of the congestion is inferred. If the congestion is at or near the outgoing link, outgoing traffic is shed to alleviate the congestion by shedding child node(s) receiving descriptions in the least important layer of data that the child node(s) are receiving. Similarly, if the congestion is at or near the incoming link, incoming traffic is shed by shedding parent nodes that are sending descriptions in the least important layer of data that the node is receiving. Nodes with available bandwidth are further instructed to subscribe to additional descriptions.

REFERENCES:
patent: 6151633 (2000-11-01), Hurst et al.
patent: 6185698 (2001-02-01), Wesley et al.
patent: 6215766 (2001-04-01), Ammar et al.
patent: 6987728 (2006-01-01), Deshpande
patent: 7035217 (2006-04-01), Vicisano et al.
The Active Traffic Control Mechanism for Layered Multimedia Multicast in Active Network, Saehoon Kang et al., Modeling, Analysis and Simulation of Computer and Telecommunication Systems, 2000, Proceedings, 8th International Symposium, pp. 325-332, IEEE, Year 2000.
Barabasi, Albert-Laszlo, et al., “Emergence of Scaling in Random Networks,”Science, vol. 286, (1999), pp. 509-512.
Bu, Tian, et al., “Network Tomography on General Topologies,”Proc. ACM Sigmetrics, (2002).
Castro, Miguel, et al., “SplitStream: High-bandwidth Content Distribution in Cooperative Environments,”Proc. SOSP, (2003).
Chawathe, Yatin, et al., “Making Gnutella-like P2P Systems Scalable,”Proc. ACM Sigcomm, (2003).
Chou, Philip A., et al., “Layered Multiple Description Coding,”Proc. Packet Video Workshop, (2003).
Chu, Yang-Hua, et al., “Enabling Conferencing Applications on the Internet Using an Overlay Multicast Architecture,”Proc. ACM Sigcomm, (2001).
“End System Multicast,” http://esm.cs.cmu.edu, printed on May 6, 2004.
Goyal, Vivek K., “Multiple Description Coding: Compression Meets the Network,”IEEE Signal Processing, (2001), pp. 74-93.
Liu, Jiangchuan, et al., “A Hybrid Adaptation Protocol for TCP-Friendly Layered Multicast and Its Optimal Rate Allocation,”IEEE Infocom, (2002).
McCanne, S.R., et al., “Receiver-driven Layered Multicast,”Proc. ACM Sigcomm, (1996).
Medina, Alberto, et al., “Brite: An Approach to Universal Topology Generation,”Proc. Mascots, (2001).
Padmanabhan, Venkat, et al., “Resilient Peer-to-Peer Streaming,”Proc. IEEE ICNP, (2003).
Padmanabhan, Venkat, et al., “Distributing Streaming Media Content Using Cooperative Networking,”Proc. NOSSDAV, (2002).
http://www.rawflow.com/technology.html, printed on May 4, 2004.
Wu, Linda, et al., “Thin Streams: An Architecture for Multicasting Layered Video,”Proc. NOSSDAV, (1997).
Albanese et al., “Priority Encoding Transmission,”IEEE Transactions on Information Theory, vol. 42, pp. 1737-1744 (Nov. 1996),
Chou et al., “Clustering Source/Channel Rate Allocations for Receiver-driven Multicast under a Limited Number of Streams,”2000 IEEE International Conference on Multimedia and Expo(ICME 2000), pp. 1221-1224 (Jul. 2000).
Chou et al., “Error Control for Receiver-Driven Layered Multicast of Audio and Video,”IEEE Transactions on Multimedia, vol. 3, No. 1, pp. 108-122 (Mar. 2001).
Davis et al., “Joint Source and Channel Coding for Image Transmission Over Lossy Packet Networks,”SPIE, vol. 2847, pp. 376-387 (Aug. 1996).
Majumdar et al., “Rate-Distortion Efficient Video Transmission from Multiple Servers,”International Conference on Multimedia and Expo(ICME), Lausanne, Switzerland (Aug. 2002).
Mohr et al., “Approximately Optimal Assignment for Unequal Loss Protection,”Proceedings of the IEEE International Conference on Image Processing(ICIP 2000), vol. 1, pp. 367-370. (Sep. 2000).
Mohr et al., “Unequal Loss Protection: Graceful Degradation of Image Quality over Packet Erasure Channels Through Forward Error Correction,”IEEE Journal on Selected Areas in Communications, vol. 18, No. 6, pp. 819-829 (Jun. 2000).
Nguyen et al., “Distributed Video Streaming with Forward Error Correction,”Packet Video Workshop, Pittsburgh, PA (2002).
Padmanabhan et al., “Supporting Heterogeneity and Congestion Control in Peer-to-Peer Multicast Streaming,”The 3rd International Workshop on Peer-to-Peer Systems(IPTPS 2004), San Diego, CA, Feb. 26-27, 2004 (2004).
Puri et al., “Multiple Description Source Coding using Forward Error Correction Codes,”The Thirty-Third Asilomar Conference on Signals, Systems,&Computers, pp. 342-346 (Oct. 1999).
Stanković et al., “Packet Loss Protection of Embedded Data with Fast Local Search,”ICIP: 2002 Proceedings of International Conference on Image Processing, vol. II, pp. 165-168 (Sep. 2002).
Wicker,Error Control Systems for Digital Communication and Storage(Prentice Hall, Upper Saddle River, NJ, 1995).
Zimmerman, “OSI Reference Model—The ISO Model of Architecture for Open Systems Interconnection,”IEEE Transactions on Communications, vol. com-28, No. 4, pp. 425-432 (Apr. 1980).

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

Methods and systems for streaming data does not yet have a rating. At this time, there are no reviews or comments for this patent.

If you have personal experience with Methods and systems for streaming data, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Methods and systems for streaming data will most certainly appreciate the feedback.

Rate now

     

Profile ID: LFUS-PAI-O-3974029

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