A routing calculi with dynamic routing tables

Abstract

newline We prepare a new routing calculus named DRand#966; newline newlineand#960; , an adaption of routing calculus which dynamically newlineupdates the routing table using distance vector routing updates in a distributed computing networks. newlineOur calculus is a three category syntactic expression where routers form a undirected graph for their newlineconnectivity which is not a clique; nodes where processes reside are directly connected to some router. newlineThe proposed calculus has a distinct feature where routing tables updates take place over a periodic newline newlineinterval by exchanging them between the adjacent routers in real time. This ensures that router re- newlineturns the optimal path choice during message propagation between the communicating processes. We newline newlineclaim that this calculus is closer to actual distributed network in a process algebraic framework. We newline newlinejustify our calculus by showing that a touchstone equivalence defined between well formed configura- newlinetions over reduction semantics can be recovered through bisimulation based equivalence over labeled newline newlinetransition system (lts) and vice-versa.