NEWS: WoNeCa is over (all presentations are online) - thanks to all, it was great fun :-)
In a democratic election, Steffen Bondorf won the Best Presentation Award - congrats, Steffen!
The network calculus has established as a versatile methodology for the queueing analysis of resource sharing based systems. Its prospect is that it can deal with problems that are fundamentally hard for alternative methodologies, based on the fact that it works with bounds rather than striving for exact solutions. The high modelling power of the network calculus has been transposed into several important applications for network engineering problems, traditionally in the Internet’s Quality of Service proposals IntServ and DiffServ, and more recently in diverse environments such as wireless sensor networks, switched Ethernets, or Systems-on-Chip.
The goal of this workshop is to bring together researchers with an interest in the theory of network calculus as well as those who want to apply existing results in new applications. The workshop will serve to promote the network calculus theory to researchers with an interest in applied queueing models for data communication.
Markus Fidler, Leibniz University Hannover, DE
Jens Schmitt, University of Kaiserslautern, DE
Invited Talk (in the MMB/DFT Plenary)
|10:00-11:15||Session 1: Wireless Channel|
|Sami Akin: On the Transmission Rate Strategies in Cognitive Radio|
|Fengyou Sun: Further Properties of Wireless Channel Capacity|
|Nico Becker: A Non-stationary Service Curve Model for Performance Analysis of Transient Phases in Cellular Networks|
|11:30-12:30||Session 2: Load Balancing and Bandwidth Estimation|
|Invited Talk by Amr Rizk: Saving Resources on Wireless Uplinks: Models of Queue-aware Scheduling|
|Katarzyna Wasielewska: Network Calculus in the Practice - Available Bandwidth Estimation|
|13:30-15:20||Session 3: Stochastic Analysis|
|Invited Talk by Florin Ciucu: A Unified Queueing Analysis of Markov Modulated Processes|
|Alireza Shekaramiz: Window Flow Control Systems with Random Service|
Michael Beck: Window Flow Controller and Subadditivity
|15:35-17:15||Session 4: Deterministic Analysis|
|Anne Bouillard: Symbolic Computation for Worst-case Performance Bounds in Tree-network and Application to Networks with Cyclic Dependencies|
|Kai Lampka: Network Calculus with Compact Domains|
|Ahlem Mifdaoui: Extended Applications of PMOO principle|
Steffen Bondorf: Bounding Flow Arrivals in Feed-forward Networks
The idea is to have an informal meeting with presentations of recent work in the context of network calculus (theory, applications, tool support) and gather as many network calculus experts as possible to discuss about the future development of the theory and its application opportunities. Hence, there are no written papers and everyone can present his/her "hottest" recent research on network calculus.
The topics of this workshop are related to fundamental aspects as well as applications of network calculus. The following list of topics is non-excluding:
Deterministic and stochastic network calculus, e.g.
Feedback systems, e.g.,
Loss systems, e.g.,
Aggregate multiplexing, e.g.,
Data transformation, e.g.,
Relation to other theories, e.g.,
New applications, e.g.,
Tool support, e.g.,
18th International GI/ITG Conference on “Measurement, Modelling and Evaluation of Computing Systems” and “Dependability and Fault-Tolerance”
April 4-6, 2016