scispace - formally typeset
Journal ArticleDOI

On protective buffer policies

Reads0
Chats0
TLDR
The main contribution of the paper is the identification and evaluation of buffering policies which preserve packet ordering and guarantee high priority packets performance (loss probability), irrespective of the traffic intensity and arrival patterns of low priority packets.
Abstract
Studies buffering policies which provide different loss priorities to packets/cells, while preserving packet ordering (space priority disciplines). These policies are motivated by the possible presence, within the same connection, of packets with different loss probability requirements or guarantees, e.g., voice and video coders or rate control mechanisms. The main contribution of the paper is the identification and evaluation of buffering policies which preserve packet ordering and guarantee high priority packets performance (loss probability), irrespective of the traffic intensity and arrival patterns of low priority packets. Such policies are termed protective policies. The need for such policies arises from the difficulty to accurately characterize and size low priority traffic, which can generate large and unpredictable traffic variations over short periods of time. The authors review previously proposed buffer admission policies and determine if they satisfy such "protection" requirements. Furthermore, they also identify and design new policies, which for a given level of protection maximize low priority throughput. >

read more

Citations
More filters
Journal ArticleDOI

The BLUE active queue management algorithms

TL;DR: Stochastic Fair Blue is proposed and evaluated, a queue management algorithm which can identify and rate-limit nonresponsive flows using a very small amount of state information and is shown to perform significantly better than Red, both in terms of packet loss rates and buffer size requirements in the network.

BLUE: A New Class of Active Queue Management Algorithms

TL;DR: Stochastic Fair BLUE is proposed and evaluated, a queue management algorithm which can identify and rate-limit non-responsive flows using a very small amount of state information and a novel technique for enforcing fairness among a large number of flows.
Journal Article

Quality-of-service in packet networks: basic mechanisms and directions [Comput. Networks 31 (1999) 169-189]

R. Guérin, +1 more
- 17 Aug 1999 - 
TL;DR: In this article, the basic mechanisms used in packet networks to support Quality-of-Service QoS guarantees are reviewed, and a discussion on the use of such mechanisms to provide specific end-to-end performance guarantees.
Journal ArticleDOI

Quality-of-service in packet networks: basic mechanisms and directions

Roch Guerin, +1 more
- 11 Feb 1999 - 
TL;DR: The paper starts by introducing the different scheduling and buffer management mechanisms that can be used to provide service differentiation in packet networks, and discusses the need for adapting mechanisms to the different environments where they are to be deployed.
Proceedings ArticleDOI

Scalable QoS provision through buffer management

TL;DR: This paper proposes and analyze an approach that uses a simple buffer management scheme to provide rate guarantees to individual flows multiplexed into a common FIFO queue, and establishes the buffer allocation requirements to achieve these rate guarantees.
References
More filters
Journal ArticleDOI

Priority management in ATM switching nodes

TL;DR: A comparative performance study is given, indicating the excellent performance characteristics of a simple buffer management scheme called partial buffer sharing, and the introduction of a second bearer capability provides a 10/sup -6/ cell loss rate instead of 10/Sup -10/.
Journal ArticleDOI

Packet video and its integration into the network architecture

TL;DR: Simulation results indicating practical solutions to some of the issues raised are presented for a hierarchical packet-video subband coding system and they can be made less dependent on network implementation and signal format.
Journal ArticleDOI

Variable bit-rate coding of video signals for ATM networks

TL;DR: A variable-bit-rate coding method for asynchronous transfer mode (ATM) networks is described that is capable of compensating for packet loss and the influence of packet loss on picture quality is discussed, and decoded pictures with packet loss are shown.
Proceedings ArticleDOI

Congestion control for high speed packet switched networks

TL;DR: A leaky-bucket-type scheme operating on a session basis that limits the session's average rate and the burstiness is proposed, combined with an optimistic bandwidth usage scheme which works by marking packets into two different colors, green and red.
Journal ArticleDOI

Bandwidth management and congestion control in plaNET

TL;DR: The discussion draws heavily on the lessons learned from the design and implementation of plaNET, a high-speed packet-switching system for integrated voice, video, and data communications, to address the protocols and mechanisms necessary for network bandwidth management and congestion control.
Related Papers (5)