On the selection of management/monitoring nodes in highly dynamic networks

Paper type: 
Journal Paper
Richard G. Clegg, Stuart Clayman, George Pavlou, Lefteris Mamatas and Alex Galis
IEEE Transactions on Computers, vol.62, no.6, pp.1207,1220, 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: 
PDF icon manage_elect.pdf
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
Publisher link: 
http://dx.doi.org/10.1109/TC.2012.67
Subject area: 
Modelling
Network Management

News

  • Workshop paper
    Raphtory: Decentralised Streaming for Temporal Graphs
    Demo and Doctoral Workshop DEBS (Distributed and Event Based Systems)

    This work in progress was accepted as a Demo and at the Doctoral workshop for DEBS (Distributed and Event-Based Systems). It shows the early development of a system that ingests events and can create (and eventually query) a dynamic graph.

  • Conference paper
    Emu: Rapid Prototyping of Networking Services
    Proc. USENIX ATC

    This paper describes a C# library that can be used to build networked programs which can compile to several target hardware and software platforms. This greatly eases development and debugging. The system is tested using NetFPGA as a target and performs almost as well as hand tuned code.

  • Workshop paper
    Demo: Detecting group formations using Beacon technology
    ACM MobiSys (Demo)

    This demo shows how Apple's iBeacon technology can be used to track groups of people who are moving together in a crowd.

  • Journal Paper
    Faces in the Clouds: Long-Duration, Multi-User, Cloud-Assisted Video Conferencing
    Transactions on Cloud Computing (to appear)

    This paper is a simulation based study of cloud assisted multi-user video streaming. It is based upon two use cases (one related to video poker the other related to MOOCs). The paper looks at strategies for placing cloud locations to facilitate streaming using Amazon EC2 cloud locations. The paper compares a strategy that dynamically picks new locations for cloud hosts as time goes on. Interestingly this seems to provide little benefit compared with simply having a good initial choice of sites even when users may drop into and out of a cloud chat session over the course of many hours.

  • Journal Paper
    On rate limitation mechanisms for TCP throughput: a longitudinal analysis
    Computer Networks

    This paper is a considerably expanded version of the INFOCOM paper.

    Again it argues that TCP is no longer mainly controlled by loss and congestion but instead by algorithms and settings under the control of the sender or receiver deliberately or accidentally designed to restrict throughput for a variety of reasons (for example limiting video sending to the rate at which the viewer is watching).

    It contains extended discussion of the methodology and in particular how flight and RTT data was extracted from passive traces.

  • Workshop paper
    Detecting Group Formations using iBeacon Technology
    Human Activity Sensing Corpus and Applications Workshop

    This paper looks at how sensor measurements in mobile phones can be used to determine when people are talking in a group.

  • Conference paper
    FLICK: Developing and Running Application-Specific Network Services
    USENIX ATC

    This paper describes a system for middleboxes that process application level data -- that is reconstructed TCP flows not packets. The system consists of three parts:
    1) A language specific to middleboxes that can quickly express data formats and how to process them but in a "safe" way that allows middleboxes to co-exist on the same physical hardware.
    2) An abstraction, the task graph, that breaks middlebox logic into small, parallelisable logical units (tasks) connected by channels through which data flows.
    3) A system that allows the compiled code to execute in a performant way.

  • Conference presentation
    FLICK: Developing and Running Application-Specific Network Services
    Location: 
    USENIX ATC
    Date: 
    2016-06-22
    Slides: 
    PDF icon rgc_usenix_atc_2016.pdf
    Comments: 

    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.

  • Journal Paper
    Self-Tuning Service Provisioning for Decentralized Cloud Applications
    Transactions on Networks and Service Management

    This paper considers auction mechanisms that can allow people to bid for resources in cloud computing environments when resources are constrained.

  • Conference paper
    Multichannel Cross-Layer Routing for Sensor Networks
    Proc. of International Conference on Telecommunications

    This paper looks at a new way to use multiple channels in ad-hoc sensor networks. It consists of two parts:
    1) A protocol that allows a node, when sent a particular message, to attempt to change channel (reliably with a fall-back if the new channel is subject to interference).
    2) An algorithm run at a single "command" node that selects which nodes should change channel according to a graph colouring problem.

    The work is tested in simulation using Cooja (which simulates Contiki based sensor nodes).

Subscribe to News