Abstract
Optical networks are the main traffic carriers of all the modern communications. All the core and regional networks are very much optical these days. Even in the metro and access area networks, we now have a lot of presence of optical fibers. With the growth of traffic, the complexities of management and control aspects of the optical networks increase. In optical networks, shortest path and the minimum hop paths are not the only choices when the network operates at its optimum capacity level. Rather, several other paths are chosen for routing and traffic management, which are neither the shortest nor minimum hop path lengths. So, there is a requirement to understand the statistics of these paths. In this paper, we analyze the path lengths of 35 real optical transport networks (OTNs). For this study, we used 65 different statistical distributions. We found that both Wakeby and Johnson SB distributions are very much suitable for the modeling of path lengths in OTNs. The validity of our statistical measurements was checked using Kolmogorov–Smirnov statistic (KSS). For both Wakeby and Johnson SB distributions, all the KSS values obtained are valid at 95% confidence interval for all 35 networks.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Barabási AL (2013) Network science. Philos Trans Roy Soc A 371(1987):1–3
Ramaswamy R, Shivrajan K, Sasaki G (2010) Optical networks: a practical perspective, 2nd edn. Morgan Khufman, San Fraccisco, CA, USA
Routray SK et al (2015) Statistical analysis and modelling of optical transport networks: characterization and application. In: Proceedings of international conference on telecommunication (ConfTele), Aveiro, Portugal, September 2015
Reference Optical Networks (last updated: 23 Jan 2015). [Online]. Available: http://www.av.it.pt/anp/on/refnet2.html
Routray SK, Sahin G, da Rocha JRF, Pinto AN (2015) Statistical analysis and modeling of shortest path lengths in optical transport networks. IEEE/OSA J Opt Commun Netw 33(13):2791–2801
Routray SK, Morais RM, da Rocha JRF, Pinto AN (2013) Statistical model for link lengths in optical transport networks. J Opt Commun Netw 5(7):762–773
Korotky SK (2004) Network global expectation model: a statistical formalism for quickly quantifying network needs and costs. IEEE/OSA J Lightwave Technol 22(3):703–722
Labourdette JF, Bouillet E, Ramamurthy R, Akyamac AA (2005) Fast approximate dimensioning and performance analysis of mesh optical networks. IEEE/ACMJ Trans Netw 3(4):906–917
Bauckhage C, Kersting K, Rastegarpanah B (2013) The weibull as a model of shortest path distributions in random networks. In: Proceedings of ACM international workshop on mining learning graphs, Chicago, IL, USA
Zhu Z, Lu W, Zhang L, Ansari N (2013) Dynamic service provisioning in elastic optical networks with hybrid single-/multi-path routing. J Lightwave Technol 31(1):15–22
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2019 Springer Nature Singapore Pte Ltd.
About this paper
Cite this paper
Malladi, M. et al. (2019). Statistical Analysis of Path Length in Optical Networks. In: Saini, H., Singh, R., Patel, V., Santhi, K., Ranganayakulu, S. (eds) Innovations in Electronics and Communication Engineering. Lecture Notes in Networks and Systems, vol 33. Springer, Singapore. https://doi.org/10.1007/978-981-10-8204-7_46
Download citation
DOI: https://doi.org/10.1007/978-981-10-8204-7_46
Published:
Publisher Name: Springer, Singapore
Print ISBN: 978-981-10-8203-0
Online ISBN: 978-981-10-8204-7
eBook Packages: EngineeringEngineering (R0)