IMPROVED ALGORITHM FOR THE PACKET ROUTING IN TELECOMMUNICATION NETWORKS

Packet routing efficiency is and will remain one of the major factors that have a major impact on a network performance and a quality of service. One of the most common routing protocols used in autonomous Internet systems is the Open Shortest Path First (OSPF) protocol. The OSPF protocol performs packet transmission using the shortest paths, calculated according to a certain, but only one criterion. Default criterion is channels bandwidth, but in general any criteria can be selected. The disadvantage here is that channels loading is not considered and thus packets are routed to a shortest but potentially overloaded path. In wider sense usage of single criteria may results in routing through paths suboptimal or even inappropriate by other criteria. The growth of the network traffic, and especially the increase of its multimedia component drives continuous improvement of routing methods in existing telecommunication networks. Network performance will benefit from more advanced routing methods, which would take into account several network characteristics, important for specific services quality. In given work a new algorithm of a gateway selection for the routing tables of autonomous Internet systems is proposed. The algorithm is based on the OSPF protocol but takes into account three criteria: channel bandwidth, the number of intermediate nodes in the path and the signal propagation delay. Weighting coefficient for each criteria is introduced. Besides that, the integral criterion is proposed based on optimal path weights for individual criteria and path weights found by two other criteria. The total relative deviation of the path weight from the path weights calculated according to individual criteria is used as the optimization criterion. The purpose of optimization is to minimize this deviation. Routing tables constructed using proposed algorithm ensure packets transmission through the optimal path, selected according to the integral criterion, taking into account the three criteria and their coefficients of importance. Further research may be conducted to expand the list of criteria used in the optimization process.

Download Full-text

Researching the Impact of Parameters of the Developed Routing Models on Network Performance

Studies in Engineering and Technology ◽

10.11114/set.v4i1.2470 ◽

2017 ◽

Vol 4 (1) ◽

pp. 61 ◽

Cited By ~ 1

Author(s):

Mohammad Alhihi ◽

Hani Attar ◽

Mohammad Samour ◽

Artem Akulynichev

Keyword(s):

Network Performance ◽

Structural Model ◽

Data Gathering ◽

Oriented Graph ◽

Telecommunication Networks ◽

High Quality ◽

Network Maintenance ◽

Telecommunications Network ◽

Routing Methods ◽

The Impact

Nowadays, it is hard to imagine work without applying the principle of computer networks, and every day the requirement for high-quality network maintenance is increasing. In order to have a high-quality network; always optimize QoS through the optimization of routing protocols is required. In this paper, the scientific task of optimizing routing processes in hybrid telecommunication networks with guaranteed quality of service is solved by developing models and methods of adaptive routing. To develop methods, a system of Telecommunications network (TN) mathematical models was constructed at the levels of its morphological and functional descriptions. We used a weighted oriented graph as a structural model. Formalization of the main indicators of the network operation efficiency is carried out, which are the network performance (or its derivatives – relative and normalized performances) and indicators of the degree of use of network resources – buffer memory capacities of nodes and bandwidth of the transmission paths. In this paper, an experimental study of the developed models and routing methods was carried out in order to verify their adequacy, evaluate the effectiveness, and develop practical recommendations. The scheme of experiment, focusing on the investigation of processes occurring in the network while solving routing tasks (data gathering, RT processing, distribution, and implementation), is proposed.

Download Full-text

Spectrum Based Power Management for Congested IoT Networks

Sensors ◽

10.3390/s21082681 ◽

2021 ◽

Vol 21 (8) ◽

pp. 2681

Author(s):

Kedir Mamo Besher ◽

Juan Ivan Nieto-Hipolito ◽

Raymundo Buenrostro-Mariscal ◽

Mohammed Zamshed Ali

Keyword(s):

Power Management ◽

Network Performance ◽

Channel Allocation ◽

Battery Life ◽

Packet Routing ◽

Data Packets ◽

Increasing Demand ◽

Iot Devices ◽

Set Up

