Log in

Relevant bibliographies by topics / Bellman-Ford routing algorithm

Contents

Journal articles
Book chapters
Conference papers

Academic literature on the topic 'Bellman-Ford routing algorithm'

Author: Grafiati

Published: 4 June 2025

Last updated: 8 July 2025

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Bellman-Ford routing algorithm.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Bellman-Ford routing algorithm"

1

Saxena, Mohit Chandra, Munish Sabharwal, and Preeti Bajaj. "An Optimised Shortest Path Algorithm for Network Rotuting & SDN." International Journal on Recent and Innovation Trends in Computing and Communication 11, no. 8s (2023): 20–31. http://dx.doi.org/10.17762/ijritcc.v11i8s.7172.

Full text

Abstract:

Network routing algorithms form the backbone of data transmission in modern network architectures, with implications for efficiency, speed, and reliability. This research aims to critically investigate and compare three prominent routing algorithms: Bellman-Ford, Shortest Path Faster Algorithm (SPFA), and our novel improved variant of Bellman-Ford, the Space-efficient Cost-Balancing Bellman-Ford (SCBF). We evaluate the performance of these algorithms in terms of time and space complexity, memory utilization, and routing efficacy, within a simulated network environment. Our results indicate that while Bellman-Ford provides consistent performance, both SPFA and SCBF present improvements in specific scenarios with the SCBF showing notable enhancements in space efficiency. The innovative SCBF algorithm provides competitive performance and greater space efficiency, potentially making it a valuable contribution to the development of network routing protocols. Further research is encouraged to optimize and evaluate these algorithms in real-world network conditions. This study underscores the continuous need for algorithmic innovation in response to evolving network demands.

APA, Harvard, Vancouver, ISO, and other styles

2

Motghare, Preshit, Gaurav Ulekar, Sudarshan Biradar, and Prof Dipti Pandit. "Hybrid Algorithm Combining Bellman-Ford, Dijkstra, and Machine Learning for Dynamic Network Routing." International Journal for Research in Applied Science and Engineering Technology 12, no. 11 (2024): 2368–77. https://doi.org/10.22214/ijraset.2024.65581.

Full text

Abstract:

Abstract: Optimizing routing in dynamic networks has emerged as an increasingly important problem today with re- duced latency, guaranteed connectivity and efficient data trans- fer under a variety of changing conditions. Among the more well known shortest path algorithms those of Bellman-Ford and Dijkstra’s have very notable advantages and disadvantages themselves; while Bellman-Ford has provisions against negative weighted edges and pays a penalty in computation, Dijkstra’s algorithm cannot work with negative weighted edges but is highly efficient. It introduces a new hybrid routing algorithm that makes intelligent choices between the classical Bellman-Ford and Dijk- stra’s using machine learning techniques. This model, through historical analysis of data on traffic data and network metrics, predicts the level of congestion and identifies that algorithm which is most efficient in the selection of a call for routing. It switches over to Bellman-Ford if congestion expectation is high or if it contains negative weights, whereas under stable network conditions, it employs Dijkstra’s due to its efficiency. Preliminary experiments reveal that this adaptive strategy optimizes both computation overhead and route selection accuracy in large scale dynamic networking environments. Our results indicate improvements in routing efficiency in complex networks based on predictive analytics from established algorithms

APA, Harvard, Vancouver, ISO, and other styles

3

Ghimire, Roshani, and Ram Kumar Basnet. "Shortest Path Routing Performance Evaluation over SDN Environment." December 2023 5, no. 4 (2023): 405–22. http://dx.doi.org/10.36548/jei.2023.4.004.

Full text

Abstract:

Static routing has a manual configuration setup system, and the scope of static routing in an SDN network is just for small networks. The solution to this problem rises up with the new technology deﬁned as software-deﬁned networking (SDN) based on shortest path ﬁrst dynamic routing. SDN has the facility of a centralized controller that smooth the controls and routes computation over a data packet. The performance analysis of SDN networks that have SDN switches connected to the network based on the shortest path ﬁrst protocol are simulated on Mininet. The POX controller with Mininet programming feature for creating smart topologies was chosen. In this research, the SDN network using Dijkstra’s algorithm, Bellman-Ford algorithm, extended Dijkstra’s algorithm and Floyd Warshall Algorithm were implemented. The quality factors of SDN created by using four algorithms are measured in terms of delay, jitter, latency, packet loss, transmit, received, throughput, and bandwidth based on experimental results and European Telecommunications Standards Institute (ETSI) data. The performance parameters of SDN network topology created using Dijkstra’s, bellman ford, extended Dijkstra’s, and Floyd Warshall algorithms were compared and the experimental results showed that Bellman-Ford algorithm is better in terms of performance parameters than the other three algorithms.

