Sciweavers

393 search results - page 5 / 79
» Approximation Algorithm for Directed Telephone Multicast Pro...
Sort
View
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
14 years 1 months ago
Online Priority Steiner Tree Problems
Abstract. A central issue in the design of modern communication networks is the provision of Quality-of-Service (QoS) guarantees at the presence of heterogeneous users. For instanc...
Spyros Angelopoulos
SC
2003
ACM
13 years 12 months ago
Scalable Hardware-Based Multicast Trees
This paper presents an algorithm for implementing optimal hardware-based multicast trees, on networks that provide hardware support for collective communication. Although the prop...
Salvador Coll, José Duato, Fabrizio Petrini...
TPDS
2008
68views more  TPDS 2008»
13 years 6 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»
13 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
JCT
2008
120views more  JCT 2008»
13 years 6 months ago
Approximate min-max theorems for Steiner rooted-orientations of graphs and hypergraphs
Given an undirected hypergraph and a subset of vertices S V with a specified root vertex r S, the STEINER ROOTED-ORIENTATION problem is to find an orientation of all the hypered...
Tamás Király, Lap Chi Lau