Abstract
To study the underlying organizing principles of various complex systems, designing an efficient graph-based model for data representation, is a fundamental aspect. As the topological structure of the network changes over time, it is a challenging task to design a communication system having ability to respond to randomly changing traffic. We are interested to find out the suitable and fair traffic flow rates to each system for getting optimal system utility using dynamic complex network model. In this context, we design and simulate a growth model of the data communication network based on the dynamics of in-flowing links which is motivated by the concept that newly added node will connect to the most influential nodes already present in the system. The connectivity distribution of the evolved communication networks follows power law form, free from network scale. We analyze Kelly’s optimization framework for a rate allocation problem in communication networks at different time instants, and optimal rates are obtained with the consideration of arbitrary communication delays.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Adamic, L.A., Huberman, B.A.: Power-law distribution of the world wide web. science 287(5461), 2115–2115 (2000)
Albert, R., Barab´asi, A.L.: Statistical mechanics of complex networks. Reviews of modern physics 74(1), 47 (2002)
Aoki, T., Rocha, L.E., Gross, T.: Temporal and structural heterogeneities emerging in adaptive temporal networks. Physical Review E 93(4), 040,301 (2016)
Barab´asi, A.L., Albert, R., Jeong, H.: Mean-field theory for scale-free random networks. Physica A: Statistical Mechanics and its Applications 272(1), 173–187 (1999)
Casteigts, A., Flocchini, P., Quattrociocchi,W., Santoro, N.: Time-varying graphs and dynamic networks. International Journal of Parallel, Emergent and Distributed Systems 27(5), 387–408 (2012)
Erd¨os, P., R´enyi, A.: On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci 5(17-61), 43 (1960)
Golubitsky, M., Stewart, I.: Nonlinear dynamics of networks: the groupoid formalism. Bulletin of the american mathematical society 43(3), 305–364 (2006)
Kelly, F., Voice, T.: Stability of end-to-end algorithms for joint routing and rate control. ACM SIGCOMM Computer Communication Review 35(2), 5–12 (2005)
Kelly, F.P.: Mathematical modelling of the internet. Mathematics unlimited-2001 and beyond pp. 685–702 (2001)
Kim, H., Anderson, R.: Temporal node centrality in complex networks. Physical Review E 85(2), 026,107 (2012)
Kivel¨a, M., Arenas, A., Barthelemy, M., Gleeson, J.P., Moreno, Y., Porter, M.A.: Multilayer networks. Journal of Complex Networks 2(3), 203–271 (2014)
Kumari, S., Singh, A., Ranjan, P.: Towards a framework for rate control on dynamic communication networks. In: Proceedings of the International Conference on Internet of Things and Cloud Computing, ICC ’16, pp. 12:1–12:7. ACM, New York, NY, USA (2016). DOI 10.1145/2896387.2896397. URL http://doi.acm.org/10.1145/2896387.2896397
La, R.J., Anantharam, V.: Utility-based rate control in the internet for elastic traffic. IEEE/ACM Transactions on Networking (TON) 10(2), 272–286 (2002)
La, R.J., Ranjan, P.: Asymptotic stability of a primal algorithm with a finite communication delay. In: Decision and Control, 2006 45th IEEE Conference on, pp. 644–649. IEEE (2006)
Newman, M.: Complex systems: A survey. arXiv preprint arXiv:1112.1440 (2011)
Newman, M.E.: The structure and function of complex networks. SIAM review 45(2), 167–256 (2003)
Ranjan, P., La, R.J., Abed, E.H.: Global stability conditions for rate control with arbitrary communication delays. IEEE/ACM Transactions on Networking (TON) 14(1), 94–107 (2006)
Singh, A., Singh, Y.N.: Nonlinear spread of rumor and inoculation strategies in the nodes with degree dependent tie stregth in complex networks. Acta Physica Polonica B 44(1), 5–28 (2013)
Singh, A., Singh, Y.N.: Rumor dynamics with inoculations for correlated scale free networks. In: Communications (NCC), 2013 National Conference on, pp. 1–5. IEEE (2013)
Tadi´c, B.: Dynamics of directed graphs: the world-wide web. Physica A: Statistical Mechanics and its Applications 293(1), 273–284 (2001)
Tang, J., Scellato, S., Musolesi, M., Mascolo, C., Latora, V.: Small-world behavior in time varying graphs. arXiv preprint arXiv:0909.1712 (2009)
Watts, D.J., Strogatz, S.H.: Collective dynamics of small-worldnetworks. nature 393(6684), 440–442 (1998)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2017 Springer International Publishing AG
About this paper
Cite this paper
Kumari, S., Singh, A. (2017). Modeling of Data Communication Networks using Dynamic Complex Networks and its Performance Studies. In: Cherifi, H., Gaito, S., Quattrociocchi, W., Sala, A. (eds) Complex Networks & Their Applications V. COMPLEX NETWORKS 2016 2016. Studies in Computational Intelligence, vol 693. Springer, Cham. https://doi.org/10.1007/978-3-319-50901-3_3
Download citation
DOI: https://doi.org/10.1007/978-3-319-50901-3_3
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-50900-6
Online ISBN: 978-3-319-50901-3
eBook Packages: EngineeringEngineering (R0)