A. Bouloutas and P. M. Gopal, Clustering Schemes for Network Management, in: Proceedings of 10th Annual Joint Conference of the IEEE Computer and Communication Societies, IEEE INFOCOM, pp.111-120, 1991. Home/Search Document Not in Database Summary Related Articles Check |
This paper is cited in the following contexts:
Network Restoration Using Recurrent Neural Networks - Kumar, Venkataram (Correct)
....the failed links. The restoration algorithm is initiated in case of link failure and successfully terminates if sufficient spare bandwidth is available in the network. This model assumes a centralized manager for every network. The manager is chosen as a node that is close to the all other nodes [4][20] 24] In the interconnected network environment, the managers use some protocols to interact with one another. We use the static information to restore the network. We assume that, whenever a network connection has to be established, the manager creates it based on the bandwidth available on ....
....D(N N) is the matrix, where the element d i;j represents the distance between the node i and node j. Consider a network G(V ) having N nodes. Taking away the source and the destination, rest of the nodes are mapped onto 0 : N 3) using a function map(i) For example, consider N = 6 and V = [1,2,3,4,5,6]. If 2 and 4 are the source and the destination, the map(i) refers to the element i of the vector V1 = 1 3 5 6] formed by removing the source and the destination from the vector V. Definition 2 : Spin matrix S( N 2) N 2) is a reduced matrix, where s i;j = 1 if node i is accepted on the ....
A. Bouloutas and P. M. Gopal, Clustering Schemes for Network Management, in: Proceedings of 10th Annual Joint Conference of the IEEE Computer and Communication Societies, IEEE INFOCOM, pp.111-120, 1991.
AI Approaches to Network Management: Recent Advances and A.. - Kumar, Venkataram (Correct)
....regions such that, the number of nodes and the number of management centers in each region are constrained and a criterion function, representing the communication cost, is minimized. Finding an optimal partition is a combinatorial optimization problem and it has been proved to be NP complete [33][34] 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 10 method called evolutionary ....
A. Bouloutas and P. M. Gopal, Clustering Schemes for Network Management, in: Proc. 10th Annual Joint Conf. of the IEEE Computer and Comm. Societies, IEEE INFOCOM, pp.111-120, 1991. 21
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC