NDLI: Lagrange relaxation based method for the QoS routing problem

Content Provider	IEEE Xplore Digital Library
Author	Juttner, A. Szviatovski, B. Mecs, I. Rajko, Z.
Copyright Year	2001
Description	Author affiliation: Traffic Anal. & Network Performance Lab., Ericsson Res., Budapest, Hungary (Juttner, A.)
Abstract	In this paper a practically efficient QoS routing method is presented, which provides a solution to the delay constrained least cost routing problem. The algorithm uses the concept of aggregated costs and provides an efficient method to find the optimal multiplier based on Lagrange relaxation. This method is proven to be polynomial and it is also efficient in practice. The benefit of this method is that it also gives a lower bound on the theoretical optimal solution along with the result. The difference between the lower bound and the cost of the found path is very small proving the good quality of the result. Moreover, by further relaxing the optimality of paths, an easy way is provided to control the trade-off between the running time of the algorithm and the quality of the found paths. We present a comprehensive numerical evaluation of the algorithm, by comparing it to a wide range of QoS routing algorithms proposed in the literature. It is shown that the performance of the proposed polynomial time algorithm is close to the optimal solution computed by an exponential algorithm.
Sponsorship	IEEE Comput. Soc. IEEE Commun. Soc
Starting Page	859
Ending Page	868
File Size	192551
Page Count	10
File Format	PDF
ISBN	0780370163
ISSN	0743166X
DOI	10.1109/INFCOM.2001.916277
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2001-04-22
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Lagrangian functions Routing Propagation delay Costs Polynomials Quality of service Resource management Internet Telecommunication traffic Performance analysis
Content Type	Text
Resource Type	Article
Subject	Computer Science Electrical and Electronic Engineering

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

Nonlinear Lagrange relaxation based QoS routing revisited

Efficient QoS routing

Lagrange relaxation based algorithm for DiffServ/MPLS network dimensioning with QoS guarantees

Performance evaluation of delay-constrained least-cost QoS routing algorithms based on linear and nonlinear Lagrange relaxation

QoS routing algorithm based on multiclasses traffic load

An algorithm for QoS routing to optimize network resource utilization

Integrating effective-bandwidth-based QoS routing and best effort routing

Incentive compatible pricing strategies for QoS routing

Optimization of QoS Routing

Lagrange relaxation based method for the QoS routing problem

Similar Documents

Nonlinear Lagrange relaxation based QoS routing revisited

Efficient QoS routing

Lagrange relaxation based algorithm for DiffServ/MPLS network dimensioning with QoS guarantees

Performance evaluation of delay-constrained least-cost QoS routing algorithms based on linear and nonlinear Lagrange relaxation

QoS routing algorithm based on multiclasses traffic load

An algorithm for QoS routing to optimize network resource utilization

Integrating effective-bandwidth-based QoS routing and best effort routing

Incentive compatible pricing strategies for QoS routing

Optimization of QoS Routing

Lagrange relaxation based method for the QoS routing problem