A Routing Algorithm of Data in Networks of Metro and Mega Cities

Abstract

Data transmission in networks is carried out by either the distance-vector or the link-state routing protocols, using the Bellman-Ford and the Dijkstra’s algorithms re- spectively for the least-cost path from a source to a destination. Inter-network is carried out by the path-vector routing protocol that also uses the Bellman-Ford algorithm. These protocols require dynamically shared maintenance of large charts by the nodal routers of the network. For a large network over the global earth, the author [7] has recently presented algorithms that adopts a near geodesic path connecting the source node to the destination node. However, when the nodes lie in the same city spread over a large area, the algorithm degenerates in to a simpler form. This paper presents an algorithm appro- priate for such cases.