You signed in with another tab or window. Reload to refresh your session.You signed out in another tab or window. Reload to refresh your session.You switched accounts on another tab or window. Reload to refresh your session.Dismiss alert
Copy file name to clipboardExpand all lines: _config.yml
+1-1Lines changed: 1 addition & 1 deletion
Original file line number
Diff line number
Diff line change
@@ -85,7 +85,7 @@ authors:
85
85
name: Aditya Akella
86
86
site: http://pages.cs.wisc.edu/~akella/
87
87
avatar: /assets/images/aditya-akella.jpg
88
-
bio: "Aditya Akella is a Professor of Computer Sciences at the University of Wisconsin-Madison, where he leads the Wisconsin Internet and Systems Research (WISR) Lab, and a Visiting Scientist at Google. Aditya has also been a Visiting Researcher at Microsoft (2014), a Visiting Associate Professor at the University of Washington (2013), and a Postdoc at Stanford University (2005-2006). Aditya has received numerous awards, including an H.I. Romnes Faculty Fellowship (2018), SACM Student Choice Professor of the Year (COW) Award (2017, 2019), the Internet Engineering Task Force (IETF) Applied Networking Research Prize (2015), and the ACM SIGCOMM Rising Star Award (2014). Aditya received a Ph.D. in Computer Science from Carnegie Mellon University (2005) and a B.Tech. in Computer Science from Indian Insitute of Technology, Madras (2000)."
88
+
bio: "Aditya Akella is a Professor of Computer Sciences at the University of Wisconsin-Madison, where he leads the Wisconsin Internet and Systems Research (WISR) Lab, and a Visiting Scientist at Google. Aditya has also been a Visiting Researcher at Microsoft (2014), a Visiting Associate Professor at the University of Washington (2013), and a Postdoc at Stanford University (2005-2006). Aditya has received numerous awards, including a Finalist for the Blavatnik National Award for Young Scientists (2020), an H.I. Romnes Faculty Fellowship (2018), SACM Student Choice Professor of the Year (COW) Award (2017, 2019), the Internet Engineering Task Force (IETF) Applied Networking Research Prize (2015), and the ACM SIGCOMM Rising Star Award (2014). Aditya received a Ph.D. in Computer Science from Carnegie Mellon University (2005) and a B.Tech. in Computer Science from Indian Insitute of Technology, Madras (2000)."
Copy file name to clipboardExpand all lines: _posts/2020-06-30-talk-to-a-network-operator-today.md
+16-13Lines changed: 16 additions & 13 deletions
Display the source diff
Display the rich diff
Original file line number
Diff line number
Diff line change
@@ -12,7 +12,13 @@ Recently, we have seen significant advances in tools that bring formal methods t
12
12
While we have made big intellectual strides in developing these tools, it still feels like the beginning of a long journey. In our view, the research community as a whole has a ways to go before the tools are useful and widely applicable. And a major reason is the lack of close interaction with the network operator community.
13
13
14
14
This article is a call to arms to those researching in this space to have a
15
-
"network operator-buddy", actually, several operator-buddies. Talk to these buddies about their needs and pain-points; talk to them about obtaining access to operational data, and let the data guide your research as much as possible; talk to them about your ideas, and get them to use your tools! Our experience has been that this opens up not only interesting new research problems but also a direct path to real-world impact.
15
+
"network operator-buddy", actually, several operator-buddies. Talk to these
16
+
buddies about their needs and pain-points; talk to them about obtaining access
17
+
to operational data, and let the data guide your research as much as possible;
18
+
talk to them about your ideas, and get them to use your tools! Our experience
19
+
has been that this opens up not only interesting new research problems but
20
+
also a direct path to real-world impact. Such conversations can be especially
21
+
valuable for newcomers to this space.
16
22
17
23
Below we outline some highlights from our own exploration of this research topic, and how it was, and continues to be, largely informed by feedback and help from network operators and by insights derived from their invaluable data.
18
24
@@ -40,14 +46,9 @@ devices.
40
46
41
47
Crucially, we found critical empirical evidence that networks with a greater degree of change -- either frequent changes, or changes that are big in scope, or both -- were more susceptible to failures (as indicated by higher incidence of trouble tickets). This in particular hinted at a potentially important use case that the state-of-the-art dataplane verification tools may be missing, namely, proactive verification. Dataplane verification tools verify just the current snapshot of the network's forwarding state. Given the frequency of changes, and the relationship between changes and outages, we felt that network operators may also be interested in whether the modifications might result in violations of properties.
42
48
43
-
Our informal conversation with operators from [US Big-10](https://bigten.org)
44
-
schools (of which [UW-Madison](https://wisc.edu) is one) confirmed this for
45
-
us: operators indicate that they would much rather analyze configuration
46
-
changes before deployment, rather than identify bugs when they manifest after
47
-
deployment, by which time it is often already too late!
49
+
Our informal conversation with operators from [US Big-10](https://bigten.org) schools (of which [UW-Madison](https://wisc.edu) is one) confirmed this for us: operators indicate that they would much rather analyze configuration changes before deployment, rather than identify bugs when they manifest after deployment, by which time it is often already too late! About the same time, a group of researchers presented [Batfish](https://www.usenix.org/system/files/conference/nsdi15/nsdi15-paper-fogel.pdf) -- the first control plane verifier to ``derive the actual data plane that would emerge given a configuration and environment.'' Using Batfish, the researchers uncovered a variety of bugs in two real university networks.
48
50
49
-
Analyzing operational data and talking to operators thus opened the door to
50
-
our work on
51
+
Our own and others' analysis of operational data and discussions with operators thus opened the door to our work on
51
52
[ARC](https://aaron.gember-jacobson.com/docs/gember-jacobson2016arc.pdf) and
52
53
subsequently, [Tiramisu](https://www.usenix.org/system/files/nsdi20-paper-abhashkumar.pdf), tools for proactive verification of network control planes.
53
54
@@ -80,18 +81,20 @@ encode the various metrics routing protocols use in their decision-making.
80
81
81
82
## Identifying new directions
82
83
83
-
Operators continue to offer us valuable insights on our verification tools that have steered our work in an interesting new direction.
84
+
Operators continue to offer us valuable insights on our verification tools
85
+
that have steered our work in an interesting new direction, and helped us
86
+
identify which problems are the most important to work on.
84
87
85
88
Notably, at a presentation on ARC and Tiramisu at a large online service
86
89
provider, a network operator asked us if the graph-based control plane
87
90
abstractions underlying these tools can be used to validate if a given network
88
91
is susceptible to overload: more precisely, does there exist a combination of
89
92
a group of links failing and a network traffic matrix that causes the
90
93
network's control plane to select paths that may overload certain links? This
91
-
is an example of a "quantitative verification question" that existing tools
92
-
cannot answer because of their exclusive focus on qualitative path properties
93
-
(such as path existence, number of paths, etc). This led to our work on
94
-
[QARC](http://wisr.cs.wisc.edu/papers/pldi20qarc.pdf), a tool for exhaustively checking networks for potential susceptibilities to overload. We hope to talk about QARC at length in a future article.
94
+
is an example of a "quantitative verification question" that existing
95
+
proactive verification tools cannot answer because of their exclusive focus on
96
+
qualitative path properties (such as path existence, number of paths, etc).
97
+
Interestingly, the same question arose in a discussion we had with operators at UW-Madison. This led to our work on [QARC](http://wisr.cs.wisc.edu/papers/pldi20qarc.pdf), a tool for exhaustively checking networks for potential susceptibilities to overload. We hope to talk about QARC at length in a future article.
0 commit comments