Local routing protocols performance for computer virus elimination in complex networks

2019 ◽  
Vol 536 ◽  
pp. 120984
Author(s):  
A.Ould Baba Alweimine ◽  
O. Bamaarouf ◽  
A. Rachadi ◽  
H. Ez-Zahraouy
Keyword(s):  
Complex Networks ◽  
Routing Protocols ◽  
Computer Virus ◽  
Virus Elimination ◽  
Local Routing

Analysis of computer virus propagation behaviors over complex networks: a case study of Oregon routing network

2020 ◽  
Vol 100 (2) ◽  
pp. 1725-1740 ◽  
Author(s):  
Chenquan Gan ◽  
Qingdong Feng ◽  
Qingyi Zhu ◽  
Zufan Zhang ◽  
Yushu Zhang ◽  
...  
Keyword(s):  
Complex Networks ◽  
Computer Virus ◽  
Virus Propagation

Greedy Routing on Complex Networks

2011 ◽  
Vol 403-408 ◽  
pp. 2453-2456
Author(s):  
Xin Ling Shi ◽  
Li Jun Zhang ◽  
Da Kuo Wang
Keyword(s):  
Complex Networks ◽  
Greedy Algorithm ◽  
Queue Length ◽  
Search Strategy ◽  
Greedy Routing ◽  
Dynamic Information ◽  
Routing Strategy ◽  
Local Routing

This paper proposes a new routing strategy on complex networks. Based on the idea of greedy algorithm, our routing strategy chooses the node that has the highest probability to reach destination with the studies of max degree search strategy. In the meantime, the dynamic information like queue length will affect influence our strategy in order to increase the capacity of network. The result of simulation shows our strategy has a better performance compare to other local routing strategy. This strategy can be used on different kinds of complex networks.

scholarly journals Advanced Algorithms for Local Routing Strategy on Complex Networks

PLoS ONE ◽  
2016 ◽  
Vol 11 (7) ◽  
pp. e0156756 ◽  
Author(s):  
Benchuan Lin ◽  
Bokui Chen ◽  
Yachun Gao ◽  
Chi K. Tse ◽  
Chuanfei Dong ◽  
...  
Keyword(s):  
Complex Networks ◽  
Routing Strategy ◽  
Local Routing

scholarly journals Correction: Advanced Algorithms for Local Routing Strategy on Complex Networks

PLoS ONE ◽  
2016 ◽  
Vol 11 (12) ◽  
pp. e0163075 ◽  
Author(s):  
Ben-Chuan Lin ◽  
Bo-Kui Chen ◽  
Ya-Chun Gao ◽  
Chi K. Tse ◽  
Chuan-Fei Dong ◽  
...  
Keyword(s):  
Complex Networks ◽  
Routing Strategy ◽  
Local Routing

TRAVEL TIME DISTRIBUTION FOR NETWORK FLOWS UNDER LOCAL ROUTING

2011 ◽  
Vol 22 (06) ◽  
pp. 581-594
Author(s):  
CHAO-YANG WANG ◽  
ZI-YOU GAO ◽  
JIAN-FENG ZHENG ◽  
SHUAI DAI
Keyword(s):  
Complex Networks ◽  
Travel Time ◽  
Communication Networks ◽  
Large Scale ◽  
Network Flows ◽  
Small World ◽  
Scale Free ◽  
Data Packets ◽  
Travel Time Distribution ◽  
Local Routing

When transporting data packets on communication networks, the local routing protocols are often preferred because of the large-scale and complicated property of many realistic network structures such as Internet. Based on a local routing protocol with a navigation parameter proposed in a previous paper [W. X. Wang et al., Phys. Rev. E73, 026111 (2006)], this paper numerically investigates the distribution of travel time for transporting data packets from the origin to the destination in complex networks, including random networks, small-world networks and scale-free networks. Numerical results show that exponential distributions of travel time with various values of exponent in complex networks are obtained. Furthermore, the different values of the exponent can also intuitively prove the previous result for the optimal local routing strategy. Finally, violations of the First-Departure-First-Arrival situation in complex networks are discussed.

Complex Networks

2009 ◽  
Author(s):  
Reuven Cohen ◽  
Shlomo Havlin
Keyword(s):  
Complex Networks
Sign in / Sign up

Export Citation Format

Share Document