Sciweavers

830 search results - page 23 / 166
» Route kernels for trees
Sort
View
INFOCOM
2000
IEEE
15 years 4 months ago
A QoS-Aware Multicast Routing Protocol
—The future Internet is expected to support multicast applications with quality of service (QoS) requirements. To facilitate this, QoS multicast routing protocols are pivotal in ...
Shigang Chen, Klara Nahrstedt, Yuval Shavitt
ICC
2008
IEEE
141views Communications» more  ICC 2008»
15 years 6 months ago
Greedy Hop Distance Routing Using Tree Recovery on Wireless Ad Hoc and Sensor Networks
—Connectivity-based routing protocols use the hop count vector to a group of anchors for packet forwarding. Due to the discrete nature of hop count based coordinates, without an ...
Shao Tao, Akkihebbal L. Ananda, Mun Choon Chan
ASPDAC
2005
ACM
73views Hardware» more  ASPDAC 2005»
15 years 5 months ago
An-OARSMan: obstacle-avoiding routing tree construction with good length performance
- Routing is one of the important steps in VLSI/ULSI physical design. The rectilinear Steiner minimum tree (RSMT) construction is an essential part of routing. Since macro cells, I...
Yu Hu, Tong Jing, Xianlong Hong, Zhe Feng 0002, Xi...
ICCAD
2006
IEEE
119views Hardware» more  ICCAD 2006»
15 years 8 months ago
FastRoute: a step to integrate global routing into placement
Because of the increasing dominance of interconnect issues in advanced IC technology, placement has become a critical step in the IC design flow. To get accurate interconnect inf...
Min Pan, Chris C. N. Chu
ASPDAC
2012
ACM
247views Hardware» more  ASPDAC 2012»
13 years 7 months ago
Through-silicon-via-induced obstacle-aware clock tree synthesis for 3D ICs
— In this paper, we present an obstacle-aware clock tree synthesis method for through-silicon-via (TSV)-based 3D ICs. A unique aspect of this problem lies in the fact that variou...
Xin Zhao, Sung Kyu Lim