24 search results - page 4 / 5 » Lower Bounds for One-to-one Packet Routing on Trees using Ho... |
TMC
2012
11 years 9 months ago
2012
—We investigate the following fundamental question—how fast can information be collected from a wireless sensor network organized as tree? To address this, we explore and evalu...
ICALP
2005
Springer
14 years 28 days ago
2005
Springer
Virtual Private Network Design is the following NP-hard problem. We are given a communication network, represented as a weighted graph with thresholds on the nodes which represent...
ICALP
2003
Springer
14 years 19 days ago
2003
Springer
Abstract. In this paper we consider the problem of routing packets in dynamically changing networks, using the anycast mode. In anycasting, a packet may have a set of destinations ...
CIC
2004
13 years 8 months ago
2004
As a key issue in multicast routing with quality of service (QoS) support, constrained minimum Steiner tree (CMST) problem has been a research focus for more than a decade, and ten...
CN
2008
13 years 7 months ago
2008
act 11 Overlay multicasting has been proposed for implementing multicast routing in the application layer as a practical alter12 native to IP multicasting. Since a packet in overla...