Program Overview

RNDM 2017 will offer a number of technical sessions, plenary sessions, and social events.

A detailed program of RNDM 2017 will be announced after paper acceptance deadline.

September 4, 2017
September 5, 2017
September 6, 2017
Plenary Session I
Plenary Session II
Technical Session VII
Coffee break
Coffee break
Coffee break
Technical Session I
Technical Session IV
Technical Session VIII
Technical Session II
Technical Session V
Technical Session IX
Closing Session + BPA
Coffee break
Coffee break
Technical Session III
Technical Session VI
Welcome Reception
Gala Dinner

Keynote Talk I
Affine Flow Thinning – a traffic routing and protection mechanism for networks with variable link capacity
Michal Pioro (Warsaw University of Technology, PL & Lund University, SE)
Flow Thinning (FT) is a traffic routing and protection mechanism for communication networks whose links experience fluctuations in available capacity. To cope withthis phenomenon, end-to-end traffic demands are equipped with dedicated sets of logical tunnels whose nominal capacity is subject to state-dependent thinning to account for variable capacity of the links fluctuating below their nominal (maximum) values. Consequently, the instantaneous traffic sent between the demand's end nodes must accommodate to the current total capacity available on its dedicated tunnels. FTis relevant for example for wireless mesh networks utilizing MPLS tunnels. The multi-commodity flow optimization problem related to FT is NP-hard and its non-compact linear programming formulation requires path generation. The presentation is devoted to optimization modelling of Affine Flow Thinning – an important, practical version of FT, where tunnels are thinned according to a linear (affine) formula.
Michal Pioro is a professor at the Institute of Telecommunications, Warsaw University of Technology (Poland). At the same time, he is a professor at the Department of Electrical and Information Systems Lund University (Sweden). He received a Ph.D. degree in telecommunications in 1979, and a (habilitation) in 1990, both from the Warsaw University of Technology. In 2002, he received the Polish State Professor title. His research interests concentrate on modeling, optimization and performance evaluation of telecommunication and computer networks and systems. He is the first author of a monograph Routing, Flow, and Capacity Design in Communication and Computer Networks, Morgan-Kaufmann (Elsevier), USA, 2004, and more than 150 technical papers presented in telecommunication and operations research journals and conference proceedings. He has led many research projects for telecom industry in the field of network modeling, design, and performance analysis. Heis deeply involved in international scientific research including the EC funded projects.

Keynote Talk II
The Age of Programmable Networks: Algorithms for Designing Flexible and Robust SDNs
Stefan Schmid (Aalborg University, DK)
Computer networks currently undergo a phase transition, in that they are becoming more and more programmable, and hence introduce interesting new algorithmic opportunities and flexibilities (e.g., for the design, deployment, and operation of computer networks) -- but also challenges. In this talk, I will provide an overview of these opportunities and challenges, describe algorithmic models and techniques to address them, and finally outline open questions for future research. A main focus of the talk will be on the design of robust and self-optimizing computer networks.
Stefan Schmid is an Associate Professor in Computer Science at Aalborg University, Denmark. He received his MSc and PhD from ETH Zurich, Switzerland, was a postdoc at TU Munich and Uni Paderborn, a Senior Research Scientist at T-Labs Berlin, and a visiting professor at CNRS (LAAS), Toulouse and at Universite catholique de Louvain (UCL). He serves as the Editor of the Distributed Computing Column of the Bulletin of the EATCS, and as an Associate Editor of IEEE Transactions on Network and Service Management (TNSM).
His research interests revolve around the fundamental and algorithmic problems arising in distributed and networked systems. Stefan Schmid received the IEEE Communications Society (ComSoc) Early Career Award 2016.

A practical view of modeling and quantification of network survivability
Poul E. Heegaard (Norwegian University of Science and Technology, NO)
Kishor S. Trivedi (Duke University, US)
The goal of this tutorial is to provide an introduction to the concept and definition of survivability and to demonstrate approaches to model and quantify survivability in networks. In our tutorial we define survivability as the "ability to provide services in compliance with the requirement even in presence of major and minor failures in network infrastructure and service platforms caused by undesired events that might be external or internal". The network survivability is quantified as defined by the ANSI T1A1.2 committee, which is the transient performance from the instant an undesirable event occurs until steady state with an acceptable performance level is attained. Examples are taken from the survivability of mobile networks and virtual connection over an IP network as well as from smartgrid.
After an introduction to survivability and the modelling framework for quantification of survivability, the tutorial will present an exercise with example from a 5G mobile system. The objective with the exercise is to provide useful insight and experience with the use of an analytic tool (Sharpe), and programming of a discrete event simulator.


Poul E. Heegaard is Professor at NTNU (Norwegian University of Science and Technology), Department of Telematics (Department of Information Security and Communication Technology from Jan 1, 2017). Heegaard has since 2006 been on the faculty at NTNU, and was Head of Department 2009-2013. He has also been a Senior Research Scientist at Telenor R&I, and Senior Scientist at SINTEF Telecom and Informatics.
Heegaard is the author/co-author of more than 150 articles and has supervised 9 PhDs. He has given numerous tutorial and talks at international meetings and conferences. His research interests cover performance, dependability and survivability evaluation and management of communication systems. Special interest has been rare event simulation techniques, and monitoring, routing and management in dynamic networks.His current research focus is on performance, dependability and survivability in interacting complex systems, which includes distributed, autonomous and adaptive management and routing in communication networks and services. Examples are Software Defined Networking and ICT-power system integration (Smart Grid).

Kishor S. Trivedi holds the Hudson Chair in the Department of Electrical and Computer Engineering at Duke University, Durham, NC. He has been on the Duke faculty since 1975. He is the author of a well-known text entitled, Probability and Statistics with Reliability, Queuing and Computer Science Applications, published by Prentice-Hall; a thoroughly revised second edition (including its Indian edition) of this book has been published by John Wiley. He has also published three other books. He is a Fellow of the IEEE, and a Golden Core Member of IEEE Computer Society. He is the recipient of IEEE Computer Society Technical Achievement Award for his research on Software Aging and Rejuvenation.
Trivedi has published over 420 articles and has supervised 42 Ph.D. dissertations, and has given numerous keynotes, tutorials, and talks at international meetings and conferences. His research interests are in reliability, availability, performance, performability, security and survivability evaluation of computer and communication systems. He works closely with industry in carrying out reliability/availability analysis, providing short courses on reliability, availability, performabilitymodeling and in the development and dissemination of software packages such as SHARPE and SPNP.