Abstract: We propose a routing calculus in a process algebraic framework to implement dynamic updates of routing table using distance vector routing. This calculus is an extension of an existing routing calculus DRωπ where routing tables are fixed except when new nodes are created in which case the routing tables are appended with relevant entries. The main objective of implementing dynamic routing updates is to demonstrate the formal modeling of distributed networks which is closer to the networks in practice. We justify our calculus by showing its reduction equivalence with its specification Dπ (distributed π-calculus) after abstracting away the unnecessary details from our calculus which in fact is one of the implementations of Dπ. We nomenclate our calculus with routing table updates as DRϕπ .

Priyanka Gupta and Manish Gaur, “A Routing Calculus with Distance Vector Routing Updates” International Journal of Advanced Computer Science and Applications(IJACSA), 9(10), 2018. http://dx.doi.org/10.14569/IJACSA.2018.091067

@article{Gupta2018,
title = {A Routing Calculus with Distance Vector Routing Updates},
journal = {International Journal of Advanced Computer Science and Applications},
doi = {10.14569/IJACSA.2018.091067},
url = {http://dx.doi.org/10.14569/IJACSA.2018.091067},
year = {2018},
publisher = {The Science and Information Organization},
volume = {9},
number = {10},
author = {Priyanka Gupta and Manish Gaur}
}