GRAPH VISUALIZATION OF TRACEROUTE UTILITY RESULTS FOR COMPUTER NETWORK ANALYSIS

Ivan Danych, Kvitoslava Obelovska, Zoreslava Shpak

Abstract


Background. Monitoring destination reachability, path discovery, and latency analysis is essential for network performance, reliability, and security. The traceroute utility is widely used for path diagnostics, but its text-based output limits the ability to perform complex analysis of network capabilities. ICMP traffic filtering, rate limiting, and load balancing cause missing hops in route displays, non-monotonic delays, and artifacts that are difficult to detect in tabular form. Existing visualization methods rely on geolocation databases and emphasize geographical aspects rather than network topology. Therefore, developing a geolocation-independent graph-based visualization tool for traceroute is relevant.

Materials and Methods. The proposed graph-based approach converts single and multiple traceroute results into a unified weighted directed graph, where vertices represent IP-defined nodes. Unknown nodes are handled using two strategies: explicit labeling or skipping with a direct connection between known nodes. The following edge-weighting criteria are introduced: occurrence frequency, used to identify critical links, and average round-trip time (RTT), used to detect latency segments. Graph visualization is performed using the Fruchterman-Reingold algorithm. The system is implemented in Java with JavaFX, Spring Core, and GraphStream, supports both archived results import and real-time tracing via a multithreaded producer-consumer model, ensuring graph integrity.

Results and Discussion. Combining multiple traceroutes into a single graph enables quick identification of shared segments and critical nodes. Systematic RTT non-monotonicity, likely caused by rate limiting, supports using absolute rather than incremental RTT values. In the experiments conducted, the multithreaded mode accelerates graph construction fourfold with seven threads, but it also increases the number of timeouts. Using five threads achieves an optimal balance between speed and data quality.

Conclusion. The proposed approach improves network analysis efficiency by constructing a geolocation-independent graph for diagnostics. The developed system reduces cognitive load compared to tabular logs analysis and speeds up detection of bottlenecks, common segments, critical nodes, and routing anomalies.

Keywords: traceroute, graph visualization, network topology, network monitoring, weighted directed graphs


Full Text:

PDF

References


[1] Caiazza, C., Luconi, V., & Vecchio, A. (2019). TCP-based traceroute: An evaluation of different probing methods. Internet Technology Letters, 2(6), e134. https://doi.org/10.1002/itl2.134

[2] Luckie, M., Hyun, Y., & Huffaker, B. (2008). Traceroute probe method and forward IP path inference. In Proceedings of the 8th ACM SIGCOMM Conference on Internet Measurement (IMC ’08) (pp. 311–317). Association for Computing Machinery. https://doi.org/10.1145/1452520.1452553

[3] Guo, H., & Heidemann, J. (2018, March). Detecting ICMP rate limiting in the Internet. In R. Beverly, G. Smaragdakis, & A. Feldmann (Eds.), Proceedings of the 19th International Conference on Passive and Active Network Measurement (PAM 2018, Berlin, Germany) (LNCS 10771, pp. 3-17). Springer. https://doi.org/10.1007/978-3-319-76481-8_1

[4] Li, W., Zhang, D., Xie, G., & Yang, J. (2005). TCP and ICMP in network measurement: An experimental evaluation. Parallel and Distributed Processing and Applications, Lecture Notes in Computer Science, 3758(3), 870–881. https://doi.org/10.1007/11576235_87

[5] Augustin, B., Cuvellier, X., Orgogozo, B., Viger, F., Friedman, T., Latapy, M., Magnien, C., & Teixeira, R. (2006). Avoiding traceroute anomalies with Paris traceroute. Proceedings of the 6th ACM SIGCOMM Conference on Internet Measurement (IMC'06), 153–158. https://doi.org/10.1145/1177080.1177100

[6] VisualTraceroute. (n.d.). Visual traceroute. Retrieved from https://visualtraceroute.net/

[7] Sundin, S. (n.d.). Traceroute mapper. GitHub Pages. Retrieved from https://stefansundin.github.io/traceroute-mapper/

[8] Traceroute Online. (n.d.). Traceroute online. Retrieved from https://traceroute-online.com

[9] GeoTraceroute. (n.d.). GeoTraceroute. Retrieved from https://geotraceroute.com/

[10] Fischer, F., Fuchs, J., Vervier, P.-A., Mansmann, F., & Thonnard, O. (2012). VisTracer: A visual analytics tool to investigate routing anomalies in traceroutes. Proceedings of the Ninth International Symposium on Visualization for Cyber Security (VizSec '12), 80–87. https://doi.org/10.1145/2379690.2379701

[11] Cheong, S.-H., & Si, Y.-W. (2022). Force-directed algorithms for schematic drawings and placement: A survey. arXiv preprint arXiv:2204.01006. https://arxiv.org/abs/2204.01006

[12] Obelovska, K., Danych, I. (2022). Adoption of the OMNET++ Simulator for the Computer Networks Learning: A Case Study in CSMA Schemes. In: Hu, Z., Zhang, Q., Petoukhov, S., He, M. (eds) Advances in Artificial Systems for Logistics Engineering. ICAILE 2022. Lecture Notes on Data Engineering and Communications Technologies, vol 135. Springer, Cham. https://doi.org/10.1007/978-3-031-04809-8_21

[13] Microsoft. (n.d.). tracert. In Windows Server: Windows commands. Microsoft Learn. https://learn.microsoft.com/uk-ua/windows-server/administration/windows-commands/tracert

[14] Postel, J. (1981). Internet control message protocol. RFC 792. Internet Engineering Task Force (IETF). https://datatracker.ietf.org/doc/html/rfc792

[15] Baker, F. (1995). Requirements for IP version 4 routers. RFC 1812. Internet Engineering Task Force (IETF). https://datatracker.ietf.org/doc/html/rfc1812

[16] Danych, I. M., & Shpak, Z. Y. (2025). Methods and tools for graph visualization in dynamic systems: An experimental study. Ukrainian Journal of Information Technology, 7(1), 131–139. https://doi.org/10.23939/ujit2025.01.131




DOI: http://dx.doi.org/10.30970/eli.32.1

Refbacks

  • There are currently no refbacks.