625 search results - page 2 / 125 » Routing in Trees |
SODA
1997
ACM
13 years 10 months ago
1997
ACM
The permutation routing problem is studied for trees under the matching model. By introducing a novel and useful (so-called) caterpillar tree partition, we prove that any permutati...
CCR
1998
13 years 8 months ago
1998
: Multicasting has an increasing importance for network applications such as groupware or videoconferencing. Several multicast routing protocols have been defined. However they can...
TCAD
2002
13 years 8 months ago
2002
Interconnect optimization for VLSI circuits has received wide attention. To model routing surfaces, multiple circuit layers are freabstracted as a single rectilinear plane, ignori...
ISCC
2000
IEEE
14 years 28 days ago
2000
IEEE
In this paper, we propose a new Tree Switching Protocol (TSP) to reduce multicast routing states required for a forest of multicast trees. The protocol accomplishes this goal by s...
WSS
1997
13 years 10 months ago
1997
We present a distributed protocol for maintaining a maximum flow spanning tree in a network, with a designated node as the root of the tree. This maximum flow spanning tree can be...