Concept

Réseau superposé

Publications associées (526)

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

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

A general basis for quarter-power scaling in animals

Andrea Rinaldo, Amos Maritan

It has been known for decades that the metabolic rate of animals scales with body mass with an exponent that is almost always 2/3, and often very close to 3/4. The 3/4 exponent emerges naturally from two models of resource distribution networks, radia ...

National Academy of Sciences2010

QoSNC: A Novel Approach to QoS-Based Network Coding for Fixed Networks

Amir Hesam Salavati

In this paper, we present a decentralized algorithm to find minimum cost quality of service (QoS) flow subgraphs in network coded multicast schemes. The main objective is to find minimum cost subgraphs that also satisfy user-specified QoS constraints, spec ...

2010

How regular is a regular-interval timetable? From theory to application

Panagiotis Tzieropoulos, Daniel Emery, David Tron

Initially, choice of regular-interval timetable was mostly addressing operational concerns, aiming to increase the network throughput and to smooth the day-today tasks of the personnel. Separation between infrastructure management and train operations, ind ...

Wit Press, Ashurst Lodge, Southampton So40 7Aa, Ashurst, England2010

Mobile adaptive networks with self-organization abilities

Ali H. Sayed

In this paper we investigate the self-organization and cognitive abilities of adaptive networks when the individual agents are allowed to move in pursuit of an objective. The network as a whole acts as an adaptive entity with localized processing and is ab ...

IEEE2010

A Practical Hand-on Guide for Deploying a Large-scale Wireless Multi-hop Network

Julien Pierre Sacha Herzen, Adel Aziz

The knowledge of how to exactly deploy a wireless multi-hop network can be of interest for both researchers and engineers. Engineers may be interested in the possibility of extending the coverage area of their traditional access point and to provide ubiqui ...

2010

Using location observations to observe routing for choice models

Michel Bierlaire, Jingmin Chen, Jeffrey Newman

Map matching algorithms try to map a series of location observations to an underlying network, to generate a single hypothesized true location or route. For some applications, including route choice modeling, such map matching is not required, and may intr ...

2010

Randomized incremental protocols over adaptive networks

Ali H. Sayed

We introduce an incremental cooperation mode into the framework of adaptive networks (AN). The method applies to generic topologies and avoids the need to establish a Hamiltonian cycle over the network, generalizing the original incremental mode, while kee ...

IEEE2010

Function computation via subspace coding

Christina Fragouli, 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 computing functions, that req ...

2010