With constantly increasing demand in connected society Internet of Things (IoT) network is frequently becoming congested. IoT sensor devices lose more power while transmitting data through congested IoT networks. Currently, in most scenarios, the distributed IoT devices in use have no effective spectrum based power management, and have no guarantee of a long term battery life while transmitting data through congested IoT networks. This puts user information at risk, which could lead to loss of important information in communication. In this paper, we studied the extra power consumed due to retransmission of IoT data packet and bad communication channel management in a congested IoT network. We propose a spectrum based power management solution that scans channel conditions when needed and utilizes the lowest congested channel for IoT packet routing. It also effectively measured power consumed in idle, connected, paging and synchronization status of a standard IoT device in a congested IoT network. In our proposed solution, a Freescale Freedom Development Board (FREDEVPLA) is used for managing channel related parameters. While supervising the congestion level and coordinating channel allocation at the FREDEVPLA level, our system configures MAC and Physical layer of IoT devices such that it provides the outstanding power utilization based on the operating network in connected mode compared to the basic IoT standard. A model has been set up and tested using freescale launchpads. Test data show that battery life of IoT devices using proposed spectrum based power management increases by at least 30% more than non-spectrum based power management methods embedded within IoT devices itself. Finally, we compared our results with the basic IoT standard, IEEE802.15.4. Furthermore, the proposed system saves lot of memory for IoT devices, improves overall IoT network performance, and above all, decrease the risk of losing data packets in communication. The detail analysis in this paper also opens up multiple avenues for further research in future use of channel scanning by FREDEVPLA board.

Download Full-text

RESEARCH OF SDN NETWORK PERFORMANCE PARAMETERS USING MININET NETWORK EMULATOR

Information and Telecommunication Sciences ◽

10.20535/2411-2976.12021.24-32 ◽

2021 ◽

pp. 24-32

Author(s):

Oleksandr Romanov ◽

Ivan Saychenko ◽

Anton Marinov ◽

Serhii Skolets

Keyword(s):

Simulation Model ◽

Performance Indicators ◽

Network Performance ◽

Complex Structure ◽

Science Research ◽

Simulation Modelling ◽

Network Equipment ◽

Network Emulator ◽

Network Technologies ◽

Routing Tables

Background. The implementation of the new modern services on existing networks requires replacement or modernization of the old equipment. This negatively affects the efficiency of providing users with new types of services and their cost. Therefore, the issues/tasks of implementing SDN technology in the construction of networks are in the center of attention of representatives of science-research organizations and telecom operators. SDN networks have the advantages of flexible scaling of the system without replacing existing server and network equipment, eliminating operator dependence on specific vendor solutions, and rapid implementation of the new network technologies and services. To determine the numerical values of indicators of the functioning of SDN networks and check their compliance with the requirements, it is proposed to use in working process simulation modelling. For these goals, the Open Networking Foundation consortium developed the Mininet network emulator, the elements of that are published publicly. The formation of the simulation model and the procedure for determining the performance indicators of the SDN network that uses Mininet has a number of features that are considered in the work. Objective. The purpose of the article is to build a simulation model based on the Mininet network emulator and to determine the performance indicators of SDN networks of various structures/topologies. Methods. Creation of a SDN network segment for testing process of its functioning in the overload mode of various communication routes. Results. The Mininet network emulator allows simulating SDN networks of a rather complex structure, change the performance of network branches and the amount of load in communication routes, to create a network-wide overload mode. During the simulation, it is possible to determine a number of indicators of network performance, such as the RTT (Round Trip Time) parameter for each route of communication, the bandwidth of branches and routes of communication, the amount of delay on network elements, loading of OpenFlow Switch ports/interfaces, network elements with the highest delay, the number of served and lost packets. Conclusions. Use of the Mininet network emulator is a fairly convenient tool for determining the performance indicators of SDN networks. However, there are also some problems. First of all, setting up the system's operability requires writing programs to ensure the interaction among standard elements from the Mininet library. Secondone, is when congestion occurs in the communication routes, the Floodlight Controller does not automatically balance traffic along the work-around route. This task has to be solved manually by making changes to the OpenFlow Switch routing tables. Keywords: Software Defined Networking; SDN; Mininet; OpenFlow; Floodlight Controller; OpenFlowSwitch; NFV; virtualization.

