Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/a-packet-switch-with-a-priority-scheduling-discipline-performance-tymyDWmYPY
References (37)
-
C. Tham, Qi Yao, Yuming Jiang (2002)
Achieving differentiated services through multi-class probabilistic priority schedulingComput. Networks, 40
-
H. Bruneel (1993)
Performance of discrete-time queueing systemsComput. Oper. Res., 20
-
S.P. Morgan (1991)
Queueing disciplines and passive congestion control in byte-stream networksIEEE Transactions on Communications, 39
-
A. Pattavina, G. Bruzzi (1993)
Analysis of input and output queueing for nonblocking ATM switchesIEEE/ACM Trans. Netw., 1
-
S. Morgan (1989)
Queueing disciplines and passive congestion control in byte-stream networksIEEE INFOCOM '89, Proceedings of the Eighth Annual Joint Conference of the IEEE Computer and Communications Societies
-
M. Drmota (1997)
Systems of functional equationsRandom Struct. Algorithms, 10
-
A. Parekh, R. Gallager (1993)
A generalized processor sharing approach to flow control in integrated services networks-the multiple node caseIEEE INFOCOM '93 The Conference on Computer Communications, Proceedings
-
H. Bruneel, B. Steyaert, E. Desmet, G. Petit (1994)
Analytic derivation of tail probabilities for queue lengths and waiting times in ATM multiserver queuesEuropean Journal of Operational Research, 76
-
F. Machihara (1995)
A Bridge Between Preemptive and Non-Preemptive Queueing ModelsPerform. Evaluation, 23
-
L. Takacs (1964)
Priority queuesOperations Research, 12
-
M. Guizani, A. Al-Fuqaha (2001)
A new queueing strategy for large scale ATM switchesIEEE Communications Magazine, 39
-
H. Takagi (1991)
Queueing Analysis. A Foundation of Performance Evaluation, Vol. 1: Vacation and Priority Systems -
J. Walraevens, B. Steyaert, H. Bruneel (2002)
Delay characteristics in discrete-time GI-G-1 queues with non-preemptive priority queueing disciplinePerform. Evaluation, 50
-
E. Gelenbe, V. Srinivasan, S. Seshadri, N. Gautam (2001)
Optimal Policies for ATM Cell Scheduling and RejectionTelecommunication Systems, 18
-
J. Liebeherr, D. Wrege (1999)
Priority queue schedulers with approximate sorting in output-buffered switchesIEEE J. Sel. Areas Commun., 17
-
D. Fiems, B. Steyaert, H. Bruneel (2003)
Analysis of a discrete-time GI-G-1 queueing model subjected to bursty interruptionsComput. Oper. Res., 30
-
M. Guizani, Ala Al-Fuqaha (2001)
New queuing strategy for large scale ATM switchesProceedings. 34th Annual Simulation Symposium
-
A. Khamisy, M. Sidi (1992)
Discrete-time priority queueing systems with two-state Markov modulated arrival processesStochastic Models, 8
-
K. Liu, D. Petr, V. Frost, Hongbo Zhu, C. Braun, W. Edwards (1996)
Design and analysis of a bandwidth management framework for ATM-based broadband ISDNProceedings of ICC/SUPERCOMM '96 - International Conference on Communications, 3
-
T. Takine (1994)
The workload in the MAP/G/1 queue with state-dependent services: its application to a queue with preemptive resume priorityStochastic Models, 10
-
H. Takagi (1993)
Queueing analysis: a foundation of performance evaluation -
M. Herlihy, N. Shavit, Victor Luchangco, Michael Spear (2019)
Priority queuesThe Art of Multiprocessor Programming
-
T. Takine, T. Hasegawa (1994)
The workload in the MAP/G/1 queue with state-dependent services: Its application to a queue with preemptive resume priorityCommunications in Statistics Stochastic Models, 10
-
J. Walraevens, B. Steyaert, H. Bruneel (2004)
Performance analysis of a GI-Geo-1 buffer with a preemptive resume priority scheduling disciplineEur. J. Oper. Res., 157
-
T. Takine, B. Sengupta, T. Hasegawa (1994)
An analysis of a discrete-time queue for broadband ISDN with priorities among traffic classesIEEE Trans. Commun., 42
-
M. Karol, M. Hluchyj, S. Morgan (1987)
Input Versus Output Queueing on a Space-Division Packet SwitchIEEE Trans. Commun., 35
-
A. Parekh, R. Gallager (1994)
A generalized processor sharing approach to flow control in integrated services networks: The multiple node caseIEEE/ACM Transactions on Networking, 2
-
J. Walraevens, B. Steyaert, H. Bruneel (2003)
Performance analysis of a single-server ATM queue with a priority schedulingComput. Oper. Res., 30
-
I. Cidon, R. Guérin, A. Khamisy (1993)
On protective buffer policiesIEEE INFOCOM '93 The Conference on Computer Communications, Proceedings
-
H. Bruneel, Byung Kim (1992)
Discrete-time models for communication systems including ATM -
A. Khamisy, M. Sidi (1991)
Discrete-time priority queueing systems with two-state Markov modulated arrival processesIEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings
-
P. Flajolet, A. Odlyzko (1990)
Singularity Analysis of Generating FunctionsSIAM J. Discret. Math., 3
-
K. Liu (1997)
Design and analysis of a bandwidth management framework for ATM-based broadband ISDNIEEE Communications Magazine, 35
-
K. Laevens, H. Bruneel (1998)
Discrete-Time Multiserver Queues with PrioritiesPerform. Evaluation, 33
-
Yutaka Takahashi (1993)
Queueing analysis: A foundation of performance evaluation, volume 1: Vacation and priority systems, Part 1: by H. Takagi. Elsevier Science Publishers, Amsterdam, The Netherlands, April 1991. ISBN: 0-444-88910-8Computer Networks and Isdn Systems, 25
-
A. Pattavina (1993)
Nonblocking architectures for ATM switchingIEEE Communications Magazine, 31
-
R.G. Miller (1960)
Priority queuesAnnals of Mathematical Statistics, 31
- Publisher
- Springer Journals
- Copyright
- Copyright © 2005 by Springer Science + Business Media, Inc.
- Subject
- Business and Management; IT in Business; Computer Communication Networks; Artificial Intelligence (incl. Robotics); Probability Theory and Stochastic Processes
- ISSN
- 1018-4864
- eISSN
- 1572-9451
- DOI
- 10.1023/B:TELS.0000048327.45979.f7
- Publisher site
- See Article on Publisher Site
Abstract
In this paper, we analyze a discrete-time GI-G1, Geo2-1 preemptive resume priority queue. We consider two classes of packets which have to be served, where one class has preemptive resume priority over the other. The high-priority class contains packets with generally distributed service times while the low-priority packets are assumed to have geometrically distributed service times. We show that the use of generating functions is beneficial for analyzing the system contents and packet delay of both classes. Performance measures of system contents and packet delay are calculated. We apply these theoretical results on the special case of a packet switch.
Journal
Telecommunication Systems – Springer Journals
Published: Dec 20, 2004