Restoration Technique to Optimize Recovery Time for Efficient OSPF Network

Author(s):  
Pertik Garg ◽  
Ashu Gupta

Some high speed IP networks, which involve interior gateway protocols, such as OSPF, are not capable of finding the new routes to bypass the effect like failure in time. At the point when the failure occurs the network must converge it before the traffic has the capacity to go to and from the network segment that caused a connection disconnect. The duration of the convergence period of these protocols vary from hundred of milliseconds to 10 seconds, which creates unsteadiness and results high packet loss rate. This issue may be determined by proposing an algorithm that can rapidly react to the topology change and reduce the convergence time by providing back up path which is already stored in routing table before the failover occurs.

2014 ◽  
Vol 536-537 ◽  
pp. 536-539
Author(s):  
Wei Feng Zhang

10G Ethernet technology has been widely used in modern high speed communication system. As a result, program design for high-speed data capture on 10G Ethernet, as the first and important step in network monitor and analysis system, has become a challenging task. This paper proposed a high-speed data capture method based on WinCap and shared memory pool technology and has features of high speed, low packet loss rate, high efficiency and good portability. The system test and data analysis proved that the proposed method in this paper can effectively capture the data at speed of 6Gbps and stably keep the packet loss rate under 0.03%.


The internet now plays crucial roles such as streaming videos, social networking, managing large scientific data. There is a need for high-speed Internet. The volume of data handled by the data centers is increasing very rapidly. Hence, the need to handle data center traffic effectively becomes inevitable. At present, the government office network uses a data center network design based on Fat-Tree that employs high-end IP switches. Unfortunately, the resulting network performance has delays of more than 0.06 ms, throughput of about 500 kbps, and packet loss rate is 2. This research introduces BCube to re-design and improve network performance (i.e., delay, throughput, and packet loss). Through this research, we propose a new data center design in the government office that improves the network performance significantly, with delays less than 0.004 ms, throughput more than 515 kbps, and packet loss rate 0, two–three percent better compared to the Fat-Tree data center network design that contributes significantly to the data center operations in the government office and its overall business performance through the data center network design.


2021 ◽  
pp. 1-12
Author(s):  
Yinghua Feng ◽  
Wei Yang

In order to overcome the problems of high energy consumption and low execution efficiency of traditional Internet of things (IOT) packet loss rate monitoring model, a new packet loss rate monitoring model based on differential evolution algorithm is proposed. The similarity between each data point in the data space of the Internet of things is set as the data gravity. On the basis of the data gravity, combined with the law of gravity in the data space, the gravity of different data is calculated. At the same time, the size of the data gravity is compared, and the data are classified. Through the classification results, the packet loss rate monitoring model of the Internet of things is established. Differential evolution algorithm is used to solve the model to obtain the best monitoring scheme to ensure the security of network data transmission. The experimental results show that the proposed model can effectively reduce the data acquisition overhead and energy consumption, and improve the execution efficiency of the model. The maximum monitoring efficiency is 99.74%.


2019 ◽  
Vol 2019 ◽  
pp. 1-11
Author(s):  
Kehua Zhao ◽  
Yourong Chen ◽  
Siyi Lu ◽  
Banteng Liu ◽  
Tiaojuan Ren ◽  
...  

To solve the problem of sensing coverage of sparse wireless sensor networks, the movement of sensor nodes is considered and a sensing coverage algorithm of sparse mobile sensor node with trade-off between packet loss rate and transmission delay (SCA_SM) is proposed. Firstly, SCA_SM divides the monitoring area into several grids of same size and establishes a path planning model of multisensor nodes’ movement. Secondly, the social foraging behavior of Escherichia coli in bacterial foraging is used. A fitness function formula of sensor nodes’ moving paths is proposed. The optimal moving paths of all mobile sensor nodes which can cover the entire monitoring area are obtained through the operations of chemotaxis, replication, and migration. The simulation results show that SCA_SM can fully cover the monitoring area and reduce the packet loss rate and data transmission delay in the process of data transmission. Under certain conditions, SCA_SM is better than RAND_D, HILBERT, and TCM.


Sensors ◽  
2020 ◽  
Vol 20 (7) ◽  
pp. 2153 ◽  
Author(s):  
Latha R ◽  
Vetrivelan P

This paper is a collection of telemedicine techniques used by wireless body area networks (WBANs) for emergency conditions. Furthermore, Bayes’ theorem is proposed for predicting emergency conditions. With prior knowledge, the posterior probability can be found along with the observed evidence. The probability of sending emergency messages can be determined using Bayes’ theorem with the likelihood evidence. It can be viewed as medical decision-making, since diagnosis conditions such as emergency monitoring, delay-sensitive monitoring, and general monitoring are analyzed with its network characteristics, including data rate, cost, packet loss rate, latency, and jitter. This paper explains the network model with 16 variables, with one describing immediate consultation, as well as another three describing emergency monitoring, delay-sensitive monitoring, and general monitoring. The remaining 12 variables are observations related to latency, cost, packet loss rate, data rate, and jitter.


Sign in / Sign up

Export Citation Format

Share Document