Logo image
Heavy traffic analysis of a multi-class loss link with preemption
Conference proceeding

Heavy traffic analysis of a multi-class loss link with preemption

Zhen Zhao, Steven Weber, Jaudelice C. de Oliveira and IEEE
2007 41ST ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, VOLS 1 AND 2, pp 794-799
01 Jan 2007

Abstract

Computer Science Computer Science, Information Systems Computer Science, Theory & Methods Engineering Engineering, Electrical & Electronic Science & Technology Technology
Preemption policies are widely used in many contexts to provide higher quality of service (QoS) to high priority traffic during congestion by preempting low priority traffic. Although there is extensive work in the queueing literature on the performance of mufti-class loss systems, there is little work on the performance of preemption models. In this paper we employ heavy traffic results from queueing theory for the blocking probability on a single-class loss link to obtain expressions for preemption probabilities in a mufti-class loss link. In particular, we consider the case of L classes where class l may preempt if necessary any calls of classes l + 1,, L, and may in turn be preempted by any calls of class 1,, l - 1. We characterize the probabilities of a class l call causing preemption of an admitted lower priority call upon its arrival, and of a class L call being preempted by a higher priority call.(1)

Metrics

10 Record Views
1 citations in Scopus

Details

UN Sustainable Development Goals (SDGs)

This publication has contributed to the advancement of the following goals:

#11 Sustainable Cities and Communities

InCites Highlights

Data related to this publication, from InCites Benchmarking & Analytics tool:

Web of Science research areas
Computer Science, Information Systems
Computer Science, Theory & Methods
Engineering, Electrical & Electronic
Logo image