Call preemption in communication networks
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Erlang capacity and uniform approximations for shared unbuffered resources
IEEE/ACM Transactions on Networking (TON)
SIAM Journal on Matrix Analysis and Applications
Multiservice Loss Models for Broadband Telecommunication Networks
Multiservice Loss Models for Broadband Telecommunication Networks
Connection Premption: Issues, Algorithms, and a Simulation Study
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
The Mathematics of Internet Congestion Control (Systems and Control: Foundations and Applications)
IEEE/ACM Transactions on Networking (TON)
EHAC'05 Proceedings of the 4th WSEAS International Conference on Electronics, Hardware, Wireless and Optical Communications
Cognitive radio: brain-empowered wireless communications
IEEE Journal on Selected Areas in Communications
Flow splitting for end-to-end proportional QoS in OBS networks
IEEE Transactions on Communications
Optimal control of preemptive systems with loss
Computers and Electrical Engineering
Hi-index | 0.01 |
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.