Publication

Joint Smoothing and Source Rate Selection for Guaranteed Service Networks

Related publications (42)

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.

Worst Case Burstiness Increase due to FIFO Multiplexing

Jean-Yves Le Boudec, Juan Echagüe

We consider a FIFO multiplexer fed by flows that are individually constrained by arrival curves, and look for the best possible arrival curve for every output flow. This problem arises in scenarios where aggregate multiplexing is performed, such as differe ...

2002

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

Optimal smoothing for guaranteed service

Jean-Yves Le Boudec, Olivier Verscheure

We consider the transmission of variable bit rate (VBR) video over a network offering a guaranteed service such as ATM VBR or the guaranteed service of the IETF. The guaranteed service requires that the flow accepted by the network has to be conforming wit ...

2000

Optimal Smoothing for Guaranteed Service

Jean-Yves Le Boudec

2000

High-bandwidth internet video telephony

Martin Vetterli

We consider the problem of full-duplex video transmission over the Internet, under real-time delay constraints. In this work we present the design of a complete communications system, whose salient features are: (a) a soft real-time transport protocol, who ...

2000

Renegotiable VBR service

In this work we address the problem of supporting the QoS requirements for applications while efficiently allocating the network resources. We analyse this problem at the source node where the traffic profile is negotiated with the network and the traffic ...

EPFL1999

Regulation of a Connection Admission Control Algorithm

Jean-Yves Le Boudec, Patrick Thiran

Connection Admission Control (CAC) algorithms are used to decide whether an incoming connection should be accepted or rejected in a node of a network offering reservation based services in order to maintain the guaranteed Quality of Service (QoS) in the ne ...

1999

A Min-Plus System Theory for Constrained Traffic Regulation and Dynamic Service Guarantees

Jean-Yves Le Boudec, Patrick Thiran

By extending the system theory under the (min,+)-algebra to the time varying setting, we solve the problem of constrained traffic regulation and develop a calculus for dynamic service guarantees. For a constrained traffic regulation problem with maximum to ...

1999

Project DIANA - Converging and Integrating IP and ATM for real-time applications

The evolution of IP and ATM share some common drivers. Both of them are addressing efficient network resource utilisation. In order to evaluate the options and combinations offered by these technologies the DIANA project is looking into the areas where ATM ...

1999

Designing new network adaptation and ATM adaptation layers for interactive multimedia applications

Multimedia services, audiovisual applications composed of a combination of discrete and continuous data streams, will be a major part of the traffic flowing in the next generation of high speed networks. The cornerstones for multimedia are Asynchronous Tra ...

EPFL1998