Corpus ID: 666410

Is the Network Turing-Complete? EPFL Technical Report 187131

@inproceedings{Peresni2013IsTN,
  title={Is the Network Turing-Complete? EPFL Technical Report 187131},
  author={Peter Peres{\'i}ni and D. Kosti{\'c}},
  year={2013}
}
  • Peter Peresíni, D. Kostić
  • Published 2013
  • Computer Science
  • Ensuring correct network behavior is hard. [...] Key Method We do so using just a set of network devices with simple features such as packet matching, header rewriting and round-robin loadbalancing. Therefore, we show that a network can emulate any Turing machine. This ultimately means that analyzing dynamic network behavior can be as hard as analyzing an arbitrary program. Analyzing a network containing middleboxes is already understood to be hard. Our result shows that using even only statically configured…Expand Abstract

    References

    Publications referenced by this paper.
    SHOWING 1-10 OF 16 REFERENCES
    Header Space Analysis: Static Checking for Networks
    • 623
    • Open Access
    Using routers to build logic circuits: How powerful is BGP?
    • 11
    • Open Access
    On static reachability analysis of IP networks
    • 223
    • Open Access
    P-completeness of Cellular Automaton Rule 110
    • 88
    • Open Access
    Implicit Simulations using Messaging Protocols
    • 5
    • Open Access
    Computational Complexity: A Modern Approach
    • 1,848
    Protocol Interactions and the Chosen Protocol Attack
    • 158
    • Open Access
    Theory and Applications of Cellular Automata
    • 1,538