No abstract

No abstract

No abstract

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 picalculus (ADpi). We believe that such modeling helps in prototyping the distributed routing algorithms.

No abstract

No abstract

No abstract

No abstract