On the Integration of Best‐Effort and Guaranteed Performance Services

Abstract

Abstract.One of the main challenges of emerging high speed telecommunication networks is the integration of services. Both ATM as well as the Internet have been evolving so as to accommodate both best-effort type traffic (such as file transfer) as well as real time traffic requiring guaranteed performance. The co-existence of thesc two service types on the same network carries important hencfits such as resource sharing betwecn service classcs, and the ability of the user to easily select an appropriate service class according to requiremcnts and preferences. These benefits depend on efticient network management and resource sharing strategies. The aim of this paper is twofold. First, we study [he performance measures of both scrvice types, as a function of the nctwork managcmcnt strategy. This study allows us at a second phase to design efficient network managcmcnt schemes. This includes questions such as whcther best-effort trat'fic should use only bandwidth Icft-over by the guarantccd pcrformance ones, or whcthcr (and how much) bandwidth needs to be reserved to best-effort tratfic. Another managcmcnt issue that we study is thc pricing. We allow Tor diffcrent classes of ~uarantced-pcrformancc traffic to have difkrcnt priorities with rcspcct to the rejection probabilities.

Performance Analysis of the Uplink of a CDMA Cell Supporting Elastic Services

“…This is not trivial because one could intuitively argue that since the elastic flows bring with themselves a certain amount of workload, the memoryless property does not hold, even if this workload is exponentially distributed. However, the Markovian property for such systems was independently of one another observed and formally proven by Altman et al [9], Andersen et al [5] and Nunez Queija et al [10].…”

Perturbation analysis for denumerable Markov chains with application to queueing models

“…We give conditions for its existence in terms of the characteristics of the unperturbed Markov chain (e.g. probability measure(s), deviation matrix) and the perturbation term G (1) . Furthermore, we show that, under rather weak conditions, the invariant probability measure of the perturbed chain π(ε) is analytic in ε in the punctured neighbourhood of zero.…”

“…Furthermore, we show that, under rather weak conditions, the invariant probability measure of the perturbed chain π(ε) is analytic in ε in the punctured neighbourhood of zero. Specifically, π(ε) = π (0) + επ (1) + · · · .…”

“…In the present work, we use the concepts of Lyapunov functions and ν-geometric ergodicity ( [9], [16], [21], [27], [28]) that allow us to treat the cases that satisfy neither Doeblin conditions nor the strong ergodicity condition. Works on the application of singularly perturbed Markov chains to quasibirth-and-death models, queueing models and reliability theory include [1], [2], [7], [11], [20], [24]. The singular perturbation techniques allow us to solve models with significantly larger state space than in the case of direct application of standard tools.…”

On Scheduling and Interference Coordination Policies for Multicell OFDMA Networks

“…The Markovian property for such systems was observed and formally proven by Altman et al in [14]. Thus, the system under these assumptions is a continuous time Markov chain whose state is uniquely characterized by the state variable n.…”