LARGE DEVIATIONS BOUNDS FOR A POLLING SYSTEM WITH MARKOVIAN ON/OFF SOURCES AND BERNOULLI SERVICE SCHEDULE

Abstract. In this paper we consider a large deviations problem for a discrete-time polling system consisting of two-parallel queues and a single server. The arrival process of each queue is a superposition of traffic streams generated by a number of mutually independent and identical Markovian on/off sources, and the single server serves the two queues according to the so-called Bernoulli service schedule. Using the large deviations techniques, we derive the upper and lower bounds of the probability that the queue length of each queue exceeds a certain level (i.e., the buffer overflow probability). These results have important implications for traffic management of high-speed communication networks such as call admission control and bandwidth allocation

Performance analysis of priority queueing systems in discrete time

The integration of different types of traffic in packet-based networks spawns the need for traffic differentiation. In this tutorial paper, we present some analytical techniques to tackle discrete-time queueing systems with priority scheduling. We investigate both preemptive (resume and repeat) and non-preemptive priority scheduling disciplines. Two classes of traffic are considered, high-priority and low-priority traffic, which both generate variable-length packets. A probability generating functions approach leads to performance measures such as moments of system contents and packet delays of both classes

Statistical multiplexing and connection admission control in ATM networks

Asynchronous Transfer Mode (ATM) technology is widely employed for the transport of network traffic, and has the potential to be the base technology for the next generation of global communications. Connection Admission Control (CAC) is the effective traffic control mechanism which is necessary in ATM networks in order to avoid possible congestion at each network node and to achieve the Quality-of-Service (QoS) requested by each connection. CAC determines whether or not the network should accept a new connection. A new connection will only be accepted if the network has sufficient resources to meet its QoS requirements without affecting the QoS commitments already made by the network for existing connections. The design of a high-performance CAC is based on an in-depth understanding of the statistical characteristics of the traffic sources

Introduction to Queueing Theory and Stochastic Teletraffic Models

The aim of this textbook is to provide students with basic knowledge of stochastic models that may apply to telecommunications research areas, such as traffic modelling, resource provisioning and traffic management. These study areas are often collectively called teletraffic. This book assumes prior knowledge of a programming language, mathematics, probability and stochastic processes normally taught in an electrical engineering course. For students who have some but not sufficiently strong background in probability and stochastic processes, we provide, in the first few chapters, background on the relevant concepts in these areas.Comment: 298 page