A Routing Calculus with Flooding Updates
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.
KeywordsRouting Process Calculi Flooding Specification Computational Cost
Unable to display preview. Download preview PDF.
- 3.Cormen, T.H., Leiserson, C.E., Rivest, R.L., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press (2003)Google Scholar
- 6.Griffin, T.G., Sobrinho, J.L.: Metarouting. In: SIGCOMM, pp. 1–12 (2005)Google Scholar
- 7.Hennessy, M.: A distributed Pi-Calculus. Cambridge University Press (2007)Google Scholar
- 9.Milner, R.: Communicating and mobile systems: The π-Calculus. Cambridge University Press (1999)Google Scholar
- 12.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)Google Scholar
- 13.Tanenbaum, A.S.: Computer Networks. Pearson Education, Inc., Upper Saddle River (2003)Google Scholar