Scipediacontent at 08:54, 23 October 2020

2020-10-23T08:54:14Z

Scipediacontent: Scipediacontent moved page Draft Content 736284900 to Hu et al 2018a

2020-10-22T14:11:59Z

Scipediacontent moved page Draft Content 736284900 to Hu et al 2018a

Scipediacontent: Created page with " == Abstract == Abstract: "The ability to locate network bottlenecks along end-to-end paths on the Internet is of great interest to both network operators and researchers. Fo..."

2020-10-22T14:11:54Z

Created page with " == Abstract == Abstract: "The ability to locate network bottlenecks along end-to-end paths on the Internet is of great interest to both network operators and researchers. Fo..."

New page

== Abstract ==

Abstract: "The ability to locate network bottlenecks along end-to-end paths on the Internet is of great interest to both network operators and researchers. For example, knowing where bottleneck links are, network operators can apply traffic engineering either at the interdomain or intradomain level to improve routing. Existing bandwith measurement tools fail to identify the location of bottleneck links. In addition, they often require access to both end points and generate huge amount [sic] of probing packets. These drawbacks make them impractical. In this paper, we present a novel light-weight, single-end active probing tool -- Pathneck -- based [sic] a novel probing technique called Recursive Packet Train (RPT), which allows end users to efficiently and accurately locate bottleneck points to destinations on the Internet. We evaluate Pathneck using trace-driven emulations and wide area Internet experiments. In addition, we conduct extensive measurements on the Internet among carefully selected, geographically diverse probing sources and destinations to study Internet bottleneck properties. We find that Pathneck can successfully detect bottlenecks for over 70% of paths, and most of the bottlenecks are fairly stable. We also report our success on bottleneck inference, using multihoming and overlay routing to avoid bottlenecks based on the bottleneck link location and bandwidth estimation provided by Pathneck."

Document type: Report

== Full document ==
<pdf>Media:Draft_Content_736284900-beopen42-6018-document.pdf</pdf>

== Original document ==

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

* [http://dx.doi.org/10.1184/r1/6607022 http://dx.doi.org/10.1184/r1/6607022]

* [http://dx.doi.org/10.1184/r1/6607022.v1 http://dx.doi.org/10.1184/r1/6607022.v1]

* [http://dx.doi.org/10.21236/ada461104 http://dx.doi.org/10.21236/ada461104]

* [http://www.dtic.mil/dtic/tr/fulltext/u2/a461104.pdf http://www.dtic.mil/dtic/tr/fulltext/u2/a461104.pdf]

* [http://www.cs.cmu.edu/~hnn/papers/bottleneck.pdf http://www.cs.cmu.edu/~hnn/papers/bottleneck.pdf],[http://www.cs.columbia.edu/~lierranli/publications/SIGCOMM04.pdf http://www.cs.columbia.edu/~lierranli/publications/SIGCOMM04.pdf],[http://conferences.sigcomm.org/sigcomm/2004/papers/p443-hu11.pdf http://conferences.sigcomm.org/sigcomm/2004/papers/p443-hu11.pdf],[http://www.cs.cornell.edu/courses/cs619/2004fa/documents/p443-hu11.pdf http://www.cs.cornell.edu/courses/cs619/2004fa/documents/p443-hu11.pdf],[https://dl.acm.org/citation.cfm?id=1015474 https://dl.acm.org/citation.cfm?id=1015474],[http://www.cs.northwestern.edu/~akuzma/classes/CS495-s05/doc/lib1.pdf http://www.cs.northwestern.edu/~akuzma/classes/CS495-s05/doc/lib1.pdf],[http://oai.dtic.mil/oai/oai?verb=getRecord&metadataPrefix=html&identifier=ADA461104 http://oai.dtic.mil/oai/oai?verb=getRecord&metadataPrefix=html&identifier=ADA461104],[http://portal.acm.org/citation.cfm?id=1015467.1015474 http://portal.acm.org/citation.cfm?id=1015467.1015474],[http://repository.cmu.edu/compsci/2266 http://repository.cmu.edu/compsci/2266],[http://reports-archive.adm.cs.cmu.edu/anon/anon/usr/anon/2004/CMU-CS-04-123.pdf http://reports-archive.adm.cs.cmu.edu/anon/anon/usr/anon/2004/CMU-CS-04-123.pdf],[https://doi.acm.org/10.1145/1015467.1015474 https://doi.acm.org/10.1145/1015467.1015474],[https://doi.org/10.1145/1015467.1015474 https://doi.org/10.1145/1015467.1015474],[https://academic.microsoft.com/#/detail/2162071412 https://academic.microsoft.com/#/detail/2162071412]

* [http://dl.acm.org/ft_gateway.cfm?id=1015474&ftid=274211&dwn=1 http://dl.acm.org/ft_gateway.cfm?id=1015474&ftid=274211&dwn=1],[http://dx.doi.org/10.1145/1030194.1015474 http://dx.doi.org/10.1145/1030194.1015474]

DOIS: 10.1145/1030194.1015474 10.1184/r1/6607022.v1 10.1184/r1/6607022 10.21236/ada461104

@@ Line 7: / Line 7: @@
 == Full document ==
-<pdf>Media:Draft_Content_736284900-beopen42-6018-document.pdf</pdf>
+<pdf>Media:Hu_et_al_2018a_5701_a461104.pdf</pdf>
-−
 == Original document ==

← Older revision	Revision as of 14:11, 22 October 2020
(No difference)

Hu et al 2018a - Revision history

Scipediacontent at 08:54, 23 October 2020

Scipediacontent: Scipediacontent moved page Draft Content 736284900 to Hu et al 2018a

Scipediacontent: Created page with " == Abstract == Abstract: "The ability to locate network bottlenecks along end-to-end paths on the Internet is of great interest to both network operators and researchers. Fo..."