Streaming Video Using Dynamic Rate Shaping and TCP Congestion Control

Jacobs, Stephen E.; Eleftheriadis, Alexandros

doi:10.1006/jvci.1998.0389

Cited by 76 publications

(30 citation statements)

References 15 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Table 1 shows how the following protocols are classified: Slack ARQ [13], PECC [11,12], k-XP [3,22], POCv2 [10], AOEC [16], CUDP [32], VDP [8], Jacobs/Eleftheriadis [20], TLTCP [24], SRP [27], Papadopoulos/Parulkar [25], SR-RTP [15], HPF [21], MSP [19], XUDP [4], PR-SCTP [33], and PRTP-ECN [17,18]. A survey of a subset of these protocols is also presented: PECC, POCv2, SRP, HPF, PR-SCTP, and PRTP-ECN.…”

Section: A Classification and Survey Of Existing Protocolsmentioning

confidence: 99%

Taxonomy and survey of retransmission-based partially reliable transport protocols

Grinnemo¹,

Garcia²,

Brunström³

2004

Computer Communications

View full text Add to dashboard Cite

The mismatch between the services offered by the two standard transport protocols in the Internet, TCP and UDP, and the services required by distributed multimedia applications has led to the development of a large number of partially reliable transport protocols. That is, protocols which in terms of reliability places themselves between TCP and UDP. This paper presents a taxonomy for retransmission based, partially reliable transport protocols, i.e., the subclass of partially reliable transport protocols that performs error recovery through retransmissions. The taxonomy comprises two classification schemes: one that classifies retransmission based, partially reliable transport protocols with respect to the reliability service they offer and one that classifies them with respect to their error control scheme. The objective of our taxonomy is fourfold: to introduce a unified terminology; to provide a framework in which retransmission based, partially reliable transport protocols can be examined, compared, and contrasted; to make explicit the error control schemes used by these protocols; and, finally, to gain new insights into these protocols and thereby suggest avenues for future research. Based on our taxonomy, a survey was made of existing retransmission based, partially reliable transport protocols. The survey shows how protocols are categorized according to our taxonomy, and exemplifies the majority of reliability services and error control schemes detailed in our taxonomy.

show abstract

Section: A Classification and Survey Of Existing Protocolsmentioning

confidence: 99%

Taxonomy and survey of retransmission-based partially reliable transport protocols

Grinnemo¹,

Garcia²,

Brunström³

2004

Computer Communications

View full text Add to dashboard Cite

show abstract

“…Sender-driven adaptation schemes fall into two categories: buffer based and loss based. Buffer based adaptation schemes use the occupancy of a buffer on the transmission path as a measure of congestion (Jacobs and Eleftheriadis, 1998;Kanakia et al, 1995). Loss based adaptation schemes adjust the rate based on the packet loss experienced by the receivers (Busse et al, 1996;Sisalem and Schulzrinne, 1998).…”

Section: Introductionmentioning

confidence: 99%

“…Real-time streams are also expected to share the network bandwidth with the dominant TCP flows to obtain the inter-protocol fairness. Some approaches adjust the transmission rate in an additive increase and multiplicative decrease (AIMD) way which is similar to TCP (Jacobs and Eleftheriadis, 1998;Rejaie et al, 1999). These approaches will result in rather fluctuant transmission rates, which may produce an annoying presentation quality at the receiver.…”

Section: Introductionmentioning

confidence: 99%

An adaptive rate-control streaming mechanism with optimal buffer utilization

Chen

Shyu

Gray

et al. 2005

Journal of Systems and Software

View full text Add to dashboard Cite

In this paper, an end-to-end real-time adaptive protocol for multimedia transmission is presented. The bandwidth is dynamically allocated according to the network status, and the client buffer occupancy and playback requirement. The transmission rate is determined by the quadratic probing algorithm that can obtain the maximal utilization of the client buffer and minimal occupation of the network bandwidth. It is also coupled with a congestion control mechanism that can effectively decrease the packet loss rate during network congestion. We investigate the performance of our quadratic probing algorithm in different congestion levels under both the Local Area Net (LAN) and Internet environments. Performance analysis reveals that our approach is more robust in avoiding overflows and underflows in different network congestion levels, and adapting to the changing network delays. Comparisons are made with the fixed rate approach and the rate by playback requirement approach. The experimental results show that our proposed real time protocol with the rate adjusting quadratic probing algorithm is efficient in utilizing the network resources and decreasing the packet loss ratios.

show abstract

“…bandwidth) of a connection [7][8][9][10][11], and reduction of resource requirements by statistical multiplexing of multiple sources [12,13]. Most of these studies are based on MPEG video transmission over ATM networks, although some studies on MPEG transmission using the Transmission Control Protocol (TCP) over IP networks have been carried out [14]. However, the IETF has specified the User Datagram Protocol (UDP) for transmitting MPEG streams in the Integrated Services model [15].…”

Section: Introductionmentioning

confidence: 99%

Traffic shaping for MPEG video transmission over the next generation internet

Alam

Atiquzzaman

Karim

2000

Computer Communications

View full text Add to dashboard Cite

The Internet Engineering Task Force (IETF) has proposed the Guaranteed Service (GS) in the Integrated Services model with firm delay and bandwidth guarantees. In this paper, we study the effects of a token bucket traffic shaper at the source on the transmission characteristics of Motion Picture Experts Group (MPEG) compressed video streams over the GS. We develop an analytical model of the traffic shaper, and also carry out numerical simulation of the transmission performance using MPEG trace data from several different video sequences. The analytical model and the numerical simulation results are in excellent agreement. Our study provides a technique to determine the token bucket parameters that have to be specified while setting up a GS flow. Our study reveals that the traffic shaping process gives an end application a wide range of flexibility in controlling the delay. By choosing appropriate token bucket traffic shaper parameters, delay can be reduced significantly without the need to reserve costly network resources for less delay-sensitive applications, while time-critical applications may specify the required token bucket parameters for minimum delay. ᭧

show abstract

Streaming Video Using Dynamic Rate Shaping and TCP Congestion Control

Cited by 76 publications

References 15 publications

Taxonomy and survey of retransmission-based partially reliable transport protocols

Taxonomy and survey of retransmission-based partially reliable transport protocols

An adaptive rate-control streaming mechanism with optimal buffer utilization

Traffic shaping for MPEG video transmission over the next generation internet

Contact Info

Product

Resources

About