Download Full-text

A Routing Protocol for Emergency Communication Based on Load Balancing

Applied Mechanics and Materials ◽

10.4028/www.scientific.net/amm.719-720.744 ◽

2015 ◽

Vol 719-720 ◽

pp. 744-749

Author(s):

Hui Han ◽

Hong De Zhang ◽

Yang Wang

Keyword(s):

Load Balancing ◽

Communication Networks ◽

Routing Protocol ◽

Network Performance ◽

Ad Hoc ◽

Mobile Ad Hoc Network ◽

Network Routing ◽

Packet Transmission ◽

Emergency Communication ◽

Network Load

Ad-hoc communications is a mobile communication networks and computer networks combine with no infrastructure support, and network survivability and flexibility is strong, especially suitable for emergency communication. As the existing mobile ad hoc network routing protocols lack of network load balancing capabilities, this paper proposed a routing protocol based on load balancing LBBR (Load Balancing Based Routing). Simulation results shows that, LBBR can improve the success rate of packet transmission, reducing the average end to end delay, thus effectively improving network performance.

Download Full-text

Q -Learning-Based High Credibility and Stability Routing Algorithm for Internet of Medical Things

Wireless Communications and Mobile Computing ◽

10.1155/2020/8856271 ◽

2020 ◽

Vol 2020 ◽

pp. 1-10

Author(s):

Kefeng Wei ◽

Lincong Zhang ◽

Xin Jiang ◽

Yi Guo

Keyword(s):

Health Monitoring ◽

Learning Algorithm ◽

Routing Algorithm ◽

Optimal Path ◽

Packet Transmission ◽

Dynamic Adjustment ◽

Data Packets ◽

Forwarding Node ◽

Internet Of Medical Things ◽

High Credibility

With the outbreak of COVID-19, people’s demand for using the Internet of Medical Things (IoMT) for physical health monitoring has increased dramatically. The considerable amount of data requires stable, reliable, and real-time transmission, which has become an urgent problem to be solved. This paper constructs a health monitoring-enabled IoMT network which is composed of several users carrying wearable devices and a coordinator. One of the important problems for the proposed network is the unstable and inefficient transmission of data packets caused by node congestion and link breakage in the routing process. Based on these, we propose a Q -learning-based dynamic routing selection (QDRS) algorithm. First, a mathematical model of path optimization and a solution named Global Routing selection with high Credibility and Stability (GRCS) is proposed to select the optimal path globally. However, during the data transmission through the optimal path, the node and link status may change, causing packet loss or retransmission. This is a problem not considered by standard routing algorithms. Therefore, this paper proposes a local link dynamic adjustment scheme based on GRCS, using the Q -learning algorithm to select the optimal next-hop node for each intermediate forwarding node. If the selected node is not the same as the original path, the chosen node replaces the downstream node in the original path and so corrects the optimal path in time. This paper considers the congestion state, remaining energy, and mobility of the node when selecting the path and considers the network state changes during packet transmission, which is the most significant innovation of this paper. The simulation results show that compared with other similar algorithms, the proposed algorithm can significantly improve the packet forwarding rate without seriously affecting the network energy consumption and delay.

Download Full-text

Optimizing Energy Consumption in IoT-Based Scalable Wireless Sensor Networks

International Journal of System Dynamics Applications ◽

10.4018/ijsda.20211001.oa21 ◽

2021 ◽

Vol 10 (4) ◽

pp. 1-16

Author(s):

Vinay Rishiwal ◽

Preeti Yadav ◽

Omkar Singh ◽

B. G. Prasad

Keyword(s):

Wireless Sensor Networks ◽

Energy Consumption ◽

Sensor Networks ◽

Routing Protocol ◽

Routing Protocols ◽

Network Performance ◽

Optimal Path ◽

Sensor Nodes ◽

Wireless Sensor ◽

Selection For

