Sciweavers

527 search results - page 8 / 106
» Implementation of Approximation Algorithms for the Multicast...
Sort
View
ECCC
2006
88views more  ECCC 2006»
13 years 7 months ago
Hardness of Directed Routing with Congestion
Given a graph G and a collection of source-sink pairs in G, what is the least integer c such that each source can be connected by a path to its sink, with at most c paths going th...
Julia Chuzhoy, Sanjeev Khanna
LCN
2000
IEEE
13 years 11 months ago
Efficient Congestion Avoidance Mechanism
The nowadays Internet architecture is mainly based on unicast communications and best-effort service. However, the development of the Internet encouraged emerging services that ar...
Anca Dracinschi Sailer, Serge Fdida
TPDS
2008
68views more  TPDS 2008»
13 years 7 months ago
Continuous Delivery Message Dissemination Problems under the Multicasting Communication Mode
We consider the Continuous Delivery Message Dissemination (CDMD) problem over the n-processor single-port complete (all links are present and are bidirectional) static network with...
Teofilo F. Gonzalez
CDC
2009
IEEE
168views Control Systems» more  CDC 2009»
14 years 1 days 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
TON
2008
98views more  TON 2008»
13 years 7 months ago
A unified framework for multipath routing for unicast and multicast traffic
We study the problem of load balancing the traffic from a set of unicast and multicast sessions. The problem is formulated as an optimization problem. However, we assume that the g...
Tuna Güven, Richard J. La, Mark A. Shayman, B...