Bidirectional search procedure development for solving the transport software-defined network routing problem

Mobile ad hoc network represents a system of wireless mobile nodes that can freely and dynamically self-organize network topologies without any preexisting communication infrastructure. Due to characteristics like temporary topology and absence of centralized authority, routing is one of the major issues in ad hoc networks. In this paper, a new multipath routing scheme is proposed by employing simulated annealing approach. The proposed metaheuristic approach can achieve greater and reciprocal advantages in a hostile dynamic real world network situation. Therefore, the proposed routing scheme is a powerful method for finding an effective solution into the conflict mobile ad hoc network routing problem. Simulation results indicate that the proposed paradigm adapts best to the variation of dynamic network situations. The average remaining energy, network throughput, packet loss probability, and traffic load distribution are improved by about 10%, 10%, 5%, and 10%, respectively, more than the existing schemes.

Download Full-text

Inverting the Multiple-Assisting Tool Network Problem to Solve for Optimality

Advances in Operations Research ◽

10.1155/2020/3515709 ◽

2020 ◽

Vol 2020 ◽

pp. 1-13

Author(s):

Robert Rich

Keyword(s):

Material Handling ◽

Main Tool ◽

Network Routing ◽

Integer Program ◽

Mixed Integer ◽

Mixed Integer Program ◽

Routing Problem ◽

Network Problems ◽

Tool Set ◽

The Impact

Many network problems deal with the routing of a main tool comprised of several parallel assisting tools. These problems can be found with multi-tool-head routing of CNC machines, waterjets, plasma sprayers, and cutting machines. Other applications involve logistics, distribution, and material handling that require a main tool with assisting tools. Currently no studies exist that optimally route a main tool comprised of and fitted with multiple tools, nor do any studies evaluate the impact of adding additional capabilities to the tool set. Herein we define the network routing problem for a main tool comprised of multiple secondary tools. We introduce first principles to properly configure the main tool with the appropriate number of supporting tools such that that system is not overstatured. We invert the network geometry to extract the “best case” configuration for toolset configuration to include speed, range, and number of such that the system is lean. Our computational studies reveal that the theorems introduced herein greatly improve the overall system performance without oversaturating it with unused resources. In order to validate experiments, we define a mixed integer program and compare it to our metaheuristics developed for experimentation. Both the MIP and the metaheuristics herein optimally route a main tool with multiple assisting tools as well as the routing of a parcel delivery truck comprised of many drones.

Download Full-text

Distributed Learning Algorithms For Data Network Routing Problem: Models And Convergence Analysis

Proceedings of the 1988 IEEE International Conference on Systems, Man, and Cybernetics ◽

10.1109/icsmc.1988.754358 ◽

2005 ◽

Author(s):

A. Vasilakos ◽

S. Koubias

Keyword(s):

Convergence Analysis ◽

Learning Algorithms ◽

Distributed Learning ◽

Network Routing ◽

Routing Problem ◽

Data Network

Download Full-text

Implementasi Simulated Annealing untuk Penentuan Rute pada Jaringan

MATICS ◽

10.18860/mat.v13i2.12969 ◽

2021 ◽

Vol 13 (2) ◽

pp. 42-46

Author(s):

Gusti Eka Yuliastuti ◽

Citra Nurina Prabiantissa ◽

Agung Mustika Rizki

Keyword(s):

Simulated Annealing ◽

Simulated Annealing Algorithm ◽

Computer Network ◽

Travelling Salesman Problem ◽

Optimal Solution ◽

Network Routing ◽

Path Selection ◽

Travelling Salesman ◽

Routing Problem ◽

Stored Information

Abstract—Recently computer networks are increasingly complex. It needs to be a supporting device for network management such as a router. Router is a device that plays an important role in the routing process. In a router stored information in the form of routing paths, where the information includes data and which routers will be passed. In certain cases, a router can have more than one gateway. This is because the router needs to send data packets to several networks that have different segments. Such cases can be handled by using the appropriate routing path selection rules. The routing problem can be regarded as a traveling salesman problem (TSP), where a mechanism is needed to determine the shortest route to be traversed. The author implements the Simulated Annealing Algorithm because it can produce an optimal solution with light computing, so that the routing process can be more effective and efficient. Index Terms—Computer Network, Routing, Simulated Annealing, Travelling Salesman Problem Abstrak–-Jaringan komputer saat ini semakin kompleks. Perlu adanya suatu perangkat pendukung untuk manajemen jaringan seperti router. Router merupakan perangkat yang berperan penting dalam proses routing. Pada sebuah router tersimpan informasi berupa jalur routing, dimana informasi tersebut mencakup data dan router mana saja yang akan dilewati. Pada kasus tertentu, router dapat memiliki lebih dari satu gateway. Hal ini disebabkan karena router perlu mengirimkan paket data ke beberapa jaringan yang memiliki segmen berbeda. Kasus tersebut dapat ditangani dengan menggunakan aturan pemilihan jalur routing yang tepat. Permasalahan routing dapat dikatakan sebagai suatu permasalahan travelling salesman problem (TSP), dimana diperlukan suatu mekanisme dalam menentukan rute terpendek untuk dilalui. Penulis mengimplementasikan Algoritma Simulated Annealing karena dapat menghasilkan solusi yang optimal dengan komputasi ringan, sehingga proses routing dapat lebih efektif dan efisien. Kata Kunci—Jaringan Komputer, Penentuan Rute, Travelling Salesman Problem, Algoritma Simulated Annealing

Download Full-text