NDLI: Optimal Routing Strategy by Hose Model with Link-Traffic Bounds

Content Provider	IEEE Xplore Digital Library
Author	Kitahara, Y. Oki, E.
Copyright Year	2011
Abstract	This paper presents an optimal routing strategy based on the Hose model with bounds of Link Traffic (HLT), which we introduce. HLT is specified by the total traffic passing through each link in addition to the traffic bounds described in the hose model. The pipe model, which is specified by the exact traffic matrix, provides the best routing performance, but the traffic matrix is difficult to measure and predict accurately. While the hose model employs just the total outgoing/incoming traffic from/to each node, it offers lower routing performance than the pipe model, due to insufficient traffic information. The Hose model with bounds of Source-Destination Traffic (HSDT), where the upper and lower bounds of traffic demands for source-destination pairs are added as constraints, is a construction that lies between the pipe and hose models, but determining additional bounds is not easy for the network operators to specify. HLT, which lightens the difficulty of the pipe model, but narrows the range of traffic conditions specified by the hose model, offers better routing performance than the hose model. In addition, the HLT model resolves the difficulty of the HSDT model with regard to determining appropriate additional bounds. An optimal-routing formulation extended from the pipe model to the HLT model can not be solved as a regular linear programming (LP) problem. Our solution, the introduction of a duality theorem, turns this problem into an LP formulation that can be easily solved. Numerical results via simulations show that HLT offers 20-35% lower network congestion ratios than the hose model. In addition, the congestion ratios of the pipe and HLT models differ by less than 0.1.
Starting Page	1
Ending Page	5
File Size	211647
Page Count	5
File Format	PDF
ISBN	9781424492664
ISSN	1930529X
e-ISBN	9781424492688
e-ISBN	9781424492671
DOI	10.1109/GLOCOM.2011.6133671
Language	English
Publisher	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Publisher Date	2011-12-05
Publisher Place	USA
Access Restriction	Subscribed
Rights Holder	Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subject Keyword	Hoses Routing Numerical models Peer to peer computing IP networks IEEE Communications Society Robustness
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

Load-Balanced Shortest-Path-Based Routing without Traffic Splitting in Hose Model

A Resilient Routing Policy for Peering Management

Maximum Throughput Routing of Traffic in the Hose Model

Efficient Load-Balanced IP Routing Scheme Based on Shortest Paths in Hose Model

Optimal Link Weights for IP-Based Networks Supporting Hose-Model VPNs

Waypoint Routing: A Network Layer Privacy Framework

CAM04-3: Optimal Routing Between Alternate Paths With Different Network Transit Delays

Incremental Forwarding Table Aggregation

Optimal Constrained Candidate Selection for Opportunistic Routing

Optimal Routing Strategy by Hose Model with Link-Traffic Bounds

Similar Documents

Load-Balanced Shortest-Path-Based Routing without Traffic Splitting in Hose Model

A Resilient Routing Policy for Peering Management

Maximum Throughput Routing of Traffic in the Hose Model

Efficient Load-Balanced IP Routing Scheme Based on Shortest Paths in Hose Model

Optimal Link Weights for IP-Based Networks Supporting Hose-Model VPNs

Waypoint Routing: A Network Layer Privacy Framework

CAM04-3: Optimal Routing Between Alternate Paths With Different Network Transit Delays

Incremental Forwarding Table Aggregation

Optimal Constrained Candidate Selection for Opportunistic Routing

Optimal Routing Strategy by Hose Model with Link-Traffic Bounds