In recent era of IoT, energy ingesting by sensor nodes in Wireless Sensor Networks (WSN) is one of the key challenges. It is decisive to diminish energy ingesting due to restricted battery lifespan of sensor nodes, Objective of this research is to develop efficient routing protocol/algorithm in IoT based scenario to enhance network performance with QoS parameters. Therefore, keeping this objective in mind, a QoS based Optimized Energy Clustering Routing (QOECR) protocol for IoT based WSN is proposed and evaluated. QOECR discovers optimal path for sink node and provides better selection for sub-sink nodes. Simulation has been done in MATLAB to assess the performance of QOECR with pre-existing routing protocols. Simulation outcomes represent that QOECR reduces E2E delay 30%-35%, enhances throughput 25%-30%, minimizes energy consumption 35%-40%, minimizes packet loss 28%-32%, improves PDR and prolongs network lifetime 32%-38% than CBCCP, HCSM and ZEAL routing protocols.

Download Full-text

Routing Performance Evaluation of a Multi-Domain Hybrid SDN for its Implementation in Carrier Grade ISP Networks

10.20944/preprints202105.0573.v2 ◽

2021 ◽

Author(s):

Babu R Dawadi ◽

Abhishek Thapa ◽

Roshan Guragain ◽

Dilochan Karki ◽

Sandesh P Upadhyaya ◽

...

Keyword(s):

Network Performance ◽

Transmission Rate ◽

Packet Transmission ◽

Test Bed ◽

Internet Service ◽

Trip Time ◽

Long Run ◽

Ip Routing ◽

Routing Performance ◽

Operational Expenditure

Legacy IPv4 networks are strenuous to manage and operate. Network operators are in need to minimize the capital and operational expenditure of running network infrastructure. The implementation of Software-defined networking (SDN) addresses those issues by minimizing the expenditures in the long run. Legacy networks need to integrate with the SDN networks for the smooth migration towards the fully functional SDN environment. In this paper, we compare the network performance of the legacy network with the SDN network for IP routing in order to determine the feasibility of the SDN deployment in the Internet Service provider (ISP) network. The simulation of the network is performed in the Mininet test-bed and the network traffic is generated using distributed Internet traffic generator. Open network operating system is used as a controller for the SDN network in which SDN-IP application is used for IP routing. Round trip time, bandwidth, and packet transmission rate from both SDN and legacy networks are first collected and then the comparison is done. We found that SDN-IP performs better in terms of bandwidth and latency as compared to legacy routing. The experimental analysis of interoperability between SDN and legacy networks shows that SDN implementation in production level carrier-grade ISP network is viable and progressive.

Download Full-text

Improving the efficiency of routing methods in wireless networks of telemetry systems

