Sciweavers

625 search results - page 77 / 125
» Routing in Trees
Sort
View
ICDCS
2005
IEEE
14 years 3 months ago
Resilient Capacity-Aware Multicast Based on Overlay Networks
The global deployment of IP multicast has been slow due to the difficulties related to heterogeneity, scalability, manageability, and lack of a robust inter-domain multicast rout...
Zhan Zhang, Shigang Chen, Yibei Ling, Randy Chow
ISVLSI
2007
IEEE
184views VLSI» more  ISVLSI 2007»
14 years 4 months ago
Activity-Aware Registers Placement for Low Power Gated Clock Tree Construction
As power consumption of the clock tree dominates over 40% of the total power in modern high performance VLSI designs, measures must be taken to keep it under control. One of the m...
Weixiang Shen, Yici Cai, Xianlong Hong, Jiang Hu
ICCAD
2001
IEEE
84views Hardware» more  ICCAD 2001»
14 years 6 months ago
Minimum-Buffered Routing of Non-Critical Nets for Slew Rate and Reliability Control
In high-speed digital VLSI design, bounding the load capacitance at gate outputs is a well-known methodology to improve coupling noise immunity, reduce degradation of signal trans...
Charles J. Alpert, Andrew B. Kahng, Bao Liu, Ion I...
SPAA
1996
ACM
14 years 2 months ago
Constant Time per Edge is Optimal on Rooted Tree Networks
We analyze the relationship between the expected packet delay in rooted tree networks and the distribution of time needed for a packet to cross an edge using convexity-based stoch...
Michael Mitzenmacher
SIGCOMM
1994
ACM
14 years 2 months ago
An Architecture for Wide-Area Multicast Routing
Existing multicast routing mechanisms were intended for use within regions where a group is widely represented or bandwidth is universally plentiful. When group members, and sende...
Stephen E. Deering, Deborah Estrin, Dino Farinacci...