Distances in an array: an alternative description for large scale network topology

Author(s):  
F. Norwood ◽  
W.P. Dotson
2013 ◽  
Vol 2013 ◽  
pp. 1-7
Author(s):  
Hui He ◽  
Guotao Fan ◽  
Jianwei Ye ◽  
Weizhe Zhang

It is of great significance to research the early warning system for large-scale network security incidents. It can improve the network system’s emergency response capabilities, alleviate the cyber attacks’ damage, and strengthen the system’s counterattack ability. A comprehensive early warning system is presented in this paper, which combines active measurement and anomaly detection. The key visualization algorithm and technology of the system are mainly discussed. The large-scale network system’s plane visualization is realized based on the divide and conquer thought. First, the topology of the large-scale network is divided into some small-scale networks by the MLkP/CR algorithm. Second, the sub graph plane visualization algorithm is applied to each small-scale network. Finally, the small-scale networks’ topologies are combined into a topology based on the automatic distribution algorithm of force analysis. As the algorithm transforms the large-scale network topology plane visualization problem into a series of small-scale network topology plane visualization and distribution problems, it has higher parallelism and is able to handle the display of ultra-large-scale network topology.


Sensors ◽  
2020 ◽  
Vol 20 (14) ◽  
pp. 3819
Author(s):  
Xing Wu ◽  
Jing Duan ◽  
Mingyu Zhong ◽  
Peng Li ◽  
Jianjia Wang

With the advent of the Internet of things (IoT), intelligent transportation has evolved over time to improve traffic safety and efficiency as well as to reduce congestion and environmental pollution. However, there are some challenging issues to be addressed so that it can be implemented to its full potential. The major challenge in intelligent transportation is that vehicles and pedestrians, as the main types of edge nodes in IoT infrastructure, are on the constant move. Hence, the topology of the large scale network is changing rapidly over time and the service chain may need reestablishment frequently. Existing Virtual Network Function (VNF) chain placement methods are mostly good at static network topology and any evolvement of the network requires global computation, which leads to the inefficiency in computing and the waste of resources. Mapping the network topology to a graph, we propose a novel VNF placement method called BVCP (Border VNF Chain Placement) to address this problem by elaborately dividing the graph into multiple subgraphs and fully exploiting border hypervisors. Experimental results show that BVCP outperforms the state-of-the-art method in VNF chain placement, which is highly efficient in large scale IoT of intelligent transportation.


2014 ◽  
Vol 644-650 ◽  
pp. 3203-3207
Author(s):  
Zhe Jian Shen ◽  
Yun Sheng Ge

In large scale network, the problem that network in an area topology accurately be discovered should be solved. The traditional network discovery algorithms mainly use ICMP and SNMP. But these two algorithms allow routers or other devices to send request packets to other devices. It may cause the low utilization rate of network. However, OSPF routing protocol, when it exchange routing tables, it will send LSUs to other routers and receive them from the remote routers. According to analyzing the LSAs, which are encapsulated in LSUs, we can obtain the network topology. We use GNS3 to simulate OSPF environment. Experiment shows that this algorithm can obtain the network topology rapidly and accurately.


2017 ◽  
Vol 28 (12) ◽  
pp. 4234-4243 ◽  
Author(s):  
Chenhao Wang ◽  
Jimmy Lee ◽  
New Fei Ho ◽  
Joseph K W Lim ◽  
Joann S Poh ◽  
...  

2021 ◽  
pp. 107886
Author(s):  
Jia Zhang ◽  
Lanfang Liu ◽  
Hehui Li ◽  
Xiaoxia Feng ◽  
Manli Zhang ◽  
...  

MIS Quarterly ◽  
2016 ◽  
Vol 40 (4) ◽  
pp. 849-868 ◽  
Author(s):  
Kunpeng Zhang ◽  
◽  
Siddhartha Bhattacharyya ◽  
Sudha Ram ◽  
◽  
...  

Sign in / Sign up

Export Citation Format

Share Document