2013
DOI: 10.1109/tc.2012.67
|View full text |Cite
|
Sign up to set email alerts
|

On the Selection of Management/Monitoring Nodes in Highly Dynamic Networks

Abstract: This paper addresses the problem of provisioning management/monitoring nodes within highly dynamic network environments, particularly virtual networks. In a network where nodes and links may be spontaneously created and destroyed (perhaps rapidly) there is a need for stable and responsive management and monitoring which does not create a large load (in terms of traffic or processing) for the system. A subset of nodes has to be chosen for management/monitoring, each of which will manage a subset of the nodes in… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
27
0

Year Published

2013
2013
2018
2018

Publication Types

Select...
4
2
2

Relationship

5
3

Authors

Journals

citations
Cited by 29 publications
(27 citation statements)
references
References 36 publications
0
27
0
Order By: Relevance
“…[21] [22]). In this work, we develop an approach based on a modified version of the leader node selection algorithm proposed by Clegg et al in [23], which more closely relates to our application scenario. The algorithm, called Pressure, aims at determining, given a dynamic network environment, the subset of nodes on which to install monitoring points in order to minimize the average distance (in terms of hop count) between the monitoring entities and the network nodes.…”
Section: A Placement Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…[21] [22]). In this work, we develop an approach based on a modified version of the leader node selection algorithm proposed by Clegg et al in [23], which more closely relates to our application scenario. The algorithm, called Pressure, aims at determining, given a dynamic network environment, the subset of nodes on which to install monitoring points in order to minimize the average distance (in terms of hop count) between the monitoring entities and the network nodes.…”
Section: A Placement Algorithmmentioning
confidence: 99%
“…The main principle is to select, at each step, the location at which, if a LC is installed, will lead to the largest reduction in terms of average distance. To decide on the location, the algorithm maintains a list of locations at which it is still possible to install a LC and, at each step, it calculates the Pressure score of the node i associated with each of these locations as follows [23]:…”
Section: A Placement Algorithmmentioning
confidence: 99%
“…The problem of the allocation of network functions has been investigated in a wide range of contexts, ranging from the placement of monitoring agents (e.g. [10]) to the selection of network service gateways (e.g. [11]).…”
Section: B Related Workmentioning
confidence: 99%
“…The decision on to which node to attach the next LM is based on a metric, called Pressure score [10], defined for each node, which measures the benefits of selecting the node as a LM location in terms of average LM-node distance reduction. More specifically, the Pressure score of node i is defined as:…”
Section: A Manager/controller Placement Problemmentioning
confidence: 99%
“…This development is a small software-based service and network testbed -the Very Lightweight Software Driven Network and Services (VLSP) [1] [11], which comprises a very lightweight virtual router element combined with virtual network connectivity. These elements can be combined in order to build any network topology required.…”
Section: Ivsdnet Control and Management Testbedmentioning
confidence: 99%