Wakeman, Ian, Jeffrey, Alan, Owen, Tim and Pepper, Damyan (2001) SafetyNet: a language-based approach to programmable networks. Computer Networks, 36 (1). pp. 101-114. ISSN 1389-1286Full text not available from this repository.
It appears that some degree of programmability is inevitable within the network, whether it be through active networks, active services, or programmable middleware. We argue that programming network elements with languages designed for use within a single machine is inappropriate, since the only defense for the shared resource 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, SafetyNet. Building upon this, we have implemented a compiler, run time 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. We describe the implications of the language design for the implementation of the run time support environment. The ease with which these demonstrations have been built and debugged shows the potential for enforcing network programming models with well-typed languages.
|Schools and Departments:||School of Engineering and Informatics > Informatics|
|Subjects:||Q Science > QA Mathematics > QA0075 Electronic computers. Computer science|
|Depositing User:||Chris Keene|
|Date Deposited:||15 Aug 2007|
|Last Modified:||30 Nov 2012 16:52|
|Google Scholar:||17 Citations|