Copyright © 2026 Authors retain the copyright of this article. This article is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.

@article{153912,
        author = {Sujit Kumar Bose},
        title = {A Routing Algorithm of Data in Networks of Metro and Mega Cities},
        journal = {International Journal of Innovative Research in Technology},
        year = {},
        volume = {8},
        number = {9},
        pages = {185-187},
        issn = {2349-6002},
        url = {https://ijirt.org/article?manuscript=153912},
        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.},
        keywords = {Router network, link cost, near straight line path, algorithm.},
        month = {},
        }