An Efficient K-Shortest Paths Based Routing Algorithm

2012 ◽  
Vol 532-533 ◽  
pp. 1775-1779
Author(s):  
Jian Lian ◽  
Yan Zhang ◽  
Cheng Jiang Li
Keyword(s):  
Computer Networks ◽  
Shortest Path ◽  
Traffic Engineering ◽  
Routing Algorithm ◽  
Shortest Paths ◽  
Routing Algorithms ◽  
Dijkstra Algorithm ◽  
Link State

We present an efficient K-shortest paths routing algorithm for computer networks. This Algorithm is based on enhancements to currently used link-state routing algorithms such as OSPF and IS-IS, which are only focusing on finding the shortest path route by adopting Dijkstra algorithm. Its desire effect to achieve is through the use of K-shortest paths algorighm, which has been implemented successfully in some fileds like traffic engineering. The correctness of this Algorithm is discussed at the same time as long as the comparison with OSPF.

scholarly journals Antnet: A Robust Routing Algorithm for Data Networks

1970 ◽  
Vol 5 (1) ◽  
Author(s):  
Shariq Haseeb Khairul Azami Sidek Ahmad Faris Ismail, Lai W.K. ◽  
Aw Yit Mei
Keyword(s):  
Mobile Agents ◽  
Routing Algorithm ◽  
Routing Algorithms ◽  
Convergence Time ◽  
Data Networks ◽  
Successful Implementation ◽  
Link State ◽  
Performance Matrix ◽  
Telecommunications Network ◽  
Routing Tables

Successful implementation and operation of a network largely depends on the routing algorithm in use. To date, several routing algorithms are in use but the problem with these algorithms is that they are either not adaptive or not robust enough, thus limiting the proper use of bandwidth.  AntNet is an innovative algorithm that may be used for data networks. It is a combination of both static and dynamic routing algorithms. In this algorithm, a group of mobile agents (compared to real ants) form paths between source and destination nodes. They explore the network continuously and exchange obtained information indirectly, in order to update the routing tables at different nodes. Our version of AntNet (hereinafter referred to as AntNet2.0) has been improved to overcome the problems with other algorithms. This paper compares the performance of AntNet2.0 against two other commercially popular algorithms, viz. link state routing algorithm and distant vector routing algorithm. The performance matrix used to compare the algorithms is based on average throughput, packet loss, packet drop and end-to-end delay. Convergence time for this algorithm on a nation-wide telecommunications network will also be discussed. Conclusions and areas of further work will also be presented in lucid manner, so that it may be transformed into real practice in the future.Key Words: mobile agents, swarm intelligence, networks and constant bit rate

Design of High Speed Reconfigurable Distributed Life Time Efficient Routing Algorithm in Wireless Sensor Network

2020 ◽  
Vol 17 (9) ◽  
pp. 3860-3866
Author(s):  
M. L. Umashankar ◽  
S. Mallikarjunaswamy ◽  
M. V. Ramakrishna
Keyword(s):  
Shortest Path ◽  
High Speed ◽  
Routing Algorithm ◽  
Shortest Paths ◽  
Life Time ◽  
Wireless Sensor ◽  
Signal Interference ◽  
Energy Efficient Routing ◽  
Shortest Path Routing ◽  
Routing Techniques

Designing an energy-efficient routing makes the Wireless Sensor Networks (WSN) more effective and attractive for different applications. The WSN communication system power consumption mainly depends on three aspects such as routing cost computation, signal interference, and routing distance. All three factors are equally important in order to improve the network performance. The system reliability and deployment cost depends on the energy efficiency of the WSN. The energy related cost assignment and shortest paths identification are used in existing routing techniques. In the existing routing techniques maximum achievable lifetime and optimal link cost are low. Hence greatest possible performance can be achieved in distributed routing algorithm by finding shortest path. Maximum lifetime and best cost link can be generally obtained using distributed shortest path routing algorithm. In this paper high speed reconfigurable distributed Lifetime-Efficient Routing algorithm is designed to provide route selection outline with low complexity and obtain better performance compared to existing routing algorithm.

