Sciweavers

35 search results - page 7 / 7
» Cost Bounds of Multicast Light-Trees in WDM Networks
Sort
View
SIGECOM
2006
ACM
96views ECommerce» more  SIGECOM 2006»
13 years 11 months ago
Non-cooperative multicast and facility location games
We consider a multicast game with selfish non-cooperative players. There is a special source node and each player is interested in connecting to the source by making a routing de...
Chandra Chekuri, Julia Chuzhoy, Liane Lewin-Eytan,...
CN
2007
117views more  CN 2007»
13 years 5 months ago
Secure multicast in dynamic environments
A secure multicast framework should only allow authorized members of a group to decrypt received messages; usually, one ‘‘group key’’ is shared by all approved members. Ho...
Chun-Ying Huang, Yun-Peng Chiu, Kuan-Ta Chen, Chin...
WADS
2009
Springer
226views Algorithms» more  WADS 2009»
13 years 12 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
DIALM
2005
ACM
125views Algorithms» more  DIALM 2005»
13 years 7 months ago
Minimizing interference in ad hoc and sensor networks
Reducing interference is one of the main challenges in wireless communication, and particularly in ad hoc networks. The amount of interference experienced by a node v corresponds ...
Thomas Moscibroda, Roger Wattenhofer
COCOON
2008
Springer
13 years 7 months ago
Approximating the Generalized Capacitated Tree-Routing Problem
In this paper, we introduce the generalized capacitated tree-routing problem (GCTR), which is described as follows. Given a connected graph G = (V, E) with a sink s V and a set M...
Ehab Morsy, Hiroshi Nagamochi