Vicinity Routing in Large Scale Networks

E cient routing has been one of the most challenging and extensive researched topics in the communication networks eld. During recent years, collecting the topology and network state information essential for the routing to everynodehas become a popular approach. The most common technique for solving this task termed a link state protocol (or topology update protocol). Unfortunately, using this technique in large networks introduces a problem of handling a large amount of data and information updates. Most of the solutions to this problem refer to hierarchical division of the network into smaller clusters. Our solution takes a di erent direction. The algorithm de nes a vicinity around each node that is to be updated with the change in the local node and link in-formation. For the routing of information outside the vicinity an hierarchical yet exible structure of borders node is de ned. The route is calculated up to the nearest border and from this point a new calculation is made. This new architec-ture eliminates the need of dividing the network into clusters, in particular solving the ine ciency when such partition is done manually. We have alsoinvestigate the ability to aggregate further information regarding remote parts of the network, hence, reducing the amount of storage and updates required.