A STRATEGY OF DESIGNING ROUTING ALGORITHMS BASED ON IDEAL ROUTINGS

1999 ◽  
Vol 10 (01) ◽  
pp. 63-94 ◽  
Author(s):  
K. SHINJO ◽  
S. SHIMOGAWA ◽  
J. YAMADA ◽  
K. OIDA
Keyword(s):  
Routing Algorithm ◽  
Simple Algorithm ◽  
Packet Delay ◽  
Routing Algorithms ◽  
Performance Limits ◽  
Internet Routing ◽  
Average Delay ◽  
Switched Networks ◽  
Design Elements ◽  
The Ideal

This paper proposes a strategy of designing routing algorithms for connectionless packet-switched networks. This strategy consists of three design elements as follows: [A] the notion of ideal routings is introduced to provide the upper performance limits attained by improving routing algorithm and it serves as a standard to measure the performance of other algorithms; [B] a method of constructing simple algorithms is presented under implementation conditions from ideal routings; [C] a method is described to enhance the performance limits of [A]. By using these elements, simple algorithms with a maximum degree of performance attainment are realized. By "degree of performance attainment", we mean that we can see how much room is left for the improvement of algorithms. We develop [A] and [B] with the performance measures of throughput and average packet delay and the M/M/1 queuing network. We decide ideal static routings and their performance limits from [A]. We obtain a new simple algorithm from [B] based on the notion of the ideal routings in implementation conditions. The designed algorithm improves the throughput and the average delay, which are comparable to those from ideal static routings. This improvement is contrasted to the adaptive and distributed OSPF (Open Shortest Path First), a standard Internet routing protocol.

Antnet Routing Algorithm with Link Evaporation and Multiple Ant Colonies to Overcome Stagnation Problem

2013 ◽  
pp. 255-274
Author(s):  
Firat Tekiner ◽  
Zabih Ghassemlooy
Keyword(s):  
Routing Algorithm ◽  
Packet Delay ◽  
Average Delay ◽  
Ant Colonies ◽  
Feedback Information ◽  
Switched Networks ◽  
Agent Based ◽  
Data Packets ◽  
Reinforcement Parameter ◽  
Distance Vector

Antnet is a software agent-based routing algorithm that is influenced by the unsophisticated and individual ant’s emergent behaviour. The aim of this chapter is twofold, firstly to introduce improvements to the antnet routing algorithm and then to critically review the work that is done around antnet and reinforcement learning in routing applications. In this chapter a modified antnet algorithm for packet-based networks has been proposed, which offers improvement in the throughput and the average delay by detecting and dropping packets routed through the non-optimal routes. The effect of traffic fluctuations has been limited by applying boundaries to the reinforcement parameter. The round trip feedback information supplied by the software agents is reinforced by updated probability entries in the distance vector table. In addition, link usage information is also used to prevent stagnation problems. Also discussed is antnet with multiple ant colonies applied to packet switched networks. Simulation results show that the average delay experienced by data packets is reduced for evaporation for all cases when non-uniform traffic model traffic is used. However, there is no performance gain on the uniform traffic models. In addition, multiple ant colonies are applied to the packet switched networks, and results are compared with the other approaches. Results show that the throughput could be increased when compared to other schemes, but with no gain in the average packet delay time.

scholarly journals DCAR: DTN Congestion Avoidance Routing Algorithm Based on Tokens in an Urban Environment

2017 ◽  
Vol 2017 ◽  
pp. 1-9
Author(s):  
Hezhe Wang ◽  
Hongwu Lv ◽  
Huiqiang Wang ◽  
Guangsheng Feng
Keyword(s):  
Network Performance ◽  
Routing Algorithm ◽  
Relay Node ◽  
Routing Algorithms ◽  
Buffer Size ◽  
Destination Node ◽  
Delivery Ratio ◽  
Movement Trajectory ◽  
Average Delay ◽  
Urban Scenario

