NDLI: Off-line reduced complexity layout design for MPLS networks

Content Provider	IEEE Xplore Digital Library
Author	Beker, S. Kofman, D. Puech, N.
Copyright Year	2003
Description	Author affiliation: Departement Informatique et Reseaux, Ecole Nat. Superieure des Telecommun., Paris, France (Beker, S.; Kofman, D.; Puech, N.)
Abstract	One of the main reasons for the present market enthusiasm for the MPLS architecture is its capability for implementing evolved traffic engineering (TE) functionalities, as they are required, for example, to support the next generation Internet. MPLS paths (LSPs) can be calculated on-line, as demands arrive, or off-line for a given estimate of the traffic matrix. Off-line calculation has the advantage of enabling a globally optimal network design. From the operational standpoint, the layout design for a large network should consider minimizing the layout complexity, thus reducing the cost of operation. Layout optimization objectives usually aim at minimizing total delay in the network, maximum loaded link, or any other function of link loads. To address the layout complexity issue, we propose an optimization problem whose objective is to minimize the number of required paths, while an end-to-end path delay constraint provides the required quality of service (QoS) guarantees. To solve the resulting multicommodity flow allocation problem, a MINLP (mixed integer non linear program) formulation is used. The results are then compared to the solutions obtained with a commonly used cost function, which does not consider complexity.
Sponsorship	IEEE Commun. Soc
Starting Page	99
Ending Page	105
File Size	467693
Page Count	7
File Format	PDF
ISBN	0780381998
DOI	10.1109/IPOM.2003.1251230
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2003-10-03
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Multiprotocol label switching Telecommunication traffic Quality of service Delay Network topology Cost function Routing Interference constraints Tellurium Constraint optimization
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

On-line routing optimization for MPLS-based IP networks

A minimum interference anycast QOS routing for MPLS traffic engineering

Selection of backup LSPs in MPLS network based on QoS

A new low-complexity QoS routing algorithm for MPLS Traffic Engineering

Traffic engineering with constraint-based routing in DiffServ/MPLS network

Multi-Commodity Flow Traffic Engineering with Hybrid MPLS/OSPF Routing

Balanced Traffic Distribution for MPLS Using Bin Packing Method

Traffic engineering with constraint based routing in MPLS networks

An On-Line Routing Algorithm Based on the Off-Line Optimal Computing in MPLS

Off-line reduced complexity layout design for MPLS networks

Similar Documents

On-line routing optimization for MPLS-based IP networks

A minimum interference anycast QOS routing for MPLS traffic engineering

Selection of backup LSPs in MPLS network based on QoS

A new low-complexity QoS routing algorithm for MPLS Traffic Engineering

Traffic engineering with constraint-based routing in DiffServ/MPLS network

Multi-Commodity Flow Traffic Engineering with Hybrid MPLS/OSPF Routing

Balanced Traffic Distribution for MPLS Using Bin Packing Method

Traffic engineering with constraint based routing in MPLS networks

An On-Line Routing Algorithm Based on the Off-Line Optimal Computing in MPLS

Off-line reduced complexity layout design for MPLS networks