article

Free access

The use of service limits for efficient operation of multistation single-medium communication systems

Editor: Simon S. Lam Authors:

Sem C. Borst,

Onno J. Boxma,

Hanoch LevyAuthors Info & Claims

IEEE/ACM Transactions on Networking (TON), Volume 3, Issue 5

Pages 602 - 612

https://doi.org/10.1109/90.469947

Published: 01 October 1995 Publication History

PDF eReader

References

[1]

ANSI Standard, "FDDI token ring--Media access control," ANSI X3.139-1987, 1986.

Google Scholar

[2]

ANSI/IEEE Standard 802.4, Token-Passing Bus Access Method. New York: IEEE Press, 1985.

Google Scholar

[3]

J. P. C. Blanc, "A numerical approach to cyclic-service queueing models," Queueing Syst., vol. 6, pp. 173-188, 1990.

Crossref

Google Scholar

[4]

"The power-series algorithm applied to cyclic polling systems," Commun. Stat. Stoch. Mad., voL 7, pp. 527-545, 1991.

Google Scholar

[5]

J. P. C. Blanc and R. D. van der Met, "Optimization of polling systems with Bernoulli schedules," Perform. EvaL, vol. 21, pp. 139-158, 1995.

Crossref

Google Scholar

[6]

S. C. Borst, O.I. Boxma, and H. Levy, "The use of service limits for efficient operation of multi-station single-medium communication systems," CWI Rep. BS-R9312, 1993.

Google Scholar

[7]

O. J. Boxma, "Workloads and waiting times in single-server systems with multiple customer classes," Queueing Syst., vol. 5, pp. 185-214, 1989.

Crossref

Google Scholar

[8]

"Analysis and optimization of polling systems," in Queueing, Performance and Control in ATM, J. W. Cohen and C. D. Pack, Eds. Amsterdam, The Netherlands: North-Holland, 1991, pp. 173-183.

Google Scholar

[9]

O. J. Boxma and W. P. Groenendijk, "Pseudo-conservation laws in cyclic-service systems," J. Appl. Prob., vol. 24, pp. 949-964, 1987.

Google Scholar

[10]

__ "Two queues with alternating service and switching times," in Queueing Theoo' and its Applications--Liber Amicorum for J. W. Cohen, O.J. Boxma and R. Syski, Eds. Amsterdam, The Netherlands: North- Holland, 1988, pp. 261-282.

Google Scholar

[11]

O. J. Boxma, H. Levy, J. A. Weststrate, "Efficient visit frequencies for polling tables: minimization of waiting cost," Queueing Syst., vol. 9, pp. 133-162, 1991.

Crossref

Google Scholar

[12]

"Efficient visit orders for polling systems," Perform Eval., vol. 18, pp. 103-123, 1993.

Crossref

Google Scholar

[13]

O. J. Boxma and B. W. Meister, "Waiting-time approximations for cyclic-service systems with switchover times," Perform. Eval., vol. 7, pp. 299-308, 1987.

Crossref

Google Scholar

[14]

K. C. Chang and D. Sandhu, "Mean waiting time approximations in cyclic-service systems with exhaustive limited service policy," Perform. Eval., vol. 15, pp. 21-40, 1992.

Crossref

Google Scholar

[15]

E. G. Coffman, Jr., I. Mitrani, and G. Fayolle, '`Two queues with alternating service periods," in Performance '87, P.-J. Courtois and G. Latouche, Eds. Amsterdam. The Netherlands: North-Holland, 1988, pp. 227-239.

Crossref

Google Scholar

[16]

J. W. Cohen and O. J. Boxma, "The M/G/1 queue with alternating service formulated as a Riemann-Hilbert boundary value problem," in Performance '8l, F.L Kylstra, Ed. Amsterdam, The Netherlands: North-Holland, 1981, pp. 181-199.

Google Scholar

[17]

E. De Souza e Silva, H. R. Gall, and R. R. Muntz, "Polling systems with server timeouts," preprint, 1994.

Google Scholar

[18]

M. Eisenberg, ''Two queues with alternating service," SIAM J. Appl. Math., voi. 36, pp. 287-303, 1979.

Google Scholar

[19]

D. E. Everitt, "A conservation-type law for the token ring with limited service," Brit. Telecom Technol. J., vol. 4, pp. 51-61, 1986.

