Concept

Nœud sinusal

Publications associées (63)

Bounds for Independent Regulated Inputs Multiplexed in a Service Curve Network Element

We consider the problem of bounding the probability of buffer overflow in a network node receiving independent inputs that are each constrained by arrival curves, but that are served as an aggregate. Existing results (for example \cite{kesidis-00-b} and \c ...

2003

The Effect of Rumor Spreading in Reputation Systems for Mobile Ad-hoc Networks

Jean-Yves Le Boudec, Sonja Buchegger

Mobile ad-hoc networks rely on the cooperation of nodes for routing and forwarding. For individual nodes there are however several advantages resulting from noncooperation, the most obvious being power saving. Nodes that act selfishly or even maliciously p ...

2003

Secure Routing for Mobile Ad hoc Networks

Panagiotis Papadimitratos

The emergence of the Mobile Ad Hoc Networking (MANET) technology advocates self-organized wireless interconnection of communication devices that would either extend or operate in concert with the wired networking infrastructure or, possibly, evolve to auto ...

SCS2002

Stochastic Analysis of Some Expedited Forwarding Networks

Jean-Yves Le Boudec, Milan Vojnovic

We consider stochastic guarantees for networks with aggregate scheduling, in particular, Expedited Forwarding (EF). Our approach is based on the assumption that a node can be abstracted by a service curve, and the input flows are regulated individually at ...

2002

Performance Analysis of the CONFIDANT Protocol (Cooperation Of Nodes - Fairness In Dynamic Ad-hoc NeTworks)

Jean-Yves Le Boudec, Sonja Buchegger

Mobile ad-hoc networking works properly only if the par- ticipating nodes cooperate in routing and forwarding. How- ever, it may be advantageous for individual nodes not to cooperate. We propose a protocol, called CONFIDANT, for making misbehavior unattrac ...

2002

Malice, Selfishness, and Slander in Mobile Ad-hoc Networks.

Jean-Yves Le Boudec, Sonja Buchegger

In mobile ad-hoc networks nodes need to cooperate to communicate, but there are many reasons for non-cooperation. Saving power or preventing other nodes from obstructing a service are merely selfish reasons for non-cooperation, whereas nodes may also activ ...

2002

Cooperation of Nodes. In: L. Buttyan and J.-P. Hubaux (eds.), Report on a Working Session on Security in Wireless Ad Hoc Networks

Jean-Yves Le Boudec, Sonja Buchegger

2002

Performance Analysis of the CONFIDANT Protocol: Cooperation Of Nodes - Fairness In Dynamic Ad-hoc NeTworks

Jean-Yves Le Boudec, Sonja Buchegger

Mobile ad-hoc networking works properly only if the participating nodes cooperate in routing and forwarding. However, it may be advantageous for individual nodes not to cooperate. We propose a protocol, called CONFIDANT, for making misbehavior unattractive ...

2002

Cooperative Routing in Mobile Ad-hoc Networks: Current Efforts Against Malice and Selfishness

Jean-Yves Le Boudec, Sonja Buchegger

In mobile ad-hoc networks, nodes do not rely on any routing infrastructure but relay packets for each other. Thus communication in mobile ad-hoc networks functions properly only if the participating nodes cooperate in routing and forwarding. However, it ma ...

2002

Stochastic Analysis of Some Expedited Forwarding Networks

Jean-Yves Le Boudec, Milan Vojnovic

2001

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