Article

Parametric delay differentiation between packet flows using multiple reserved spaces

Authors:

Stijn De Vuyst,

Sabine Wittevrongel,

Herwig BruneelAuthors Info & Claims

valuetools '06: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools

Pages 40 - es

https://doi.org/10.1145/1190095.1190146

Published: 11 October 2006 Publication History

Abstract

We analyse a discrete-time queueing model with packet arrivals that are either classified as delay-sensitive (type 1) or delay-tolerant (type 2). The queue has a single server and each packet requires a service time of exactly one slot. The prominent feature of this model is its reservation-based queueing discipline, which has the purpose of reducing the queueing delay perceived by the 1-packets at the cost of allowing higher delays for the 2-packets. Our suggestion is to introduce a total of N reserved spaces in the queue, intended for future arrivals of type 1. Specifically, whenever a 1-packet enters the queue, it takes the position of the most advanced reservation and creates a new reservation at the end of the queue. Type 2 arrivals on the other hand, are always stored in the usual FIFO (First-In First-Out) manner. This way, it is possible for a 1-packet to jump over already queued 2-packets, resulting in the desired prioritisation of type 1 over type 2 packets. The amount of stochastic delay difference between 1- and 2-packets can be controlled smoothly by the parameter N. As a result of our analysis, we obtain the probability generating function, the mean value and the tail distribution of the delay experienced by both 1- and 2-packets. In each case, fast computational algorithms are provided, as well as some numerical examples.

References

[1]

J. J. Bae, T. Suda, Survey of Traffic Control Schemes and Protocols in ATM Networks, Proc. IEEE, Vol. 79, No. 2, 1991, pp. 170--189.]]

[2]

S. Blake et al., An Architecture for Differentiated Services, Internet RFC 2475, December 1998.]]

Digital Library

[3]

R. Braden, D. Clark, S. Shenker, Integrated Services in the Internet Architecture: an Overview, Internet RFC 1633, June 1994.]]

Digital Library

[4]

H. Bruneel, B. G. Kim, Discrete-Time Models for Communication Systems Including ATM (Kluwer Academic Publishers, Boston, 1993).]]

Digital Library

[5]

H. Bruneel, B. Steyaert, E. Desmet, G. Petit, Analytic Derivation of Tail Probabilities for Queue Lengths and Waiting Times in ATM Multiserver Queues, European Journal of Operational Research, Vol. 76, 1994, pp. 563--572.]]

[6]

W. Burakowski, H. Tarasiuk, On New Strategy for Prioritising the Selected Flow in Queuing System, Proc. COST 257 11th Management Committee Meeting, (20--21 January 2000, Barcelona, Spain), COST-257 TD(00)03.]]

[7]

B. D. Choi, D. I. Choi, Y. Lee, D. K. Sung, Priority Queueing System with Fixed-length Packet-train Arrivals, IEE Proceedings-Communications, Vol. 145, No. 5, 1998, pp. 331--336.]]

[8]

L. Chuang, L. Wanming, Y. Baoping, S. Chanson, A Dynamic Partial Buffer Sharing Scheme for Packet Loss Control in Congested Networks, Proc. International Conference on Communication Technology, ICCT 2000 (21--25 August 2000, Beijing, China), Vol. 2, pp. 1286--1293.]]

[9]

A. Demers, S. Keshav, S. Shenker, Analysis and Simulation of a Fair Queueing Algorithm, Proc. ACM Symposium on Communications Architectures & Protocols, SIGCOMM '89 (19--22 September 1989, Austin, TX, USA), pp. 1--12.]]

Digital Library

[10]

S. De Vuyst, S. Wittevrongel, H. Bruneel, Delay differentiation by reserving a space in the queue, Electronics Letters, 2005, Vol. 41, No. 9, pp. 69--70.]]

[11]

S. De Vuyst, S. Wittevrongel, H. Bruneel, Analysis of a priority scheduling discipline with place reservation, Proc. INOC 2005, International Network Optimization Conference (20--23 March 2005, Lisbon, Portugal), pp. 442--448.]]

[12]

C. Dovrolis, D. Stiliadis, P. Ramanathan, Proportional Differentiated Services: Delay Differentiation and Packet Scheduling, ACM Computer Communications Review, Vol. 29, No. 4, 1999, pp. 109--120.]]

Digital Library

[13]

S. Floyd, V. Jacobson, Random Early Detection Gateways for Congestion Avoidance, IEEE-ACM Transactions on Networking, Vol. 1, No. 4, August 1993, pp. 397--413.]]

Digital Library

[14]

H. R. Gail, S. L. Hantler, B. A. Taylor, On a Preemptive Markovian Queue with multiple servers and two priority classes, Mathematics of Operations Research, 1992, Vol. 17, No. 2, pp. 365--391.]]

Digital Library

[15]

P. H. Leslie, On the Use of Matrices in Certain Population Mathematics, Biometrika, 1945, Vol. 33, pp. 183--212.]]

[16]

