Amortized efficiency of list update and paging rules
Communications of the ACM
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)
Bandwidth management and congestion control framework of the broadband network architecture
Computer Networks and ISDN Systems
ATM: theory and application
Access services for the Networking Broadband Services architecture
IBM Systems Journal
Preemption rates for a parallel link loss network
Performance Evaluation
Optimal control of preemptive systems with loss
Computers and Electrical Engineering
Fine protection of data-paths in multi-layer networks based on the GMPLS paradigm
Optical Switching and Networking
Formulation and optimization of the connection preemption problem
Computer Communications
| Hi-index | 0.00 |
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.