Analysis and simulation of a fair queueing algorithm
SIGCOMM '89 Symposium proceedings on Communications architectures & protocols
Shortest path first with emergency exits
SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
Fast bandwidth reservation scheme with multi-line & multi-path routing in ATM networks
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
SIGCOMM '92 Conference proceedings on Communications architectures & protocols
Distributed, scalable routing based on link-state vectors
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Finding near-optimal cuts: an empirical evaluation
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Scalability issues for distributed explicit rate allocation in ATM networks
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 3
The rate-based flow control framework for the available bit rate ATM service
IEEE Network: The Magazine of Global Internetworking
File server scaling with network-attached secure disks
SIGMETRICS '97 Proceedings of the 1997 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Combined path and server selection in dynamic multimedia environments
MULTIMEDIA '99 Proceedings of the seventh ACM international conference on Multimedia (Part 1)
Ant algorithms for discrete optimization
Artificial Life
Granularity of QoS Routing in MPLS Networks
IWQoS '01 Proceedings of the 9th International Workshop on Quality of Service
Optimal Link Capacity Dimensioning in Proportionally Fair Networks
NETWORKING '02 Proceedings of the Second International IFIP-TC6 Networking Conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; and Mobile and Wireless Communications
A new class of QoS routing strategies based on network graph reduction
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hop-by-hop routing algorithms for premium traffic
ACM SIGCOMM Computer Communication Review
Predictive routing to enhance QoS for stream-based flows sharing excess bandwidth
Computer Networks: The International Journal of Computer and Telecommunications Networking - Small and home networks
Prompt partial path optimization in MPLS networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Hop count based optimization of Bluetooth scatternets
Ad Hoc Networks
Topology aggregation for combined additive and restrictive metrics
Computer Networks: The International Journal of Computer and Telecommunications Networking
Lexicographic Maxmin Fairness for Data Collection in Wireless Sensor Networks
IEEE Transactions on Mobile Computing
Optimal scheduling and routing for maximum network throughput
IEEE/ACM Transactions on Networking (TON)
Multi-class QoS routing strategies based on the network state
Computer Communications
Fairness for extend DCCP congestion control in wireless sensor networks
CCDC'09 Proceedings of the 21st annual international conference on Chinese control and decision conference
In-advance path reservation for file transfers in e-science applications
The Journal of Supercomputing
Fuzzy multiobjective routing model in B-ISDN
Computer Communications
Dynamic grooming in IP over optical networks based on the overlay architecture
Optical Switching and Networking
Minimizing re-routing in MPLS networks with preemption-aware constraint-based routing
Computer Communications
A game-theoretic approach to stable routing in max-min fair networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
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.