625 search results - page 101 / 125 » Semi-preemptive routing on trees |
FORTE
2011
12 years 12 months ago
2011
Abstract. Data centric languages, such as recursive rule based languages, have been proposed to program distributed applications over networks. They simplify greatly the code, whic...
INFOCOM
2011
IEEE
12 years 12 months ago
2011
IEEE
Abstract—Several recently proposed multicast protocols use inpacket Bloom filters to encode multicast trees. These mechanisms are in principle highly scalable because no per-fl...
SIAMDM
2010
13 years 3 months ago
2010
We consider the following network design problem. We are given an undirected network with costs on the edges, a set of terminals, and an upper bound for each terminal limiting the ...
SENSYS
2004
ACM
14 years 1 months ago
2004
ACM
Previous approaches for computing duplicate-sensitive aggregates in sensor networks (e.g., in TAG) have used a tree topology, in order to conserve energy and to avoid double-count...
TON
2008
13 years 8 months ago
2008
Estimating distances in the Internet has been studied in the recent years due to its ability to improve the performance of many applications, e.g., in the peer-topeer realm. One sc...