Concept

Nœud (réseau)

Publications associées (163)

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

Flexible Spectrum Assignment for Local Wireless Networks

Julien Pierre Sacha Herzen

In this dissertation, we consider the problem of assigning spectrum to wireless local-area networks (WLANs). In line with recent IEEE 802.11 amendments and newer hardware capabilities, we consider situations where wireless nodes have the ability to adapt n ...

EPFL2015

Large deviations analysis of adaptive distributed detection

Ali H. Sayed

In distributed inference, local cooperation among network nodes can be exploited to enhance the performance of each individual agent, but a challenging requirement for networks operating in dynamic real-world environments is that of adaptation. The interpl ...

IEEE2014

Parallel symbolic execution on cluster of commodity hardware

George Candea, Cristian Zamfir, Stefan Bucur

A symbolic execution task is dynamically divided among multiple computing nodes. Each of the multiple computing nodes explores a different portion of a same symbolic execution tree independently of other computing nodes. Workload status updates are receive ...

2014

Decoding Delay Minimization in Inter-Session Network Coding

Pascal Frossard, Nikolaos Thomos, Eirina Bourtsoulatze

Intra-session network coding has been shown to offer significant gains in terms of achievable throughput and delay in settings where one source multicasts data to several clients. In this paper, we consider a more general scenario where multiple sources tr ...

Institute of Electrical and Electronics Engineers2014

Creating Secrets out of Erasures

Christina Fragouli, Suhas Diggavi, Panagiotis Kostopoulos

Current security systems often rely on the adversary's computational limitations. Wireless networks offer the opportunity for a different, complementary kind of security, which relies on the adversary's limited network presence (i.e., that the adversary ca ...

2013

Network Coding Meets Multimedia: A Review

Pascal Frossard, Enrico Magli

While every network node only relays messages in a traditional communication system, the recent network coding (NC) paradigm proposes to implement simple in-network processing with packet combinations in the nodes. NC extends the concept of "encoding" a me ...

Ieee-Inst Electrical Electronics Engineers Inc2013

Function computation via subspace coding

Christina Fragouli, Lorenzo Keller, Nikhil Karamchandani

This paper considers function computation in a network where intermediate nodes perform randomized network coding, through appropriate choice of the subspace codebooks at the source nodes. Unlike traditional network coding for comput- ing functions, that r ...

2013

Rate allocation and optimized decoding in inter-session network coding

Eirina Bourtsoulatze

Recent advances in data processing and communication systems have led to a continuous increase in the amount of data communicated over today’s networks. These large volumes of data pose new challenges on the current networking infrastructure that only offe ...

EPFL2013

Performance Bounds for Sensor Data Gathering by Coding in Finite Fields

Pascal Frossard, Tamara Tosic

We address the problem of data gathering in adhoc networks. We propose a novel framework where sensor signals are quantized and mapped to a finite field. The network nodes then combine the data from different sensors to form messages that are transmitted t ...

2013

Scalable Routing Easy as PIE: a Practical Isometric Embedding Protocol (Technical Report)

Patrick Thiran, Julien Pierre Sacha Herzen

We present PIE, a scalable routing scheme that achieves 100% packet delivery and low path stretch. It is easy to implement in a distributed fashion and works well when costs are associated to links. Scalability is achieved by using virtual coordinates in a ...

2013