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ϕπ .

Highlights

  • 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]

  • We present a new calculi DRφπ which is a direct adoption of routing calculus DRωπ table updates which is

  • We define a set of conditions on well formed configurations and prove them in DRφπ

Read more

Summary

A Routing Calculus with Distance Vector Routing Updates

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 is one of the implementations of Dπ. We nomenclate our calculus with routing table updates as DRφπ

INTRODUCTION
SYNTAX
System
STRUCTURAL EQUIVALENCE
REDUCTION SEMANTICS
EXAMPLE
WELL FORMED CONFIGURATIONS
EQUIVALENCE BETWEEN DRφπ AND Dπ
VIII. CONCLUSION
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call