Sciweavers

9 search results - page 2 / 2
» A Cost-Based Evaluation of End-to-End Network Measurements i...
Sort
View
AINA
2007
IEEE
14 years 1 months ago
Depth-Latency Tradeoffs in Multicast Tree Algorithms
The construction of multicast trees is complicated by the need to balance a number of important objectives, including: minimizing latencies, minimizing depth/hops, and bounding th...
Michael T. Helmick, Fred S. Annexstein
SIGCOMM
2003
ACM
14 years 21 days ago
Forwarding in a content-based network
This paper presents an algorithm for content-based forwarding, an essential function in content-based networking. Unlike in traditional address-based unicast or multicast networks...
Antonio Carzaniga, Alexander L. Wolf
SIGCOMM
2004
ACM
14 years 27 days ago
The feasibility of supporting large-scale live streaming applications with dynamic application end-points
While application end-point architectures have proven to be viable solutions for large-scale distributed applications such as distributed computing and file-sharing, there is lit...
Kunwadee Sripanidkulchai, Aditya Ganjam, Bruce M. ...
INFOCOM
2005
IEEE
14 years 1 months ago
Distributed querying of Internet distance information
— Estimation of network proximity among nodes is an important building block in several applications like service selection and composition, multicast tree formation, and overlay...
Rodrigo Fonseca, Puneet Sharma, Sujata Banerjee, S...