DocumentCode :
2207915
Title :
Connection preemption: issues, algorithms, and a simulation study
Author :
Peyravian, Mohammad ; Kshemkalyani, Ajay D.
Author_Institution :
IBM Corp., Research Triangle Park, NC, USA
Volume :
1
fYear :
1997
fDate :
7-12 Apr 1997
Firstpage :
143
Abstract :
Connection preemption can be a means to provide available and reliable services to high-priority connections when a network is heavily loaded and connection request arrival patterns are unknown, or when the network experiences link or node failures. We present a simulation study of preemption in a general connection-oriented network setting. Based on the observations made in this study, we have developed two optimal connection preemption selection algorithms that operate in a decentralized/distributed network where individual link managers run the algorithm for connection preemption selection on their outgoing links. The first algorithm optimizes the criteria of (i) the number of connections to be preempted, (ii) the bandwidth to be preempted, and (iii) the priority of connections to be preempted, in that order, and has polynomial complexity. The second algorithm optimizes the criteria of (i) the bandwidth to be preempted, (ii) the priority of connections to be preempted, and (iii) the number of connections to be preempted, in that order, and has exponential complexity. We conclude that the polynomial algorithm is almost as good as the exponential algorithm in terms of overall network performance
Keywords :
computational complexity; optimisation; polynomials; protocols; telecommunication congestion control; algorithms; bandwidth; connection preemption; connection request arrival patterns; decentralized/distributed network; exponential algorithm; exponential complexity; general connection-oriented network setting; high-priority connections; individual link managers; link failures; node failures; optimal connection preemption selection algorithms; overall network performance; polynomial algorithm; polynomial complexity; simulation; Asynchronous transfer mode; Bandwidth; Centralized control; Communication networks; Costs; Polynomials; Pricing; Quality of service; Steady-state; Telecommunication traffic;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution., Proceedings IEEE
Conference_Location :
Kobe
ISSN :
0743-166X
Print_ISBN :
0-8186-7780-5
Type :
conf
DOI :
10.1109/INFCOM.1997.635124
Filename :
635124
Link To Document :
بازگشت