Sciweavers

625 search results - page 29 / 125
» Semi-preemptive routing on trees
Sort
View
CJ
2002
81views more  CJ 2002»
15 years 5 months ago
Lower Bounds for One-to-one Packet Routing on Trees using Hot-Potato Algorithms
Alan Roberts, Antonios Symvonis, David R. Wood
NETWORKS
2000
15 years 5 months ago
Minimizing number of wavelengths in multicast routing trees in WDM networks
Deying Li, Xiufeng Du, Xiao-Dong Hu, Lu Ruan, Xiao...
CORR
2010
Springer
178views Education» more  CORR 2010»
15 years 3 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...
EURODAC
1995
IEEE
133views VHDL» more  EURODAC 1995»
15 years 9 months ago
Tree restructuring approach to mapping problem in cellular-architecture FPGAs
A new technique for mapping combinational circuits to Fine-Grain Cellular-Architecture FPGAs is presented. The proposed tree restructuring algorithm preserves local connectivity a...
Naveen Ramineni, Malgorzata Chrzanowska-Jeske, Nav...
CORR
2007
Springer
132views Education» more  CORR 2007»
15 years 6 months ago
On Compact Routing for the Internet
The Internet’s routing system is facing stresses due to its poor fundamental scaling properties. Compact routing is a research field that studies fundamental limits of routing ...
Dmitri V. Krioukov, Kimberly C. Claffy, Kevin R. F...