Abstract:
Today's trend toward network virtualization and software-defined networking enables flexible new distributed systems where resources can be dynamically allocated and migr...Show MoreMetadata
Abstract:
Today's trend toward network virtualization and software-defined networking enables flexible new distributed systems where resources can be dynamically allocated and migrated to locations where they are most useful. This paper proposes a competitive analysis approach to design and reason about online algorithms that find a good tradeoff between the benefits and costs of a migratable service. A competitive online algorithm provides worst-case performance guarantees under any demand dynamics, and without any information or statistical assumptions on the demand in the future. This is attractive especially in scenarios where the demand is hard to predict and can be subject to unexpected events. As a case study, we describe a service (e.g., an SAP server or a gaming application) that uses network virtualization to improve the quality of service (QoS) experienced by thin client applications running on mobile devices. By decoupling the service from the underlying resource infrastructure, it can be migrated closer to the current client locations while taking into account migration costs. We identify the major cost factors in such a system and formalize the wide-area service migration problem. Our main contributions are a randomized and a deterministic online algorithm that achieve a competitive ratio of O(logn) in a simplified scenario, where n is the size of the substrate network. This is almost optimal. We complement our worst-case analysis with simulations in different specific scenarios and also sketch a migration demonstrator.
Published in: IEEE/ACM Transactions on Networking ( Volume: 22, Issue: 1, February 2014)
Institute of Computer Science, University of Wroc aw, Wroclaw, Poland
Marcin Bienkowski received the Ph.D. degree in computer science from the University of Paderborn, Paderborn, Germany, in 2005.
He is currently an Assistant Professor with the Computer Science and Mathematics Department, University of Wroclaw, Wroclaw, Poland. At the University of Paderborn, he worked with the Algorithms and the Complexity Theory Group. His research interests focus on online and approximation algorithms.
Marcin Bienkowski received the Ph.D. degree in computer science from the University of Paderborn, Paderborn, Germany, in 2005.
He is currently an Assistant Professor with the Computer Science and Mathematics Department, University of Wroclaw, Wroclaw, Poland. At the University of Paderborn, he worked with the Algorithms and the Complexity Theory Group. His research interests focus on online and approximation algorithms.View more
Telekom Innovation Laboratories (T-Labs) and TU Berlin, Berlin, Germany
Anja Feldmann received the M.S. degree from the University of Paderborn, Paderborn, Germany, in 1990, and the M.S. and Ph.D. degrees from Carnegie Mellon University, Pittsburgh, PA, USA, in 1991 and 1995, respectively, all in computer science.
She is a Professor with the Deutsche Telekom Laboratories, Berlin, Germany. Previously, she was a Professor with the Computer Science Department, Technische Universität München, Muni...Show More
Anja Feldmann received the M.S. degree from the University of Paderborn, Paderborn, Germany, in 1990, and the M.S. and Ph.D. degrees from Carnegie Mellon University, Pittsburgh, PA, USA, in 1991 and 1995, respectively, all in computer science.
She is a Professor with the Deutsche Telekom Laboratories, Berlin, Germany. Previously, she was a Professor with the Computer Science Department, Technische Universität München, Muni...View more
Telekom Innovation Laboratories (T-Labs) and TU Berlin, Berlin, Germany
Johannes Grassler is currently studying applied computer science at Beuth-Hochschule für Technik Berlin, Berlin, Germany.
He has been a Student Worker with FG INET, Berlin, Germany, since February 2011. Before that, he worked for several years with Google, Berlin, Germany, and Kabel Deutschland, Berlin, Germany. His professional interests include Unix systems programming and network virtualization.
Johannes Grassler is currently studying applied computer science at Beuth-Hochschule für Technik Berlin, Berlin, Germany.
He has been a Student Worker with FG INET, Berlin, Germany, since February 2011. Before that, he worked for several years with Google, Berlin, Germany, and Kabel Deutschland, Berlin, Germany. His professional interests include Unix systems programming and network virtualization.View more
Telekom Innovation Laboratories (T-Labs) and TU Berlin, Berlin, Germany
Gregor Schaffrath studied computer science with a minor in physics at the University of Saarland, Saarbrücken, Germany.
He worked for several years with IFI Zurich, Zurich, Switzerland, before becoming a Ph.D. student at FG INET (T-Labs), Berlin, Germany. His research interests include network virtualization and network-based intrusion detection.
Gregor Schaffrath studied computer science with a minor in physics at the University of Saarland, Saarbrücken, Germany.
He worked for several years with IFI Zurich, Zurich, Switzerland, before becoming a Ph.D. student at FG INET (T-Labs), Berlin, Germany. His research interests include network virtualization and network-based intrusion detection.View more
Telekom Innovation Laboratories (T-Labs) and TU Berlin, Berlin, Germany
Stefan Schmid studied computer science with a minor in micro/macro economics and received the Ph.D. degree from the Distributed Computing Group at ETH Zurich, Zurich, Switzerland, in 2008.
He interned at CERN, Meyrin, Switzerland. Subsequently, he worked with the Chair for Efficient Algorithms, Technical University of Munich (TUM), Munich, Germany, and with the Chair for Theory of Distributed Systems, University of Paderbo...Show More
Stefan Schmid studied computer science with a minor in micro/macro economics and received the Ph.D. degree from the Distributed Computing Group at ETH Zurich, Zurich, Switzerland, in 2008.
He interned at CERN, Meyrin, Switzerland. Subsequently, he worked with the Chair for Efficient Algorithms, Technical University of Munich (TUM), Munich, Germany, and with the Chair for Theory of Distributed Systems, University of Paderbo...View more
Contents Institute of Computer Science, University of Wroc aw, Wroclaw, Poland
Marcin Bienkowski received the Ph.D. degree in computer science from the University of Paderborn, Paderborn, Germany, in 2005.
He is currently an Assistant Professor with the Computer Science and Mathematics Department, University of Wroclaw, Wroclaw, Poland. At the University of Paderborn, he worked with the Algorithms and the Complexity Theory Group. His research interests focus on online and approximation algorithms.
Marcin Bienkowski received the Ph.D. degree in computer science from the University of Paderborn, Paderborn, Germany, in 2005.
He is currently an Assistant Professor with the Computer Science and Mathematics Department, University of Wroclaw, Wroclaw, Poland. At the University of Paderborn, he worked with the Algorithms and the Complexity Theory Group. His research interests focus on online and approximation algorithms.View more
Telekom Innovation Laboratories (T-Labs) and TU Berlin, Berlin, Germany
Anja Feldmann received the M.S. degree from the University of Paderborn, Paderborn, Germany, in 1990, and the M.S. and Ph.D. degrees from Carnegie Mellon University, Pittsburgh, PA, USA, in 1991 and 1995, respectively, all in computer science.
She is a Professor with the Deutsche Telekom Laboratories, Berlin, Germany. Previously, she was a Professor with the Computer Science Department, Technische Universität München, Munich, Germany; a Professor with the Computer Science Department, University of Saarbrücken, Saarbrücken, Germany; and a member of the IP Network Measurement and Performance Department, AT&T Labs—Research, Florham Park, NJ, USA. Her research interest is network performance debugging: Starting from data traffic measurements over traffic characterization, this leads to judging the performance implications of what we have learned.
Prof. Feldmann was awarded the Gottfried–Wilhelm–Leibniz–Preis and the Berliner Wissenschaftspreis in 2011.
Anja Feldmann received the M.S. degree from the University of Paderborn, Paderborn, Germany, in 1990, and the M.S. and Ph.D. degrees from Carnegie Mellon University, Pittsburgh, PA, USA, in 1991 and 1995, respectively, all in computer science.
She is a Professor with the Deutsche Telekom Laboratories, Berlin, Germany. Previously, she was a Professor with the Computer Science Department, Technische Universität München, Munich, Germany; a Professor with the Computer Science Department, University of Saarbrücken, Saarbrücken, Germany; and a member of the IP Network Measurement and Performance Department, AT&T Labs—Research, Florham Park, NJ, USA. Her research interest is network performance debugging: Starting from data traffic measurements over traffic characterization, this leads to judging the performance implications of what we have learned.
Prof. Feldmann was awarded the Gottfried–Wilhelm–Leibniz–Preis and the Berliner Wissenschaftspreis in 2011.View more
Telekom Innovation Laboratories (T-Labs) and TU Berlin, Berlin, Germany
Johannes Grassler is currently studying applied computer science at Beuth-Hochschule für Technik Berlin, Berlin, Germany.
He has been a Student Worker with FG INET, Berlin, Germany, since February 2011. Before that, he worked for several years with Google, Berlin, Germany, and Kabel Deutschland, Berlin, Germany. His professional interests include Unix systems programming and network virtualization.
Johannes Grassler is currently studying applied computer science at Beuth-Hochschule für Technik Berlin, Berlin, Germany.
He has been a Student Worker with FG INET, Berlin, Germany, since February 2011. Before that, he worked for several years with Google, Berlin, Germany, and Kabel Deutschland, Berlin, Germany. His professional interests include Unix systems programming and network virtualization.View more
Telekom Innovation Laboratories (T-Labs) and TU Berlin, Berlin, Germany
Gregor Schaffrath studied computer science with a minor in physics at the University of Saarland, Saarbrücken, Germany.
He worked for several years with IFI Zurich, Zurich, Switzerland, before becoming a Ph.D. student at FG INET (T-Labs), Berlin, Germany. His research interests include network virtualization and network-based intrusion detection.
Gregor Schaffrath studied computer science with a minor in physics at the University of Saarland, Saarbrücken, Germany.
He worked for several years with IFI Zurich, Zurich, Switzerland, before becoming a Ph.D. student at FG INET (T-Labs), Berlin, Germany. His research interests include network virtualization and network-based intrusion detection.View more
Telekom Innovation Laboratories (T-Labs) and TU Berlin, Berlin, Germany
Stefan Schmid studied computer science with a minor in micro/macro economics and received the Ph.D. degree from the Distributed Computing Group at ETH Zurich, Zurich, Switzerland, in 2008.
He interned at CERN, Meyrin, Switzerland. Subsequently, he worked with the Chair for Efficient Algorithms, Technical University of Munich (TUM), Munich, Germany, and with the Chair for Theory of Distributed Systems, University of Paderborn, Paderborn, Germany. He is now a Senior Research Scientist with Telekom Innovation Laboratories, Berlin, Germany. He is interested in distributed systems, and especially in the design of robust and dynamic networks.
Stefan Schmid studied computer science with a minor in micro/macro economics and received the Ph.D. degree from the Distributed Computing Group at ETH Zurich, Zurich, Switzerland, in 2008.
He interned at CERN, Meyrin, Switzerland. Subsequently, he worked with the Chair for Efficient Algorithms, Technical University of Munich (TUM), Munich, Germany, and with the Chair for Theory of Distributed Systems, University of Paderborn, Paderborn, Germany. He is now a Senior Research Scientist with Telekom Innovation Laboratories, Berlin, Germany. He is interested in distributed systems, and especially in the design of robust and dynamic networks.View more
