Publication

"Pay bursts only once" does not hold for non-FIFO Guaranteed Rate nodes

Related publications (14)

"Pay bursts only once" does not hold for non-FIFO Guaranteed Rate nodes

We demonstrate that, contrary to what is generally believed, the existing end-to-end delay bounds apply only to GR nodes that are FIFO per flow. We show this by exhibiting a counter-example. Then we show that the proof of the existing bounds has a subtle, ...

2005

Mapping and Physical Planning of Networks-on-Chip Architectures with Quality-of-Service Guarantees

Giovanni De Micheli, Luca Benini, Srinivasan Murali

Networks on Chips (NoCs) have evolved as the communication design paradigm of future Systems on Chips (SoCs). In this work we target the NoC design of complex SoCs with heterogeneous processor/memory cores, providing Quality-of-Service (QoS) for the applic ...

2005

Controlled Use of Excess Backbone Bandwidth for Providing New Services in IP-Over-WDM Networks

Patrick Thiran

We study an approach to quality-of-service (QoS) that offers end-users the choice between two service classes defined according to their level of transmission protection. The fully protected (FP) class offers end-users a guarantee of survivability in the c ...

2004

Network Availability Based Service Differentiation

Patrick Thiran, Mathilde Durvy

Numerous approaches have been proposed to manage Quality of Service in the Internet. However, none of them was successfully deployed in a commercial IP backbone, mostly because of their complexity. In this paper, we take advantage of the excess network ban ...

2003

Broadcast quality video over IP

We consider the problem of designing systems for the transmission of high-quality video signals over certain high-speed segments of the public IP network. Our most important contribution is the definition of a network/coder interface for IP networks which ...

2001

Combining IntServ and DiffServ under Linux

Combining Integrated Services ([1], [5]) QoS mechanisms for end-to-end signaling at hosts and Differentiated Services ([2], [10]) QoS mechanisms in the network core is one proposal for overcoming the limitation of either mechanisms when applied alone ([8]) ...

2000

Scalable resource reservation for the Internet

For some time now, the design of architectures for providing dependable Quality of Service (QoS) on multimedia networks has been a busy topic in academia and industry. In this work we look at practical aspects of Quality of Service, and in particular at re ...

EPFL1999

Scalable Resource Reservation for the Internet

1999

The Asymmetric Best-Effort Service

Jean-Yves Le Boudec, Ljubica Blazevic

We present Asymmetric Best-Effort, a novel service to provide a ``throughput versus delay jitter'' differentiated service for IP packets. With this service, every best effort packet is marked as either green or blue. Green packets, typically sent by real-t ...

1999

The Alternative Best-Effort Service

Jean-Yves Le Boudec, Patrick Thiran, Paul Hurley

Alternative Best-Effort (ABE) is a novel service for IP networks which offers applications the choice between receiving a lower end-to-end delay and receiving more overall throughput. Every best effort packet is marked as either green or blue. Green packet ...

1999

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.