APA, Harvard, Vancouver, ISO, and other styles

4

Sulaiman, Oris Krianto, Amir Mahmud Siregar, Khairuddin Nasution, and Tasliyah Haramaini. "Bellman Ford algorithm - in Routing Information Protocol (RIP)." Journal of Physics: Conference Series 1007 (April 2018): 012009. http://dx.doi.org/10.1088/1742-6596/1007/1/012009.

Full text

APA, Harvard, Vancouver, ISO, and other styles

5

Cholla, Dr Raman. "Optimizing the Bellman-Ford Algorithm Using GPU Parallelization." INTERNATIONAL JOURNAL OF SCIENTIFIC RESEARCH IN ENGINEERING AND MANAGEMENT 09, no. 05 (2025): 1–9. https://doi.org/10.55041/ijsrem47660.

Full text

Abstract:

ABSTRACT The Bellman-Ford algorithm's temporal complexity of O(VE) renders it ineffective for big and dense networks, which is a serious computational disadvantage. The need for effective algorithms that can handle large-scale graph structures has increased due to the modern digital landscape's rapid data expansion. The Single Source Shortest Path (SSSP) problem, which entails determining the shortest pathways from a single source vertex to every other vertex in a graph, is one of the most basic and extensively researched topics in graph theory. Numerous real-world applications, including biological network modelling, social media analysis, telecommunications routing, and navigation systems, are based on this issue. The Bellman-Ford algorithm stands out among the other algorithms created to address the SSSP problem because it can handle networks with negative weight edges and detect negative weight cycles, two features that more effective algorithms like Dijkstra's do not allow. Our project investigates using Graphics Processing Units (GPUs) to parallelise the Bellman-Ford algorithm in order to get around this restriction. With thousands of cores, GPUs are made for extremely parallel calculations and provide significant speedups over conventional CPU-based processing for jobs that can be divided into discrete, independent work units. We developed a GPUaccelerated version of the Bellman-Ford algorithm by utilising NVIDIA's parallel computing platform, CUDA (Compute Unified Device Architecture). Keywords Computer Unified Device Architecture (CUDA), Graphics Processing Units (GPUs), and the Single Source Shortest Path (SSSP) problem.

APA, Harvard, Vancouver, ISO, and other styles

6

Kumar Rao, Kavikondala Praveen, and Tamilarasan Senthil Murugan. "An Efficient Routing Algorithm for Software Defined Networking using Bellman Ford Algorithm." International Journal of Online and Biomedical Engineering (iJOE) 15, no. 14 (2019): 87. http://dx.doi.org/10.3991/ijoe.v15i14.11546.

Full text

Abstract:

<p class="0abstract">Software-Defined Networking (SDN) is the developing technology and has the advantages of handling dynamic nodes in the network with improved performance. SDN has the problem of allocating the resources to the user with high latency and this affects the overall system performance. To solve this problem, the routing method based on Bellman Ford Algorithm (BFA) is proposed in the SDN. The Bellman-Ford has less computation time in identifying the shortest path in the nodes of SDN graph. The BFA is applied to identify the optimal path for the nodes to the user with low latency. The BFA is compared with Dijikstra’s algorithm to analyze its performance. The experimental outcome shows that the BFA has lower latency compared to the Dijkstra's algorithm. The lower computation time is achieved due to BFA has a lower magnitude time in vertices and edges compared Dijkstra's algorithm. The Dijkstra’s algorithm has the latency of 10.8 ms, while proposed BFA has the latency of 2.97ms.</p>

APA, Harvard, Vancouver, ISO, and other styles

7

Shen, Xue Zhen, and Xin Guo Tang. "Dynamic Routing Algorithm Based on HIP Multicast Model." Advanced Materials Research 424-425 (January 2012): 607–11. http://dx.doi.org/10.4028/www.scientific.net/amr.424-425.607.

