Pemodelan Proses Pemilihan Rute pada Protokol Babel dengan Activity Diagram dan Transition System

Vittalis Ayu

Abstract


Babel Routing Protocol was designed by Juliuz Chrobozcek and its written specification was published in RFC 6126 in April 2014. Babel is one of distance vector routing protocols that has its own distinctive features. Although it sends updates periodically to its neighbours, it also sends triggered updates whenever it detects its neighbour’s changes. The changes can include broken links and new link detections. Babel route selection process is also unique, because there are feasibility condition requirements to ensure that the routing loop does not exist during the routing process. Unified Modelling Language (UML) is a modelling language widely used in software engineering. Its popularity is based on its capability to express and describe different aspects of a software. Activity diagram is one of the UML models to describe the flow activity of a software execution. It answers and explains situations like the different states that the flow can reach and the prerequisite to reach the next states. On the other hand, transition systems describe the transition state of the running software. When a software is executed, we have to keep track of the state of the software. We need to describe how state can jump from one to anotherstate and what requirements to do the transition from one state to another one.It will be helpful inthe debugging process laterwhen some errors occur. However, the transition system can be derived from the activity diagram that has described the software flow. This researchis conducted to give more understanding about the flow of the route selection process in Babel Routing Protocol and describe the flow in the activity diagram and further define it with a transition system.

Full Text:

PDF

References


Jacquet P, Clausen T. Optimized Link State Routing Protocol (OLSR). RFC 3626. 2003.

Perkins C, Belding-Royer E. Ad hoc On-Demand Distance Vector (AODV) Routing. RFC 3561. Juli 2003.

Lougheed K, Rekhter Y. Border Gateway Protocol (BGP). RFC 1105. Juni 1989.

Hedrick C. Routing Information Protocol (RIP). RFC 1058. Juni 1988.

Moy J. OSPF Version 2. RFC 1247. Juli 1991.

Savage D, Ng J, Moore S, Slice D, Paluch P and White R. Cisco's Enhanced Interior Gateway Routing Protocol (EIGRP). RFC 7868. Mei 2016.

Perkins Charles E, Bhagwat Pravin. Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers. In Proceedings of the conference on Communications architectures, protocols and applications (SIGCOMM '94). 1994. ACM. New York, NY, USA.

Kulla Elis, Hiyama Masahiro, Ikeda Makoto, Barolli Leonard. Performance comparison of OLSR and BATMAN routing protocols by a MANET testbed in stairs environment. In Proceedings of Computers & Mathematics with Applications, Volume 63, Issue 2, 2012: 339-349.

Chroboczek J. The Babel Routing Protocol. RFC 6126. April 2011.

Abolhasan M, Hagelstein B, Wang J. Real-world Performance of Current Proactive Multi-hop Mesh Protocols. In Proceedings of the 15th Asia-Pacific Conference on Communications, APCC. 2009. IEEE Press, Piscataway, NJ, USA.

Seidl M, Scholz M, Huimer C, Kappel G. UML@Classroom:An Introduction to Object-Oriented Modeling. 2015.

Thramboulidis K, Mikroyannidis A. Using UML for the Design of Communication Protocols: The TCP case study. International Conference on Software, Telecommunications and Computer Networks, SoftCOM. Januari 2003.

Baier C, Katoen J. Principles of Model Checking. 2008. MIT Press. London, England.

Jonglez B, Boutier M, Chroboczek J. A delay-based routing metric. Computing Research Repository (CoRR). arXiv:1403.3488v1. Maret 2014.




DOI: http://dx.doi.org/10.24071/mt.v12i1.947

Refbacks

  • There are currently no refbacks.