University of Cambridge > > Optimization and Incentives Seminar > Experiments with dynamic networks of virtual routers

Experiments with dynamic networks of virtual routers

Add to your list(s) Download to your calendar using vCal

If you have a question about this talk, please contact eiko.yoneki.

This talk is a part of the SRG-SEMINAR series, and it is listed here as it may be of interest to this seminar's audience as well.

In many modern networking contexts, nodes and links are highly dynamic. Network nodes and links may start or stop with little notice. Such contexts include virtual networks, cloud computing, MANE Ts, sensor networks and Internet of Things. Simulation can provide highly scalable results but the realism o a simulation may be uncertain. System virtual machines (Xen, QEMU , VMWare and similar) can provide accurate results (for some type of network) but it is hard to get scalable results without a large number of physical machines. In this work we develop and tests a half-way house: software routers which exist within Java Virtual Machines, exchange routing tables, provide a socket-like interface and route data in a realistic way. This enables larger scale tests on testbeds with the same number of physical machines.

Initial experiments have looked at the problem of selecting nodes to be management/monitoring nodes within a dynamic network. Such nodes should be selected for their position in the network (to be “close” to the nodes they monitor) but also for their longevity. This gives some degree of trade-off between “stable” nodes and “well-positioned” nodes. An algorithm is given with a tunable parameter for making this trade off.

Bio: Richard Clegg is a Senior Research Fellow at University College London. His PhD in Mathematics and Statistics was obtained from the University of York in 2005. His research interests include network traffic statistics, network topologies, overlay networks and network economics.

This talk is part of the Optimization and Incentives Seminar series.

Tell a friend about this talk:

This talk is included in these lists:

Note that ex-directory lists are not shown.


© 2006-2023, University of Cambridge. Contact Us | Help and Documentation | Privacy and Publicity