Publication

Delay Bounds in a Network with Aggregate Scheduling

Related publications (32)

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.

Contention-based forwarding for mobile ad-hoc networks

Jörg Widmer

Existing position-based unicast routing algorithms which forward packets in the geographic direction of the destination require that the forwarding node knows the positions of all neighbors in its transmission range. This information on direct neighbors is ...

2003

A novel forwarding paradigm for position-based routing (with implicit addressing)

Jörg Widmer

2003

Network topology aware scheduling of collective communications

Roger Hersch, Emin Gabrielyan

A method is proposed for the optimal scheduling of collective data exchanges relying on the knowledge of the underlying network topology. The concept of liquid schedules is introduced. Liquid schedules ensure the maximal utilization of a network's bottlene ...

IEEE2003

Scalable routing protocols with applications to mobility

Ljubica Blazevic

In this thesis we study two routing problems related to mobility. The first problem concerns scalable multicast routing when there is a large number of multicast groups with a small number of receivers. Existing dense and sparse mode routing protocols have ...

EPFL2002

Delay Bounds in a Network with Aggregate Scheduling

Jean-Yves Le Boudec

A large number of products implementing aggregate buffering and scheduling mechanisms have been developed and deployed, and still more are under development. With the rapid increase in the demand for reliable end-to-end QoS solutions, it becomes increasing ...

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

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

Circuit Emulation over IP Networks

Jean-Pierre Hubaux

The best-effort service offered by the Internet is not suitable for a large variety of multimedia applications, which require strict guarantees on losses and end-to-end delay. We design functionalities and mechanisms for RTP in order to provide a transport ...

1999

A comparison of ABR and UBR to support TCP traffic

Jean-Yves Le Boudec

We compare the performance of ABR and UBR for providing high-speed network interconnection services for TCP traffic. We test the hypothesis that UBR with adequate buffering in the ATM switches results in better overall goodput for TCP traffic than explicit ...

1999

The Asymmetric Best-Effort Service

Jean-Yves Le Boudec, Patrick Thiran, Paul Hurley

We present Asymmetric Best-Effort (ABE), a novel service to provide a throughput versus delay jitter service for IP packets. With this service, every best effort packet is marked as either Green or Blue. Green packets, typically sent by real-time applicati ...

1999