Sciweavers

953 search results - page 167 / 191
» A Heuristic for Channel Routing
Sort
View
INFOCOM
2006
IEEE
14 years 1 months ago
Placing Relay Nodes for Intra-Domain Path Diversity
Abstract— To increase reliability and robustness of missioncritical services in the face of routing changes, it is often desirable and beneficial to take advantage of path diver...
Meeyoung Cha, Sue B. Moon, Chong-Dae Park, Aman Sh...
ISPD
2005
ACM
174views Hardware» more  ISPD 2005»
14 years 1 months ago
Fast and accurate rectilinear steiner minimal tree algorithm for VLSI design
In this paper, we present a very fast and accurate rectilinear Steiner minimal tree (RSMT)1 algorithm called FLUTE. The algorithm is an extension of the wirelength estimation appr...
Chris C. N. Chu, Yiu-Chung Wong
ADHOC
2010
123views more  ADHOC 2010»
13 years 8 months ago
An analysis of the lifetime of OLSR networks
The Optimized Link State Routing (OLSR) protocol is a well-known route discovery protocol for ad-hoc networks. OLSR optimizes the flooding of link state information through the ne...
Jan-Maarten Verbree, Maurits de Graaf, Johann Huri...
CN
2007
91views more  CN 2007»
13 years 7 months ago
On investigating overlay service topologies
Recently, a moderate amount of work has been reported on the use of overlay networks to support value-added network services, such as multicasting, Quality of Service (QoS), secur...
Zhi Li, Prasant Mohapatra
TCAD
2008
128views more  TCAD 2008»
13 years 7 months ago
Obstacle-Avoiding Rectilinear Steiner Tree Construction Based on Spanning Graphs
Given a set of pins and a set of obstacles on a plane, an obstacle-avoiding rectilinear Steiner minimal tree (OARSMT) connects these pins, possibly through some additional points (...
Chung-Wei Lin, Szu-Yu Chen, Chi-Feng Li, Yao-Wen C...