Preemption With Rerouting to Minimize Service Disruption in Connection-Oriented Networks

Resource allocation is a fundamental problem in connection-oriented networks. A preemption mechanism would provide available and reliable services to new connections with higher priority by tearing down existing connections of lower priority. However, end users of the existing connections that are p...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on systems, man and cybernetics. Part A, Systems and humans man and cybernetics. Part A, Systems and humans, 2008-09, Vol.38 (5), p.1093-1104
Main Authors: Chun Hau Lau, Boon-Hee Soong, Bose, S.K.
Format: Article
Language:English
Subjects:
Algorithms
Bandwidth
Channel allocation
Connection-oriented
Cybernetics
Disruption
Joints
Load management
Mission critical systems
Multiprotocol label switching
Networks
Optical fiber networks
Preemption
Priorities
reroute
Resource allocation
Resource management
soft preemption
SONET
Studies
Synchronous digital hierarchy
Tearing
Throughput
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Resource allocation is a fundamental problem in connection-oriented networks. A preemption mechanism would provide available and reliable services to new connections with higher priority by tearing down existing connections of lower priority. However, end users of the existing connections that are preempted will suffer service disruptions. The duration spent and the work done for these connections are wasted, leading to lower useful utilization of the overall network resources. Soft preemption can alleviate this by rerouting a connection that is about to be preempted before actually tearing it down so that the interruption of ongoing service can be avoided. In this paper, we focus on minimizing the service disruptions caused as a result of preemption by proposing algorithms that incorporate the soft preemption feature. A centralized algorithm is developed to select the network links that have a high number of reroutable connections in order to minimize service disruptions. For feasible deployment, a decentralized preemption algorithm that uses local information is subsequently proposed. Simulation results indicate that these approaches not only reduce the service disruption but also lead to higher network throughput than what can be achieved by existing preemption algorithms.
ISSN:1083-4427
2168-2216
1558-2426
2168-2232
DOI:10.1109/TSMCA.2008.2001075