Cart (Loading....) | Create Account
Close category search window
 

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

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Chun Hau Lau ; Sch. of Electr. & Electron. Eng., Nanyang Technol. Univ., Singapore ; Boon-Hee Soong ; Bose, S.K.

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.

Published in:

Systems, Man and Cybernetics, Part A: Systems and Humans, IEEE Transactions on  (Volume:38 ,  Issue: 5 )

Date of Publication:

Sept. 2008

Need Help?


IEEE Advancing Technology for Humanity About IEEE Xplore | Contact | Help | Terms of Use | Nondiscrimination Policy | Site Map | Privacy & Opting Out of Cookies

A not-for-profit organization, IEEE is the world's largest professional association for the advancement of technology.
© Copyright 2014 IEEE - All rights reserved. Use of this web site signifies your agreement to the terms and conditions.