A routing calculus with flooding updates

Gaur, M., Gay, S. J. and Mackie, I. (2015) A routing calculus with flooding updates. Lecture Notes in Computer Science, 8956, pp. 181-186. (doi: 10.1007/978-3-319-14977-6_12)

109018.pdf - Accepted Version



We propose a process calculus which explicitly models routing in a distributed computer network. We define a model which consists of a network of routers where the topology of routers is fixed. The calculus has three syntactic categories namely processes, nodes and systems. Processes reside in nodes which are connected to a specific routers which forms a system. Upon creation of new nodes, the routing tables are updated using flooding method. We show that the proposed routing calculi is reduction equivalent to its specification asynchronous distributed pi-calculus (ADpi). We believe that such modeling helps in prototyping the distributed routing algorithms.

Item Type:Articles
Additional Information:ISBN: 9783319149769
Glasgow Author(s) Enlighten ID:Gay, Professor Simon and Gaur, Dr Manish
Authors: Gaur, M., Gay, S. J., and Mackie, I.
College/School:College of Science and Engineering > School of Computing Science
Journal Name:Lecture Notes in Computer Science
Publisher:Springer International Publishing
Copyright Holders:Copyright © 2015 Springer International Publishing
First Published:First published in Lecture Notes in Computer Science 8956:181-186
Publisher Policy:Reproduced in accordance with the copyright policy of the publisher.

University Staff: Request a correction | Enlighten Editors: Update this record