Abstract
A survey is presented of present algorithms, with emphasis of a proposed scheme, the hierarchical hybrid adaptive routing algorithm (HHARA). HHARA reduces the size of routing database by dynamically organizing nodes into hierarchically structured clusters so that only partial information is stored and maintained in each site. The responsibility for routing is shared by the routing hierarchy so that the algorithm can maintain the global routing optimality and the local adaptivity at the same time. In this way, the storage, maintenance, communication, and computation overheads can be reduced while the response time to local status changes is kept small. HHARA can be used with either diagram routing or virtual circuit routing. Due to its ability to adapt to the network changes, it is specially useful for dynamic networks such as large military computer communication networks. >
Published Version
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call