Publication

Rethinking Boolean Network Tomography

Graph Chatbot

Chattez avec Graph Search

Posez n’importe quelle question sur les cours, conférences, exercices, recherches, actualités, etc. de l’EPFL ou essayez les exemples de questions ci-dessous.

AVERTISSEMENT : Le chatbot Graph n'est pas programmé pour fournir des réponses explicites ou catégoriques à vos questions. Il transforme plutôt vos questions en demandes API qui sont distribuées aux différents services informatiques officiellement administrés par l'EPFL. Son but est uniquement de collecter et de recommander des références pertinentes à des contenus que vous pouvez explorer pour vous aider à répondre à vos questions.

Connectez-vous pour utiliser Chat avec Graph Search

An improved approximation algorithm for virtual private network design

Friedrich Eisenbrand

Virtual private network design deals with the reservation of capacities in a network, such that the nodes can share communication. Each node in the network has associated upper bounds on the amount of flow that it can send to the network and receive from t ...

2005

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

Synchronizing Method for Impulse Radio Network

Jean-Yves Le Boudec, Alaeddine El Fawal

In IR (Impulse Radio) network, the conventional synchronization (also called signal acquisition) method becomes inefficient and results in a certain failure of synchronization when concurrent transmissions are allowed without controlling their powers. The ...

2005

Synchronizing Method for Impulse Radio Network

Jean-Yves Le Boudec, Alaeddine El Fawal

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

Connectivity vs Capacity in Dense Ad Hoc Networks

Patrick Thiran, Olivier Dousse

We study the connectivity and capacity of finite area ad hoc wireless networks, with an increasing number of nodes (dense networks). We find that the properties of the network strongly depend on the shape of the attenuation function. For power law attenuat ...

2004

Network structures from selection principles

Andrea Rinaldo, Amos Maritan

Analysis of a class of models was performed in which the key selection criterion for network topology is optimality. Optimality leads to the emergence of several distinct network structures including an apparent scale-free arrangement in the treelike topol ...

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

Oxygen diffusion through the disordered oxide network during silicon oxidation

Alfredo Pasquarello, Angelo Bongiorno

An atomic-scale description is provided for the long-range oxygen migration through the disordered SiO2 oxide during silicon oxidation. First-principles calculations, classical molecular dynamics, and Monte Carlo simulations are used in sequence to span th ...

2002

A Min-Plus System Theory for Constrained Traffic Regulation and Dynamic Service Guarantees

Jean-Yves Le Boudec, Patrick Thiran

By extending the system theory under the (min,+)-algebra to the time varying setting, we solve the problem of constrained traffic regulation and develop a calculus for dynamic service guarantees. For a constrained traffic regulation problem with maximum to ...

1999