Concept

Tor (réseau)

Publications associées (127)

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

Network coding node placement for delay minimization in streaming overlays

Pascal Frossard, Nikolaos Thomos, Nicolae Cleju

Network coding has been proposed recently as an efficient method to increase network throughput by allowing network nodes to combine packets instead of simply forwarding them. However, packet combinations in the network may increase delay, complexity and e ...

2010

LiFTinG: Lightweight Freerider-Tracking in Gossip

Rachid Guerraoui, Anne-Marie Kermarrec, Kévin Clément Huguenin, Maxime Monod

This paper presents LiFTinG, the first protocol to detect freeriders, including colluding ones, in gossip-based content dissemination systems with asymmetric data exchanges. LiFTinG relies on nodes tracking abnormal behaviors by cross-checking the history ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

Network coding of rateless video in streaming overlays

Pascal Frossard, Nikolaos Thomos

We investigate the problem of collaborative video streaming in overlay networks. We exploit path and source diversity, as well as basic processing capabilities of network nodes in order to increase the overall throughput and improve the video quality at th ...

Institute of Electrical and Electronics Engineers2010

NC Node Selection Game in Collaborative Streaming Systems

Pascal Frossard, Nikolaos Thomos, Eymen Kurdoglu

Network coding has been recently proposed as an efficient method to improve throughput, minimize delays and remove the need for reconciliation between network nodes in distributed streaming systems. It permits to take advantage of the path and node diversi ...

2010

Dissent: Accountable Group Anonymity

Bryan Alexander Ford, Henry Nathaniel Corrigan-Gibbs

Users often wish to participate in online groups anonymously, but misbehaving users may abuse this anonymity to disrupt the group. Messaging protocols such as Mix-nets and DC-nets leave online groups vulnerable to denial-of-service and Sybil attacks, while ...

2010

Controlling Parallelism on Multi-core Software Routers

Mihai Dobrescu

Software routers promise to enable the fast deployment of new, sophisticated kinds of packet processing without the need to buy and deploy expensive new equipment. The challenge is offering such programmability while at the same time achieving a competitiv ...

2010

Context-adaptive information flow allocation and media delivery in online social networks

Pascal Frossard

This paper investigates context-driven flow allocation and media delivery in online social networks. We exploit information on contacts and content preferences found in social networking applications to provide efficient network services and operation at t ...

2010

MobiCrowd: A Collaborative Location-Privacy Preserving Mobile Proxy

Jean-Pierre Hubaux, Panagiotis Papadimitratos, Reza Shokri

We demonstrate the first, to the best of our knowledge, LBS client that safeguards user privacy against non-trustworthy LBS servers. Our collaborative approach allows the client to obtain responses from its near-by peers rather than submitting the query to ...

2010

Low-Overhead Bug Fingerprinting for Fast Debugging

George Candea, Cristian Zamfir

There is a gap between the information available at the time of a software failure and the information actually shipped to developers in the corresponding bug report. As a result, identifying the cause of the bug based on this bug report is often difficult ...

Springer-Verlag New York, Ms Ingrid Cunningham, 175 Fifth Ave, New York, Ny 10010 Usa2010

Diffusion LMS with communication constraints

Ali H. Sayed

Diffusion LMS is a distributed algorithm that allows a network of nodes to solve estimation problems in a fully distributed manner by relying solely on local interactions. The algorithm consists of two steps: a consultation step whereby each node combines ...

IEEE2010