Delay and Load Fairness Optimization with Queuing Model in Multi-UAV Assisted MEC: A Deep Reinforcement Learning Approach
1
Citation
0
Reference
10
Related Paper
Citation Trend
Keywords:
Fair queuing
Abstract Queuing theory involves the use of mathematical modelling approaches to obtain insights into the efficiency and effectiveness of various queuing methods, processes, and systems. The theory enables types of queuing systems such as first-in/first-served, last-in/first-served, random order service, and service sharing systems to be examined in terms of their performance in relation to characteristics including arrival rates, arrival probabilities, server numbers, and system capacity. Services marketing remains the major area of marketing where mathematical models based on queuing theory are able to provide insights into various queuing system behaviours. Marketers seeking to establish appropriate queuing systems in any area of services involving the queuing of customers can therefore potentially benefit from applying queuing theory principles and methods to both queuing system design and evaluation. (See also Little’s Law.)
Fair queuing
Generalized processor sharing
Cite
Citations (0)
As part of the resource allocation mechanisms, each router must implement some queuing discipline that governs how packets are buffered while waiting to be transmitted. Various queuing disciplines can be used to control which packets get transmitted (bandwidth allocation) and which packets get dropped (buffer space). The queuing discipline also affects the latency experienced by a packet, by determining how long a packet waits to be transmitted. Examples of the common queuing disciplines are first-in first-out (FIFO) queuing, priority queuing (PQ), and weighted-fair queuing (WFQ). This paper throws a light on the comparative study of these disciplines and explains through simulation which is a better method of queuing.
Weighted fair queueing
Fair queuing
Queuing delay
Generalized processor sharing
Cite
Citations (31)
This paper addresses the sociotechnical challenges of organising queuing at large scale, face-to-face, food-sharing events. The authors have partnered with a grassroots food-sharing community, FoodSharing Copenhagen (FS-CPH), to reconsider queuing practices at food-sharing events. The results present three "queuing canvases" that illustrate how FS-CPH members envision digitally mediated queuing at food-sharing events. The paper outlines three themes that emerge from this design work: communicating activism through queuing, encountering others through queuing, and transparency in queuing mechanisms. We discuss how the envisioned ideas illustrate novel perspectives on queuing in volunteer-driven settings, while sometimes falling back on accepted norms and common expectations of how queuing should work. To address this, we present a set of sensitivities, for designers and activists alike, to design for queuing in settings where non-monetary sharing is central.
Fair queuing
Generalized processor sharing
Grassroots
Cite
Citations (9)
In this paper we study some basic concept of queuing theory and provide brief overview of queuing theory.We analyze the basic component of queuing theory and different type of distribution that are used to analyze a queuing model.The importance and requirement of state dependent queuing model also explained.Finally some basic model of queuing theory, performance measures is discussed and methodologies used to analyze such model are explained.
Fair queuing
Component (thermodynamics)
Cite
Citations (1)
A comparative analysis of basic and hybrid queuing methods and their impact on the VoIP traffic delay within the network have been discussed in this paper. In this experiment the hybrid queuing method is formed by combining three of the most useful basic queuing methods. In basic queuing methods priority queuing (PQ), custom queuing (CQ) and weighted fair queuing (WFQ) are combined with class-based weighted fair queuing (CBWFQ) for hybrid queuing. Hybrid method is compared with the basic method. All the basic and hybrid queuing mechanisms are tested using an OPNET Modeler simulation tool. From this, it is found how queuing combinations affect VoIP traffic quality, especially QoS.
Weighted fair queueing
Fair queuing
Generalized processor sharing
Queuing delay
Cite
Citations (6)
Based on the queuing theory,the queuing phenomena frequently encountered in Bank Queuing System were analyzed.The results indicated that the performance of single-shared queuing model is better than that of multi-separated queuing model when more than one server exist.Therefore,the queuing and calling system are usually used in Bank Queuing System.
Fair queuing
Generalized processor sharing
Cite
Citations (0)
Queuing is a common phenomenon in our daily life. Mathematical study on waiting line or queues is called queuing theory. Generally, queuing theory has been used extensively by service industry in order to optimize the service effectiveness and improve the customer satisfaction since it helps an organization to understand how a system operates while reviewing the efficiency of the system. Most of queuing theory deals with system performance in steady-state condition. That is, most queuing models assume that the system has been operating with the same arrival rate, service rate and other characteristics for a sufficiently long time that the probabilistic behavior of performance measures such as queue length is independent of initial condition. However, in many situations, the parameters defining the queuing system may vary over time. Under such circumstances, it is most unlikely that such systems are in equilibrium. This paper reviews the transient behavior (no assumption of statistical equilibrium) of the queuing model. The aim is to provide sufficient information to analysts who are interested in studying queuing theory with this special characteristic.
Fair queuing
Transient (computer programming)
Cite
Citations (1)
Fair queuing
Queuing delay
Cite
Citations (0)
Fair queuing
Phenomenon
Cite
Citations (1)
Abstract Queuing is a common phenomenon in daily life. The theory of queuing provides theoretical basis and optimization scheme for queuing in real life. However, due to the limitation of time and space, the queuing problem in real life is not an ideal queuing model, and the field verification of the queuing model with losses consumes a lot of manpower, material resources and financial resources. In this paper, a queuing model with loss mechanism was established by using color Petri net. One-dimensional random walk model was improved and introduced into the queuing system to further reveal the principle of loss in queuing. CPN tools were used to simulate the model. By comparing the experimental results with the actual results, the correctness of the model is proved, which fully indicates that the model can well explain the loss of queuing system in real life.
Fair queuing
Cite
Citations (0)