Sciweavers

625 search results - page 13 / 125
» Routing in Trees
Sort
View
ASPDAC
2012
ACM
247views Hardware» more  ASPDAC 2012»
13 years 5 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
COMCOM
2006
101views more  COMCOM 2006»
14 years 10 months ago
A combined group/tree approach for scalable many-to-many reliable multicast
Abstract--In this paper we present the design, implementation, and performance analysis of Group-Aided Multicast (GAM), a scalable many-tomany reliable multicast transport protocol...
Wonyong Yoon, Dongman Lee, Hee Yong Youn, Seung-Ik...
ICPPW
1999
IEEE
15 years 2 months ago
An On-Demand Shared Tree with Hybrid State for Multicast Routing in Ad Hoc Mobile Wireless Networks
This paper describes the Multicast Shared Tree Protocol MSTP that has been designed to support the delivery of multicast packets in a mobile ad hoc network. MSTP uses a shared tre...
Elena Pagani, Gian Paolo Rossi
FPGA
2003
ACM
117views FPGA» more  FPGA 2003»
15 years 3 months ago
PipeRoute: a pipelining-aware router for FPGAs
We present a pipelining-aware router for FPGAs. The problem of routing pipelined signals is different from the conventional FPGA routing problem. For example, the two terminal N-D...
Akshay Sharma, Carl Ebeling, Scott Hauck
COMCOM
2010
246views more  COMCOM 2010»
14 years 8 months ago
Tabu search algorithm for RP selection in PIM-SM multicast routing
: - To construct a multicast tree is the basis of multicast data transmission. The prime problem concerning the construction of a shared multicast tree is to determine the position...
Hua Wang, Xiangxu Meng, Min Zhang, Yanlong Li