Abstract
The increasing complexity, heterogeneity and unpredictability of networks make the task of managing these systems highly complex. The autonomic computing paradigm brings innovative solutions to the network management area with new adaptable and “clever” solutions which should consider a heterogeneous functionality in a wide variety of fields. One of the challenges involved in proposing autonomic solutions for QoS management consists of dealing with the inherent complexity and proposing solutions with feasible execution time. In brief, the autonomic solution effective response time should be fast enough so that it could be applied before any new important network state change. In this paper, a framework that uses self-partitioning methods is considered as the basis for evaluating a solution to the problem of dynamic LSPs setup allocation in a general MPLS network topology focusing on keeping a low complexity solution and aiming at achieving the best possible problem solution identification response time.
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
Preview
Unable to display preview. Download preview PDF.
References
Jennings, B., van der Meer, S., Balasubramaniam, S., Botvich, D., Foghlu, M., Donnelly, W., Strassner, J.: Towards autonomic management of communications networks. Communications Magazine, IEEE 45(10), 112–121 (2007)
Nalatwad, S., Devetsikiotis, M.: Self-sizing networks: local vs. global control. In: Proceedings of IEEE International Conference on Communications, June 2004, vol. 4, pp. 2163–2167 (2004)
Pons, P., Latapy, M.: Computing communities in large networks using random walks. Journal of Graph Algorithms and Applications 10(2), 191–218 (2006)
Newman, M.E.J., Girvan, M.: Finding and evaluating community structure in networks. Physical Review E 69 (2004)
Newman, M.E.J.: Finding community structure in networks using the eigenvectors of matrices. Physical Review E 74 (2006)
Clauset, A., Newman, M.E.J., Moore, C.: Finding community structure in very large networks. Physical Review E 70 (2004)
Bezerra, R.M.S., Martins, J.S.B.: A sense and react plane structured autonomic model suitable for quality of service (qos) management. In: Proceedings of 5th International IEEE Workshop on Management of Ubiquitous Communications and Services, vol. 1 (Maio 2008)
Bezerra, R.M.S., Martins, J.S.B.: Functional decoupling principle applied to network device and qos management. In: Proceedings of 7me Colloque Francophone of Gestion of Rseaux et of Services, June 2006, vol. 1, pp. 47–58 (2006)
R Development Core Team: R: A Language and Environment for Statistical Computing. R Foundation for Statistical Computing, Vienna, Austria (2009) ISBN 3-900051-07-0
Bezerra, R.M.S., Martins, J.S.B.: Penalty-based lsp allocation algorithm. Technical Report TR-01-AN2009, DMCC (2009)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2009 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
da Silva Bezerra, R.M., Martins, J.S.B. (2009). Network Partitioning and Self-sizing Methods for QoS Management with Autonomic Characteristics. In: Hong, C.S., Tonouchi, T., Ma, Y., Chao, CS. (eds) Management Enabling the Future Internet for Changing Business and New Computing Services. APNOMS 2009. Lecture Notes in Computer Science, vol 5787. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04492-2_16
Download citation
DOI: https://doi.org/10.1007/978-3-642-04492-2_16
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-642-04491-5
Online ISBN: 978-3-642-04492-2
eBook Packages: Computer ScienceComputer Science (R0)