Graph-based Tool for Bandwidth Estimation, Health Monitoring and Update Planning in Broadband Networks
by Gian Paolo Jesi 1,* 
, Andrea Odorizzi 1, Gianluca Mazzini 2
1 Network Department, Lepida ScpA, Bologna, 40128, Italy
2 Engineering Department, University of Ferrara, Ferrara, 44121, Italy
* Author to whom correspondence should be addressed.
Journal of Engineering Research and Sciences, Volume 2, Issue 4, Page # 1-13, 2023; DOI: 10.55708/js0204001
Keywords: Graphs, Network bandwidth, Broadband
Received: 27 December 2022, Accepted: 23 March 2023, Published Online: 28 April 2023
APA Style
Chicago/Turabian Style
IEEE Style
This paper focuses on the genesis and evolution of our specific Company tool. It is aimed to tackle the problem of verifying the health status and availability of residual bandwidth between any node over the Lepida ScpA broadband network. In fact, there must be a correspondence between active contractual obligations signed by local network operators and the physical bandwidth which we allocate. This is the key factor that must be addressed in the early phases when processing any bandwidth requests from local customers. Before the introduction of our tool, this verification process has been carried out almost manually with a substantial cost in terms of time. The adoption of this in-house developed tool allowed us to substantially shrink of the verification time required and to provide an overview of the network status. Our tool is grounded on building a graph representation of the network and on well known graph algorithms.
- “LepidaScpA Home Page”, 2022.
- “Nagios Monitoring Solutions”, 2022.
- “Network monitoring with intuition”, 2022.
- V. J. Ribeiro, J. Navrátil, R. H. Riedi, R. Baraniuk, L. Cottrell, “pathchirp: Efficient available bandwidth estimation for network paths”, 2003.
- R. L. Carter, M. E. Crovella, “Measuring bottleneck link speed in packet-switched networks”, Performance Evaluation, vol. 27-28, pp. 297–318, 1996, doi:https://doi.org/10.1016/S0166-5316(96)90032-2.
- M. Allman, “Measuring end-to-end bulk transfer capacity”, “Proceed- ings of the 1st ACM SIGCOMM Workshop on Internet Measurement”, IMW ’01, p. 139–143, Association for Computing Machinery, New York, NY, USA, 2001, doi:10.1145/505202.505220.
- “Elastic Stack”, 2022.
- “Graphana Labs”, 2022.
- “NEO4J Graph Data Platform”, 2022.
- Y. Dinitz, Dinitz’ Algorithm: The Original Version and Even’s Version, pp. 218–240, Springer Berlin Heidelberg, Berlin, Heidelberg, 2006, doi:10.1007/11685654_10.
- Y. Boykov, V. Kolmogorov, “An experimental comparison of min- cut/max-flow algorithms for energy minimization in vision”, “Thirdy Minimization Methods in Common and Pattern Recognition”, vol. 23, pp. 1124–1137, 2004.
- G. P. Jesi, G. Mazzini, “Banda calculus: a tool for bandwidth estimation in broadband network infrastructures”, “2020 International Conference on Software, Telecommunications and Computer Networks (Soft- COM)”, pp. 1–5, 2020, doi:10.23919/SoftCOM50211.2020.9238312.
- G. P. Jesi, A. Odorizzi, G. Mazzini, “Exploit company knowledge from graphs with banda calculus”, “2021 International Conference on Software, Telecommunications and Computer Networks (SoftCOM)”, pp. 1–6, 2021, doi:10.23919/SoftCOM52868.2021.9559101.
- “Project Jupyter”, 2022.
- “NetworkX – Network Analysis in Python”, 2022.
- “Low-Code Data Apps”, 2022.
- Cytoscape – Network Data Integration, Analysis, and Visualization a Box”, 2022.
Citations by Dimensions
Citations by PlumX
Crossref Citations
This paper is currently not cited.
