Sciweavers

5079 search results - page 636 / 1016
» Hidden-Action in Network Routing
Sort
View
INFOCOM
1999
IEEE
15 years 11 months ago
Inference of Multicast Routing Trees and Bottleneck Bandwidths Using End-to-end Measurements
Abstract-- The efficacy of end-to-end multicast transport protocols depends critically upon their ability to scale efficiently to a large number of receivers. Several research mult...
Sylvia Ratnasamy, Steven McCanne
CN
2006
91views more  CN 2006»
15 years 6 months ago
End-host controlled multicast routing
The last decade has seen a deluge of proposals for supporting multicast in the Internet. These proposals can be categorized as either infrastructure-based, with the multicast func...
Karthik Lakshminarayanan, Ananth Rao, Ion Stoica, ...
157
Voted
COR
2007
88views more  COR 2007»
15 years 6 months ago
Finding minimum and equitable risk routes for hazmat shipments
This paper deals with the generation of minimal risk paths for the road transportation of hazardous materials between an origin–destination pair of a given regional area. The ma...
Pasquale Carotenuto, Stefano Giordani, Salvatore R...
CCR
2004
151views more  CCR 2004»
15 years 6 months ago
Practical verification techniques for wide-area routing
Protocol and system designers use verification techniques to analyze a system's correctness properties. Network operators need verification techniques to ensure the "cor...
Nick Feamster
ALGORITHMICA
1999
102views more  ALGORITHMICA 1999»
15 years 6 months ago
Approximating Latin Square Extensions
In this paper, we consider the following question: what is the maximum number of entries that can be added to a partially lled latin square? The decision version of this question ...
Ravi Kumar, Alexander Russell, Ravi Sundaram