Published January 2, 2020 | Version v1
Preprint Open

A Tradeoff Approach for the Scalability Issue in Large Self-Managed Networks

  • 1. Salvador University - UNIFACS

Description

Autonomic systems for network management are available and present significant benefits such as the reduction of human intervention, performance improvement and optimization of available resources. However, large networks composed by hundreds of nodes (routers) present a challenging scalability issue in relation to the development and implementation of self-management solutions. In effect, computational complexity required for autonomic solutions increases with network size resulting, typically, in unacceptable response time for an effective near real-time set of management action implementations. Alternatives that may be explored to deal with the scalability problem include the increase of computational resources supporting the autonomic management solution and the reduction of managed network size and, consequently, computational complexity. The first approach is realizable but implies, typically, in a significant cost increase for the autonomic solution. The reduction of managed network size, whenever realized preserving the quality of the overall autonomic solution, may represent an important tradeoff for managers in the direction of realizable and affordable autonomic management solutions. This paper proposes the systematic use of two parameters, robustness and performability, to deal with the scalability issue in large self-managed networks. These parameters will support managers in implementing self-management solutions by considering the tradeoff between solution's quality and execution time. Robustness and performability are, in turn, parameters resulted from a network partitioning method based on network density.

Files

Paper 2010 - JSMNet PREPRINT - A Tradeoff Approach - APNOMS 2011.pdf

Files (749.1 kB)

Additional details

References

  • B. Jennings, S. van der Meer, S. Balasubramaniam, D. Botvich, M. Foghlu, W. Donnelly, and J. Strassner, "Towards autonomic management of communications networks," Communications Magazine, IEEE, vol. 45, no. 10, pp. 112–121, October 2007.
  • I. G. B. Yahia, E. Bertin, and N. Crespi, "Towards autonomic management for next generation services," in Proceedings of the International conference on Networking and Services (ICNS '06). Washington, DC, USA: IEEE Computer Society, 2006, p. 38.
  • Z. Jrad, F. Krief, L. Dehni, and Y. Bennani, "Artificial intelligence techniques in the dynamic negotiation of qos: A user interface for the internet new generation," in Autonomic Networking, ser. Lecture Notes in Computer Science, D. Ga¨ıti, G. Pujolle, E. S. Al-Shaer, K. L. Calvert, S. A. Dobson, G. Leduc, and O. Martikainen, Eds., vol. 4195. Springer, 2006, pp. 146–158.
  • S. Dobson, S. Denazis, A. FernA˜ ¡ndez, D. Ga¨ıti, E. Gelenbe, F. Massacci, P. Nixon, F. Saffre, N. Schmidt, and F. Zambonelli, "A survey of autonomic communications," ACM Trans. Auton. Adapt. Syst., vol. 1, no. 2, pp. 223–259, 2006.
  • B. V. Cherkassky, A. V. Goldberg, and T. Radzik, "Shortest paths algorithms: theory and experimental evaluation," in SODA '94: Proceedings of the fifth annual ACM-SIAM symposium on Discrete algorithms. Philadelphia, PA, USA: Society for Industrial and Applied Mathematics, 1994, pp. 516–525.
  • R. M. S. Bezerra and J. S. B. Martins, "A policy-based autonomic model suitable for quality of service management," Journal of Networks (JNW), vol. 4, no. 6, pp. 495–504, 2009.
  • R. M. S. Bezerra and J. S. Martins, "A sense and react plane structured autonomic model suitable for qos management," in Proceedings of 5th International IEEE Workshop on Management of Ubiquitous Communications and Services, 2008, pp. 275 – 280.
  • J. P. G. Sterbenz, D. Hutchison, E. K. C¸ etinkaya, A. Jabbar, J. P. Rohrer, M. Sch¨oller, and P. Smith, "Resilience and survivability in communication networks: Strategies, principles, and survey of disciplines," Comput. Netw., vol. 54, pp. 1245–1265, June 2010.
  • M. Newman and M. Girvan, "Finding and evaluating community structure in networks," Physical Review E, vol. 69, 2004. [Online]. Available: http://www.citebase.org/abstract?id=oai:arXiv.org:cond-mat/0308217.
  • A. Clauset, M. Newman, and C. Moore, "Finding community structure in very large networks," Physical Review E, vol. 70, 2004. [Online]. Available: doi:10.1103/PhysRevE.70.066111.
  • M. Newman, "Finding community structure in networks using the eigenvectors of matrices," Physical Review E, vol. 74, 2006. [Online]. Available: doi:10.1103/PhysRevE.74.036104.
  • P. Pons and M. Latapy, "Computing communities in large networks using random walks," Journal of Graph Algorithms and Applications, vol. 10, no. 2, pp. 191–218, 2006.
  • R. M. S. Bezerra and J. S. B. Martins, "Network partitioning and selfsizing methods for qos management with autonomic characteristics," in APNOMS, ser. Lecture Notes in Computer Science, C. S. Hong, T. Tonouchi, Y. Ma, and C.-S. Chao, Eds., vol. 5787. Springer, 2009, pp. 151–160.
  • E. W. Dijkstra, "A note on two problems in connexion with graphs," Numerische Mathematik, vol. 1, no. 1, pp. 269–271, December 1959. [Online]. Available: http://dx.doi.org/10.1007/BF01386390.
  • R. Bellman, "On a Routing Problem," Quarterly of Applied Mathematics, vol. 16, pp. 87–90, 1958.
  • D. B. Johnson, "Efficient algorithms for shortest paths in sparse networks," J. ACM, vol. 24, no. 1, pp. 1–13, 1977.
  • A. V. Goldberg and R. E. Tarjan, "A new approach to the maximum flow problem," in Proceedings of the eighteenth annual ACM symposium on Theory of computing, ser. STOC '86. New York, NY, USA: ACM, 1986, pp. 136–146. [Online]. Available: http://doi.acm.org/10.1145/12130.12144
  • R Development Core Team, R: A Language and Environment for Statistical Computing, R Foundation for Statistical Computing, Vienna, Austria, 2011, ISBN 3-900051-07-0. [Online]. Available: http://www.R-project.org
  • G. Csardi, igraph Manual, Universitat de Lausanne, Lausanne, Switzerland, 2010. [Online]. Available: http://igraph.sourceforge.net/