Using Simulation to Study the Last to Enter Service Delay Announcement in Multiserver Queues with Abandonment

2019 ◽  
Author(s):  
Aditya Shah ◽  
Anders Wikum ◽  
Jamol Pender
Keyword(s):  
Multiserver Queues ◽  
Service Delay ◽  
Delay Announcement ◽  
Queues With Abandonment

scholarly journals SRPT Scheduling Discipline in Many-Server Queues with Impatient Customers

2021 ◽  
Author(s):  
Jing Dong ◽  
Rouba Ibrahim
Keyword(s):  
Priority Queue ◽  
System Throughput ◽  
Single Server ◽  
Impatient Customers ◽  
Scheduling Policy ◽  
Multiserver Queues ◽  
Many Server Queues ◽  
Service Times ◽  
The Many ◽  
Queues With Abandonment

The shortest-remaining-processing-time (SRPT) scheduling policy has been extensively studied, for more than 50 years, in single-server queues with infinitely patient jobs. Yet, much less is known about its performance in multiserver queues. In this paper, we present the first theoretical analysis of SRPT in multiserver queues with abandonment. In particular, we consider the [Formula: see text] queue and demonstrate that, in the many-sever overloaded regime, performance in the SRPT queue is equivalent, asymptotically in steady state, to a preemptive two-class priority queue where customers with short service times (below a threshold) are served without wait, and customers with long service times (above a threshold) eventually abandon without service. We prove that the SRPT discipline maximizes, asymptotically, the system throughput, among all scheduling disciplines. We also compare the performance of the SRPT policy to blind policies and study the effects of the patience-time and service-time distributions. This paper was accepted by Baris Ata, stochastic models & simulation.

Multicommodity-Based Delay Analysis for Heterogeneous Wireless Services in Core Network

2012 ◽  
Vol 198-199 ◽  
pp. 1733-1738
Author(s):  
Xiao Wei Qin ◽  
Feng Chen
Keyword(s):  
Access Network ◽  
Core Network ◽  
Wireless Applications ◽  
Core Networks ◽  
Service Delay ◽  
Wireless Access Network ◽  
The Cost ◽  
Mathematics Problem ◽  
Minimal Cost Flow

With the explosive growth of wireless applications, the subscribers’ requirements of QoS (Quality of Service) are increasing as well. In this paper, the upper bound of the tolerant delay of services in wireless access network is investigated, by mapping core network onto a cost-variable directed graph, where the cost is construed as the average service delay of the flows traveling in core network that depends on the current load. A multicommodity minimal cost flow mathematics problem is then derived and solved by Price-directive Decomposition and Lagrangian Relaxation. Simulations are carried out in two typical core networks and some valuable conclusions are gained.

QoS and Mobility Management Issues on Next Generation Mobile WiMAX Networks

2014 ◽  
pp. 298-323 ◽  
Author(s):  
Sajal Saha ◽  
Asish K. Mukhopadhyay ◽  
Anup Kumar Bhattacharjee
Keyword(s):  
Mobility Management ◽  
Dynamic Scheduling ◽  
Mobile Ip ◽  
Mobile Wimax ◽  
Ieee 802.16E ◽  
Handoff Management ◽  
Signaling Cost ◽  
Service Delay ◽  
Input Multiple Output ◽  
Mobility Management Protocol

Selection of a MIMO (Multiple Input Multiple Output) antenna to achieve high throughput, minimize errors, and optimize data speed is an important design issue. Radio resource management to provide Quality of Service (QoS) in WiMAX involves dynamic scheduling of resources according to the user’s priority, based classes Platinum, Gold, Silver, and Bronze. Mobility and handoff management in WiMAX is another important issue involving location update, signaling traffic and service delay, and call blocking and dropping. This chapter focuses on some issues concerning MIMO configuration to improve transmit diversity, developing an appropriate scheduling algorithm to improve QoS, and presenting a novel mobility management protocol THMIP (Three Level Hierarchical Mobile IP) in IEEE 802.16e environment to reduce signaling cost with respect to QoS parameters like throughput, end-to-end delay, interference, path loss, bit error rate, and Signal-to-Noise Ratio (SNR). For the simulation, the authors use OPNET Modeler and MATLAB.

scholarly journals Analysis and Optimization of Service Delay for Multiquality Videos in Multitier Heterogeneous Network With Random Caching

2020 ◽  
pp. 1-12
Author(s):  
Xuewei Zhang ◽  
Tiejun Lv ◽  
Yuan Ren ◽  
Wei Ni ◽  
Norman C. Beaulieu
Keyword(s):  
Heterogeneous Network ◽  
Service Delay

Convexity results for single-server queues and for multiserver queues with constant service times

1990 ◽  
Vol 27 (02) ◽  
pp. 465-468 ◽  
Author(s):  
Arie Harel
Keyword(s):  
Waiting Time ◽  
Service Time ◽  
Sojourn Time ◽  
Interarrival Time ◽  
Service Rate ◽  
Single Server ◽  
Multiserver Queues ◽  
Service Rates ◽  
Constant Service Times ◽  
Number Of Customers

We show that the waiting time in queue and the sojourn time of every customer in the G/G/1 and G/D/c queue are jointly convex in mean interarrival time and mean service time, and also jointly convex in mean interarrival time and service rate. Counterexamples show that this need not be the case, for the GI/GI/c queue or for the D/GI/c queue, for c ≧ 2. Also, we show that the average number of customers in the M/D/c queue is jointly convex in arrival and service rates. These results are surprising in light of the negative result for the GI/GI/2 queue (Weber (1983)).

Sign in / Sign up

Export Citation Format

Share Document