Concept

Réseau superposé

Publications associées (526)

Aerated flows on stepped chutes with macro-roughness elements - Part I: Hydraulic characteristics

Uncontrolled overtopping during flood events can endanger embankment dams. Erosion of the downstream slope and scouring of its toe due to the high energy of the overflow can lead to breach formation and complete failure. Solution to overcome these dangerou ...

2008

CMOS programmable asynchronous neighborhood mechanism for WTM kohonen neural network

Rafal Tomasz Dlugosz

A new programmable neighborhood mechanism for the Winner Takes Most (WTM) self-organizing Kohonen map has been proposed in this paper. Described circuit is an asynchronous solution, which does not require the controlling clock generator. The winning neuron ...

2008

Short and intermediate range order in amorphous GeSe2

Alfredo Pasquarello

By using first-principle molecular dynamics within density functional theory, we study the structural properties of amorphous GeSe2 at a temperature T of 300 K. For each property, a statistical average is obtained from six independent partial averages take ...

2008

On the Specification of Partitionable Group Membership

André Schiper, Stefan Pleisch, Olivier Rütti

Group communication in partitionable systems has been the focus of many research activities over the last decade. Fault-tolerant applications in a partitionable system model generally rely on two basic services: a group membership service and a reliable mu ...

IEEE Computer Society2008

Bottleneck Discovery and Overlay Management in Network Coded Peer-to-Peer Systems

Christina Fragouli, Suhas Diggavi, Mahdi Jafari Siavoshani

The performance of peer-to-peer (P2P) networks depends critically on the good connectivity of the overlay topology. In this paper we study P2P networks for content distribution (such as Avalanche) that use randomized network coding techniques. The basic id ...

2007

Bottleneck Discovery and Overlay Management in Network Coded Peer-to-Peer Systems

Christina Fragouli, Suhas Diggavi

2007

UniStore: Querying a DHT-based Universal Storage

Manfred Hauswirth, Roman Schmidt, Renault John Lecoultre, Jessica Müller

The idea of collecting and combining large public data sets and services became more and more popular. The special characteristics of such systems and the requirements of the participants demand for strictly decentralized solutions. However, this comes alo ...

2007

Message Passing in Semantic Peer-to-Peer Overlay Networks

Karl Aberer, Philippe Cudré-Mauroux

Peer-to-Peer (P2P) systems rely on machine-to-machine ad-hoc communications to offer services to a community. Contrary to the classical client-server architecture, P2P systems consider all peers, i.e., all nodes participating in the network, as being equal ...

2007

Sampling Cluster Endurance for Peer-to-Peer based Content Distribution Networks

Several types of Content Distribution Networks are being deployed over the Internet today, based on different architectures to meet their requirements (e.g., scalability, efficiency and resiliency). Peer-to-peer (P2P) based Content Distribution Networks ar ...

2007

Generalization of the RIN Result to Heterogeneous Networks of Aggregate Schedulers and Leaky Bucket Constrained Flows

Jean-Yves Le Boudec, Gianluca Rizzo

We consider networks of FIFO aggregate schedulers. Quite surprisingly, the natural condition (node utilization inferior to one) in general is not sufficient in these networks to ensure stability (boundedness of delay and backlog at each node). Deriving goo ...

2007

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