pith. sign in

arxiv: 1510.02705 · v1 · pith:B33JOOO6new · submitted 2015-10-08 · 💻 cs.NI

From Rough Consensus to Automated Reasoning

classification 💻 cs.NI
keywords networkingrulesclaimdifferenteffortsfirstgrammarproblem
0
0 comments X
read the original abstract

Unwritten languages today often have no official grammar, and are rather governed by "unspoken rules". Similarly, we argue that the young discipline of networking is still a practice that lacks a deep understanding of the rules that govern it. This situation results in a tremendous loss of time and efforts. First, since the rules are unspoken, they are not systematically reused. Second, since there is no grammar, it is impossible to assert if a sentence is correct. Comparing two networking approaches or solutions is sometimes a synonym of endless religious debates. Drawing the proper conclusion from this claim, we advocate that networking research should spend more efforts on better understanding its rules as a first step to automatically reuse them. To illustrate our claim, we focus in this paper on one specific networking problem, and show how different instances of this same problem were solved in parallel, resulting in different solutions, and no explicit knowledge reuse.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.