scholarly journals An ImprovedPhysarum polycephalumAlgorithm for the Shortest Path Problem

2014 ◽  
Vol 2014 ◽  
pp. 1-9 ◽  
Author(s):  
Xiaoge Zhang ◽  
Qing Wang ◽  
Andrew Adamatzky ◽  
Felix T. S. Chan ◽  
Sankaran Mahadevan ◽  
...  
Keyword(s):  
Shortest Path ◽  
Shortest Paths ◽  
Unconventional Computing ◽  
Dijkstra Algorithm ◽  
Ant Colony Optimization Algorithm ◽  
Slime Mould ◽  
Inoculation Site ◽  
Biological Substrate ◽  
Approximate Shortest Path ◽  
Number Of Iterations

Shortest path is among classical problems of computer science. The problems are solved by hundreds of algorithms, silicon computing architectures and novel substrate, unconventional, computing devices. Acellular slime mouldP. polycephalumis originally famous as a computing biological substrate due to its alleged ability to approximate shortest path from its inoculation site to a source of nutrients. Several algorithms were designed based on properties of the slime mould. Many of thePhysarum-inspired algorithms suffer from a low converge speed. To accelerate the search of a solution and reduce a number of iterations we combined an original model of Physarum-inspired path solver with a new a parameter, called energy. We undertook a series of computational experiments on approximating shortest paths in networks with different topologies, and number of nodes varying from 15 to 2000. We found that the improvedPhysarumalgorithm matches well with existing Physarum-inspired approaches yet outperforms them in number of iterations executed and a total running time. We also compare our algorithm with other existing algorithms, including the ant colony optimization algorithm and Dijkstra algorithm.

scholarly journals QoS Routing Algorithm Based on Entropy Granularity in the Network Transmission

2019 ◽  
Vol 19 (4) ◽  
pp. 61-72
Author(s):  
Xiaoling Li ◽  
Hai Hu
Keyword(s):  
Shortest Path ◽  
Rapid Development ◽  
Routing Algorithm ◽  
Routing Algorithms ◽  
Adaptive Genetic Algorithm ◽  
Service Capacity ◽  
Network Resources ◽  
Qos Routing Algorithm

Abstract With the rapid development of computer networks, more hosts are connected to the Internet where they could communicate with each other. The need for network service has exceeded the service capacity of the network, and the Quality of Service (QoS) is gradually declining. Based on existing Shortest Path First (SPF) algorithm, this paper proposes a new QoS required transmission path approach by considering the overhead balance of network resources. This paper uses the entropy granularity as the main line in the application of routing protocols. Firstly, it researches the optimization of routing algorithms for network load balancing resources, routing algorithms based on link traffic distributing weights, link weight optimization based on adaptive genetic algorithm and computational intelligence based on entropy granularity theory. This research proposes a method to apply entropy granularity to Open Shortest Path First (OSPF) routing, including the implementation of the method. After that, a case study is presented by using some examples.

scholarly journals Rancang Bangun Sistem Penentuan Jalur Evakuasi Keluar Gedung Rumah Sakit Saat Kondisi Darurat Menggunakan Algoritma Dijkstra Dengan Antrian Prioritas

2019 ◽  
Vol 3 (01) ◽  
pp. 30-38
Author(s):  
Dody Ichwana
Keyword(s):  
Shortest Path ◽  
Shortest Paths ◽  
Priority Queue ◽  
Dijkstra Algorithm ◽  
Loss Of Life ◽  
Public Facilities ◽  
Evacuation Strategy ◽  
Evacuation Routes ◽  
Evacuation Route ◽  
Great Damage

