Concept

Real-time Transport Protocol

Publications associées (116)

Towards Provable Secure Neighbor Discovery in Wireless Networks

Jean-Pierre Hubaux, Panagiotis Papadimitratos, Marcin Poturalski

In wireless systems, neighbor discovery (ND) is a fundamental building block: determining which devices are within direct radio communication is an enabler for networking protocols and a wide range of applications. To thwart abuse of ND and the resultant c ...

2008

Towards Provable Secure Neighbor Discovery in Wireless Networks

Jean-Pierre Hubaux, Panagiotis Papadimitratos, Marcin Poturalski

ACM2008

The Next 700 BFT Protocols

Rachid Guerraoui, Marko Vukolic, Nikola Knezevic

Modern Byzantine fault-tolerant state machine replication (BFT) protocols involve about 20.000 lines of challenging C++ code encompassing synchronization, networking and cryptography. They are notoriously difficult to develop, test and prove. We present a ...

2008

Efficient Protocols for Set Membership and Range Proofs

Rafik Chaabouni

We consider the following problem: Given a commitment to a value σ, prove in zero-knowledge that σ belongs to some discrete set Φ. The set Φ can perhaps be a list of cities or clubs; often Φ can be a numerical range such as [1, 220]. This problem arises in ...

Springer2008

Reducing Buffer Space in Multipath Schemes

Maysam Yabandeh, Sajjad Zarifzadeh

One major drawback of multipath transferring schemes, which is inspired by the usage of different paths with diverse delays, is the emergence of reordering among packets of a flow. This reordering brings some substantial problems (like larger delay and buf ...

2008

Making giant unilamellar vesicles via hydration of a lipid film

Suliana Manley

This unit describes protocols for making giant unilamellar vesicles (GUVs) based on rehydration of dried lipid films. These model membranes are useful for determining the impact of membrane and membrane-binding components on lipid bilayer stiffness and pha ...

2008

Improving the Throughput of Distributed Hash Tables Using Congestion-Aware Routing

Jean-Yves Le Boudec, Karl Aberer, Dejan Kostic, Fabius Klemm

Advanced applications for Distributed Hash Tables (DHTs), such as Peer-to-Peer Information Retrieval, require a DHT to quickly and efficiently process a large number (in the order of millions) of requests. In this paper we study mechanisms to optimize the ...

2007

A Method for Routing Packets Across Multiple Paths in NoCs with In-Order Delivery and Fault-Tolerance Guarantees

Giovanni De Micheli, David Atienza Alonso, Luca Benini, Srinivasan Murali

Networks on Chips (NoCs) are required to tackle the increasing delay and poor scalability issues of bus-based communication architectures. Many of today’s NoC designs are based on single path routing. By utilizing multiple paths for routing, congestion in ...

Hindawi Publications2007

Hardware-in-the-Loop Simulation Software for regulator tests and optimization

Jean-Jacques Simond, Philippe Allenbach, Antoine Béguin, Stefan Keller

This paper presents a real-time extension, called SIMSEN-RT, of the simulation software SIMSEN. SIMSEN-RT allows carrying out hardware-in-the-loop (HIL) simulations of power systems using hardware regulators. It can therefore be used to fine-tune regulator ...

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

Hardware-in-the-Loop Simulation Software for regulator tests and optimization.

Jean-Jacques Simond, Philippe Allenbach, Antoine Béguin, Stefan Keller

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