NEWS

• New Network Calculus Mailing List Available: see https://lists.geant.org/sympa/info/netcal-list

Slides of all presentations are available online (see program for download links) In a democratic election, Paul Nikolaus won the Best Presentation Award.  Congrats, Paul!

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 modeling 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.

Workshop Organizers

Amr Rizk, TU Darmstadt, GER

Steffen Bondorf, National University of Singapore, SG

Kai-Steffen Jens Hielscher, FAU Erlangen, GER

Markus Fidler, Leibniz University Hannover, GER

Jens Schmitt, TU Kaiserslautern, GER

Workshop Program

Call for Presentations

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.

If you like to present then please send an email to This email address is being protected from spambots. You need JavaScript enabled to view it. and This email address is being protected from spambots. You need JavaScript enabled to view it. and This email address is being protected from spambots. You need JavaScript enabled to view it. with the following content

• the title of your presentation,
• a short abstract (max 200 words), and
• the name of the presenter.

In case of contention, presentations will be selected based on novelty and topical coherence.

Best Presentation Award

As in the previous edition, participants democratically elected the best presentation.

This year's award goes to Paul Nikolaus [talk, slides]. Congratulations!

Important Dates

Submission of presentation title and abstract: January 11, 2018 (passed)

Notification of invitation for presentation: January 18, 2018 (passed)

Workshop date: February 28, 2018 (passed) 

Workshop Registration (passed)

The workshop is integrated into the MMB 2018 conference and we suggest to also take registering to this event into consideration, but a WoNeCa-only registration is also possible here.

Topics of Interest

The topics of this workshop are related to fundamental aspects as well as applications of network calculus. The following list of topics is non-exclusive:

[WoNeCa-5] Virtual Event on 09 October 2020

News

• New Network Calculus Mailing List Available: see https://lists.geant.org/sympa/info/netcal-list
• [WoNeCa-6] Event on 08/09 September 2022: Call for presentations https://2022.woneca.org

Slides of all presentations are starting to become available online The community has chosen: Seyed Mohammadhossein Tabatabaee won the Best Presentation Award.  Congratulations!

The Workshop

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 modeling 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.

Schedule (all times given in Central European Summer Time, UTC+02:00)

Virtual Event Instructions

We will conduct the virtual event via Zoom. The meeting invitation been sent on October 07. If you have not received the link, please contact Amr (This email address is being protected from spambots. You need JavaScript enabled to view it.).

While we plan to have live presentations using Zoom's screen sharing feature, we also ask presenters to provide a recording to be played in case of technical problems. All presenters should have received an email by Amr with instructions and the upload link. If you have not received an email, please contact Amr (This email address is being protected from spambots. You need JavaScript enabled to view it.).

The best presentation will be awarded with a price! Voting will be anonymous and will take place during the closing session.

Workshop Organizers

Steffen Bondorf, Ruhr University Bochum, GER

Amr Rizk, Ulm University, GER

Markus Fidler, Leibniz University Hannover, GER

Jens Schmitt, TU Kaiserslautern, GER

Call for Presentations

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.

If you like to present then please send the title of your presentation and
the name of the presenter in an email to

This email address is being protected from spambots. You need JavaScript enabled to view it. AND
This email address is being protected from spambots. You need JavaScript enabled to view it.

In case of contention, presentations will be selected based on topical coherence.

Important Dates

Submission of presentation title and abstract: December 18, 2019 January 14, 2020 (extended, passed)

Notification of invitation for presentation: January 17, 2020 January 19, 2020 (extended, passed)

Workshop date: March 18, 2020 March 18 and 19, 2020 (extended)

Topics of Interest

The topics of this workshop are related to fundamental aspects as well as applications of network calculus. The following list of topics is non-exclusive:

[WoNeCa-5] Cancelled physical event in Saarbrücken (collocated with MMB 2020)

Dear network calculus community,

In face of the outbreak of the coronavirus in Europe, we will have to cancel the current WoNeCa workshop dates. Safety and health of our participants is our highest concern. We plan to postpone WoNeCa-5 to safer times, potentially later this year. We are very sorry that we cannot meet as soon as planned and we will keep you up to date.

Please also note announcements of the MMB 2020 conference that intended to host our workshop: MMB 2020.

Best regards,
Amr, Steffen, Markus and Jens

Registration

The workshop will integrated into the MMB 2020 conference. Registration details are available here.
Note the early registration deadline: March 01.

Programm

Slot for every talk is 25 min = 20min talk + 5min Q&A

Wednesday, March 18

Thursday, March 19

Keynote Abstract

François Baccelli - Interference Networks

This talk features networks of coupled processor sharing queues in the Euclidean space,
where customers arrive according to independent Poisson point processes at every queue,
are served, and then leave the network. The coupling is through service rates.
In any given queue, this rate is inversely proportional the interference seen by this queue,
which is determined by the load in neighboring queues, attenuated by some distance-based path-loss function.

The model is a discrete version of a spatial birth and death process where customers
arrive to the Euclidean space according to Poisson rain and leave it when they
have transferred an exponential file, assuming that the instantaneous rate of each transfer is
determined through information theory by the signal to interference and noise ratio experienced by the user.

The discrete and the continuous models will be discussed, both in finite and infinite domains.
The stability condition is identified. The minimal stationary regime is built
using coupling from the past techniques.

The mean queue size of this minimal stationary regime is determined in closed form using
the rate conservation principle of Palm calculus. Some bounds on the tail of latency
will be discussed.

In infinite domains, when the stability condition holds, for all bounded initial conditions,
there is weak convergence to this minimal stationary regime; however, there exist
initial conditions for which all queue sizes converge to infinity.

Joint work with S. Foss and A. Sankararaman