Proceedings ArticleDOI
Routing high-bandwidth traffic in max-min fair share networks
Qingming Ma,Peter Steenkiste,Hui Zhang +2 more
- Vol. 26, Iss: 4, pp 206-217
Reads0
Chats0
TLDR
This work identifies 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 and proposes a novel prioritized multi-path routing algorithm in which low priority paths share the bandwidth left unused by higher priority paths.Citations
More filters
Journal ArticleDOI
Ant algorithms for discrete optimization
TL;DR: An overview of recent work on ant algorithms, that is, algorithms for discrete optimization that took inspiration from the observation of ant colonies' foraging behavior, and the ant colony optimization (ACO) metaheuristic is presented.
Journal ArticleDOI
Distributed quality-of-service routing in ad hoc networks
Shigang Chen,Klara Nahrstedt +1 more
TL;DR: This paper proposes a distributed QoS routing scheme that selects a network path with sufficient resources to satisfy a certain delay (or bandwidth) requirement in a dynamic multihop mobile environment and can tolerate a high degree of information imprecision.
Proceedings ArticleDOI
On path selection for traffic with bandwidth guarantees
Qingming Ma,Peter Steenkiste +1 more
TL;DR: This work presents a systematic evaluation of four routing algorithms that offer different tradeoffs between limiting the path hop count and balancing the network load, and shows that a routing algorithm that gives preference to limiting the hop count performs better when the network loads are heavy.
Proceedings ArticleDOI
On finding multi-constrained paths
Shigang Chen,Klara Nahrstedt +1 more
TL;DR: A heuristic algorithm to first reduce the NP-complete problem to a simpler one which can be solved in polynomial time, and then solve the new problem by either an extended Dijkstra's algorithm or an extended Bellman-Ford algorithm.
Proceedings ArticleDOI
File server scaling with network-attached secure disks
Garth A. Gibson,David F. Nagle,Khalil Amiri,Fay W. Chang,Eugene M. Feinberg,Howard Gobioff,Chen Lee,Berend Ozceri,Erik Riedel,David Rochberg,Jim Zelenka +10 more
TL;DR: An analytic model and replay experiments suggest that NetSCSI can reduce file server load during a burst of NFS or AFS activity by about 30% and with the NASD architecture, server load can be reduced by a factor of up to five for AFS and up to ten for NFS.
References
More filters
Journal ArticleDOI
A note on two problems in connexion with graphs
TL;DR: A tree is a graph with one and only one path between every two nodes, where at least one path exists between any two nodes and the length of each branch is given.
Journal ArticleDOI
Analysis and simulation of a fair queueing algorithm
TL;DR: In this article, a fair gateway queueing algorithm based on an earlier suggestion by Nagle is proposed to control congestion in datagram networks, based on the idea of fair queueing.
Proceedings ArticleDOI
Analysis and simulation of a fair queueing algorithm
TL;DR: It is found that fair queueing provides several important advantages over the usual first-come-first-serve queueing algorithm: fair allocation of bandwidth, lower delay for sources using less than their full share of bandwidth and protection from ill-behaved sources.
Journal ArticleDOI
The New Routing Algorithm for the ARPANET
TL;DR: The new ARPANET routing algorithm is an improvement over the old procedure in that it uses fewer network resources, operates on more realistic estimates of network conditions, reacts faster to important network changes, and does not suffer from long-term loops or oscillations.
Journal ArticleDOI
The rate-based flow control framework for the available bit rate ATM service
F. Bonomi,K.W. Fendick +1 more
TL;DR: A new ATM service category, the available bit rate service, is currently the subject of intense development and the rate-based flow control framework has been identified as the most appropriate for the support of this new service.