When Random-Order-of-Service outperforms First-Come-First-Served

被引:7
|
作者
Rogiest, W. [1 ]
Laevens, K. [1 ]
Walraevens, J. [1 ]
Bruneel, H. [1 ]
机构
[1] Univ Ghent, Dept Telecommun & Informat Proc, B-9000 Ghent, Belgium
关键词
Scheduling policies; Markov-Modulated Poisson Process; First-Come-First-Served; Random-Order-of-Service; QUEUE; M/G/1;
D O I
10.1016/j.orl.2015.06.010
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
This letter focuses on the waiting time of customers in a single-server queueing system, served according to one of two well-known scheduling disciplines, Random-Order-of-Service (ROS) and First-Come-First-Served (FCFS). Arrivals are modeled with a Markov-Modulated Poisson Process (MMPP); service times are exponential. For two basic settings, ROS outperforms FCFS by several percent in terms of mean waiting time. This finding is supported by Monte Carlo simulation, as well as an intuitive argument, motivating the usefulness of ROS as alternative to FCFS. (C) 2015 Elsevier B.V. All rights reserved.
引用
收藏
页码:504 / 506
页数:3
相关论文
共 50 条
  • [1] First-Come-First-Served as a Separate Principle
    Hesselink, Wim A.
    Buhr, Peter A.
    Parsons, Colby A.
    ACM Transactions on Parallel Computing, 2024, 11 (04)
  • [2] First-come-first-served polling systems
    Chang, KH
    ASIA-PACIFIC JOURNAL OF OPERATIONAL RESEARCH, 2001, 18 (01) : 1 - 12
  • [3] First-come-first-served packet dispersion and implications for TCP
    Melander, B
    Björkman, M
    Gunningberg, P
    GLOBECOM'02: IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE, VOLS 1-3, CONFERENCE RECORDS: THE WORLD CONVERGES, 2002, : 2170 - 2174
  • [4] The First-Come-First-Served Principle applies to Key Witnesses
    Mundt, Andreas
    FLEISCHWIRTSCHAFT, 2011, 91 (08): : 8 - +
  • [5] A Study of MEV Extraction Techniques on a First-Come-First-Served Blockchain
    Oz, Burak
    Rezabek, Filip
    Gebele, Jonas
    Hoops, Felix
    Matthes, Florian
    39TH ANNUAL ACM SYMPOSIUM ON APPLIED COMPUTING, SAC 2024, 2024, : 288 - 297
  • [6] First-come-first-served queues with multiple servers and customer classes
    Brandwajn, Alexandre
    Begin, Thomas
    PERFORMANCE EVALUATION, 2019, 130 : 51 - 63
  • [7] Public Library Computer Waiting Queues: Alternatives to the First-Come-First-Served Strategy
    Williamson, Stuart
    INFORMATION TECHNOLOGY AND LIBRARIES, 2012, 31 (02) : 72 - 81
  • [8] Waiting time in a combined first-come-first-served and shortest-time-first queue
    Wang, PP
    Gong, M
    Lee, T
    COMPUTERS & OPERATIONS RESEARCH, 2003, 30 (11) : 1727 - 1743
  • [9] Age-of-Information in First-Come-First-Served Wireless Communications: Upper Bound and Performance Optimization
    Lin, Wensheng
    Li, Lixin
    Yuan, Jinhong
    Han, Zhu
    Juntti, Markku
    Matsumoto, Tad
    IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2022, 71 (09) : 9501 - 9515
  • [10] A comparison of first-come-first-served and multidimensional heuristic approaches for asset allocation of floor cleaning machines
    Abdor-Sierra, Javier Alexis
    Merchan-Cruz, Emmanuel Alejandro
    Rodriguez-Canizo, Ricardo Gustavo
    Pavlyuk, Dmitry
    RESULTS IN ENGINEERING, 2023, 18