Logo image
Preemption rates for a parallel link loss network
Journal article   Peer reviewed

Preemption rates for a parallel link loss network

Zhen Zhao, Steven Weber and Jaudelice C. de Oliveira
Performance evaluation, v 66(1), pp 21-46
01 Jan 2009

Abstract

Computer Science Computer Science, Hardware & Architecture Computer Science, Theory & Methods Science & Technology Technology
We consider a two parallel link network supporting K call classes, where a class k call may preempt if necessary any calls of classes k + 1,..., K, and may in turn be preempted by any calls of class 1,..., k - 1. The two links are a (preferred) primary link (PL) and a backup link (BL). The preemption policy permits both preemption from the PL to the BL (a transfer) if possible, and eviction from either link if necessary. We characterize the rates of an arriving class k call causing preemption of an active lower priority call, and of an active class k call being preempted by an arriving higher priority call. When all classes share a common service rate, we express the preemption rates for each class in terms of the Erlang-B blocking probability equation. Simple expressions for the preemption rates are obtained in the heavy traffic limit. When classes have individual service rates, we approximate the preemption rates for each class using nearly completely decomposable (NCD) Markov chain techniques. The accuracy of the approximation improves with increasing timescale separation between classes. (C) 2008 Elsevier B.V. All rights reserved.

Metrics

12 Record Views
10 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, Hardware & Architecture
Computer Science, Theory & Methods
Logo image