Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Barbanera, F., Bugliesi, M., Dezani-Ciancaglini, M., Sassone, V.: A calculus of bounded capacities. In: Saraswat, V.A. (ed.) ASIAN 2003. LNCS, vol. 2896, pp. 205–223. Springer, Heidelberg (2003)
Cardelli, L., Gordon, A.D.: Mobile ambients. Theor. Comput. Sci. 240(1), 177–213 (2000)
Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press (2003)
Gaur, M., Hennessy, M.: Counting the cost in the picalculus (extended abstract). Electronic Notes in Theoretical Computer Science (ENTCS) 229(3), 117–129 (2009)
Gay, S.J., Hole, M.: Subtyping for session types in the pi-calculus. Acta Inf. 42(2-3), 191–225 (2005)
Griffin, T.G., Sobrinho, J.L.: Metarouting. In: SIGCOMM, pp. 1–12 (2005)
Hennessy, M.: A distributed Pi-Calculus. Cambridge University Press (2007)
Hennessy, M., Rathke, J.: Typed behavioural equivalences for processes in the presence of subtyping. Mathematical Structures in Computer Science 14(5), 651–684 (2004)
Milner, R.: Communicating and mobile systems: The π-Calculus. Cambridge University Press (1999)
Nicola, R.D., Gorla, D., Pugliese, R.: Basic observables for a calculus for global computing. Inf. Comput. 205(10), 1491–1525 (2007)
Orava, F., Parrow, J.: An algebraic verification of a mobile network. Formal Asp. Comput. 4(6), 497–543 (1992)
Sewell, P., Wojciechowski, P.T., Pierce, B.C.: Location-independent communication for mobile agents: A two-level architecture. In: Bal, H.E., Cardelli, L., Belkhouche, B. (eds.) ICCL 1998 Workshop. LNCS, vol. 1686, pp. 1–31. Springer, Heidelberg (1999)
Tanenbaum, A.S.: Computer Networks. Pearson Education, Inc., Upper Saddle River (2003)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this paper
Cite this paper
Gaur, M., Gay, S.J., Mackie, I. (2015). A Routing Calculus with Flooding Updates. In: Natarajan, R., Barua, G., Patra, M.R. (eds) Distributed Computing and Internet Technology. ICDCIT 2015. Lecture Notes in Computer Science, vol 8956. Springer, Cham. https://doi.org/10.1007/978-3-319-14977-6_12
Download citation
DOI: https://doi.org/10.1007/978-3-319-14977-6_12
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-14976-9
Online ISBN: 978-3-319-14977-6
eBook Packages: Computer ScienceComputer Science (R0)