K. Y. Liu, D. W. Petr, V. S. Frost, H. B. Zhu, C. Braun, W. L. Edwards, Design and Analysis of a Bandwidth Management Framework for ATM-Based Broadband ISDN, IEEE Communications Magazine, Vol. 35, No. 5, 1997, pp. 138--145.]]

Digital Library

[17]

T. Maertens, J. Walraevens, H. Bruneel, Non-exponential Tail Probabilities in Queuing Systems, Proc. ITC-19, 19th International Teletraffic Congress (29 August-2 September 2005, Beijing, China), pp. 1155--1164.]]

[18]

C. D. Meyer, Matrix Analysis and Applied Linear Algebra, (SIAM, Philadelphia, 2000).]]

Digital Library

[19]

M. Neuts, Matrix-Geometric Solutions in Stochastic Models, an Algorithmic Approach (The Johns Hopkins University Press, 1981).]]

[20]

A. K. Parekh, R. G. Gallager, A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Single Node Case, IEEE Network, Vol. 1, No. 3, June 1993, pp. 344--57.]]

Digital Library

[21]

T. Takine, B. Sengupta, T. Hasegawa, An Analysis of a Discrete-Time Queue for Broadband ISDN with Priorities Among Traffic Classes, IEEE Transactions on Communications, Vol. 42, No. 2--4, 1994, pp. 1837--1845.]]

[22]

J. Walraevens, D. Fiems, H. Bruneel, Analysis of Queues with a Priority Scheduling Discipline, Proc. First International Working Conference on Performance Modelling and Evaluation of Heterogeneous Networks HET-NETs '03 (21--23 July 2003, Ilkley, West Yorkshire, UK), Tutorial Papers, pp. T4/1--T4/34.]]

[23]

J. Walraevens, D. Fiems, H. Bruneel, Transient Analysis of a Discrete-time Priority Queue, Proc. ASMTA 2005, 12th International Conference on Analytical and Stochastic Modelling Techniques and Applications (1--4 June 2005, Riga, Latvia), pp. 17--24.]]

Cited By

De Vuyst SWittevrongel SBruneel H(2011)Transform-domain analysis of packet delay in network nodes with QoS-aware schedulingNetwork performance engineering10.5555/1996629.1996677(921-950)Online publication date: 1-Jan-2011
https://dl.acm.org/doi/10.5555/1996629.1996677
De Vuyst SWittevrongel SBruneel H(2011)Transform-Domain Analysis of Packet Delay in Network Nodes with QoS-Aware SchedulingNetwork Performance Engineering10.1007/978-3-642-02742-0_39(921-950)Online publication date: 2011
https://doi.org/10.1007/978-3-642-02742-0_39

Index Terms

Recommendations

Controlling the delay trade-off between packet flows using multiple reserved places

We analyse a discrete-time queueing model with packet arrivals that are either delay-sensitive (type 1) or delay-tolerant (type 2). The prominent feature of this model is its reservation-based queueing discipline, which reduces the queueing delay ...
Packet Models Revisited: Tandem and Priority Systems

We examine two extensions of traditional single-node packet-scale queueing models: tandem networks and (strict) priority systems. Two generic input processes are considered: periodic and Poisson arrivals. For the two-node tandem, an exact expression is ...
Packet Delay Analysis of Symmetric Gated Polling System for DBA Scheme in an EPON

In this paper, we analyze the mean packet delay of a dynamic bandwidth allocation (DBA) scheme in an Ethernet passive optical network (EPON). We propose the interleaved polling system with a gated service discipline and a two-stage queue in order to ...

Comments

Information & Contributors

Information

Published In

cover image ACM Other conferences

valuetools '06: Proceedings of the 1st international conference on Performance evaluation methodolgies and tools

October 2006

638 pages

ISBN:1595935045

DOI:10.1145/1190095

General Chairs:
Luciano Lenzini
University of Pisa, Italy
,
Rene Cruz
UCSD, US

Copyright © 2006 ACM.

Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 11 October 2006

Permissions

Request permissions for this article.

Request Permissions

Check for updates

Qualifiers

Article

Acceptance Rates

Overall Acceptance Rate 90 of 196 submissions, 46%

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

2
Total Citations
View Citations
109
Total Downloads

Downloads (Last 12 months)0
Downloads (Last 6 weeks)0

Reflects downloads up to 08 Mar 2025

Other Metrics

View Author Metrics

Citations

Cited By

De Vuyst SWittevrongel SBruneel H(2011)Transform-domain analysis of packet delay in network nodes with QoS-aware schedulingNetwork performance engineering10.5555/1996629.1996677(921-950)Online publication date: 1-Jan-2011
https://dl.acm.org/doi/10.5555/1996629.1996677
De Vuyst SWittevrongel SBruneel H(2011)Transform-Domain Analysis of Packet Delay in Network Nodes with QoS-Aware SchedulingNetwork Performance Engineering10.1007/978-3-642-02742-0_39(921-950)Online publication date: 2011
https://doi.org/10.1007/978-3-642-02742-0_39

View Options

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Publication

View options

PDF

View or Download as a PDF file.

eReader

View online with eReader.

Figures

Tables

Media

View Table of Conten