Journal of Computer Science

Analysis of Enhanced Associativity Based Routing Protocol

Said A. Shaar, Fawaz A.M. Masoud, Ayman Murad, Riyad Al-Shalabi and Ghassan Kanaan

DOI : 10.3844/jcssp.2006.853.858

Journal of Computer Science

Volume 2, Issue 12

Pages 853-858

Abstract

This study introduces an analysis to the performance of the Enhanced Associativity Based Routing protocol (EABR ) based on two factors; Operation complexity (OC) and Communication Complexity (CC). OC can be defined as the number of steps required in performing a protocol operation, while CC can be defined as the number of messages exchanged in performing a protocol operation[1]. The values represent the worst-case analysis. The EABR has been analyzed based on CC and OC and the results have been compared with another routing technique called ABR. The results have shown that EABR can perform better than ABR in many circumstances during the route reconstruction.

Copyright

© 2006 Said A. Shaar, Fawaz A.M. Masoud, Ayman Murad, Riyad Al-Shalabi and Ghassan Kanaan. This is an open access article distributed under the terms of the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original author and source are credited.