Publication

Stability-Aware Integrated Routing and Scheduling for Control Applications in Ethernet Networks

Related publications (36)

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.

Lattice Networks: Capacity Limits, Optimal Routing and Queueing Behavior

Martin Vetterli, Guillermo Barrenetxea Kobas

Lattice networks are widely used in regular settings like grid computing, distributed control, satellite constellations, and sensor networks. Thus, limits on capacity, optimal routing policies, and performance with finite buffers are key issues and are add ...

2006

Efficient routing with small buffers in dense networks

Martin Vetterli, Guillermo Barrenetxea Kobas

The analysis and design of routing algorithms for finite buffer networks requires solving the associated queue network problem which is known to be hard. We propose alternative and more accurate approximation models to the usual Jackson’s Theorem that give ...

2005

An online throughput-competitive algorithm for multicast routing and admission control

Monika Henzinger, Ashish Goel

We present the first polylog-competitive online algorithm for the general multicast admission control and routing problem in the throughput model. The ratio of the number of requests accepted by the optimum offline algorithm to the expected number of reque ...

2005

A Location Based Routing Method for Mobile Ad Hoc Networks

Jean-Yves Le Boudec, Ljubica Blazevic

Using location information to help routing is often proposed as a means to achieve scalability in large mobile ad-hoc networks. However, location based routing is difficult when there are holes in the network topology and nodes are mobile or frequently dis ...

2005

Consensus with Unknown Participants or Fundamental Self-Organization

André Schiper, David Cavin, Yoav Sasson

We consider the problem of bootstrapping self-organized mobile ad hoc networks (MANET), i.e. reliably determining in a distributed and self- organized manner the services to be offered by each node when neither the identity nor the number of the nodes in t ...

2004

A Location Based Routing Method for Irregular Mobile Ad Hoc Networks

Jean-Yves Le Boudec, Ljubica Blazevic

2003

A Software Architecture for Industrial Automation

Esther Gelle

The Aspect Integrator Platform (AIP) from ABB was designed to build the next generation of industrial automation applications. This platform is part of a set of products that provide the means to model, control and supervise continuous or discrete processe ...

2003

Self Organized Terminode Routing

Jean-Yves Le Boudec, Ljubica Blazevic

We consider the problem of routing in a wide area mobile ad-hoc network called Terminode Network. Routing in this network is designed with the following objectives. First, it should scale well in terms of the number of nodes and geographical coverage ...

2002

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

Load Balancing in Data Networks

Load balancing apparatus for a data communications network comprises hash logic for computing a hash function on incoming data packets. A threshold detector is connected to the hash logic for triggering, in response to utilization of the downstream objects ...

2002