Sciweavers

189 search results - page 8 / 38
» Bandwidth Scheduling and Path Computation Algorithms for Con...
Sort
View
LCN
1999
IEEE
13 years 11 months ago
The New Shortest Best Path Tree (SBPT) Algorithm for Dynamic Multicast Trees
This paper presents the new Shortest Best Path Tree (SBPT) algorithm for multicast trees. The SBPT algorithm establishes and maintains dynamic multicast trees which maximize the b...
Hiroshi Fujinoki, Kenneth J. Christensen
NSDI
2010
13 years 9 months ago
Hedera: Dynamic Flow Scheduling for Data Center Networks
Today's data centers offer tremendous aggregate bandwidth to clusters of tens of thousands of machines. However, because of limited port densities in even the highest-end swi...
Mohammad Al-Fares, Sivasankar Radhakrishnan, Barat...
ICC
2007
IEEE
200views Communications» more  ICC 2007»
14 years 1 months ago
Optimal Packet Scheduling for Multi-Description Multi-Path Video Streaming Over Wireless Networks
—As developments in wireless networks continue, there is an increasing expectation with regard to supporting highquality real-time video streaming service in such networks. The r...
Gui Xie, M. N. S. Swamy, M. Omair Ahmad
ICCS
2004
Springer
14 years 28 days ago
On Algorithm for All-Pairs Most Reliable Quickest Paths
Abstract. The reliability problem of the quickest path deals with the transmission of a message of sizeσ from a source to a destination with both the minimum end-to-end delay and ...
Young-Cheol Bang, Inki Hong, Hyunseung Choo
AINA
2003
IEEE
14 years 25 days ago
Detection of Multiple Bottleneck Bandwidth
This paper endeavors to present a scheme to detect and estimate bottleneck bandwidth along the path in the Internet. We have participated in the RIPE NCC’s TTM project to perfor...
Niwat Thepvilojanapong, Yoshito Tobe, Kaoru Sezaki