Scipediacontent: Scipediacontent moved page Draft Content 278036761 to Gvozdiev et al 2017a

2021-02-03T17:55:20Z

Scipediacontent moved page Draft Content 278036761 to Gvozdiev et al 2017a

Scipediacontent: Created page with " == Abstract == Early in in the Internet's history, routing within a single provider's WAN centered on placing traffic on the shortest path. More recent traffic engineering e..."

2021-02-03T17:55:17Z

Created page with " == Abstract == Early in in the Internet's history, routing within a single provider's WAN centered on placing traffic on the shortest path. More recent traffic engineering e..."

New page

== Abstract ==

Early in in the Internet's history, routing within a single provider's WAN centered on placing traffic on the shortest path. More recent traffic engineering efforts aim to reduce congestion and/or increase utilization within the status quo of greedy shortest-path first routing on a sparse topology. In this paper, we argue that this status quo of routing and topology is fundamentally at odds with placing traffic so as to minimize latency for users while avoiding congestion. We advocate instead provider backbone topologies that are more mesh-like, and hence better at providing multiple low-latency paths, and a routing system that directly considers latency minimization and congestion avoidance while dynamically placing traffic on multiple unequal-cost paths. We offer a research agenda for achieving this new low-latency approach to WAN topology design and routing.

== Original document ==

The different versions of the original document can be found in:

* [https://discovery.ucl.ac.uk/id/eprint/10039679/1/Karp_LowLatencyRoutingOnMeshLikeBackbones_hotnets17.pdf https://discovery.ucl.ac.uk/id/eprint/10039679/1/Karp_LowLatencyRoutingOnMeshLikeBackbones_hotnets17.pdf]

* [http://dl.acm.org/ft_gateway.cfm?id=3152453&ftid=1927309&dwn=1 http://dl.acm.org/ft_gateway.cfm?id=3152453&ftid=1927309&dwn=1],
: [http://dx.doi.org/10.1145/3152434.3152453 http://dx.doi.org/10.1145/3152434.3152453] under the license http://www.acm.org/publications/policies/copyright_policy#Background

* [https://dblp.uni-trier.de/db/conf/hotnets/hotnets2017.html#GvozdievVKH17 https://dblp.uni-trier.de/db/conf/hotnets/hotnets2017.html#GvozdievVKH17],
: [https://dl.acm.org/citation.cfm?id=3152453 https://dl.acm.org/citation.cfm?id=3152453],
: [https://doi.org/10.1145/3152434.3152453 https://doi.org/10.1145/3152434.3152453],
: [https://academic.microsoft.com/#/detail/2768333230 https://academic.microsoft.com/#/detail/2768333230]

* [https://discovery.ucl.ac.uk/id/eprint/10039679 https://discovery.ucl.ac.uk/id/eprint/10039679],
: [https://discovery.ucl.ac.uk/id/eprint/10039679/1/Karp_LowLatencyRoutingOnMeshLikeBackbones_hotnets17.pdf https://discovery.ucl.ac.uk/id/eprint/10039679/1/Karp_LowLatencyRoutingOnMeshLikeBackbones_hotnets17.pdf]

← Older revision	Revision as of 17:55, 3 February 2021
(No difference)

Gvozdiev et al 2017a - Revision history

Scipediacontent: Scipediacontent moved page Draft Content 278036761 to Gvozdiev et al 2017a

Scipediacontent: Created page with " == Abstract == Early in in the Internet's history, routing within a single provider's WAN centered on placing traffic on the shortest path. More recent traffic engineering e..."