ترغب بنشر مسار تعليمي؟ اضغط هنا

Approximations for a Queueing Game Model with Join-the-Shortest-Queue Strategy

106   0   0.0 ( 0 )
 نشر من قبل Yiqiang Zhao
 تاريخ النشر 2020
  مجال البحث
والبحث باللغة English




اسأل ChatGPT حول البحث

This paper investigates a partially observable queueing system with $N$ nodes in which each node has a dedicated arrival stream. There is an extra arrival stream to balance the load of the system by routing its customers to the shortest queue. In addition, a reward-cost structure is considered to analyze customers strategic behaviours. The equilibrium and socially optimal strategies are derived for the partially observable mean field limit model. Then, we show that the strategies obtained from the mean field model are good approximations to the model with finite $N$ nodes. Finally, numerical experiments are provided to compare the equilibrium and socially optimal behaviours, including joining probabilities and social benefits for different system parameters.



قيم البحث

اقرأ أيضاً

96 - Rami Atar , Asaf Cohen 2014
We study a differential game that governs the moderate-deviation heavy-traffic asymptotics of a multiclass single-server queueing control problem with a risk-sensitive cost. We consider a cost set on a finite but sufficiently large time horizon, and show that this formulation leads to stationary feedback policies for the game. Several aspects of the game are explored, including its characterization via a (one-dimensional) free boundary problem, the semi-explicit solution of an optimal strategy, and the specification of a saddle point. We emphasize the analogy to the well-known Harrison-Taksar free boundary problem which plays a similar role in the diffusion-scale heavy-traffic literature.
63 - Rami Atar , Asaf Cohen 2018
We study a single-server Markovian queueing model with $N$ customer classes in which priority is given to the shortest queue. Under a critical load condition, we establish the diffusion limit of the workload and queue length processes in the form of a Walsh Brownian motion (WBM) living in the union of the $N$ nonnegative coordinate axes in $mathbb{R}^N$ and a linear transformation thereof. This reveals the following asymptotic behavior. Each time that queues begin to build starting from an empty system, one of them becomes dominant in the sense that it contains nearly all the workload in the system, and it remains so until the system becomes (nearly) empty again. The radial part of the WBM, given as a reflected Brownian motion (RBM) on the half-line, captures the total workload asymptotics, whereas its angular distribution expresses how likely it is for each class to become dominant on excursions. As a heavy traffic result it is nonstandard in three ways: (i) In the terminology of Harrison (1995) it is unconventional, in that the limit is not an RBM. (ii) It does not constitute an invariance principle, in that the limit law (specifically, the angular distribution) is not determined solely by the first two moments of the data, and is sensitive even to tie breaking rules. (iii) The proof method does not fully characterize the limit law (specifically, it gives no information on the angular distribution).
In the todays Internet and TCP/IP-networks, the queueing of packets is commonly implemented using the protocol FIFO (First In First Out). Unfortunately, FIFO performs poorly in the Adversarial Queueing Theory. Other queueing strategies are researched in this model and better results are performed by alternative queueing strategies, e.g. LIS (Longest In System). This article introduces a new queueing protocol called interval-strategy that is concerned with the reduction from dynamic to static routing. We discuss the maximum system time for a packet and estimate with up-to-date results how this can be achieved. We figure out the maximum amount of time where a packet can spend in the network (i.e. worst case system time), and argue that the universal instability of the presented interval-strategy can be reached through these results. When a large group of queueing strategies is used for queueing, we prove that the interval-strategy will be universally unstable. Finally, we calculate the maximum time of the static routing to reach an universal stable and polynomial - in detail linear - bounded interval-strategy. Afterwards we close - in order to check this upper bound - with up-to-date results about the delivery times in static routing.
The scope of this work is twofold: On the one hand, strongly motivated by emerging engineering issues in multiple access communication systems, we investigate the performance of a slotted-time relay-assisted cooperative random access wireless network with collisions and with join the shortest queue relay-routing protocol. For this model, we investigate the stability condition, and apply different methods to derive the joint equilibrium distribution of the queue lengths. On the other hand, using the cooperative communication system as a vehicle for illustration, we investigate and compare three different approaches for this type of multi-dimensional stochastic processes, namely the compensation approach, the power series algorithm (PSA), and the probability generating function (PGF) approach. We present an extensive numerical comparison of the compensation approach and PSA, and discuss which method performs better in terms of accuracy and computation time. We also provide details on how to compute the PGF in terms of a solution of a Riemann-Hilbert boundary value problem.
In many applications, significant correlations between arrivals of load-generating events make the numerical evaluation of the load of a system a challenging problem. Here, we construct very accurate approximations of the workload distribution of the MAP/G/1 queue that capture the tail behavior of the exact workload distribution and provide a small relative error. Motivated by statistical analysis, we assume that the service times are a mixture of a phase-type and a heavy-tailed distribution. With the aid of perturbation analysis, we derive our approximations as a sum of the workload distribution of the MAP/PH/1 queue and a heavy-tailed component that depends on the perturbation parameter. We refer to our approximations as corrected phase-type approximations, and we exhibit their performance with a numerical study.
التعليقات
جاري جلب التعليقات جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
mircosoft-partner

هل ترغب بارسال اشعارات عن اخر التحديثات في شمرا-اكاديميا