Sciweavers

765 search results - page 42 / 153
» Self-organization of Internet Paths
Sort
View
TON
2008
126views more  TON 2008»
13 years 7 months ago
Hyperbolic embedding of internet graph for distance estimation and overlay construction
Estimating distances in the Internet has been studied in the recent years due to its ability to improve the performance of many applications, e.g., in the peer-topeer realm. One sc...
Yuval Shavitt, Tomer Tankel
IMC
2009
ACM
14 years 2 months ago
Triangle inequality variations in the internet
Triangle inequality violations (TIVs) are important for latency sensitive distributed applications. On one hand, they can expose opportunities to improve network routing by findi...
Cristian Lumezanu, Randolph Baden, Neil Spring, Bo...
ICCCN
2008
IEEE
14 years 2 months ago
A Distributed Routing Algorithm for Networks with Data-Path Services
Abstract—Many next-generation Internet architectures propose advanced packet processing functions in the data path of the network. Such “services” are typically performed on ...
Xin Huang, Sivakumar Ganapathy, Tilman Wolf
AICCSA
2006
IEEE
126views Hardware» more  AICCSA 2006»
14 years 1 months ago
Restricted Shortest Path Routing with Concave Costs
Multi-constraint quality-of-service routing has become increasingly important as the Internet evolves to support real-time services. Restricted shortest path (RSP) is one of the i...
Pejman Khadivi, Shadrokh Samavi, Hossein Saidi
NSDI
2008
13 years 10 months ago
Studying Black Holes in the Internet with Hubble
We present Hubble, a system that operates continuously to find Internet reachability problems in which routes exist to a destination but packets are unable to reach the destinatio...
Ethan Katz-Bassett, Harsha V. Madhyastha, John P. ...