Publication

Stability and bounds in aggregate scheduling networks

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.

Cross-Layer Based Analysis of Multi-Hop Wireless Networks

Tarik Tabet

In this work, we revisit classical packet radio networks with a modern treatment of physical-layer (PHY) procedures, medium-access (MAC) and geographic channel-driven routing protocols. Our network model assumes that nodes are randomly distributed on the p ...

2010

Synchronization in dynamical networks

Mahdi Jalili

Complex dynamical networks are ubiquitous in many fields of science from engineering to biology, physics, and sociology. Collective behavior, and in particular synchronization,) is one of the most interesting consequences of interaction of dynamical system ...

EPFL2008

Adaptive media streaming over multipath networks

Dan Jurca

With the latest developments in video coding technology and fast deployment of end-user broadband internet connections, real-time media applications become increasingly interesting for both private users and businesses. However, the internet remains a best ...

EPFL2007

Analysis of finite capacity queueing networks

Michel Bierlaire, Carolina Osorio Pizano

Queueing network models have been widely applied as tools allowing the estimation of performance measures and the behavioural description of systems such as communication, production and software architecture networks. Queueing network models with finite c ...

2007

Delay and coding in multiple-user communications

Stéphane Musy

In multiple-user communications, the bursty nature of the packet arrival times cannot be divorced from the analysis of the transmission process. However, in traditional information theory the random arrival times are smoothed out by appropriated source cod ...

EPFL2007

Describing network congestion and blocking with an analytic queueing network model

Michel Bierlaire, Carolina Osorio Pizano

In a network with capacity constraints congestion effects such as bottlenecks, spillbacks and gridlocks can be observed. These can be described with a queueing network model. The main challenge of such an approach lies in adequately capturing the between-q ...

2007

Describing network congestion and blocking with an analytic queueing network model

Michel Bierlaire, Carolina Osorio Pizano

2007

Node Cooperation in Hybrid Ad hoc Networks

Jean-Pierre Hubaux, Naouel Ben Salem, Levente Buttyan

A hybrid ad hoc network is a structure-based network that is extended using multi-hop communications. Indeed, in this kind of network, the existence of a communication link between the mobile station and the base station is not required: A mobile station t ...

2006

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

Real-time interaction over the Internet

Christophe Salzmann

This dissertation studied real-time interaction over the Internet (RTI2) in the context of remote experimentation where there is typically a person at the client side interacting with physical equipments at the server side. Remote experimentations of mecha ...

EPFL2005