A space priority queuing mechanism for multiplexing ATM channels

Hebuterne, Gérard; Gravey, Annie

doi:10.1016/0169-7552(90)90007-f

Cited by 66 publications

(16 citation statements)

References 1 publication

Supporting

Mentioning

Contrasting

Order By: Relevance

“…High priority packets continue to access the buffer until it is full, at which point arriving high priority packets will also be discarded despite the presence of low priority packets in the buffer. Classical PBS schemes have a static threshold and have been studied in [6,[8][9][10][11][12][13][14][15], for example. In order to improve the overall buffer utilization and responsiveness to changing traffic condition, dynamic threshold PBS schemes have been proposed (see e.g.…”

Section: Related Workmentioning

confidence: 99%

Novel Radio Link Buffer Management Schemes for End-User Multi-class Traffic in High Speed Packet Access Networks

Yerima

Al‐Begain

2010

Wireless Pers Commun

View full text Add to dashboard Cite

The requirement to provide multimedia services with QoS support in mobile networks has led to standardization and deployment of high speed data access technologies such as the High Speed Downlink Packet Access (HSDPA) system. HSDPA improves downlink packet data and multimedia services support in WCDMA-based cellular networks. As is the trend in emerging wireless access technologies, HSDPA supports end-user multi-class sessions comprising parallel flows with diverse Quality of Service (QoS) requirements, such as real-time (RT) voice or video streaming concurrent with non real-time (NRT) data service being transmitted to the same user, with differentiated queuing at the radio link interface. Hence, in this paper we present and evaluate novel radio link buffer management schemes for QoS control of multimedia traffic comprising concurrent RT and NRT flows in the same HSDPA end-user session. The new buffer management schemes-Enhanced Time Space Priority (E-TSP) and Dynamic Time Space Priority (D-TSP)-are designed to improve radio link and network resource utilization as well as optimize end-to-end QoS performance of both RT and NRT flows in the end-user session. Both schemes are based on a Time-Space Priority (TSP) queuing system, which provides joint delay and loss differentiation between the flows by queuing (partially) loss tolerant RT flow packets for higher transmission priority but with restricted access to the buffer space, whilst allowing unlimited access to the buffer space for delay-tolerant NRT flow but with queuing for lower transmission priority. Experiments by means of extensive system-level HSDPA simulations demonstrates that with the proposed TSP-based radio link buffer management schemes, significant end-to-end QoS performance gains accrue to end-user traffic with simultaneous RT and NRT flows, in addition to improved resource utilization in the radio access network.

show abstract

Section: Related Workmentioning

confidence: 99%

Novel Radio Link Buffer Management Schemes for End-User Multi-class Traffic in High Speed Packet Access Networks

Yerima

Al‐Begain

2010

Wireless Pers Commun

View full text Add to dashboard Cite

show abstract

“…This is consistent with ATM cells but it is clearly a modeling simplification for other networks. Such a mechanism has been proposed for ATM networks [18]. We further assume that the low priority packets are scheduled before high priority packets (recall that the priority level is based on the access).…”

Section: A Real Example With Large State Spacementioning

confidence: 99%

“…Section 4 is devoted to the analysis of a real problem: the loss rates of a finite buffer with batch arrivals and modulation, Head of Line service discipline and Pushout buffer management. Such systems have been proposed for ATM networks [18]. The example here is only slightly simplified to focus on the algorithmic aspects.…”

Section: Introductionmentioning

confidence: 99%

An Algorithmic Approach to Stochastic Bounds

Fourneau

Pekergin

2002

Performance Evaluation of Complex Systems: Techniques and Tools

View full text Add to dashboard Cite

Abstract. We present a new methodology based on the stochastic ordering, algorithmic derivation of simpler Markov chains and numerical analysis of these chains. The performance indices defined by reward functions are stochastically bounded by reward functions computed on much simpler or smaller Markov chains. This leads to an important reduction on numerical complexity. Stochastic bounds are a promising method to analyze QoS requirements. Indeed it is sufficient to prove that a bound of the real performance satisfies the guarantee.

show abstract

“…Their result shows that the two mean waiting times are subject to a linear restriction. Furthermore, Hebuterne and Gravey [6] have evaluated the loss probabilities of a similar system assuming a Poisson arrival process, a deterministic service time and the replacement strategy FIFO. Their solution is not applicable to a general service time distribution.…”

Section: Introductionmentioning

confidence: 99%

A finite buffer two class queue with different scheduling and push-out schemes

Cheng

Akyildiz²

1992

[Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications

View full text Add to dashboard Cite

We analyze an M I , M2/G1,G2/1/N queue with different scheduling and push-out scheme in this paper. Our work is motivated by the study of the performance of an output link of ATM switches with two-class priority traffics. The queueing model developed in this paper is more general than that of the output link of ATM switches with two-class priority traffics. We can have general service time distributions for classes 1 and 2, and a general service discipline function, al(z,j), with a l ( i , j ) being the probability that a class 1 packet will be served, given that there are i class 1 and j class 2 packets waiting for service. We obtain an exact solution for loss probabilities for classes 1 and 2, the queue length distribution and the mean waiting time for class 1 and an approximate calculation for the queue length distribution and mean waiting time for class 2. We show that our approximation is an upper bound and the error due to the approximation is very small when the loss probability of class 2 is small (e.g., 5 0.01).

show abstract

A space priority queuing mechanism for multiplexing ATM channels

Cited by 66 publications

References 1 publication

Novel Radio Link Buffer Management Schemes for End-User Multi-class Traffic in High Speed Packet Access Networks

Novel Radio Link Buffer Management Schemes for End-User Multi-class Traffic in High Speed Packet Access Networks

An Algorithmic Approach to Stochastic Bounds

A finite buffer two class queue with different scheduling and push-out schemes

Contact Info

Product

Resources

About