Ask any question about EPFL courses, lectures, exercises, research, news, etc. or try the example questions below.
DISCLAIMER: The Graph Chatbot is not programmed to provide explicit or categorical answers to your questions. Rather, it transforms your questions into API requests that are distributed across the various IT services officially administered by EPFL. Its purpose is solely to collect and recommend relevant references to content that you can explore to help you answer your questions.
We find that the probabilistic bound on delay in [1] is incorrect. The problem originates from: (1) the difference between stationary and Palm probabilities, and (2) treating the arrival counting process over some random time intervals as if the time interval would be fixed. The error is propagated to some later work, e.g. [2], which derived some probabilistic delay bounds based on [2]. We give fixes to the above problem.