MORSKIE INTELLEKTUAL`NYE TEHNOLOGII ◽

10.37220/mit.2021.52.2.075 ◽

2021 ◽

pp. 92-96

Author(s):

Е.Е. Прозоровский ◽

Ю.В. Редькин

Keyword(s):

Control Systems ◽

Network Topology ◽

High Reliability ◽

Optimal Path ◽

Operating Costs ◽

Information Collection ◽

Acceptable Solution ◽

Routing Methods ◽

And Control ◽

Automated Telemetry

Одна из основных проблем построения автоматизированных систем телеметрии и управления – организация надежной связи между удаленными объектами и пунктами сбора информации. Использование беспроводных самоорганизующихся сетей является наиболее приемлемым решением данной задачи. Подобные сети характеризуются: высокой надежностью и живучестью; достаточной пропускной способностью; низкой стоимостью эксплуатации; простотой перемещения и оперативностью развертывания. В настоящее время разработано множество алгоритмов и протоколов, обеспечивающих автоматическое конфигурирование таких сетей. Однако, несмотря на обилие разработанных алгоритмов и протоколов существует необходимость создания новых протоколов, оптимальных для решения поставленной задачи при заданной топологии сети. В работе предложен алгоритм поиска кратчайшего пути маршрутизации в телеметрической беспроводной сети. Представлен пример поиска оптимального пути в случае выхода из строя одного из транзитных узлов системы телеметрии. Реализация алгоритма позволяет существенно упростить поиск нового маршрута и сократить временные затраты на восстановление целостности сети, что в конечном итоге увеличивает пропускную способность сети. One of the main problems of building automated telemetry and control systems is the organization of reliable communication between remote objects and information collection points. The most acceptable solution to this problem is the use of wireless self-organizing networks. Such networks are characterized by high reliability and survivability, sufficient bandwidth, low operating costs, ease of movement and speed of deployment. Currently, many algorithms and protocols have been developed that provide automatic configuration of such networks. However, despite the abundance of developed algorithms and protocols, there is a need to create new protocols that are optimal for solving the problem at a given network topology. The paper proposes an algorithm for finding the shortest routing path in a telemetric wireless network. An example of finding the optimal path in the event of failure of one transit node of the telemetry system is presented. The implementation of the algorithm makes it possible to significantly simplify the search for a new route and reduce the time spent on restoring the integrity of the network, which ultimately increases the network throughput.

Download Full-text

Artificial Intelligence Based A* Optimization Routing in Mobile Ad Hoc Networks

International Journal of Engineering and Advanced Technology - Regular Issue ◽

10.35940/ijeat.b3721.129219 ◽

2019 ◽

Vol 9 (2) ◽

pp. 1553-1560

Keyword(s):

Routing Protocol ◽

Routing Protocols ◽

Path Length ◽

Network Performance ◽

Ad Hoc ◽

Mobile Ad Hoc Network ◽

Theory Model ◽

Packet Transmission ◽

Mobile Ad Hoc ◽

Node Availability

A Mobile Ad Hoc Network (MANET) is a hotchpotch of nodes with mobility feature, the established network utilization is dynamically outlined based on temporary architecture. In MANETs, the challenging and vital role is played by the routing protocols performance factors under different condition and environments. The routing protocols are liable to handle many nodes with limited resources. There exits many routing protocols in MANETs, one of the main key note that has to be considered in designing a routing protocol is to observe that the designed routing protocol is having an proportionate effect on network performance. The existence of obstacles may lead to many geographical routing problems like excess consumption of power and congestion of data. The aim of this paper is to take the assistance of A* algorithm that finds the walk-able path avoiding the concave obstacle in the path relaying on the gaming-theory model[29]. This algorithm decreases the delays in packet transmission and in turn increases the success rate of transmission. We take into consideration path length, penalty for node availability as probability of forwarding criteria and processes effective packet transmission. The simulated results analyse the performance of our protocol over other conventional algorithms based on congestion cost, path length, node availability penalty, delay, packet loss, throughput.

Download Full-text

Dynamic Load Balancing of Software-Defined Networking Based on Genetic-Ant Colony Optimization

Sensors ◽

10.3390/s19020311 ◽

2019 ◽

Vol 19 (2) ◽

pp. 311 ◽

Cited By ~ 5

Author(s):

Hai Xue ◽

Kyung Kim ◽

Hee Youn

Keyword(s):

Load Balancing ◽

Ant Colony Optimization ◽

Network Performance ◽

Optimal Path ◽

Optimal Solution ◽

Software Defined Networking ◽

Ant Colony ◽

Centralized Control ◽

Trip Time ◽

Overall Performance

Load Balancing (LB) is one of the most important tasks required to maximize network performance, scalability and robustness. Nowadays, with the emergence of Software-Defined Networking (SDN), LB for SDN has become a very important issue. SDN decouples the control plane from the data forwarding plane to implement centralized control of the whole network. LB assigns the network traffic to the resources in such a way that no one resource is overloaded and therefore the overall performance is maximized. The Ant Colony Optimization (ACO) algorithm has been recognized to be effective for LB of SDN among several existing optimization algorithms. The convergence latency and searching optimal solution are the key criteria of ACO. In this paper, a novel dynamic LB scheme that integrates genetic algorithm (GA) with ACO for further enhancing the performance of SDN is proposed. It capitalizes the merit of fast global search of GA and efficient search of an optimal solution of ACO. Computer simulation results show that the proposed scheme substantially improves the Round Robin and ACO algorithm in terms of the rate of searching optimal path, round trip time, and packet loss rate.

Download Full-text