ACM SIGCOMM Computer Communication Review · 2006 · 192 citations · 24 references
Hardware SecurityRouting SystemNetwork Routing AlgorithmEngineeringGraph TheoryRouting ProtocolEdge ComputingNetwork RoutingNetwork AnalysisRoutingScalable RoutingRobust RoutingComputer ScienceExplicit Source RoutingCombinatorial OptimizationData SecurityCryptographySource Routes
We present the design of a routing system in which end-systems set tags to select non-shortest path routes as an alternative to explicit source routes. Routers collectively generate these routes by using tags as hints to independently deflect packets to neighbors that lie off the shortest-path. We show how this can be done simply, by local extensions of the shortest path machinery, and safely, so that loops are provably not formed. The result is to provide end-systems with a high-level of path diversity that allows them to bypass unde-sirable locations within the network. Unlike explicit source routing, our scheme is inherently scalable and compatible with ISP policies because it derives from the deployed Internet routing. We also sug-gest an encoding that is compatible with common IP usage, making our scheme incrementally deployable at the granularity of individual routers.
24
David G. Andersen, Hari Balakrishnan, Frans Kaashoek et al. · 2001 · 1.9K citations
Network Monitoring, Resilient Overlay Network, Network Science +12
Measuring ISP topologies with rocketfuel
Neil Spring, Ratul Mahajan, David Wetherall · 2002 · 1.3K citations
Cluster Computing, Internet Traffic Analysis, Engineering +16
Practical network support for IP traceback
Stefan Savage, David Wetherall, Anna R. Karlin et al. · ACM SIGCOMM Computer Communication Review · 2000 · 1.1K citations · Full text
Internet Traffic Analysis, Engineering, Information Security +17
<i>Core</i> -stateless fair queueing
Ion Stoica, Scott Shenker, Hui Zhang · 1998 · 496 citations
The end-to-end effects of Internet path selection
Stefan Savage, Andy Collins, Eric Hoffman et al. · 1999 · 474 citations