Priority assignment control of ATM line buffers with multiple QOS classes

Takagi, Yasushi; Hino, S.; Takahashi, Tomohiro

doi:10.1109/49.103554

Cited by 63 publications

(7 citation statements)

References 14 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Resource re-distribution can be in various forms, i.e. service scheduling (Parekh et al, 1993) (Golestani, 1994) (Lee et al, 1994) (Demers /em et al 1989) (Archambault et al, 1996), buffer management (Choudhury et al, 1996) (Collier et al, 1996) (Takagi et al, 1991) and selective cell discarding (Yang et al, 1996) (Conway et al, 1996) (Kawahara et al, 1996) (Chen et al, 1996) (Heyman et al, 1992) (Wilson et al, 1996) at moments of resource scarcity. Service scheduling primarily deals with how to fairly allocate available bandwidth to a set of connections.…”

Section: Introductionmentioning

confidence: 99%

A Simple Fair Cell Discarding Algorithm on Per-VC Queueing Basis

Mang

Levy

2000

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

In this paper we propose a simple Fair Cell Discarding (FCD) algorithm with virtual per-VC queueing. The main objective of FCD algorithm is to redistribute the cell losses according to each connection's QoS requirement. In case the buffer is full, the newly arrived cell is not automatically discarded but rather a cell from a sub-queue U which is selected according to a fairness criterion which is defined by connections mean arrival rates and their QoS (Quality of Service) such as CLR (Cell Loss Ratio) requirements. Extensive analytical analysis and simulations have been conducted to evaluate FCD algorithm's property and to validate its effectiveness under various traffic and switch configurations. Our study reveals that a very simple approach like FCD can actually differentiate connections with different traffic characteristics and QoS requirements; and satisfy their specified QoS as long as a minimum amount of resources (bandwidth and total buffer space) is allocated for guaranteeing the aggregate QoS/CLR requirement of all active connections.

show abstract

Section: Introductionmentioning

confidence: 99%

A Simple Fair Cell Discarding Algorithm on Per-VC Queueing Basis

Mang

Levy

2000

IFIP Advances in Information and Communication Technology

View full text Add to dashboard Cite

show abstract

“…Prior studies propose the following static approach to the resource allocation problem [9], [12]. During the call set-up phase, the user supplies the network with two sets of parameters, one indicating its QoS requirements such as cell loss probability and max-imum acceptable delay, and the other its anticipated traffic statistics.…”

Section: Introductionmentioning

confidence: 99%

Dynamic bandwidth allocation for ATM switches

Hsu

Walrand

1996

Journal of Applied Probability

View full text Add to dashboard Cite

We explore a dynamic approach to the problems of call admission and resource allocation for communication networks with connections that are differentiated by their quality of service requirements. In a dynamic approach, the amount of spare resources is estimated on-line based on feedbacks from the network's quality of service monitoring mechanism. The schemes we propose remove the dependence on accurate traffic models and thus simplify the tasks of supplying traffic statistics required of network users. In this paper we present two dynamic algorithms. The objective of these algorithms is to find the minimum bandwidth necessary to satisfy a cell loss probability constraint at an asynchronous transfer mode (ATM) switch. We show that in both schemes the bandwidth chosen by the algorithm approaches the optimal value almost surely. Furthermore, in the second scheme, which determines the point closest to the optimal bandwidth from a finite number of choices, the expected learning time is finite.

show abstract

“…Another approach is presented in [27], where the Self-calibrating Push-out and EDD policies are assumed for cell loss and cell delay control, respectively: Self-calibrating Push-out policy aims to push out/discard cells in a fair way according to different cell loss rate requirements and arrival rates for different classes. Cell loss and cell delay performance have also been investigated in the priority service scheme considered in [25]: a Weighted-Fair-Queueing and Buffer Threshold combination. It turns out that the delay bounds computed in [25] are loose because the buffer size cannot accurately reflect the cell delay in this service scheme.…”

Section: Introductionmentioning

confidence: 99%

“…Cell loss and cell delay performance have also been investigated in the priority service scheme considered in [25]: a Weighted-Fair-Queueing and Buffer Threshold combination. It turns out that the delay bounds computed in [25] are loose because the buffer size cannot accurately reflect the cell delay in this service scheme.…”

Section: Introductionmentioning

confidence: 99%

Study of a scheduling policy for diverse deadline-based quality of service

Stavrakakis

Chen²

2000

Performance Evaluation

View full text Add to dashboard Cite

One of the most challenging problems in ATM network design is providing diversified Quality of Service (QoS) to applications with distinct characteristics. Buffer management schemes can play a significant role in providing the necessary diversification through the employed cell admission and service policy. A flexible priority service policy for two applications (classes) with strict -and in general distinct -deadlines and different deadline violation rates is studied in this paper. The proposed policy is a generalization of the shortest time to extinction (STE) policy (or the Earliest Due Date policy which discards expired cells), which is more flexible in providing diversified QoS. The relationship of this policy to other standard ones is also discussed. A flexible numerical analysis is presented for the derivation of performance measures such as cell loss, mean cell-delay and the tail of the cell-delay probability distribution for each class. Numerical results illustrate the effectiveness of the studied priority scheme. Finally, a low-complexity implementation scheme is proposed, which does not require time-stamp-based sorting.

show abstract

Priority assignment control of ATM line buffers with multiple QOS classes

Cited by 63 publications

References 14 publications

A Simple Fair Cell Discarding Algorithm on Per-VC Queueing Basis

A Simple Fair Cell Discarding Algorithm on Per-VC Queueing Basis

Dynamic bandwidth allocation for ATM switches

Study of a scheduling policy for diverse deadline-based quality of service

Contact Info

Product

Resources

About