NDLI: Routing high-bandwidth traffic in max-min fair share networks

Content Provider	ACM Digital Library
Author	Zhang, Hui Ma, Qingming Steenkiste, Peter
Abstract	We study how to improve the throughput of high-bandwidth traffic such as large file transfers in a network where resources are fairly shared among connections. While it is possible to devise priority or reservation-based schemes that give high-bandwidth traffic preferential treatment at the expense of other connections, we focus on the use of routing algorithms that improve resource allocation while maintaining max-min fair share semantics. In our approach, routing is closely coupled with congestion control in the sense that congestion information, such as the rates allocated to existing connections, is used by the routing algorithm. To reduce the amount of routing information that must be distributed, an abstraction of the congestion information is introduced. Using an extensive set of simulation, we identify a link-cost or cost metric for "shortest-path" routing that performs uniformly better than the minimal-hop routing and shortest-widest path routing algorithms. To further improve throughput without reducing the fair share of single-path connections, we propose a novel prioritized multi-path routing algorithm in which low priority paths share the bandwidth left unused by higher priority paths. This leads to a conservative extension of max-min fairness called prioritized multi-level max-min fairness. Simulation results confirm the advantages of our multi-path routing algorithm.
Starting Page	206
Ending Page	217
Page Count	12
File Format	PDF
ISSN	01464833
DOI	10.1145/248157.248175
Journal	ACM SIGCOMM Computer Communication Review (CCRV)
Volume Number	26
Issue Number	4
Language	English
Publisher	Association for Computing Machinery (ACM)
Publisher Date	1993-07-01
Publisher Place	New York
Access Restriction	One Nation One Subscription (ONOS)
Content Type	Text
Resource Type	Article
Subject	Computer Networks and Communications Software

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

Routing high-bandwidth traffic in max-min fair share networks

Routing High-bandwidth Traffic in Max-min Fair Share Networks (1996)

Routing high-bandwidth traffic in max-min fair share networks.

Centralized and Distributed Algorithms for Routing and Weighted Max-Min Fair Bandwidth Allocation

BwE:Flexible, Hierarchical Bandwidth Allocation for WAN Distributed Computing

A Game-Theoretic Approach to Stable Routing in Max-Min Fair Networks

Nonreservation Fair Bandwidth Allocation Based on Dynamic Replacement in Optical Burst Ring Networks

Minimizing losses in max-min fair-share OBS networks

A game-theoretic approach to stable routing in max-min fair networks

Routing high-bandwidth traffic in max-min fair share networks

Similar Documents

Routing high-bandwidth traffic in max-min fair share networks

Routing High-bandwidth Traffic in Max-min Fair Share Networks (1996)

Routing high-bandwidth traffic in max-min fair share networks.

Centralized and Distributed Algorithms for Routing and Weighted Max-Min Fair Bandwidth Allocation

BwE:Flexible, Hierarchical Bandwidth Allocation for WAN Distributed Computing

A Game-Theoretic Approach to Stable Routing in Max-Min Fair Networks

Nonreservation Fair Bandwidth Allocation Based on Dynamic Replacement in Optical Burst Ring Networks

Minimizing losses in max-min fair-share OBS networks

A game-theoretic approach to stable routing in max-min fair networks

Routing high-bandwidth traffic in max-min fair share networks