NDLI: Guaranteed performance routing of unpredictable traffic with fast path restoration

Content Provider	ACM Digital Library
Author	Kodialam, Murali Lakshman, T. V. Sengupta, Sudipta
Copyright Year	2009
Abstract	Two-phase routing, where traffic is first distributed to intermediate nodes before being routed to the final destination, has been recently proposed for handling widely fluctuating traffic without the need to adapt network routing to changing traffic. Preconfiguring the network in a traffic-independent manner using two-phase routing simplifies network operation considerably. In this paper, we extend this routing scheme by providing resiliency against link failures through fast path restoration along disjoint end-to-end backup paths. We view this as important progress toward adding carrier-class reliability to the robustness of the scheme so as to facilitate its future deployment in Internet service provider (ISP) networks. On the theoretical side, the main contribution of the paper is the development of linear-programming-based and fast combinatorial algorithms for two-phase routing with fast path restoration so as to minimize the maximum utilization of any link in the network, or equivalently, maximize the throughput. The algorithms developed are fully polynomial time approximation schemes (FPTAS)-for any given ε > 0, an FPTAS guarantees a solution that is within a (1 + ε)-factor of the optimum and runs in time polynomial in the input size and 1/ε. To the best of our knowledge, this is the first work in the literature that considers making the scheme resilient to link failures through preprovisioned fast restoration mechanisms. We evaluate the performance of fast path restoration (in terms of throughput) and compare it to that of unprotected routing. For our experiments, we use actual ISP network topologies collected for the Rocketfuel project and three research network topologies.
Starting Page	1427
Ending Page	1438
Page Count	12
File Format	PDF
ISSN	10636692
DOI	10.1109/TNET.2009.2012391
Volume Number	17
Issue Number	5
Journal	IEEE/ACM Transactions on Networking (TON)
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	2009-10-01
Access Restriction	One Nation One Subscription (ONOS)
Subject Keyword	Fast path restoration Traffic engineering Traffic variation
Content Type	Text
Resource Type	Article
Subject	Electrical and Electronic Engineering Computer Networks and Communications Software 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

Guaranteed Performance Routing of Unpredictable Traffic With Fast Path Restoration

Bandwidth guaranteed routing with fast restoration against link and node failures

Bandwidth Guaranteed Routing With Fast Restoration Against Link and Node Failures

Routing restorable bandwidth guaranteed connections using maximum 2-route flows

Locally restorable routing of highly variable traffic

End-to-end restorable oblivious routing of hose model traffic

On shortest path representation

Algorithms for computing QoS paths with restoration

A performance model of deflection routing in multibuffer networks with nonuniform traffic

Guaranteed performance routing of unpredictable traffic with fast path restoration

Similar Documents

Guaranteed Performance Routing of Unpredictable Traffic With Fast Path Restoration

Bandwidth guaranteed routing with fast restoration against link and node failures

Bandwidth Guaranteed Routing With Fast Restoration Against Link and Node Failures

Routing restorable bandwidth guaranteed connections using maximum 2-route flows

Locally restorable routing of highly variable traffic

End-to-end restorable oblivious routing of hose model traffic

On shortest path representation

Algorithms for computing QoS paths with restoration

A performance model of deflection routing in multibuffer networks with nonuniform traffic

Guaranteed performance routing of unpredictable traffic with fast path restoration