Full text

Abstract:

A HIP multicast mode; based dynamic multicast routing algorithm (HIPDMR) was brought out and network model was established to describe and simplify problem to be researched. HIPDMR used Bellman-Ford as routing search algorithm, which can determine dynamic multicast routing with minimum hop number and overhead while meet constraints of bandwidth, delay, jitter and packet loss rate. Simulation experiments result show that HIPDMR can build dynamic multicast routing under constraints of multiple QoS comparing with algorithms that not considering QoS assuming network node output link capacity be equal

APA, Harvard, Vancouver, ISO, and other styles

8

Chertkov, Alexandr A., Yaroslav N. Kask, and Ludmila B. Ochina. "STREAMING NETWORK ROUTING BASED ON BELLMAN-FORD ALGORITHM MODIFICATION." Vestnik Gosudarstvennogo universiteta morskogo i rechnogo flota imeni admirala S. O. Makarova 14, no. 4 (2022): 615–27. http://dx.doi.org/10.21821/2309-5180-2022-14-4-615-627.

Full text

Abstract:

The operational task of automating the construction and routing of the network model with the known coordinates of the conditional goals set for a group of vessels to achieve them in the minimum time is solved; it makes it possible to obtain the reserves of running time necessary for saving fuel and energy, taking into account the load, the cost of cargo, transportation costs, logistics characteristics, etc. It is emphasized that in stormy weather conditions and vessel management in situations related to schedule correction, flexible operational decisions of dispatching services, made on the basis of numerical optimization methods using modern computing environments, are necessary. In this regard, the method of dynamic programming, implemented using the Bellman-Ford routing algorithm, which is supplemented by a recursive step-by-step optimization procedure that removes the limitation of the algorithm in the presence of inversely oriented edges with negative weights in the graph, is discussed in the paper. In the presence of negative weights, there are conditions for the appearance of a negative cycle in the graph, in which the practical implementation of the Bellman-Ford algorithm will become impossible due to an endless cycle of relaxations (attenuation) of the vertices weights included in this cycle. Hence, at a limited period of time for weighing all vertices (passes on all edges), the algorithm can give a knowingly false result. The proposed procedure for modifying the well-known Bellman-Ford algorithm eliminates this limitation and allows it to be used not only for estimating the shortest paths in a network containing arcs with negative weights, but also to detect negative cycles in it. The modified Bellman-Ford algorithm is implemented as a program compiled in MATLAB codes, and it is demonstrated by the example of automated construction and calculation of a network model containing both positive and negative edges (flows), using a recursive procedure of step-by-step optimization. It is shown that the proposed model, unlike the known models, eliminates the limitations caused by the presence of negative cycles in the network model, which makes it possible to automate the search for the shortest paths to conditional goals by the functional means of the MATLAB environment. The constructed computer model is simple and compact. The proposed algorithm and the recursive procedure are recommended for finding energy-efficient solutions for managing mobile objects in water transport.

APA, Harvard, Vancouver, ISO, and other styles

9

Salman et al., Mustafa I. "Software Defined Network of Video Surveillance System Based on Enhanced Routing Algorithms." Baghdad Science Journal 17, no. 1(Suppl.) (2020): 0391. http://dx.doi.org/10.21123/bsj.2020.17.1(suppl.).0391.

Full text

Abstract:

Software Defined Network (SDN) is a new technology that separate the ‎control plane from the data plane. SDN provides a choice in automation and ‎programmability faster than traditional network. It supports the ‎Quality of Service (QoS) for video surveillance application. One of most ‎significant issues in video surveillance is how to find the best path for routing the packets ‎between the source (IP cameras) and destination (monitoring center). The ‎video surveillance system requires fast transmission and reliable delivery ‎and high QoS. To improve the QoS and to achieve the optimal path, the ‎SDN architecture is used in this paper. In addition, different routing algorithms are ‎used with different steps. First, we evaluate the video transmission over the SDN with ‎Bellman Ford algorithm. Then, because the limitation of Bellman ford ‎algorithm, the Dijkstra algorithm is used to change the path when a congestion occurs. Furthermore, the Dijkstra algorithm is used with two ‎controllers to reduce the time consumed by the SDN controller. ‎ POX and Pyretic SDN controllers are used such that POX controller is ‎responsible for the network monitoring, while Pyretic controller is responsible for the ‎routing algorithm and path selection. Finally, a modified Dijkstra algorithm is further proposed and evaluated with two ‎controllers to enhance the performance. The results show that the modified Dijkstra algorithm outperformed the other approaches in the aspect of QoS parameters.

