NDLI: Lagrangian relaxation in the multicriterial routing

Content Provider	IEEE Xplore Digital Library
Author	Stachowiak, K. Weissenberg, J. Zwierzykowski, P.
Copyright Year	2011
Description	Author affiliation: Poznań University of Technology, Chair of Communication and Computer Networks, ul. Polanka 3, 60-965, Poland (Stachowiak, K.; Weissenberg, J.; Zwierzykowski, P.)
Abstract	Communications networks routing is not a new subject. However, with a growth of packet networks and the increase of their range and importance, the task of conveying information over the web has grown beyond its original shape and has become far more sophisticated. It is no longer computer scientists and the military that make use of the global network exclusively; it can be stated that almost every possible group from the global population has numerous representatives among Internet users. This fact is coupled with a decrease in the popularity of the original communication media such as the telephone and the e-mail. This is mainly due to them being assimilated into packet networks along with the process of network convergence. A number of different types of information streams in packet networks has been observed and classified. It turns out that careful resources management itself may lead to an increase in the information transporting efficiency. In this paper, an approach is explored - the Lagrangian relaxation - that enables incorporating multiple criteria into the routing problem solution. At the same time, the low computation complexity is maintained that enables further consideration of the technique also in practical scenarios.
Starting Page	1
Ending Page	6
File Size	589544
Page Count	6
File Format	PDF
ISBN	9781612849928
ISSN	21530033
e-ISBN	9781612849935
DOI	10.1109/AFRCON.2011.6072070
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-09-13
Publisher Place	Zambia
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Approximation methods Delay Approximation algorithms Routing Optimization Vectors algorithm routing Lagrangian relaxation
Content Type	Text
Resource Type	Article
Subject	Electrical and Electronic Engineering Computer Science Applications

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

An efficient multicast routing algorithm for delay-sensitive applications with dynamic membership

An Approximate Dual Subgradient Algorithm for Multi-Agent Non-Convex Optimization

Minimum-delay overlay multicast

Fair background data transfers of minimal delay impact

Joint VM placement and routing for data center traffic engineering

Network tomography using genetic algorithms

Polynomial Time Approximation Algorithms for Multi-Constrained QoS Routing

Nonlinear approximation method in Lagrangian relaxation-based algorithms for hydrothermal scheduling

A Fast Hybrid ε-Approximation Algorithm for Computing Constrained Shortest Paths

Lagrangian relaxation in the multicriterial routing

Similar Documents

An efficient multicast routing algorithm for delay-sensitive applications with dynamic membership

An Approximate Dual Subgradient Algorithm for Multi-Agent Non-Convex Optimization

Minimum-delay overlay multicast

Fair background data transfers of minimal delay impact

Joint VM placement and routing for data center traffic engineering

Network tomography using genetic algorithms

Polynomial Time Approximation Algorithms for Multi-Constrained QoS Routing

Nonlinear approximation method in Lagrangian relaxation-based algorithms for hydrothermal scheduling

A Fast Hybrid ε-Approximation Algorithm for Computing Constrained Shortest Paths

Lagrangian relaxation in the multicriterial routing