الفهرس 
Basic Routing AlgorithmsOnly 14 pages are availabe for public view
 |  | from | 32 |  |  |
| | | from | 32 | | |
Abstract
In this thesis, conventional routing algorithms (Distance Vector Routing, Link-State Routing and hybrid Routing) are studied. Traditional routing protocols (RIP, RIP2, OSPF and EIGRP) are examined. Convergence time is addressed as a major problem that affects the performance of the routing process. Lack of scalability and security weakness of RIP are explained. High complexity of OSPF is described. Two multiagent-based systems are suggested to alleviate the problems of these two well-known protocols.
A novel design of multiagent-based system is conducted to manage the routing process. Framework architecture of that system is introduced. Modified packet format is suggested. Packets contain sufficient and necessary data to perform the routing process. Composite metric of cost, delay, link and other metrics are used. Modern dynamic programming algorithms such as forward recursion algorithm and backward recursion algorithm are used in Path determination. Convergence time is calculated. Lack of scalability is tackled. The security scheme is considered. The complexity of Link-State protocols is reduced. In addition to, Router’s database has a smaller size.
The framework architecture of multiagent-based system is considered as major step to build a complete block of multiagent-based system for internetworking and data communication.