Concept

Principe de bout en bout

Publications associées (77)

Using End-to-End Data to Infer Lossy Links in Sensor Networks

Compared to wired networks, sensor networks pose two additional challenges for monitoring functions: they support much less probing traffic, and they change their routing topologies much more frequently. We propose therefore to use only end-to-end applicat ...

2006

The challenges of merging two similar structured overlays: A tale of two networks

Karl Aberer, Anwitaman Datta

Structured overlay networks is an important and interesting primitive that can be used by diverse peer-to-peer applications. Multiple overlays can result either because of network partitioning or (more likely) because different groups of peers build such o ...

Springer2006

Real-Time Interaction over the Internet: Model for QOS Adaptation

Denis Gillet, Christophe Salzmann, Philippe Müllhaupt

Real-time Interaction over the Internet (RTI2) is an Internet service that is required typically by remote experimentation applications. From a quality of service (QoS) point of view, RTI2 has constraints that differ from usual real-time multimedia service ...

2005

Large scale selective event dissemination

Sidath Handurukande

Event-based systems usually denote distributed infrastructures that are used to asynchronously disseminate information among geographically distant computing units. In these systems, the information sources (a.k.a. publishers) produce events and the system ...

EPFL2005

Network coding for efficient communication in extreme networks

Jean-Yves Le Boudec, Jörg Widmer

Some forms of ad-hoc networks need to operate in extremely performance- challenged environments where end-to-end connectivity is rare. Such environments can be found for example in very sparse mobile networks where nodes ”meet” only occasionally and are ab ...

2005

A Bandwidth Sharing Approach to Improve Licensed Spectrum Utilization

Panagiotis Papadimitratos

The spectrum of deployed wireless cellular communication systems is found to be under-utilized, even though licensed spectrum is at a premium. To efficiently utilize the bandwidth left unused in a cellular system, which we denote as the primary system (PRI ...

2005

Probabilistic Reliable Multicast in Ad Hoc Networks

Jean-Pierre Hubaux, Jun Luo, Patrick Eugster

When striving for reliability, multicast protocols are most commonly designed as deterministic solutions. Such an approach seems to make the reasoning about reliability guarantees (traditionally binary "all-or-nothing"- like) in the face of packet losses a ...

2004

Closing the gap in the capacity of random wireless networks

Patrick Thiran, Olivier Dousse

We consider the problem of how throughput in a wireless network with randomly located nodes scales as the number of users grows. Following the physical model of Gupta and Kumar, we show that randomly scattered nodes can achieve the optimal 1/sqrt(n) per-no ...

2004

Noise-Robust Multi-Stream Fusion for Text-Independent Speaker Authentication

Samy Bengio, Norman Hoon Thian Poh

Multi-stream approaches have proven to be very successful in speech recognition tasks and to a certain extent in speaker authentication tasks. In this study we propose a noise-robust multi-stream text-independent speaker authentication system. This system ...

IDIAP2004

Noise-Robust Multi-Stream Fusion for Text-Independent Speaker Authentication

Samy Bengio, Norman Hoon Thian Poh

2004

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