RT Journal Article
JF IEEE Transactions on Computers
YR 2013
VO 62
SP 1207
TI On the Selection of Management/Monitoring Nodes in Highly Dynamic Networks
A1 George Pavlou,
A1 Stuart Clayman,
A1 Richard G. Clegg,
A1 Lefteris Mamatas,
A1 Alex Galis,
K1 Monitoring
K1 Context
K1 Estimation
K1 Computer architecture
K1 Prediction algorithms
K1 Ad hoc networks
K1 Mobile computing
K1 computer systems architecture
K1 Network monitoring
K1 network management
AB 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 the network. A new, simple, and locally optimal greedy algorithm called Pressure is provided for choice of node position to minimize traffic. This algorithm is combined with a system for predicting the lifespan of nodes, and a tunable parameter is also given so that a system operator could express a preference for elected nodes to be chosen to reduce traffic, to be "stable,” or some compromise between these positions. The combined algorithm called PressureTime is lightweight and could be run in a distributed manner. The resulting algorithms are tested both in simulation and in a testbed environment of virtual routers. They perform well, both at reducing traffic and at choosing long lifespan nodes.
PB IEEE Computer Society, [URL:http://www.computer.org]
SN 0018-9340
LA English
DO 10.1109/TC.2012.67
LK http://doi.ieeecomputersociety.org/10.1109/TC.2012.67