Frame-Induced Packet Discarding: An efficient strategy for video networking

Ramanathan, S.; Rangan, P. Venkat; Vin, Harrick M.

doi:10.1007/3-540-58404-8_16

Cited by 19 publications

(7 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…M-JPEG. Then, a technique like F rame-Induced Packet Discarding FIPD 26 can be used for actual enforcement of the pro le at the packet level.…”

Section: Drop Pro Lesmentioning

confidence: 99%

<title>Predictive loss pattern queue management for Internet routers</title>

Sanneck¹,

Carle²

1998

SPIE Proceedings

View full text Add to dashboard Cite

Widespread availability of real-time services is the next challenge for the Internet after the introduction of the WWW has already changed Internet tra c patterns once. As the Internet provides a best e ort" datagram service only, n o assurance for actual packet delivery for real-time ows can be given. Most real-time applications exhibit tolerance against occasional loss of packets, but are sensitive to losses that occur in bursts. This is especially signi cant for a voice service, which we consider as our primary target application in this paper due to its importance in the future Internet, its relatively well-known subjective properties in the presence of packet loss and its simple ow structure. Currently all hop-by-hop approaches to enhance the Quality-of-Service for real-time ows either use strict per-ow setup and state maintenance of reservations Integrated Services or rely on the sender ingress router which is unaware of the amount and the location of congestion in the network to mark packets for preferred treatment Di erentiated Services. This results in either high resource consumption in the network due to a conservative characterization of the application's requirements or dissatifactory perceived quality due to the toleration of too many burst losses in the network. For interactive v oice, end-to-end adaptation to the current network load is also di cult to apply, considering the per-ow o verhead and usual tra c properties low bitrate.We propose an active queue management algorithm called PLoP Predictive Loss Pattern, that instead of enforcing static reservations tries to give preferred service over short time intervals to particular ows that have previously been discriminated i.e. lost packets. The probability of a packet drop is made dependent o n o w history previous drops and ow type. This allows a basic protection of burst-loss-sensitive ows during transient and persistent congestion, keeping only partial per-ow state. The proposed algorithm does not require any speci c cooperation of the applications and gives an incentive to build loss-resilient applications using end-to-end QoS enhancement FEC and or error concealment, which can build on the enforced predictive loss pattern.Simulation results show the performance at a congested network element in terms of conditional and unconditional loss probability and processing state overhead. It it shown that burst loss protection in the data path for periodic foreground tra c voice is feasible for a wide range of load conditions. Any impact on non-real-time tra c in terms of the conditional and unconditional loss probability i s a voided, as long as the link-speed equivalent bu er is larger than the maximum expected tra c period.

show abstract

“…M-JPEG. Then, a technique like F rame-Induced Packet Discarding FIPD 26 can be used for actual enforcement of the pro le at the packet level.…”

Section: Drop Pro Lesmentioning

confidence: 99%

<title>Predictive loss pattern queue management for Internet routers</title>

Sanneck¹,

Carle²

1998

SPIE Proceedings

View full text Add to dashboard Cite

show abstract

“…I-pictures). This filter operation can also be employed to save network resources by discarding frames that are late or have been corrupted by loss of constituent packets [26].…”

Section: B Generic Filter Mechanismsmentioning

confidence: 99%

Filters: QoS support mechanisms for multipeer communications

Yeadon

Garcia

Hutchison

et al. 1996

IEEE J. Select. Areas Commun.

124

View full text Add to dashboard Cite

The nature of distributed multimedia applications is such that they require multipeer communication support mechanisms. The multimedia traffic needs to be delivered to end-systems, networks and end-users in a form that they can handle while satisfying the constraints imposed by the multimedia application. Quality of Service (QoS) mechanisms that can ensure full quality media playout at high-performance workstations, while at the same time providing appropriately filtered lower quality media for playout at other end-systems, are required. Existing multicast support mechanisms are deficient for this purpose, in a heterogeneous environment, because they work on a common denominator premise where the quality delivered depends on the least capable link or node involved in the multicast session. This paper proposes and analyses the use of filtering mechanisms as a means of supporting disparate receiver capabilities and QoS requirements. The paper describes the implementation of a number of filtering mechanisms and highlights the communications architecture within which these mechanisms are built. This architecture constitutes a specific network topology and a new protocol family developed within a UNIX-like operating system.

show abstract

“…The basic system is based on the predicted value of the aggregate traffic at the bottleneck node, a control vector is generated for the non-real-time traffic sources. INTRODUCTION Even if the design and admission control mechanism are good, the network may go into periods of congestion due to transient oscillations in the network traffic [2]. Fortunately, in most networks there is a significant fraction of the traffic which is not very delay sensitive, and hence its input rate to the network can be controlled.…”

mentioning

confidence: 99%