58 search results - page 4 / 12 » Optimal Multicast Tree Routing for Cluster Computing in Hype... |
SPAA
1996
ACM
13 years 11 months ago
1996
ACM
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...
IPPS
1998
IEEE
13 years 11 months ago
1998
IEEE
A unicast-based multicasting algorithm is presented for arbitrary interconnection networks arising in switchbased networks of workstations. The algorithm is optimal with respect t...
SIGCOMM
1996
ACM
13 years 11 months ago
1996
ACM
Wormhole routing LANs are emerging as an effective solution for high-bandwidth, low-latency interconnects in distributed computing and cluster computing applications. An important...
SOFSEM
1997
Springer
13 years 11 months ago
1997
Springer
: In this paper we rst present a general lower bound on the stabilization time which holds for a number of graph theoretic problems, including leader election, spanning tree constr...
NETWORKING
2010
13 years 8 months ago
2010
The construction of light-trees is one principal subproblem for multicast routing in sparse splitting Wavelength Division Multiplexing (WDM) networks. Due to the light splitting co...