IMDEA Networks Institute Publications Repository

Is the Network Capable of Computation?

Perešíni, Peter and Kostic, Dejan (2013) Is the Network Capable of Computation? In: The 3rd International Workshop on Rigorous Protocol Engineering (WRiPE 2013), 7 October 2013, Gottingen, Germany.

[img]
Preview
PDF ( Is the Network Capable of Computation?) - Published Version
Download (211Kb) | Preview

Abstract

Ensuring correct network behavior is hard. Previous state of the art has demonstrated that analyzing a network containing middleboxes is hard. In this paper, we show that even using only statically configured switches, and asking the simplest possible question – “Will this concrete packet reach the destination?” – can make the problem intractable. Moreover, we demonstrate that this is a fundamental property because a network can perform arbitrary computations. Namely, we show how to emulate the Rule 110 cellular automaton using only basic network switches with simple features such as packet matching, header rewriting and round-robin load balancing. This ultimately means that analyzing dynamic network behavior can be as hard as analyzing an arbitrary program.

Item Type: Conference or Workshop Papers (Paper)
Subjects: UNSPECIFIED
Divisions: UNSPECIFIED
Depositing User: Andrea ISIMINGER
Date Deposited: 21 Nov 2013 09:59
Last Modified: 03 Mar 2014 09:10
URI: http://eprints.networks.imdea.org/id/eprint/622

Actions (login required)

View Item View Item