Sciweavers

272 search results - page 41 / 55
» On properties of multicast routing trees
Sort
View
SODA
2004
ACM
151views Algorithms» more  SODA 2004»
13 years 9 months ago
Minimum moment Steiner trees
For a rectilinear Steiner tree T with a root, define its k-th moment Mk(T) = T (dT (u))k du, where the integration is over all edges of T, dT (u) is the length of the unique path ...
Wangqi Qiu, Weiping Shi
DSOM
2000
Springer
13 years 12 months ago
A Scalable Architecture for Monitoring and Visualizing Multicast Statistics
An understanding of certain network functions is critical for successful network management. Managers must have insight into network topology, protocol performance and fault detec...
Prashant Rajvaidya, Kevin C. Almeroth, Kimberly C....
INFOCOM
2003
IEEE
14 years 25 days ago
Exploring the trade-off between label size and stack depth in MPLS Routing
— Multiprotocol Label Switching or MPLS technology is being increasingly deployed by several of the largest Internet service providers to solve problems such as traffic engineer...
Anupam Gupta, Amit Kumar, Rajeev Rastogi
P2P
2003
IEEE
108views Communications» more  P2P 2003»
14 years 25 days ago
Multicast in DKS(N, k, f) Overlay Networks
Recent developments in the area of peer-to-peer computing show that structured overlay networks implementing distributed hash tables scale well and can serve as infrastructures fo...
Luc Onana Alima, Ali Ghodsi, Sameh El-Ansary, Per ...
ISVLSI
2005
IEEE
80views VLSI» more  ISVLSI 2005»
14 years 1 months ago
Sensitivity Analysis of a Cluster-Based Interconnect Model for FPGAs
Mesh interconnect can be efficiently utilized while tree networks encourage the short routing distances. In this paper, we present the property analysis of a cluster-based interc...
Renqiu Huang, Ranga Vemuri