A Routing Algorithm of Data in Networks of Metro and Mega Cities
Author(s):
Sujit Kumar Bose
Keywords:
Router network, link cost, near straight line path, algorithm.
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.
Article Details
Unique Paper ID: 153912

Publication Volume & Issue: Volume 8, Issue 9

Page(s): 185 - 187
Article Preview & Download


Share This Article

Conference Alert

NCSST-2023

AICTE Sponsored National Conference on Smart Systems and Technologies

Last Date: 25th November 2023

SWEC- Management

LATEST INNOVATION’S AND FUTURE TRENDS IN MANAGEMENT

Last Date: 7th November 2023

Go To Issue



Call For Paper

Volume 10 Issue 1

Last Date for paper submitting for March Issue is 25 June 2023

About Us

IJIRT.org enables door in research by providing high quality research articles in open access market.

Send us any query related to your research on editor@ijirt.org

Social Media

Google Verified Reviews