Sciweavers

13214 search results - page 302 / 2643
» Pseudorandomness for network algorithms
Sort
View
FOCS
2002
IEEE
15 years 11 months ago
A Constant-Factor Approximation Algorithm for the Multicommodity
We present the first constant-factor approximation algorithm for network design with multiple commodities and economies of scale. We consider the rent-or-buy problem, a type of m...
Amit Kumar, Anupam Gupta, Tim Roughgarden
CDC
2009
IEEE
168views Control Systems» more  CDC 2009»
15 years 11 months ago
Content distribution by multiple multicast trees and intersession cooperation: Optimal algorithms and approximations
—The paper addresses the problem of massive content distribution in the network where multiple sessions coexist. In the traditional approaches, the sessions form separate overlay...
Xiaoying Zheng, Chunglae Cho, Ye Xia
ICC
2007
IEEE
106views Communications» more  ICC 2007»
16 years 1 months ago
A Hierarchical Weighted Round Robin EPON DBA Scheme and Its Comparison with Cyclic Water-Filling Algorithm
—A H-WRR (Hierarchical Weighted Round-Robin) EPON (Ethernet Passive Optical Network) DBA (Dynamic Bandwidth Allocation) algorithm is devised and investigated. WRR table entries h...
Chan Kim, Tae-Whan Yoo, Bong-Tae Kim
ICDCS
2007
IEEE
16 years 1 months ago
Streaming Algorithms for Robust, Real-Time Detection of DDoS Attacks
Effective mechanisms for detecting and thwarting Distributed Denial-of-Service (DDoS) attacks are becoming increasingly important to the success of today’s Internet as a viable ...
Sumit Ganguly, Minos N. Garofalakis, Rajeev Rastog...
P2P
2006
IEEE
121views Communications» more  P2P 2006»
16 years 22 days ago
The Orchard Algorithm: P2P Multicasting without Free-Riding
The main purpose of many current peer-to-peer (P2P) networks is off-line file sharing. However, a potentially very promising use of such networks is to share video streams (e.g.,...
Jan-David Mol, Dick H. J. Epema, Henk J. Sips