Fundamentals of Queueing Theory

Shortle, John; Thompson, James M.; Gross, Donald; Harris, Carl M.

doi:10.1002/9781119453765

Cited by 316 publications

(181 citation statements)

References 0 publications

Supporting

Mentioning

173

Contrasting

Unclassified

Order By: Relevance

“…The average age for the case of a single M/M/1 queue was analyzed in [21]. We extend their analysis to obtain analytical expressions of average age as a function of λ, µ 1 and µ 2 for the two queue case, by using the well known result that updates also enter the second queue as a Poisson process of rate λ [29].…”

Section: A Analytical Queueing Model For Two Queuesmentioning

confidence: 99%

An Age Control Transport Protocol for Delivering Fresh Updates in the Internet-of-Things

Shreedhar

Kaul

Yates

2019

2019 IEEE 20th International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM)

View full text Add to dashboard Cite

The next generation of networks must support billions of connected devices in the Internet-of-Things (IoT). To support IoT applications, sources sense and send their measurement updates over the Internet to a monitor (control station) for real-time monitoring and actuation. Ideally, these updates would be delivered at a high rate, only constrained by the sensing rate supported by the sources. However, given network constraints, such a rate may lead to delays in delivery of updates at the monitor that make the freshest update at the monitor unacceptably old for the application.We propose a novel transport layer protocol, namely the Age Control Protocol (ACP), that enables timely delivery of such updates to monitors, in a network-transparent manner. ACP allows the source to adapt its rate of updates to dynamic network conditions such that the average age of the sensed information at the monitor is minimized. We detail the protocol and the proposed control algorithm. We demonstrate its efficacy using extensive simulations and real-world experiments. To exemplify, ACP achieves about 100 msec of reduction in age in comparison to a baseline that has sources send one update every round-triptime (RTT). This is for multiple sources that send their updates over the Internet to monitors on another continent over an endto-end link with round-trip-times of 185 msec.

show abstract

Section: A Analytical Queueing Model For Two Queuesmentioning

confidence: 99%

An Age Control Transport Protocol for Delivering Fresh Updates in the Internet-of-Things

Shreedhar

Kaul

Yates

2019

2019 IEEE 20th International Symposium on "A World of Wireless, Mobile and Multimedia Networks" (WoWMoM)

View full text Add to dashboard Cite

show abstract

“…While considering both request arrivals and request acceptances (service) as Poisson processes, every request queue is a classic M/M/1 queuing system, known as single-server birthdeath system [11]. Hence, many features of birth-death model can be directly applied.…”

Section: B Queuing-theoretic Analysismentioning

confidence: 99%

“…where β n ∈ [0, 1] measures the willingness of tenants requesting type-n slices to wait. In cases that the tenant has knowledge about µ n , Shortle et al suggest another non-linear balking model 1 − b n = 1 − e −β n l n /µ n where β n > 0 [11]. Here we consider the hyperbolic balking model described by Eq.…”

Section: B Queuing-theoretic Analysismentioning

confidence: 99%

A Utility-Driven Multi-Queue Admission Control Solution for Network Slicing

Han

Sciancalepore

Feng

et al. 2019

IEEE INFOCOM 2019 - IEEE Conference on Computer Communications

View full text Add to dashboard Cite

The combination of recent emerging technologies such as network function virtualization (NFV) and network programmability (SDN) gave birth to the Network Slicing revolution. 5G networks consist of multi-tenant infrastructures capable of offering leased network "slices" to new customers (e.g., vertical industries) enabling a new telecom business model: Slice-as-a-Service (SlaaS). In this paper, we aim i) to study the slicing admission control problem by means of a multi-queuing system for heterogeneous tenant requests, ii) to derive its statistical behavior model, and iii) to provide a utility-based admission control optimization. Our results analyze the capability of the proposed SlaaS system to be approximately Markovian and evaluate its performance as compared to legacy solutions.

show abstract

“…Note that the estimation of the waiting cost can be obtained through statistical analysis of customers experience data extracted for surveys. This problem is related to numerous works that have been done considering impatience in customers decisions in such complex strategic queueing systems [12].…”

Section: Optimal Pricing Policymentioning

confidence: 99%

Revenue maximization with access and information pricing schemes in a partially-observable queueing game

Naceur

Hayel

2019

Proceedings of the 12th EAI International Conference on Performance Evaluation Methodologies and Tools

View full text Add to dashboard Cite

Today's queueing network systems are more rapidly evolving and more complex than those of even a few years ago. The goal of this paper is to study customers' behavior in an unobservable Markovian M/M/1 queue where consumers have to choose between two strategic decisions about information acquisition before joining or not the queue. According to their decision, customers decide to give up the service (balk the system) or to join the queue. We study the Nash equilibrium strategies: we compute the equilibrium and we prove its existence and uniqueness. Based on this result, we consider the problem of revenue maximization where the provider has to choose between two charging mechanisms: to charge the access to the system or to charge the queue length information to new incoming customers. We propose an heuristic algorithm to solve the considered problem and numerical experiments have been conducted in order to illustrate the result. We show that, depending on the sensitivity of customers to their waiting time, the provider will change the pricing policy used. Particularly, when customers are more sensitive then the provider will charge the information instead of the access.

show abstract

Fundamentals of Queueing Theory

Cited by 316 publications

References 0 publications

An Age Control Transport Protocol for Delivering Fresh Updates in the Internet-of-Things

An Age Control Transport Protocol for Delivering Fresh Updates in the Internet-of-Things

A Utility-Driven Multi-Queue Admission Control Solution for Network Slicing

Revenue maximization with access and information pricing schemes in a partially-observable queueing game

Contact Info

Product

Resources

About