ScienceDirect® Home Skip Main Navigation Links
You have guest access to ScienceDirect. Find out more.
 
Home
Browse
My Settings
Alerts
Help
 Quick Search
 Search tips (Opens new window)
    Clear all fields    
Computer Communications
Volume 27, Issue 3, February 2004, Pages 253-261
 
Font Size: Decrease Font Size  Increase Font Size
 Abstract - selected
Article
Purchase PDF (184 K)

  E-mail Article   
  Add to my Quick Links   
Bookmark and share in 2collab (opens in new window)
Request permission to reuse this article
  Cited By in Scopus (0)
 
 
 
Related Articles in ScienceDirect
There are no related articles for this article.
 
View Record in Scopus
 
doi:10.1016/j.comcom.2003.08.012    How to Cite or Link Using DOI (Opens New Window)
Copyright © 2003 Elsevier B.V. All rights reserved.

Formulation and optimization of the connection preemption problem

Sung-eok Jeon Corresponding Author Contact Information, E-mail The Corresponding Author and Randal T. Abler E-mail The Corresponding Author

School of Electrical and Computer Engineering, Georgia Institute of Technology, ECE, 331748 GaTech Station, Atlanta, GA 30332, USA

Received 6 December 2002; 
Revised 3 August 2003; 
accepted 13 August 2003. 
Available online 21 September 2003.

Purchase the full-text article



References and further reading may be available for this article. To view references and further reading you must purchase this article.

Abstract

In the literature, the connection preemption policy is proposed for the resource allocation method in the prioritized multi-class networks. However, the connection preemption problem that is defined in the literature does not consider the rerouting of the preempted connections. When some connections are preempted at a connection preemption event, a part of the preempted connections will be rerouted with their own preemption priorities. Therefore, each rerouted connection setup can also trigger new connection preemption events. In this work, we propose to extend the existing connection preemption problem to include the subsequent connection preemption events (triggered by new or rerouted connections). We call the new extended problem the extended connection preemption problem. We formulate the existing connection preemption problem and the extended connection preemption problem with their decision variables and cost function. This is the first work that formulates the connection preemption problem in terms of its cost function. And we also analyze how to optimize the cost function of the extended connection preemption problem.

Author Keywords: Author Keywords: Multiprotocol label switching networks; Label switched path; Priority-based networks; Connection preemption; Extended connection preemption; Decision variable; Cost function

Article Outline

1. Introduction
2. Related work
2.1. Resource allocation policies (connection preemption feature)
2.2. Previous works on the connection preemption problem
2.3. Cost function of the existing connection preemption problem
3. Cost function of the extended connection preemption problem
3.1. Problem definition
3.2. Cost function of the extended connection preemption problem
4. How to optimize the proposed cost function Fc5 (or Fc6)?
4.1. Relationship between Fci and fci
4.2. Proposed preemption policy of the extended connection preemption problem
4.3. Optimization of the total cost values Nall, Ball
4.3.1. Proposed preemption policy pp5 and the total cost Nall
4.3.2. Proposed preemption policy pp6 and the total cost Ball
5. Conclusion
References


Computer Communications
Volume 27, Issue 3, February 2004, Pages 253-261
 
Home
Browse
My Settings
Alerts
Help
Elsevier.com (Opens new window)
About ScienceDirect  |  Contact Us  |  Information for Advertisers  |  Terms & Conditions  |  Privacy Policy
Copyright © 2008 Elsevier B.V. All rights reserved. ScienceDirect® is a registered trademark of Elsevier B.V.