625 search results - page 20 / 125 » Routing in Trees |
139
Voted
COMCOM
2006
15 years 3 months ago
2006
In this paper, we address the routing and wavelength assignment problem for the core-based tree (CBT) service in a wavelength-division-multiplexing (WDM) network, where k sources ...
174
Voted
EURODAC
1995
IEEE
15 years 7 months ago
1995
IEEE
A new technique for mapping combinational circuits to Fine-Grain Cellular-Architecture FPGAs is presented. The proposed tree restructuring algorithm preserves local connectivity a...
157
Voted
GLOBECOM
2006
IEEE
15 years 9 months ago
2006
IEEE
Abstract— Wireless sensor networks (WSNs) employed in monitoring applications require data collected by the sensors to be deposited at specific nodes, referred to as drains. To ...
124
Voted
CAAN
2006
Springer
15 years 7 months ago
2006
Springer
We consider the problem of finding a short path between any two nodes of a network when no global information is available, nor any oracle to help in routing. A mobile agent, situa...
154
Voted
ISCAPDCS
2003
15 years 5 months ago
2003
The quick construction of the Shortest Path Tree (SPT) is essential to achieve fast routing speed for an interior network using link state protocols, such as OSPF and IS-IS. Whene...