Publication

Lattice Networks: Capacity Limits, Optimal Routing and Queueing Behavior

Related publications (50)

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.

Stability and bounds in aggregate scheduling networks

Gianluca Rizzo

We study networks of FIFO nodes, where flows are constrained by arrival curves. A crucial question with these networks is: Can we derive a bound to the maximum delay that a packet can experience when traversing the network, and to the maximum queue size at ...

EPFL2008

Low computation and low latency algorithms for distributed sensor network initialization

Volkan Cevher

In this paper, we show how an underlying system’s state vector distribution can be determined in a distributed heterogeneous sensor network with reduced subspace observability at the individual nodes. The presented algorithm can generate the initial state ...

Springer Verlag2007

Spectral coarse graining of complex networks

Paolo De Los Rios, David Gfeller

Reducing the complexity of large systems described as complex networks is key to understanding them and a crucial issue is to know which properties of the initial system are preserved in the reduced one. Here we use random walks to design a coarse graining ...

American Physical Society2007

Simplifying complex networks

David Gfeller

The framework of complex networks has been shown to describe adequately a wide class of complex systems made up of a large number of interacting units. In this framework, a node is associated to each unit and two nodes are connected by an edge if the two u ...

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

Adaptive Route Choice Models in Stochastic Time-Dependent Networks

Emma Frejinger, Song Gao

We study adaptive route choice models that explicitly capture travelers' route choice adjustments according to information on realized network conditions in stochastic time-dependent networks. Two types of adaptive route choice models are explored: an adap ...

2007

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

Multilayer description of large scale communication networks

Sébastien Rumley, Christian Gaumier

Data exchanges between various modules and tools raise interfacing difficulties in a multilayer environment. This aspect may become particularly critical in a distributed context. ...

Springer, 233 Spring Street, New York, Ny 10013, United States2007

Network Correlated Data Gathering with Explicit Communication: NP-Completeness and Algorithms

Martin Vetterli, Razvan Cristescu

We consider the problem of correlated data gathering by a network with a sink node and a tree based communication structure, where the goal is to minimize the total trans- mission cost of transporting the information collected by the nodes, to the sink nod ...

2006