Concept

Attaque par déni de service

Publications associées (144)

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

Vulnerabilities in Epidemic Forwarding

Jean-Yves Le Boudec, Alaeddine El Fawal

We identify vulnerabilities in epidemic forwarding. We address broadcast applications over wireless ad-hoc networks. Epidemic forwarding employs several mechanisms such as inhibition and spread control and each of them can be achieved using different alter ...

2006

Denial-of-service resilience in peer-to-peer file sharing systems

Willy Zwaenepoel, Dan Mihai Dumitriu

Peer-to-peer (p2p) file sharing systems are characterized by highly replicated content distributed among nodes with enormous aggregate resources for storage and communication. These properties alone are not sufficient, however, to render p2p networks immun ...

2005

Packet Combining in Sensor Networks

Martin Vetterli, Henri Julien Dubois-Ferrière

This paper presents the Simple Packet Combining (SPaC) error-correction scheme for wireless sensor networks. Nodes buffer corrupt packets, and when two or more corrupt versions of a packet have been received, a packet combining procedure attempts to recove ...

2005

The conditional correlation attack: a practical attack on Bluetooth encryption

Serge Vaudenay, Willi Meier, Yi Lu

Motivated by the security of the nonlinear filter generator, the concept of correlation was previously extended to the conditional correlation, that studied the linear correlation of the inputs conditioned on a given (short) output pattern of some specific ...

2005

"Pay bursts only once" does not hold for non-FIFO Guaranteed Rate nodes

Jean-Yves Le Boudec, Gianluca Rizzo

We demonstrate that, contrary to what is generally believed, the existing end-to-end delay bounds apply only to GR nodes that are FIFO per flow. We show this by exhibiting a counter-example. Then we show that the proof of the existing bounds has a subtle, ...

2005

Improving TCP Performance in Ad Hoc Networks Using Signal Strength Based Link Management

Fabius Klemm

Mobility in ad hoc networks causes frequent link failures, which in turn causes packet losses. TCP attributes these packet losses to congestion. This incorrect inference results in frequent TCP re-transmission time-outs and therefore a degradation in TCP p ...

2005

Self-Policing Mobile Ad-hoc Networks

Jean-Yves Le Boudec, Sonja Buchegger

Misbehavior in mobile ad-hoc networks occurs for several reasons. Selfish nodes misbehave to save power or to improve their access to service relative to others. Malicious intentions result in misbehavior as exemplified by denial of service attacks. Faulty ...

CRC Press2004

Denial of Service Resilience in Ad Hoc Networks

Jean-Pierre Hubaux, Imad Aad

Significant progress has been made towards making ad hoc networks secure and DoS resilient. However, little attention has been focused on quantifying DoS resilience: Do ad hoc networks have sufficiently redundant paths and counter-DoS mechanisms to make Do ...

2004

NASCENT: Network Layer Service for Vicinity Ad-hoc Groups

Jean-Pierre Hubaux, Jun Luo

Many envisioned applications of ad hoc networks involve only small-scale networks that we term Vicinity Ad-hoc Groups (VAGs). Distributed coordination services, instead of pairwise communications, are the primary requirements of VAGs. Existing designs for ...

2004

FUSE: Lightweight Guaranteed Distributed Failure Notification

Dejan Kostic

FUSE is a lightweight failure notification service for building distributed systems. Distributed systems built with FUSE are guaranteed that failure notifications never fail. Whenever a failure notification is triggered, all live members of the FUSE group ...

2004