An adaptive transport protocol for multimedia communication

Abstract

In this paper, we propose a novel approach for effectively supporting multimedia packet flows in an Internet environment. The following are the key contributions of this paper: (a) we propose a new transport protocol called HPF that supports multiple interleaved reliable and unreliable data sub-streams, (b) we decouple the congestion control and reliability mechanisms that are integrated in TCP -this allows us to provide congestion control for unreliable streams as well as reliable streams, and (c) we use priorities within sub-streams of a packet flow as application-defined hints for the link level scheduler to drop packets during congestion.We show through performance measurements in our experimental testbed that our approach can provide effective support for heterogeneous packet flows in the presence of dynamic networking resources.

A Survey of Application Layer Techniques for Adaptive Streaming of Multimedia

“…. Adaptive transport protocol for multimedia: A new transport protocol HPF, that supports multiple interleaved reliable and unreliable streams is presented in [51]. Currently, the Internet does not support heterogeneous flows.…”

Broadcast quality video over IP

“…Besides, since the bit stream syntax is known, there are some games that can be played in the presence of congestion: for example, it is possible to put all the blocks along a given motion trajectory into a single packet, so that if this packet is lost the entire motion path is lost and therefore error propagation is limited [3]. Also, it is possible to retransmit packets selectively depending on, for example, whether a lost packet contains intra-coded blocks or not [9]. Fig.…”

“…8 And is a probability measure on the number of packets that will be lost during the transmission of the th GOP. 9 B. Rate Control 1) Problem Formulation: Formally, the problem of rate control is formulated as one of optimal stochastic control of the dynamical system defined by (1)- (3), and for that purpose, we 6 T = (1=30)G =T , where G is the number of frames in a GOP, and T is the time-quantization step.…”

“…6.5]: it captures everything that is known about the unobserved state. 9 Note that in setting up our system model we made the assumption that ack messages are not lost, and therefore that missing acks indicate lost packets. This assumption is consistent with those of [14].…”

Enhancing Quality of MPEG Video through Partially Reliable Transport Service in Interactive Application

“…In this section, we present a partially reliable transport service, so that application's delay and error requirements are best respected. Few error control schemes for a such transport service have been yet proposed in [5,7,16,6,8]. However, the novel error control scheme that we propose is attractive in interactive multimedia application because application can specify the packet's QoS on the fly of the packetized stream.…”