When a delay/disruption tolerant network (DTN) is applied in an urban scenario, the network is mainly composed of mobile devices carried by pedestrians, cars, and other vehicles, and the node’s movement trajectory is closely related to its social relationships and regular life; thus, most existing DTN routing algorithms cannot show efficient network performance in urban scenarios. In this paper, we propose a routing algorithm, called DCRA, which divides the urban map into grids; fixed sink stations are established in specific grids such that the communication range of each fixed sink station can cover a specific number of grids; these grids are defined as a cluster and allocated a number of tokens in each cluster; the tokens in the cluster are controlled by the fixed sink station. A node will transmit messages to a relay node that has a larger remaining buffer size and encounters fixed sink stations or the destination node more frequently after it obtains a message transmit token. Simulation experiments are carried out to verify the performance of the DCAR under an urban scenario, and results show that the DCAR algorithm is superior to existing routing algorithms in terms of delivery ratio, average delay, and network overhead.

Fermat Point Based Joint Routing in Dual-Aggregation-Points Inter-Backup M2M Communications

2012 ◽  
Vol 546-547 ◽  
pp. 1205-1210
Author(s):  
Yun Kai Wei ◽  
Wei Qiao Li ◽  
Yu Ming Mao ◽  
Su Peng Leng ◽  
Qin Yu
Keyword(s):  
Energy Cost ◽  
Routing Algorithm ◽  
Packet Delay ◽  
Routing Algorithms ◽  
Fermat Point ◽  
M2m Communications ◽  
Communication Efficiency ◽  
Reliable Communications ◽  
Simulation Results ◽  
Ratio Energy

Machine-to-machine (M2M) communications can be widely used in military probing, disasters monitoring, etc., where have rigorous environment and require reliable communications. In order to provide enough reliability, M2M subnet can be deployed with two inter-backup aggregation points. This paper proposed a novel routing algorithm named Fermat Point based Joint Routing (FPJR) for such dual-aggregation-points inter-backup M2M Communications. Taking nodes on Fermat Points as route anchors, FPJR forms joint routes which can decrease energy cost and improve communication efficiency greatly. Further, considering the probability is quite little that there is exactly a node deployed on an appointed Fermat Point, we proposed a new terminology ‘ -Fermat Region’, which denotes the circle area with the Fermat Point as center and as radius. Based on -Fermat Region and through the FPJR interaction protocol, FPJR can act not only separately but also as the aid of other routing algorithms, without any compatibility problem. The simulation results show that FPJR can greatly decrease packet lost ratio, energy cost and packet delay.

scholarly journals Load Balancing Routing Algorithm of Low-Orbit Communication Satellite Network Traffic Based on Machine Learning

2021 ◽  
Vol 2021 ◽  
pp. 1-14
Author(s):  
Tie Liu ◽  
Chenhua Sun ◽  
Yasheng Zhang
Keyword(s):  
Machine Learning ◽  
Loss Rate ◽  
Satellite Communication ◽  
Routing Algorithm ◽  
Routing Algorithms ◽  
Research Trend ◽  
Average Delay ◽  
Average Value ◽  
Distribution Index ◽  
Better Than

Satellite communication has become an important research trend in the field of communication technology. Low-orbit satellites have always been the focus of extensive attention by scholars due to their wide coverage, strong flexibility, and freedom from geographical constraints. This article introduces some technologies about low-orbit satellites and introduces a routing algorithm DDPG based on machine learning for simulation experiments. The performance of this algorithm is compared with the performance of three commonly used low-orbit satellite routing algorithms, and a conclusion is drawn. The routing algorithm based on machine learning has the smallest average delay, and the average value is 126 ms under different weights. Its packet loss rate is the smallest, with an average of 2.9%. Its throughput is the largest, with an average of 201.7 Mbps; its load distribution index is the smallest, with an average of 0.54. In summary, the performance of routing algorithms based on machine learning is better than general algorithms.

scholarly journals DS Evidence Theory-Based Energy Balanced Routing Algorithm for Network Lifetime Enhancement in WSN-Assisted IOT

