Sciweavers

625 search results - page 37 / 125
» Semi-preemptive routing on trees
Sort
View
DAC
1994
ACM
14 years 19 days ago
Rectilinear Steiner Trees with Minimum Elmore Delay
We provide a new theoretical framework for constructing Steiner routing trees with minimum Elmore delay. Earlier work [3, 13] has established Elmore delay as a high delity estima...
Kenneth D. Boese, Andrew B. Kahng, Bernard A. McCo...
ICPADS
2005
IEEE
14 years 2 months ago
Distributed Spanning Tree Algorithms for Large Scale Traversals
— The Distributed Spanning Tree (DST) is an overlay structure designed to be scalable. It supports the growth from small scale to large scale. The DST is a tree without bottlenec...
Sylvain Dahan
TC
2010
13 years 6 months ago
Dynamic Multiway Segment Tree for IP Lookups and the Fast Pipelined Search Engine
—A dynamic multiway segment tree (DMST) is proposed for IP lookups in this paper. DMST is designed for dynamic routing tables that can dynamically insert and delete prefixes. DMS...
Yeim-Kuan Chang, Yung-Chieh Lin, Cheng-Chien Su
ISPD
2010
ACM
207views Hardware» more  ISPD 2010»
14 years 3 months ago
FOARS: FLUTE based obstacle-avoiding rectilinear steiner tree construction
Obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) construction is becoming one of the most sought after problems in modern design flow. In this paper we present FOARS, ...
Gaurav Ajwani, Chris Chu, Wai-Kei Mak
WCE
2007
13 years 9 months ago
QoS-aware Multicast Ad hoc On-Demand Distance Vector Routing
—Ad hoc networking will become a major technology for wireless connectivity beside the multimedia necessity within the next few years. There are too many applications where one-t...
Vida Lashkari B. O., Mehdi Dehghan