APA, Harvard, Vancouver, ISO, and other styles

10

Chen, You Rong, Li Yu, Qi Fen Dong, and Zhen Hong. "Distributed Lifetime Optimized Routing Algorithm for Wireless Sensor Networks." Applied Mechanics and Materials 40-41 (November 2010): 448–52. http://dx.doi.org/10.4028/www.scientific.net/amm.40-41.448.

Full text

Abstract:

The network hub nodes consumed excessive energy and failed prematurely, thus it reduced the network lifetime. In order to solve the problem, distributed lifetime optimized routing algorithm (DLOR) for wireless sensor networks was proposed. Energy for transmitting data and neighbor node residual energy were considered comprehensively. Then new weight function was introduced and distributed asynchronous Bellman-Ford algorithm was also used to construct the shortest routing tree. Finally, data were gathered along the shortest routing tree to sink node. Simulation results show that DLOR algorithm can extend network lifetime and enable cost-effective energy consumption. Under certain conditions, DLOR algorithm outperforms PEDAP, GreedyDijkstra, LET, Ratio-w and Sum-w algorithms.

APA, Harvard, Vancouver, ISO, and other styles

More sources

Book chapters on the topic "Bellman-Ford routing algorithm"

1

Cavendish, D., and M. Gerla. "Internet QoS Routing using the Bellman-Ford Algorithm." In High Performance Networking. Springer US, 1998. http://dx.doi.org/10.1007/978-0-387-35388-3_37.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Jeong, In-Kyu, Jia Uddin, Myeongsu Kang, Cheol-Hong Kim, and Jong-Myon Kim. "Accelerating a Bellman–Ford Routing Algorithm Using GPU." In Lecture Notes in Electrical Engineering. Springer Netherlands, 2014. http://dx.doi.org/10.1007/978-94-017-8798-7_19.

Full text

APA, Harvard, Vancouver, ISO, and other styles

3

Wungguli, Djihad, Hendra Gemu, Nurwan Nurwan, and Hasan S. Panigoro. "An Application of Bellman-Ford Algorithm on The Ambulance Routing." In Advances in Social Science, Education and Humanities Research. Atlantis Press SARL, 2025. https://doi.org/10.2991/978-2-38476-410-5_5.

Full text

APA, Harvard, Vancouver, ISO, and other styles

4

Curado, Marília. "Quality of Service Routing." In Encyclopedia of Internet Technologies and Applications. IGI Global, 2008. http://dx.doi.org/10.4018/978-1-59140-993-9.ch063.

Full text

Abstract:

Traditionally, Internet routing is achieved through shortest path protocols that base their decision on the number of hops or administrative metrics. The path computation algorithms belong either to the distance vector or link state families. Distance vector protocols have been widely used on the Internet since the ARPANET and remain in use today. The protocols of the Distance Vector family are used by routers to exchange routing information with their neighbours and to select the shortest paths to all destinations within the network using the Bellman-Ford algorithm, such as in the routing information protocol (RIP) (Malkin, 1998).

APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Bellman-Ford routing algorithm"

1

Tai, Xue, Hongbin Sun, Qinglai Guo, and Zihao Li. "A distributed power routing method between regional markets based on Bellman-Ford algorithm." In 2017 IEEE Conference on Energy Internet and Energy System Integration (EI2). IEEE, 2017. http://dx.doi.org/10.1109/ei2.2017.8245271.

Full text

APA, Harvard, Vancouver, ISO, and other styles

2

Awerbuch, B., A. Bar-Noy, and M. Gopal. "Approximate distributed Bellman-Ford algorithms (computer network routing)." In IEEE INFCOM '91. The conference on Computer Communications. Tenth Annual Joint Comference of the IEEE Computer and Communications Societies Proceedings. IEEE, 1991. http://dx.doi.org/10.1109/infcom.1991.147641.

Full text

APA, Harvard, Vancouver, ISO, and other styles

We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!