Sciweavers

298 search results - page 17 / 60
» Multicriteria Steiner Tree Problem for Communication Network
Sort
View
86
Voted
APPROX
2008
Springer
134views Algorithms» more  APPROX 2008»
14 years 11 months ago
Inapproximability of Survivable Networks
In the Survivable Network Design Problem (SNDP) one seeks to find a minimum cost subgraph that satisfies prescribed node-connectivity requirements. We give a novel approximation r...
Yuval Lando, Zeev Nutov
NETWORKING
2007
14 years 11 months ago
Construction of a Proxy-Based Overlay Skeleton Tree for Large-Scale Real-Time Group Communications
Abstract. We consider the problem of constructing a proxy-based overlay skeleton tree (POST) in the backbone service domain of a two-tier overlay multicast infrastructure. Spanning...
Jun Guo, Sanjay Jha
BROADNETS
2006
IEEE
15 years 3 months ago
Robust Demand-Driven Video Multicast over Ad hoc Wireless Networks
Abstract— In this paper, we address the problem of video multicasting in ad hoc wireless networks. The salient characteristics of video traffic make conventional multicasting pr...
D. Agrawal, Tamma Bheemarjuna Reddy, C. Siva Ram M...
CDC
2009
IEEE
168views Control Systems» more  CDC 2009»
15 years 2 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
99
Voted
LION
2009
Springer
145views Optimization» more  LION 2009»
15 years 4 months ago
A Variable Neighborhood Descent Search Algorithm for Delay-Constrained Least-Cost Multicast Routing
Abstract. The rapid evolution of real-time multimedia applications requires Quality of Service (QoS) based multicast routing in underlying computer networks. The constrained Steine...
Rong Qu, Ying Xu, Graham Kendall