NDLI: The optimal connection preemption algorithm in a multi-class network

Content Provider	IEEE Xplore Digital Library
Author	Sung-eok Jeon Abler, R.T. Goulart, A.E.
Copyright Year	2002
Description	Author affiliation: Dept. of Electr. & Comput. Eng., Georgia Inst. of Technol., Atlanta, GA, USA (Sung-eok Jeon; Abler, R.T.; Goulart, A.E.)
Abstract	In an integrated network in which multiple classes with different priorities exist, when the network does not have enough unused bandwidth, connection preemption algorithms (CPA) play an important role in accepting a new session with a high priority by preempting lower priority flows already admitted. Although there are lots of studies about which connections to preempt to optimize the preemption factors (the priority of connections, the bandwidth to be preempted, and the number of connections to be preempted), existing CPAs are only suboptimal from the point of view of the preemption factors because of the computational complexity. The connection preemption problem in a centralized fashion is proved to be NP-complete. To avoid the complexity of the centralized scheme, decentralized/distributed algorithms are proposed. However their solutions are optimal only at the hop level. In order to avoid the priority order problem and to minimize the number of preempted and rerouted sessions, we propose to order the priority of the preemption factors in a new way. We also propose an optimal connection preemption algorithm which optimizes the newly ordered preemption factors in the connection preemption events. The proposed algorithm is the first optimal algorithm that provides a guideline about the upper bound of the computational complexity of the optimal CPAs.
Starting Page	2294
Ending Page	2298
File Size	389253
Page Count	5
File Format	PDF
ISBN	0780374002
DOI	10.1109/ICC.2002.997255
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2002-04-28
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Intelligent networks Bandwidth Computational complexity Distributed algorithms Guidelines Upper bound Call admission control Admission control Heuristic algorithms
Content Type	Text
Resource Type	Article

Sl.	Authority	Responsibilities	Communication Details
1	Ministry of Education (GoI), Department of Higher Education	Sanctioning Authority	https://www.education.gov.in/ict-initiatives
2	Indian Institute of Technology Kharagpur	Host Institute of the Project: The host institute of the project is responsible for providing infrastructure support and hosting the project	https://www.iitkgp.ac.in
3	National Digital Library of India Office, Indian Institute of Technology Kharagpur	The administrative and infrastructural headquarters of the project	Dr. B. Sutradhar bsutra@ndl.gov.in
4	Project PI / Joint PI	Principal Investigator and Joint Principal Investigators of the project	Dr. B. Sutradhar bsutra@ndl.gov.in Prof. Saswat Chakrabarti will be added soon
5	Website/Portal (Helpdesk)	Queries regarding NDLI and its services	support@ndl.gov.in
6	Contents and Copyright Issues	Queries related to content curation and copyright issues	content@ndl.gov.in
7	National Digital Library of India Club (NDLI Club)	Queries related to NDLI Club formation, support, user awareness program, seminar/symposium, collaboration, social media, promotion, and outreach	clubsupport@ndl.gov.in
8	Digital Preservation Centre (DPC)	Assistance with digitizing and archiving copyright-free printed books	dpc@ndl.gov.in
9	IDR Setup or Support	Queries related to establishment and support of Institutional Digital Repository (IDR) and IDR workshops	idr@ndl.gov.in

Pfr: a distributed preemption strategy for improved qos in multi-class networks.

Pricing versus Admission Control in Multi-class Loss Networks

A call admission control for service differentiation and fairness management in WDM grooming networks

An adaptive distributed call admission control for QoS-sensitive wireless mobile networks

A near optimal call admission control with genetic algorithm for multimedia services in wireless/mobile networks

Optimal stochastic control for multi-services call admission in mobile wireless networks

Exponential bounds for a class of stochastic processes with application to call admission control in networks

Pricing versus Admission Control in Multi-class Loss Networks

Connection Preemption in Multi-Class Networks

The optimal connection preemption algorithm in a multi-class network

Similar Documents

Pfr: a distributed preemption strategy for improved qos in multi-class networks.

Pricing versus Admission Control in Multi-class Loss Networks

A call admission control for service differentiation and fairness management in WDM grooming networks

An adaptive distributed call admission control for QoS-sensitive wireless mobile networks

A near optimal call admission control with genetic algorithm for multimedia services in wireless/mobile networks

Optimal stochastic control for multi-services call admission in mobile wireless networks

Exponential bounds for a class of stochastic processes with application to call admission control in networks

Pricing versus Admission Control in Multi-class Loss Networks

Connection Preemption in Multi-Class Networks

The optimal connection preemption algorithm in a multi-class network