Sciweavers

830 search results - page 27 / 166
» Route kernels for trees
Sort
View
SODA
1998
ACM
157views Algorithms» more  SODA 1998»
15 years 1 months ago
A Polynomial Time Approximation Scheme for Minimum Routing Cost Spanning Trees
Given an undirected graph with nonnegative costs on the edges, the routing cost of any of its spanning trees is the sum over all pairs of vertices of the cost of the path between t...
Bang Ye Wu, Giuseppe Lancia, Vineet Bafna, Kun-Mao...
COMCOM
2006
101views more  COMCOM 2006»
14 years 11 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...
MONET
2002
162views more  MONET 2002»
14 years 11 months ago
AMRoute: Ad Hoc Multicast Routing Protocol
The Ad hoc Multicast Routing protocol (AMRoute) presents a novel approach for robust IP Multicast in mobile ad hoc networks by exploiting user-multicast trees and dynamic logical c...
Jason Xie, Rajesh R. Talpade, Anthony McAuley, Min...
ICS
2009
Tsinghua U.
15 years 4 months ago
Exploring pattern-aware routing in generalized fat tree networks
New static source routing algorithms for High Performance Computing (HPC) are presented in this work. The target parallel architectures are based on the commonly used fattree netw...
Germán Rodríguez, Ramón Beivi...
126
Voted
ICDCS
2006
IEEE
15 years 5 months ago
High-Throughput Multicast Routing Metrics in Wireless Mesh Networks
The stationary nature of nodes in a mesh network has shifted the main design goal of routing protocols from maintaining connectivity between source and destination nodes to findi...
Sabyasachi Roy, Dimitrios Koutsonikolas, Saumitra ...