Sciweavers

625 search results - page 31 / 125
» Routing in Trees
Sort
View
CORR
2010
Springer
178views Education» more  CORR 2010»
14 years 7 months ago
Is Light-Tree Structure Optimal for Multicast Routing in Sparse Light Splitting WDM Networks?
To minimize the number of wavelengths required by a multicast session in sparse light splitting Wavelength Division Multiplexing (WDM) networks, a light-hierarchy structure, which ...
Fen Zhou, Miklós Molnár, Bernard Cou...
DAC
1998
ACM
15 years 2 months ago
Global Routing with Crosstalk Constraints
—Due to the scaling down of device geometry and increasing of frequency in deep submicron designs, crosstalk between interconnection wires has become an important issue in very l...
Hai Zhou, D. F. Wong
NETGAMES
2003
ACM
15 years 3 months ago
Priority-based distribution trees for application-level multicast
In this paper, we propose a novel multicast routing algorithm that is based on application-level priorities and network characteristics: The application may specify an individual ...
Jürgen Vogel, Jörg Widmer, Dirk Farin, M...
JCM
2006
76views more  JCM 2006»
14 years 10 months ago
Hierarchical Aggregation of Multicast Trees in Large Domains
Multicast tree aggregation is a technique that reduces the control overhead and the number of states induced by multicast. The main idea of this protocol is to route several groups...
Joanna Moulierac, Alexandre Guitton, Miklós...
SODA
2004
ACM
151views Algorithms» more  SODA 2004»
14 years 11 months ago
Minimum moment Steiner trees
For a rectilinear Steiner tree T with a root, define its k-th moment Mk(T) = T (dT (u))k du, where the integration is over all edges of T, dT (u) is the length of the unique path ...
Wangqi Qiu, Weiping Shi