Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
skip to main content
10.1145/3167132.3167407acmconferencesArticle/Chapter ViewAbstractPublication PagessacConference Proceedingsconference-collections
poster

Investigation of priority queue with peaked traffic flows

Published: 09 April 2018 Publication History

Abstract

In this paper1, a new single-server priority queueing system with a peaked arrival process and generally distributed service time is analysed by using the Polya distribution to describe the peaked traffic flows. The mean waiting time in the case of infinite number of waiting places is obtained using a generalized Pollaczek-Khinchin formula. It is shown that the performance of such delay systems varies vastly depending on the peakedness of the input flow. To the best of our knowledge, such a priority queueing system with a peaked arrival process is analysed for the first time.

References

[1]
Iversen, V. Teletraffic engineering and network planning. DTU Fotonik, 2015
[2]
Kumar R., K. Varshini. Multilevel priority packet scheduling scheme for wireless networks, International Journal of Distributed and Parallel Systems (IJDPS) Vol.5, No. 1/2/3, 2014, pp. 69--76.
[3]
Samanta R., P. Bhattacharjee, G. Sanyal. Performance Analysis of Cellular Wireless Network by Queuing Priority Handoff calls, International Journal of Electrical and Electronics Engineering, Vol. 3, No 8, 2009, pp. 472--477.
[4]
Huang L., T. Lee. Generalized Pollaczek-Khinchin formula for Markov channels, IEEE Transactions on Communications, Vol. 61, No 8, 2013, pp. 3530--3540
[5]
Zhang J., T. Lee, T. Ye, W. Hu. On Pollaczek-Khinchine Formula for Peer-to-Peer Networks, Eprint arXiv: 1605.08146, 2016, bib.code:2016arXiv160508146Z.
[6]
Kleinrock L. Queueing Systems, vol. II: Computer Applications, Wiley, New York, 1976.
[7]
Stanford D., P. Taylor, I. Ziedins. Waiting time distributions in the accumulating priority queue, Queueing System, No 77, 2014, pp.297--330.
[8]
Madhumathi R., R. Radhakrishnan. Priority Queue Scheduling Approach for Resource Allocation in Cloud, Asian Journal of Information Technology, No 15, 2016, pp. 472--480.
[9]
Ramos H., D. Almorza, J. Garcia-Ramos. On Characterizing the Polya Distribution, ESAIM: Probability and Statistics, No 6, 2002, (6), pp. 105--112
[10]
Mirtchev S., I. Ganchev. A Generalized Pollaczek-Khinchin formula for the Polya/G/1 queue, Electronics Letters, Vol. 53, No 1, 2017, pp. 27--29.

Cited By

View all
  • (2019)Study of Preemptive Priority Single-server Queue with Peaked Arrival Flow2019 X National Conference with International Participation (ELECTRONICA)10.1109/ELECTRONICA.2019.8825636(1-4)Online publication date: May-2019

Index Terms

  1. Investigation of priority queue with peaked traffic flows

    Recommendations

    Comments

    Information & Contributors

    Information

    Published In

    cover image ACM Conferences
    SAC '18: Proceedings of the 33rd Annual ACM Symposium on Applied Computing
    April 2018
    2327 pages
    ISBN:9781450351911
    DOI:10.1145/3167132
    Permission to make digital or hard copies of part or all 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 third-party components of this work must be honored. For all other uses, contact the Owner/Author.

    Sponsors

    Publisher

    Association for Computing Machinery

    New York, NY, United States

    Publication History

    Published: 09 April 2018

    Check for updates

    Author Tags

    1. generalized pollaczek-khinchin formula
    2. mean waiting time
    3. non-preemptive priority
    4. polya arrival process
    5. polya/G/1 queue

    Qualifiers

    • Poster

    Conference

    SAC 2018
    Sponsor:
    SAC 2018: Symposium on Applied Computing
    April 9 - 13, 2018
    Pau, France

    Acceptance Rates

    Overall Acceptance Rate 1,650 of 6,669 submissions, 25%

    Upcoming Conference

    SAC '25
    The 40th ACM/SIGAPP Symposium on Applied Computing
    March 31 - April 4, 2025
    Catania , Italy

    Contributors

    Other Metrics

    Bibliometrics & Citations

    Bibliometrics

    Article Metrics

    • Downloads (Last 12 months)2
    • Downloads (Last 6 weeks)0
    Reflects downloads up to 13 Jan 2025

    Other Metrics

    Citations

    Cited By

    View all
    • (2019)Study of Preemptive Priority Single-server Queue with Peaked Arrival Flow2019 X National Conference with International Participation (ELECTRONICA)10.1109/ELECTRONICA.2019.8825636(1-4)Online publication date: May-2019

    View Options

    Login options

    View options

    PDF

    View or Download as a PDF file.

    PDF

    eReader

    View online with eReader.

    eReader

    Media

    Figures

    Other

    Tables

    Share

    Share

    Share this Publication link

    Share on social media