Analysis of Enhanced Associativity Based Routing Protocol
Said A. Shaar, Fawaz A.M. Masoud, Ayman Murad, Riyad Al-Shalabi & Ghassan Kanaan
Journal of Computer Science, Volume 2, Issue 12, pp. 853–858 · doi.org/10.3844/jcssp.2006.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.
Licence and reuse
Free to read. This article carries the publisher’s copyright, as printed on it: © 2006 Science Publications. It is free to read; ask us before reusing it.
How to reuse this articleResponses (0)
About this article
Shaar, S. A., Masoud, F. A., Murad, A., Al-Shalabi, R. & Kanaan, G. (2006). Analysis of Enhanced Associativity Based Routing Protocol. Journal of Computer Science, 2(12), 853–858. https://doi.org/10.3844/jcssp.2006.853.858
- Licence
- © Science Publications
- Issue
- Volume 2, Issue 12
- Policies
- Editorial independenceUse of generative AIData availabilityAppeals and complaints
- Version
- Version of record