Improvement of the Fairness of Non-Preemptive Priorities in the Transmission of Heterogeneous Traffic

被引:6
|
作者
Dudin, Sergei [1 ]
Dudina, Olga [1 ]
Samouylov, Konstantin [2 ]
Dudin, Alexander [1 ,2 ]
机构
[1] Belarusian State Univ, Dept Appl Math & Comp Sci, 4 Nezavisimosti Ave, Minsk 220030, BELARUS
[2] Peoples Friendship Univ Russia, Appl Math & Commun Technol Inst, RUDN Univ, 6 Miklukho Maklaya St, Moscow 117198, Russia
关键词
flexible priority; marked Markov arrival process; impatience; phase-type distribution; PERFORMANCE ANALYSIS; QUEUES;
D O I
10.3390/math8060929
中图分类号
O1 [数学];
学科分类号
0701 ; 070101 ;
摘要
A new flexible discipline for providing priority to one of two types of customers in a single-server queue is proposed. This discipline assumes the use of additional finite storages for each type of arriving customer. During the stay in a storage, a customer can leave the system or transfer to the main infinite buffer. Preference to priority customers is provided via the proper choice of the rates of a customer transfer from the storages to the buffer. Analysis of this discipline is implemented under quite general assumptions about the arrival and service processes. The advantage of the proposed discipline over the classical non-preemptive discipline is numerically demonstrated.
引用
收藏
页数:17
相关论文
共 50 条
  • [21] A non-preemptive packet marking scheme
    liu, Yuan
    gu, Xiaoqing
    Sun, Yaming
    2006 1ST IEEE CONFERENCE ON INDUSTRIAL ELECTRONICS AND APPLICATIONS, VOLS 1-3, 2006, : 1576 - +
  • [22] ON NON-PREEMPTIVE STRATEGIES IN STOCHASTIC SCHEDULING
    GLAZEBROOK, KD
    NAVAL RESEARCH LOGISTICS, 1981, 28 (02) : 289 - 300
  • [23] Preemptive and non-preemptive scheduling on two unrelated parallel machines
    Alan J. Soper
    Vitaly A. Strusevich
    Journal of Scheduling, 2022, 25 : 659 - 674
  • [24] From non-preemptive to preemptive scheduling using synchronization synthesis
    Cerny, Pavol
    Clarke, Edmund M.
    Henzinger, Thomas A.
    Radhakrishna, Arjun
    Ryzhyk, Leonid
    Samanta, Roopsha
    Tarrach, Thorsten
    FORMAL METHODS IN SYSTEM DESIGN, 2017, 50 (2-3) : 97 - 139
  • [25] From non-preemptive to preemptive scheduling using synchronization synthesis
    Pavol Černý
    Edmund M. Clarke
    Thomas A. Henzinger
    Arjun Radhakrishna
    Leonid Ryzhyk
    Roopsha Samanta
    Thorsten Tarrach
    Formal Methods in System Design, 2017, 50 : 97 - 139
  • [26] Preemptive and Non-Preemptive Generalized Min Sum Set Cover
    Im, Sungjin
    Sviridenko, Maxim
    van der Zwaan, Ruben
    29TH INTERNATIONAL SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE, (STACS 2012), 2012, 14 : 465 - 476
  • [28] Linear programming based algorithms for preemptive and non-preemptive RCPSP
    Damay, Jean
    Quilliot, Alain
    Sanlaville, Eric
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 2007, 182 (03) : 1012 - 1022
  • [29] Preemptive and non-preemptive scheduling on two unrelated parallel machines
    Soper, Alan J.
    Strusevich, Vitaly A.
    JOURNAL OF SCHEDULING, 2022, 25 (06) : 659 - 674
  • [30] Waiting times of a finite-capacity multi-server model with non-preemptive priorities
    Wagner, D
    EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, 1997, 102 (01) : 227 - 241