Scipediacontent: Scipediacontent moved page Draft Content 947294346 to Walker et al 2014a

2021-02-01T21:51:39Z

Scipediacontent moved page Draft Content 947294346 to Walker et al 2014a

Scipediacontent: Created page with " == Abstract == Monitoring the flow of traffic along network paths is essential for SDN programming and troubleshooting. For example, traffic engineering requires measuring t..."

2021-02-01T21:51:36Z

Created page with " == Abstract == Monitoring the flow of traffic along network paths is essential for SDN programming and troubleshooting. For example, traffic engineering requires measuring t..."

New page

== Abstract ==

Monitoring the flow of traffic along network paths is essential for SDN programming and troubleshooting. For example, traffic engineering requires measuring the ingress-egress traffic matrix; debugging a congested link requires determining the set of sources sending traffic through that link; and locating a faulty device might involve detecting how far along a path the traffic makes progress. Past path-based monitoring systems operate by diverting packets to collectors that perform "after-the-fact" analysis, at the expense of large data-collection overhead. In this paper, we show how to do more efficient "during-the-fact" analysis. We introduce a query language that allows each SDN application to specify queries independently of the forwarding state or the queries of other applications. The queries use a regular-expression-based path language that includes SQL-like "groupby" constructs for count aggregation. We track the packet trajectory directly on the data plane by converting the regular expressions into an automaton, and tagging the automaton state (i.e., the path prefix) in each packet as it progresses through the network. The SDN policies that implement the path queries can be combined with arbitrary packet-forwarding policies supplied by other elements of the SDN platform. A preliminary evaluation of our prototype shows that our "during-the-fact" strategy reduces data-collection overhead over "after-the-fact" strategies.

== Original document ==

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

* [http://www.cs.princeton.edu/~jrex/papers/pathquery14.pdf http://www.cs.princeton.edu/~jrex/papers/pathquery14.pdf]

* [https://collaborate.princeton.edu/en/publications/compiling-path-queries-in-software-defined-networks https://collaborate.princeton.edu/en/publications/compiling-path-queries-in-software-defined-networks],
: [http://conferences.sigcomm.org/sigcomm/2014/doc/slides/217.pdf http://conferences.sigcomm.org/sigcomm/2014/doc/slides/217.pdf],
: [https://dblp.uni-trier.de/db/conf/sigcomm/hotsdn2014.html#NarayanaRW14 https://dblp.uni-trier.de/db/conf/sigcomm/hotsdn2014.html#NarayanaRW14],
: [http://core.ac.uk/display/24046131 http://core.ac.uk/display/24046131],
: [https://doi.acm.org/10.1145/2620728.2620736 https://doi.acm.org/10.1145/2620728.2620736],
: [https://www.researchwithnj.com/en/publications/compiling-path-queries-in-software-defined-networks-2 https://www.researchwithnj.com/en/publications/compiling-path-queries-in-software-defined-networks-2],
: [https://core.ac.uk/display/24046131 https://core.ac.uk/display/24046131],
: [https://academic.microsoft.com/#/detail/2046001440 https://academic.microsoft.com/#/detail/2046001440]

* [http://dl.acm.org/ft_gateway.cfm?id=2620736&ftid=1493783&dwn=1 http://dl.acm.org/ft_gateway.cfm?id=2620736&ftid=1493783&dwn=1],
: [http://dx.doi.org/10.1145/2620728.2620736 http://dx.doi.org/10.1145/2620728.2620736]

← Older revision	Revision as of 21:51, 1 February 2021
(No difference)

Walker et al 2014a - Revision history

Scipediacontent: Scipediacontent moved page Draft Content 947294346 to Walker et al 2014a

Scipediacontent: Created page with " == Abstract == Monitoring the flow of traffic along network paths is essential for SDN programming and troubleshooting. For example, traffic engineering requires measuring t..."