A Routing Calculus with Flooding Updates

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.

A Routing Calculus with Distance Vector Routing Updates

“…These reduction rules for DR ϕ π are given in Fig. 7 and directly inherited from [8], [10]. The Rule (R-OUT) is for delivery.…”

“…In definition 1, the concept of well formed configurations in DR ϕ π is inherited from [8] and the reduction rule (6) and 7are used to illustrate that when (R-COMM) and (R-MSG-FWD) occurs, reduction rule (R-TABLE-UPDATE) is prohibited for given network and vice-versa. These configuration rules will prevent looping and congestion in the network.…”

“…In recent years, developments in formal modeling of distributed networks in a process algebraic framework through process calculi has marked profound work [1], [2] [3], [4], [5], [6], [7], [8], [9], [10], [11], [12]. The extended version of Asynchronous Distributed π-calculus (AD π ) named as routing calculi DR ω π was one of the significant developments towards modeling the distributed computer network using an active component named router and considering the path of a communication between the communicating nodes where a routing table is a dynamic entity in a typical distributed network.…”