625 search results - page 66 / 125 » Routing in Trees |
DAC
1989
ACM
14 years 2 months ago
1989
ACM
: We discuss a new approach to constructing the rectilinear Steiner tree (RST) of a given set of points in the plane, starting from a minimum spanning tree (MST). The main idea in ...
FPGA
2001
ACM
14 years 2 months ago
2001
ACM
The routing architecture of an FPGA consists of the length of the wires, the type of switch used to connect wires (buffered, unbuffered, fast or slow) and the topology of the inte...
LCN
2005
IEEE
14 years 3 months ago
2005
IEEE
This paper presents a novel end host multicast protocol (DSM) on top of the mesh overlays for P2P networks. Unlike the previous schemes, the major feature of DSM is that it does n...
DEXA
2010
Springer
13 years 10 months ago
2010
Springer
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
NGC
2000
Springer
14 years 1 months ago
2000
Springer
We examine the use of a hop-limit constraint with techniques to provide survivability for connection-oriented ATM group communications. A hop-limit constraint is an approach that ...