Algorithms ◽  
2020 ◽  
Vol 13 (6) ◽  
pp. 152
Author(s):  
Liangrui Tang ◽  
Zhilin Lu
Keyword(s):  
Network Lifetime ◽  
Routing Algorithm ◽  
Evidence Theory ◽  
Routing Algorithms ◽  
Energy Efficient Routing ◽  
Balancing Energy ◽  
Energy Balanced Routing ◽  
The Ideal ◽  
Lifetime Enhancement

Wireless sensor networks (WSNs) can provide data acquisition for long-term environment monitoring, which are important parts of Internet of Things (IoT). In the WSN-assisted IoT, energy efficient routing algorithms are required to maintain a long network lifetime. In this paper, a DS evidence theory-based energy balanced routing algorithm for network lifetime enhancement (EBRA-NLE) in WSN-assisted IOT is proposed. From the perspective of energy balance and minimization of routing path energy consumption, three attribute indexes are established to evaluate the forward neighboring nodes. Then a route selection method based on DS evidence theory is developed to comprehensively evaluate the nodes and select the optimal next hop. In order to avoid missing the ideal solution because of the excessive difference between the index values, the sine function is used to adjust this difference. The simulation results show that the proposed EBRA-NLE has certain advantages in prolonging network lifetime and balancing energy between nodes.

scholarly journals An Adaptive Routing Algorithm Based on Relation Tree in DTN

Sensors ◽  
2021 ◽  
Vol 21 (23) ◽  
pp. 7847
Author(s):  
Diyue Chen ◽  
Hongyan Cui ◽  
Roy E. Welsch
Keyword(s):  
Negative Feedback ◽  
Routing Algorithm ◽  
Adaptive Routing ◽  
Routing Algorithms ◽  
Source Node ◽  
Message Delivery ◽  
Average Delay ◽  
Hop Count ◽  
Simulation Results ◽  
Delay Tolerant

It is found that nodes in Delay Tolerant Networks (DTN) exhibit stable social attributes similar to those of people. In this paper, an adaptive routing algorithm based on Relation Tree (AR-RT) for DTN is proposed. Each node constructs its own Relation Tree based on the historical encounter frequency, and will adopt different forwarding strategies based on the Relation Tree in the forwarding phase, so as to achieve more targeted forwarding. To further improve the scalability of the algorithm, the source node dynamically controls the initial maximum number of message copies according to its own cache occupancy, which enables the node to make negative feedback to network environment changes. Simulation results show that the AR-RT algorithm proposed in this paper has significant advantages over existing routing algorithms in terms of average delay, average hop count, and message delivery rate.

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

INVESTIGATING A WIRELESS SENSOR NETWORK OPTIMAL LIFETIME SOLUTION FOR LINEAR TOPOLOGIES

2006 ◽  
Vol 07 (01) ◽  
pp. 91-99 ◽  
Author(s):  
Keith Hellman ◽  
Michael Colagrosso
Keyword(s):  
Wireless Sensor Network ◽  
Sensor Network ◽  
Nearest Neighbor ◽  
Analytic Solution ◽  
Routing Algorithm ◽  
Optimal Solution ◽  
Routing Algorithms ◽  
Wireless Sensor ◽  
Global Knowledge ◽  
Alternative Solutions

We investigate a known optimal lifetime solution for a linear wireless sensor network through simulation, and propose alternative solutions where a known optimal solution does not exist. The network is heterogeneous in the sensors' energy distribution and also in the amount of data each sensor must communicate. As a basis for comparison, we analyze the lifetime of a network using a simple, nearest-neighbor routing algorithm, and an analytic solution to the optimal lifetime of networks meeting certain constraints. Alternative solutions considered range from those requiring global knowledge of the network to solutions using only next-neighbor knowledge. We compare the performance of all the routing algorithms in simulation.

Sign in / Sign up

Export Citation Format

Share Document