A method for generating a local network graph based on the analysis of address sets

Introduction. The paper deals with the problem of automated construction of a local area network using tools and methods for traffic analysis at the link layer of OSI model. The problem is caused by two factors. These are difficulties of the manual determination of the communication between equipment and the lack of physical access to communication lines of an already functioning network. The purpose of the work is to reduce the time spent on building a local network diagram through automating the process of determining the communication between the equipment.

Materials and Methods. To solve the set tasks, a method for determining the relative location of devices is proposed. The network adapters of a specialized software and hardware complex, which are connected to a communication line break at different points of the network, are used in opposite directions. The method used is based on calculations of intersections of address sets received from these adapters. The structural schemes of the construction of such a software and hardware complex and the requirements for it are given. The methods of obtaining MAC addresses from transit packets are described. Examples of libraries of software components for performing this operation are given. The structure of a relational database is proposed for storing the received data. The format and content of the fields of its table are described.

Results. Using the developed methods, a typical example of an Ethernet network shows a way to determine the relative location of end devices specified by their MAC addresses, as well as at least two switches located between them. The signs by which it is possible to judge the presence of switching equipment in a particular segment are determined. A method is proposed that enables through using a set of relational operations, to sequentially refine the network topology until the required accuracy is achieved.

Discussion and Conclusions. The results obtained can be used under the administration of large local networks with an extensive structure. The proposed approach allows you to reduce the time required for building a scheme. This is possible due to the automation of the process of obtaining information about devices operating on the network and their mutual location.

1. Kuz'menko NG. Komp'yuternye seti i setevye tekhnologii. St. Petersburg: Nauka i tekhnika; 2013. 368 p. (In Russ.)

2. Galushka VV. Seti i sistemy peredachi informatsii. Rostov-on-Don: DSTU Publ. House; 2016. 105 p. (In Russ.)

3. Stefano-Niko Orzen. Interaction understanding in the OSI model functionality of networks with case studies. IEEE 9th Int. SACI, 2014. P. 327–330. URL: www.researchgate.net/publication/269301474_ Interaction_understanding_in_the_OSI_model_functionality_of_networks_with_case_studies (accessed: 18.08.2021). 10.1109/SACI.2014.6840086

4. Piyush Saxena. OSI Reference Model — A Seven Layered Architecture of OSI Model. International Journal of Research. 2014;1(10):1145–1156.

5. Lagutin IA. Opredelenie topologii s pomoshch'yu protokola LLDP v setyakh Juniper. Perspektivy razvitiya informatsionnykh tekhnologii. 2013;16:66–70. URL: https://cyberleninka.ru/article/n/opredelenie-topologii-spomoschyu-protokola-lldp-v-setyah-juniper/viewer (accessed: 10.04.2021). (In Russ.)

6. Alekseev VE, Talanov VA. Grafy i algoritmy. Struktury dannykh. Modeli vychislenii. Moscow: Binom. Laboratoriya znanii; 2012. 320 p. (In Russ.)

7. Ifenthaler D, Gibson D, Dobozy E. Informing learning design through analytics: Applying network graph analysis. Australasian Journal of Educational Technology. 2018;34(2):117–132. https://doi.org/10.14742/ajet.3767

8. Asel'derov ZM, Donets GA. Predstavlenie i vosstanovlenie grafov. Kiev: Naukova dumka; 2001. 96 p. (In Russ.)

9. Mao Yan, Kam-Yiu Lam, Song Han, et al. Hypergraph-based data link layer scheduling for reliable packet delivery in wireless sensing and control networks with end-to-end delay constraints. Information Sciences. 2014;278:34–55. 10.1016/j.ins.2014.02.006

10. Grigor’yan A. Introduction to Analysis on Graphs. Providence, Rhode Island: American Mathematical Society; 2018. 150 p.

11. Anduo Wang, Xueyuan Mei, Jason Croft, et al. Ravel: A Database-Defined Network. In: Proc. Symposium on SDN Research. 2016;5:1–7. URL: www.researchgate.net/publication/304918854_Ravel_A_DatabaseDefined_Network (accessed: 21.08.2021). https://doi.org/10.1145/2890955.2890970

12. Jiaqian Li, Chengrong Wu, Jiawei Ye, et al. The Comparison and Verification of Some Efficient Packet Capture and Processing Technologies. 2019 IEEE International Symposium on DASK, 2019. P. 967–973. URL: www.ieeexplore.ieee.org/abstract/document/8890423 (accessed: 18.08.2021). 10.1109/DASC/PiCom/CBDCom/ CyberSciTech.2019.00177

13. Saavedra MZNL, Yu W. Towards Large Scale Packet Capture and Network Flow Analysis on Hadoop. In: Proc. 6th Int. Workshop on Computer Systems and Architectures; 2018. P. 186–189. URL: www.researchgate.net/publication/329905189_Towards_Large_Scale_Packet_Capture_and_Network_Flow_Analysis_on_Hadoop (accessed: 18.08.2021). 10.1109/CANDARW.2018.00043

14. József Marton, Gábor Szárnyas, Dániel Varró. Formalising openCypher Graph Queries in Relational Algebra. In: Proc. 21st European Conf. on Advances in Databases and Information Systems. 2015;10509:53–68. 10.1007/978-3-319-66917-5_13

15. Alekh Jindal, Samuel Madden, Malu Castellanos, et al. Graph Analytics using Vertica Relational Database. IEEE Xplore, 2015. P. 1191–1200. URL: www.ieeexplore.ieee.org/document/7363873 (accessed: 18.08.2021).