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

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.

[1]  Alexander N. Dudin,et al.  Investigation of the M2/G2/1/∞,N queue with restricted admission of priority customers and its application to HSDPA mobile systems , 2009, Comput. Networks.

[2]  Jie Wu,et al.  HDEER: A Distributed Routing Scheme for Energy-Efficient Networking , 2016, IEEE Journal on Selected Areas in Communications.

[3]  Youngho Lim,et al.  Analysis of a delay-dependent priority discipline in an integrated multiclass traffic fast packet switch , 1990, IEEE Trans. Commun..

[4]  Dieter Fiems,et al.  Performance analysis of space-time priority queues , 2019, Perform. Evaluation.

[5]  Athanasios V. Vasilakos,et al.  CPHR: In-Network Caching for Information-Centric Networking With Partitioning and Hash-Routing , 2016, IEEE/ACM Transactions on Networking.

[6]  Alexander N. Dudin,et al.  Multi-dimensional asymptotically quasi-Toeplitz Markov chains and their application in queueing theory , 2006, Queueing Syst. Theory Appl..

[7]  Alexander N. Dudin,et al.  Queueing systems with correlated arrival flows and their applications to modeling telecommunication networks , 2017, Automation and Remote Control.

[8]  Sergei Dudin,et al.  Retrial multi-server queuing system with PHF service time distribution as a model of a channel with unreliable transmission of information , 2019, Applied Mathematical Modelling.

[9]  Sergei Dudin,et al.  Analysis of Multi-Server Queue With Spatial Generation and Location-Dependent Service Rate of Customers as a Cell Operation Model , 2017, IEEE Transactions on Communications.

[10]  Peter G. Taylor,et al.  Waiting time distributions in the accumulating priority queue , 2014, Queueing Syst. Theory Appl..

[11]  Qi Zhu,et al.  Performance Analysis of D2D Underlying Cellular Networks Based on Dynamic Priority Queuing Model , 2019, IEEE Access.

[12]  Athanasios V. Vasilakos,et al.  Spatial Reusability-Aware Routing in Multi-Hop Wireless Networks , 2016, IEEE Transactions on Computers.

[13]  Herwig Bruneel,et al.  On priority queues with priority jumps , 2006, Perform. Evaluation.

[14]  Athanasios V. Vasilakos,et al.  Approximating Congestion + Dilation in Networks via "Quality of Routing" Games , 2012, IEEE Trans. Computers.

[15]  Qi-Ming He,et al.  Queues with marked customers , 1996, Advances in Applied Probability.

[16]  Athanasios V. Vasilakos,et al.  Low-Latency and Resource-Efficient Service Function Chaining Orchestration in Network Function Virtualization , 2020, IEEE Internet of Things Journal.

[17]  Athanasios V. Vasilakos,et al.  Reliable Multicast with Pipelined Network Coding Using Opportunistic Feeding and Routing , 2014, IEEE Transactions on Parallel and Distributed Systems.

[18]  Athanasios V. Vasilakos,et al.  Energy-Efficient Provisioning for Service Function Chains to Support Delay-Sensitive Applications in Network Function Virtualization , 2020, IEEE Internet of Things Journal.

[19]  David M. Lucantoni,et al.  New results for the single server queue with a batch Markovian arrival process , 1991 .