Welcome Message from NetCal 2018 Co-Chairs

Abstract

As early as in mid-1970s, Leonard Kleinrock already highlighted that “We must face the fact that authentic queueing problems seldom satisfy the assumptions made throughout most of the literature available on queueing theory: stationarity is rare, independence occurs only occasionally, and ergodicity is not only unlikely but is also impossible to establish with measurements over a finite time!”. Even though in the past half century, queueing problems and queueing theory have expanded enormously, this fact remains. In addition, modern queueing systems are often required to provide services with guarantees, sometimes even in the worst case. At the same time, Kleinrock also envisioned “an exciting ‘new’ branch of queueing theory. . . that deals with methods for finding approximation or bounding behaviour for queues”. Network calculus is such a ‘new’ theory.