Analysis of Enhanced Associativity Based Routing Protocol.
Journal of Computer Science 2006, Dec, 2, 12
-
- £2.99
-
- £2.99
Publisher Description
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.
GENRE
Computing & Internet
RELEASED
2006
1 December
LANGUAGE
EN
English
LENGTH
18
Pages
PUBLISHER
Science Publications
SIZE
182.1
KB
Network Routing (Enhanced Edition)
2010
Advanced Internet Protocols, Services, and Applications
2012
Delivering Quality Of Services For Media Streaming Networks
2007
Computer Networks, the Internet and Next Generation Networks
2012
Wireless Networking and Mobile Data Management
2017
Junos Enterprise Routing
2011
Analysis of Virus Algorithms (Report)
2006
A Study of the Contracting and Procurement Process for COTS Software Projects (Commercial Off-The-Shelf)
2007
An Exact Algorithm for the Unbounded Knapsack Problem with Minimizing Maximum Processing Time.
2007
E-Government Readiness Assessment Model.
2006
Effective Factors on Iranian Consumers Behavior in Internet Shopping: A Soft Computing Approach (Report)
2009
New Cryptosystem Using Multiple Cryptographic Assumptions (Report)
2011