Google Scholar

[20]

"An approximation procedure for cyclic service queues with limited service," in Performance of Distributed and Parallel Systems, T. Hasegawa, H. Takagi, and Y. Takahashi, Eds. Amsterdam, The Netherlands: North-Holland, 1989, pp. 141-156.

Google Scholar

[21]

C. Fricker, and M. R. Ja'ibi, "Monotonicity and stability of periodic polling models," Queueing Syst., vol. 15, pp. 211-238, 1994.

Google Scholar

[22]

S. W. Fuhrmann and R. B. Cooper, "Application of decomposition principle in ),.f/G/1 vacation model to two continuum cyclic queueing models--especially token-ring LAN's," AT&T Tech. J., vol. 64, pp. 1091-1099, 1985.

Google Scholar

[23]

S. W. Fuhrmann and Y. T. Wang, "Analysis of cyclic service systems with limited service: bounds and approximations," Perform. Eval., vol. 9, pp. 35-54, 1988.

Crossref

Google Scholar

[24]

W. P. Groenendijk, "Conservation laws in polling systems," Ph.D. dissertation, Univ. of Utrecht, Utrecht, 1990.

Google Scholar

[25]

K. K. Leung, "Cyclic-service systems with probabilistically-limited service," IEEEJ. Select. Areas Commun., vol. 9, pp. 185-193, 1991.

Google Scholar

[26]

"Cyclic-service systems with nonpreemptive, time-limited service,'' IEEE Trans. Commun., vol. 42, pp. 2521-2524, 1994.

Google Scholar

[27]

K. K. Leung and D. M. Lucantoni, "Two vacation models for tokenring networks where service is controlled by timers," Perform. EvaL, vol. 20, pp. 165-184, 1994.

Crossref

Google Scholar

[28]

H. Levy, M. Sidi, and O. J. Boxma, "Dominance relations in polling systems," Queueing Syst., vol. 6, pp. 155-171, 1990.

Crossref

Google Scholar

[29]

H. Takagi and K. K. Leung, "Analysis of a discrete-time queueing system with time-limited service," Queueing Syst., vol. 18, pp. 183-197, 1994.

Google Scholar

[30]

T. E. Tedijanto, "A note on the comparison between Bernoulli and limited policies in vacation models," Perform. Eval., vol. 15, pp. 89-97, 1992.

Crossref

Google Scholar

[31]

"Nonexhaustive policies in polling systems and vacation models,'' Ph.D. dissertation, Univ. of Maryland, College Park, MD, 1990.

Crossref

Google Scholar

[32]

K. S. Watson, "Performance evaluation of cyclic service strategies - a survey," in Performance '84, E. Gelenbe, Ed. Amsterdam, The Netherlands: North-Holland, 1985, pp. 521-533.

Crossref

Google Scholar

[33]

U. Yechiali, "Optimal dynamic control of polling systems," in Queueing, Performance and Control in ATM, J.W. Cohen and C.D. Pack, Eds. Amsterdam, The Netherlands: North-Holland, 1991, pp. 205-217.

Google Scholar

Cited By

View all

Boon MWinands E(2016)Critically loaded k-limited polling systemsProceedings of the 9th EAI International Conference on Performance Evaluation Methodologies and Tools10.4108/eai.14-12-2015.2262578(95-102)Online publication date: 4-Jan-2016
https://dl.acm.org/doi/10.4108/eai.14-12-2015.2262578
Winands EAdan IVan houtum GDown D(2009)A state-dependent polling model with k-limited serviceProbability in the Engineering and Informational Sciences10.1017/S026996480900021723:2(385-408)Online publication date: 1-Apr-2009
https://dl.acm.org/doi/10.1017/S0269964809000217
Horng SLin S(2009)Ordinal Optimization of G/G/1/K Polling Systems with k-Limited Service DisciplineJournal of Optimization Theory and Applications10.1007/s10957-008-9444-9140:2(213-231)Online publication date: 1-Feb-2009
https://dl.acm.org/doi/10.1007/s10957-008-9444-9
Show More Cited By

Index Terms

The use of service limits for efficient operation of multistation single-medium communication systems
1. Hardware
  1. Communication hardware, interfaces and storage
2. Networks

Recommendations

A queueing system with single arrival bulk service and single departure

