Publication

A dynamic network loading model for anisotropic and congested pedestrian flows

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.

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

Strategic maintenance and renewal policy of a railway corridors, taking into account the value of capacity

Yves Putallaz

The paper presents a research 1that aims to develop a methodology that supports the elaboration and the optimisation of long term maintenance and renewal policies for railway infrastructure (strategic planning level, up to 20 years). The elaboration proces ...

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

Regulation of a Connection Admission Control Algorithm

Jean-Yves Le Boudec, Patrick Thiran

Connection Admission Control (CAC) algorithms are used to decide whether an incoming connection should be accepted or rejected in a node of a network offering reservation based services in order to maintain the guaranteed Quality of Service (QoS) in the ne ...

1999

Renegotiable VBR service

In this work we address the problem of supporting the QoS requirements for applications while efficiently allocating the network resources. We analyse this problem at the source node where the traffic profile is negotiated with the network and the traffic ...

EPFL1999

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