Optimal network partitioning for fault-tolerant network management using evolutionary programming

doi:10.1016/0020-0190(94)00024-7

Information Processing Letters

Volume 50, Issue 3, 9 May 1994, Pages 145-149

https://doi.org/10.1016/0020-0190(94)00024-7 Get rights and content

Abstract

This paper explores the applicability of clustering methods for obtaining an optimal partition of a network. In order to make the network management fault-tolerant, more than one management center is assigned to each cluster of nodes in the partition. Gradient descent partition methods converge to locally optimal partitions. In contrast, a stochastic search method called evolutionary programming is employed to search for a globally optimal partition that minimizes the communication cost.

References (7)

A. Bouloutas et al.
Clustering schemes for network management
Proc. 10th Ann. Joint Conf. of the IEEE Computer and Comm. Societies
(1991)
L.N. Cassel et al.
Network management architectures and protocols: Problems and approaches
IEEE J. Selected Areas Comm.
(1989)
D.B. Fogel
Evolving artificial intelligence
Doctoral Dissertation
(1992)

There are more references available in the full text version of this article.

Cited by (3)

Digital data networks design using genetic algorithms
2000, European Journal of Operational Research
Communication networks have witnessed significant growth in the last decade due to the dramatic growth in the use of Internet. The reliability and service quality requirements of modern data communication networks and the large investments in communications infrastructure have made it critical to design optimized networks that meet the performance parameters. Digital Data Service (DDS) is a popular communication service that provides users with a digital connection. The design of a DDS network is a special case of the classic Steiner-tree problem of finding the minimum cost tree connecting a set of nodes, using Steiner nodes. Since it is a combinatorial optimization problem several heuristic algorithms have been developed including Tabu search, and branch and cut algorithm. In this paper, a new approach using genetic algorithms (GAs) is proposed to solve the problem. The results from GA are compared with the Tabu search method. The results indicate that GA performs as well as Tabu search in terms of solution quality but has lower computation time. However, reducing the number of iterations in Tabu search makes it faster than GA and comparable in solution quality with GA.
Artificial intelligence approaches to network management: Recent advances and a survey
1997, Computer Communications
With increased number of new services and users being added to the communication network, management of such networks becomes crucial to provide assured quality of service. Finding skilled managers is often a problem. To alleviate this problem and also to provide assistance to the available network managers, network management has to be automated. Many attempts have been made in this direction and it is a promising area of interest to researchers in both academia and industry. In this paper, a review of the management complexities in present day networks and artificial intelligence approaches to network management are presented.
Transfer of Information using Blockchain Technology
2023, Proceedings of the 8th International Conference on Communication and Electronics Systems, ICCES 2023

View full text

Information Processing Letters

Optimal network partitioning for fault-tolerant network management using evolutionary programming

Abstract

Clustering schemes for network management

Proc. 10th Ann. Joint Conf. of the IEEE Computer and Comm. Societies

Network management architectures and protocols: Problems and approaches

IEEE J. Selected Areas Comm.

Evolving artificial intelligence

Doctoral Dissertation

Digital data networks design using genetic algorithms

Artificial intelligence approaches to network management: Recent advances and a survey

Transfer of Information using Blockchain Technology