In this note, we study a Markovian queueing system with accessible batches for service, but units depart individually. This system generalizes the M/M/C, bulk service, and accessible batch queueing systems. We compute the system size probabilities in ...
Heavy-traffic limits for many-server queues with service interruptions

We establish many-server heavy-traffic limits for G/M/n+M queueing models, allowing customer abandonment (the +M), subject to exogenous regenerative service interruptions. With unscaled service interruption times, we obtain a FWLLN for the queue-length ...
Sojourn times in polling systems with various service disciplines

We consider a polling system of N queues Q"1,...,Q"N, cyclically visited by a single server. Customers arrive at these queues according to independent Poisson processes, requiring generally distributed service times. When the server visits Q"i, i=1,...,...

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image IEEE/ACM Transactions on Networking

IEEE/ACM Transactions on Networking Volume 3, Issue 5

Oct. 1995

134 pages

ISSN:1063-6692

Editor:
Simon S. Lam
Univ. of Texas, Austin

Issue’s Table of Contents

Publisher

IEEE Press

Publication History

Published: 01 October 1995

Published in TON Volume 3, Issue 5

Qualifiers

Article

Contributors

Other Metrics

View Article Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

8
Total Citations
View Citations
354
Total Downloads

Downloads (Last 12 months)62
Downloads (Last 6 weeks)4

Reflects downloads up to 05 Jan 2025

Other Metrics

View Author Metrics

Citations

Cited By

View all

Boon MWinands E(2016)Critically loaded k-limited polling systemsProceedings of the 9th EAI International Conference on Performance Evaluation Methodologies and Tools10.4108/eai.14-12-2015.2262578(95-102)Online publication date: 4-Jan-2016
https://dl.acm.org/doi/10.4108/eai.14-12-2015.2262578
Winands EAdan IVan houtum GDown D(2009)A state-dependent polling model with k-limited serviceProbability in the Engineering and Informational Sciences10.1017/S026996480900021723:2(385-408)Online publication date: 1-Apr-2009
https://dl.acm.org/doi/10.1017/S0269964809000217
Horng SLin S(2009)Ordinal Optimization of G/G/1/K Polling Systems with k-Limited Service DisciplineJournal of Optimization Theory and Applications10.1007/s10957-008-9444-9140:2(213-231)Online publication date: 1-Feb-2009
https://dl.acm.org/doi/10.1007/s10957-008-9444-9
Katayama T(2007)Analysis of a time-limited service priority queueing system with exponential timer and server vacationsQueueing Systems: Theory and Applications10.1007/s11134-007-9055-457:4(169-178)Online publication date: 1-Dec-2007
https://dl.acm.org/doi/10.1007/s11134-007-9055-4
Vuuren MWinands E(2007)Iterative approximation of k-limited polling systemsQueueing Systems: Theory and Applications10.1007/s11134-007-9010-455:3(161-178)Online publication date: 1-Mar-2007
https://dl.acm.org/doi/10.1007/s11134-007-9010-4
Wang JLevy Y(2000)Managing Performance Using Weighted Round-RobinProceedings of the Fifth IEEE Symposium on Computers and Communications (ISCC 2000)10.5555/844383.845552Online publication date: 4-Jul-2000
https://dl.acm.org/doi/10.5555/844383.845552
Frigui IAlfa A(1999)Analysis of a discrete time table polling system with MAP input and time-limited service disciplineTelecommunications Systems10.1023/A:101918232589912:1(51-77)Online publication date: 1-Aug-1999
https://dl.acm.org/doi/10.1023/A%3A1019182325899
Van Der Mei RLevy H(1997)Polling systems in heavy trafficQueueing Systems: Theory and Applications10.1023/A:101911823249227:3/4(227-250)Online publication date: 30-Dec-1997
https://dl.acm.org/doi/10.1023/A%3A1019118232492

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Login options

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

References

Cited By

Index Terms

Recommendations

A queueing system with single arrival bulk service and single departure

Heavy-traffic limits for many-server queues with service interruptions

Sojourn times in polling systems with various service disciplines

Comments

Information

Published In

Publisher

Publication History

Qualifiers

Contributors

Other Metrics

Bibliometrics

Article Metrics

Other Metrics

Citations

Cited By

View options

PDF

eReader

Login options

Full Access

Figures

Other

Share

Share this Publication link

Share on social media

Affiliations