University of Warwick
Date: Wednesday, February 5, 2014 at 3 pm.
Location: DC 1304
Title: Network Calculus: An Inconvenient Truth and New Perspectives
Abstract: In this talk we put our finger in a wound of the stochastic network calculus: the tightness of its bounds, a lingering issue which has been for long evaded. For a broad class of bursty processes and scheduling algorithms, we reveal that the classic bounds can be arbitrarily loose, confirming thus the often rumored skepticism that SNC is impractical. Facing these bad news, we further propose a novel method based on martingales to fix the bounds. The resulting bounds are remarkably tight, rehabilitating thus the stochastic network calculus and offering new perspectives.
Biography: Florin Ciucu was educated at the Faculty of Mathematics, University of Bucharest (B.Sc. in Informatics, 1998), George Mason University (M.Sc. in Computer Science, 2001), and University of Virginia (Ph.D. in Computer Science, 2007). Between 2007 and 2008 he was a Postdoctoral Fellow in the Electrical and Computer Engineering Department at the University of Toronto. Between 2008 and 2013 he was a Senior Research Scientist at Telekom Innovation Laboratories (T-Labs) and TU Berlin. Currently he is an Assistant Professor in the CS department at the University of Warwick. His research interests are in the stochastic analysis of communication networks, resource allocation, and randomized algorithms. He has served on the Technical Program Committee of several conferences including ACM Sigmetrics, IEEE Infocom, ACM E-energy, or International Teletraffic Congress. Florin is a recipient of the ACM Sigmetrics 2005 Best Student Paper Award.