Submitted by richard on
Paper type:
Journal Paper
IEEE Transactions on Computers, vol.62, no.6, pp.1207,1220
Year:
2013
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 the network.
A new, simple and locally optimal greedy algorithm called
Pressure is provided for choice of node position to minimise
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 com-
promise 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 life-span nodes.
Description:
This paper considers the problems of placing management or monitoring nodes in a dynamic network. It trades off:
1) Selecting long-lived nodes
and
2) Selecting optimal nodes for traffic (close to the nodes they manage).
Preprint:
bibtex:
@ARTICLE{clegg_manage_elect_2013,
author={Clegg, R.G. and Clayman, S. and Pavlou, G. and Mamatas, L. and Galis, A.},
journal={Computers, IEEE Transactions on},
title={On the Selection of Management/Monitoring Nodes in Highly Dynamic Networks},
year={2013},
volume={62},
number={6},
pages={1207-1220}
}
doi:
doi://10.1109/TC.2012.67
Subject area:
This talk describes FLICK a system for the application-specific middlebox. It consists of three parts:
1) A domain specific language for the middlebox that allows easy development of typical middlebox functions.
2) An abstraction, the task graph, that allows the breaking of middlebox functions into easily parallelisable work units.
3) The system -- this implements the compiled language, handles TCP connections and memory management.
The whole system is comparable in speed to a specialist implementation.