Disaster is a sudden event, such as an accident or a natural catastrophe, that causes great damage or loss of life. Disasters can occur at any time, therefore a mechanism is needed to evacuate out of the building during a disaster. Generally public facilities have provided instructions and evacuation routes outside the building. Based on the severity of the disaster and the evacuation capability of the victim, the evacuation strategy can range from evacuation as soon as possible, evacuate slowly, move to a safe location inside the building or take refuge in the available protection room and wait for the rescue team to arrive. The algorithm for finding the shortest paths can be used to determine the evacuation route. But this path is still static, if the route damaged in then the evacuation route would become useless. The time for the evacuation process can also increase if the condition of the evacuation route is not known whether damaged or not. The solution to solve this problem is to make a system that can help find  the safest and shortest evacuation routes during emergencies. This system consist of microcontroller Arduino Mega to control the system and led for evacuation sign. The evacuation routes is determined by implementing dijkstra algorithm with priority queue to search the shortest path.

scholarly journals Software Defined Network of Video Surveillance System Based on Enhanced Routing Algorithms

2020 ◽  
Vol 17 (1(Suppl.)) ◽  
pp. 0391
Author(s):  
Mustafa I. Salman et al.
Keyword(s):  
Video Surveillance ◽  
Surveillance System ◽  
New Technology ◽  
Routing Algorithm ◽  
Optimal Path ◽  
Routing Algorithms ◽  
Path Selection ◽  
Video Surveillance System ◽  
Software Defined Network ◽  
Dijkstra Algorithm

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.

scholarly journals Network Monitoring of the MHT Company Using the DUDe

2020 ◽  
Vol 19 ◽  
Keyword(s):  
Monitoring System ◽  
Shortest Path ◽  
Routing Protocol ◽  
Routing Algorithm ◽  
The State ◽  
Network System ◽  
Alert System ◽  
Link State ◽  
The Status ◽  
Monitoring Area

In the current study we present a monitoring of the MHT network system by using the DUDe. It is an effective monitoring system for administrators covering services to every client. The administrators are constantly striving to maintain smooth operation of their networks. The system enables to monitor the status changes particularly outside the monitoring area. In the observed system, we use the Open Shortest Path First protocol, which is based on the link state routing protocol concept and uses Dijkstra’s shortest path first routing algorithm. An alert system is built to the MHT network. It can be used to supervise the network and can report the state of the network by using an alert system in the monitoring area.

scholarly journals Model Optimasi Routing Protocol OSPF Pada Jaringan Wireless Mesh Dengan MPLS Traffic Engineering

2019 ◽  
Vol 14 (1) ◽  
pp. 45
Author(s):  
Medi Taruk ◽  
Masna Wati ◽  
Eny Maria
Keyword(s):  
Open Source ◽  
Shortest Path ◽  
Routing Protocol ◽  
Traffic Engineering ◽  
Wireless Mesh Network ◽  
Mesh Network ◽  
Label Switching ◽  
Link State ◽  
Wireless Mesh

Proses pertukaran informasi dan komunikasi data antar pengguna internet yang dilakukan di lokasi berbeda dan dalam waktu yang bersamaan dapat mengakibatkan semakin tinggi lalu lintas pertukaran informasi dalam suatu jaringan internet. Oleh karena itu, diperlukan adanya suatu mekanisme untuk menentukan dan pemilihan jalur lalu lintas data terbaik untuk dilalui paket data ketika proses pertukaran informasi dan komunikasi data berlangsung. Salah satu mekanisme untuk menentukan dan pemilihan jalur lalu lintas data tersebut adalah dengan menerapkan aturan pada perangkat router. OSPF (Open Shortest Path First) merupakan salah satu routing protocol yang memiliki lisensi kode terbuka (open source), OSPF menggunakan mekanisme routing link-state, kinerja OSPF ditentukan pada kebutuhan dan konsumsi bandwidth. Model optimasi yang dilakukan pada penelitian ini akan memberikan gambaran awal bagaimana suatu routing protocol OSPF bekerja dengan menerapkan teknologi traffic engineering pada wireless mesh network (WMN) menggunakan model multi protokol label switching (MPLS). Kemudian dilakukan analisis dan penilaian terhadap faktor-faktor terkait optimasi routing protocol OSPF dengan membuat rancangan topologi routing protokol OSPF pada jaringan wireless mesh dengan model jaringan MPLS menggunakan tools simulator jaringan.

Sign in / Sign up

Export Citation Format

Share Document