Sciweavers

527 search results - page 5 / 106
» Implementation of Approximation Algorithms for the Multicast...
Sort
View
COMCOM
2008
100views more  COMCOM 2008»
13 years 7 months ago
Multicast algorithms in service overlay networks
Overlay routing has been proposed to enhance the reliability and performance of IP networks, since it can bypass congestion and transient outages by forwarding traffic through one ...
Dario Pompili, Caterina M. Scoglio, Luca Lopez
STOC
2005
ACM
135views Algorithms» more  STOC 2005»
14 years 7 months ago
Hardness of the undirected congestion minimization problem
We show that there is no log log M log log log M -approximation for the undirected congestion minimization problem unless NP ZPTIME(npolylog n ), where M is the size of the grap...
Matthew Andrews, Lisa Zhang
INFOCOM
2005
IEEE
14 years 28 days ago
Achieving minimum-cost multicast: a decentralized approach based on network coding
— We present decentralized algorithms that compute minimum-cost subgraphs for establishing multicast connections in networks that use coding. These algorithms, coupled with exist...
Desmond S. Lun, Niranjan Ratnakar, Ralf Koetter, M...
INFOCOM
2002
IEEE
14 years 7 days ago
Routing in Overlay Multicast Networks
— Multicast services can be provided either as a basic network service or as an application-layer service. Higher level multicast implementations often provide more sophisticated...
Sherlia Shi, Jonathan S. Turner
COMCOM
2006
86views more  COMCOM 2006»
13 years 7 months ago
Study on nominee selection for multicast congestion control
Nominee selection plays a key role in nominee-based congestion control, which is essential for multicast services to ensure fairness and congestion avoidance. Without valid design...
Feng Xie, Gang Feng, Chee Kheong Siew