Publication

The morning commute in urban areas with heterogeneous trip lengths

Related publications (41)

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.

Network Resource Allocation for Competing Multiple Description Transmissions

Suhas Diggavi

Providing real-time multimedia services over a best-effort network is challenging due to the stringent delay requirements in the presence of complex network dynamics. Multiple description (MD) coding is one approach to transmit the media over diverse (mult ...

2008

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

Design tools for large networks

Bryn Andrew Martin

The Atlas TDAQ network consists of four separate networks which together total over 8000 ports at 1 Gbit/s, 60 ports at 10 Gbit/s, 200 Ethernet switches at the edge of the network, 6 multi-blade chassis switches at the core and over 20 km of copper and fib ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2007

Spontaneous tidal network formation within a constructed salt marsh: Observations and morphodynamic modelling

Andrea Rinaldo

We have monitored and analyzed, through remote sensing and ancillary field surveys, the rapid (O(1) year) development of a tidal network within a newly established artificial salt marsh in the Venice Lagoon. After the construction of the salt marsh, a netw ...

2007

Congestion Control for Distributed Hash Tables

Jean-Yves Le Boudec, Karl Aberer, Fabius Klemm

Distributed Hash Tables (DHTs) provide a scalable mechanism for mapping identifiers to socket addresses. As each peer in the network can initiate lookup requests, a DHT has to process concurrently a potentially very large number of requests. In this paper, ...

IEEE2006

A statistical physics perspective of complex networks

Thomas Petermann

A statistical physics perspective of complex networks: from the architecture of the Internet and the brain to the spreading of an epidemic Statistical physics has revealed itself as the ideal framework to describe large networks appearing in a variety of d ...

EPFL2005

On network form and function

Andrea Rinaldo, Amos Maritan

Moving from the observation that drainage network configurations minimizing total energy dissipation are stationary solutions of the general equation describing landscape evolution, we review theoretical and observational evidence on river patterns and the ...

2004

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

Buried microchannels in photopolymer for delivering of solutions to neurons in a network

Philippe Renaud, Marc Olivier Heuschkel

A simple and efficient technique for the fabrication of buried microfluidic channels is presented. Microchannels made using a contribution of thick liquid and laminated photopolymers are used for the realization of smart microchips for culture, stimulation ...

1998

A Path Selection Method in ATM using Pre-Computation

Jean-Yves Le Boudec, Olivier Crochat

An algorithm that pre-computes a list of routes for each node in the network. An alternate route is also computed in case of overload of the primary one. Simulations show that this algorithm provides routes as good as On-Demand ones. ...

1996