A language-based approach to programmable networks

It appears that some degree of programmability is inevitable within a network, whether it be through active networks, active services or programmable middleware. We argue that programming network elements with languages that were designed for use within a single machine is inappropriate, since the only defence for the shared resources of the network is through the use of sandboxes, which are prone to performance problems and are difficult to implement correctly. Instead, we believe that new languages should be designed for programmable networks, using type systems that ensure safe programs and encourage correct programs. We have designed and provided the full semantics for such a language. Building upon this, we have implemented a compiler, a runtime environment and a simulation environment for our language. In this paper, we describe the major features of the language that protect the network: abstracted locations, located objects, volatile routing, thread and class loading, and enforced resource counting. We show how these features are used in a number of small case studies and in implementing optimised communication libraries. The ease with which these demonstrations have been built and debugged shows the potential for enforcing network programming models with well-typed languages