A delay optimal policy for symmetric broadcast channels
Graph Chatbot
Chat with Graph Search
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.
Time-sensitive networks provide worst-case guarantees for applications in domains such as the automobile, automation, avionics, and the space industries. A violation of these guarantees can cause considerable financial loss and serious damage to human live ...
In 1948, Claude Shannon laid the foundations of information theory, which grew out of a study to find the ultimate limits of source compression, and of reliable communication. Since then, information theory has proved itself not only as a quest to find the ...
In this paper we study a multi-channel network, each station of which is equipped with a network interface that has a receiver buffer of multiple packets. In this way, each station is able to receive multiple packets per time instant. We adopt a synchronou ...
In this paper, we study the operations of a one-way station-based carsharing system implementing a complete journey reservation policy. We consider the percentage of served demand as a primary performance measure and analyze the effect of several dynamic s ...
This paper discusses the development of key features in European Union policy and service redesign, based on social innovative practices where co-creation and the related phenomenon of digital social innovation have a high potential impact. The idea undern ...
Network calculus is often used to prove delay bounds in deterministic networks, using arrival and service curves. We consider a FIFO system that offers a rate-latency service curve and where packet transmission occurs at line rate without pre-emption. The ...
Based on a seminal policy paper (Foray et al., 2009), the Smart Specialisation Strategies (S3) approach was integrated into the reformed cohesion policy of the European Union for 2014-20. This large-scale European experience provides a unique case study of ...
We introduce Pi-regulation, a new definition of traffic regulation which extends both the arrival curves of network calculus and Chang's max-plus g-regulation, and also includes new types of regulation, such as packet rate limitations. We provide a new exa ...
This article involves a conceptual evaluation of a large-scale innovation policy experiment—so-called smart specialization strategies (S3s)—that took place within the framework of the European regional cohesion programs between 2011 and the present. The go ...
Consider a stream of status updates generated by a source, where each update is of one of two types: high priority or ordinary (low priority). These updates are to be transmitted through a network to a monitor. However, the transmission policy of each pack ...
