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

Multi-path content delivery: Efficiency analysis and optimization algorithms

The paper studies the benefits of multi-path content delivery from a rate-distortion efficiency perspective. We develop an optimization framework for computing transmission schedules for streaming media packets over multiple network paths that maximize the ...

Academic Press Inc Elsevier Science2012

Scalable and Secure Polling in Dynamic Distributed Networks

Rachid Guerraoui, Anne-Marie Kermarrec, Hamza Harkous, Florian Huc

We consider the problem of securely conducting a poll in synchronous dynamic networks equipped with a Public Key Infrastructure (PKI). Whereas previous distributed solutions had a communication cost of O(n^2) in an n nodes system, we present SPP (Secure an ...

2012

Network Coding with Computation Alignment

Michael Christoph Gastpar, Naveen Goela

Determining the capacity of multi-receiver networks with arbitrary message demands is an open problem in the network coding literature. In this paper, we consider a multi-source, multi-receiver symmetric deterministic network model parameterized by channel ...

Ieee2012

Computational Aspects of Distributed Optimization in Model Predictive Control

Colin Neil Jones, Tyler Summers, Melanie Nicole Zeilinger

This paper presents a systematic computational study on the performance of distributed optimization in model predictive control (MPC). We consider networks of dynamically coupled systems, which are subject to input and state con- straints. The resulting MP ...

2012

Broadcasting and Multicasting Nested Message Sets

Shirin Saeedi Bidokhti

Finding theoretical limits on the performance of communication systems and designing schemes to achieve them is one of the fundamental questions in information theory. While the theory of point-to-point communication is well-investigated, most problems hav ...

EPFL2012

Special Section: Information and Competitive Strategy in a Networked Economy

Thomas Alois Weber

The special section of 2012 Journal of Management Information Systems deals with the incentives for distributed content generation; counterintuitive network effects in the security software market, which features an intrinsic negative externality; and the ...

2012

Properties of Network Polynomials

Christina Fragouli, Javad Ebrahimi Boroojeni

It is well known that transfer polynomials play an important role in the network code design problem. In this paper we provide a graph theoretical description of the terms of such polynomials. We consider acyclic networks with arbitrary number of receivers ...

2012

Properties of Network Polynomials

Javad Ebrahimi Boroojeni

Ieee2012

The effect of variability of urban systems characteristics in the network capacity

Nikolaos Geroliminis, Burak Boyaci

Recent experimental analysis has shown that some types of urban networks exhibit a low scatter reproducible relationship between average network flow and density, known as the macroscopic fundamental diagram (MFD). It has also been shown that heterogeneity ...

Elsevier2012

Locating the Source of Diffusion in Large-Scale Networks

Martin Vetterli, Patrick Thiran, Pedro Pereira Correia Pinto

How can we localize the source of diffusion in a complex network? Due to the tremendous size of many real networks---such as the Internet or the human social graph---it is usually infeasible to observe the state of all nodes in a network. We show that it i ...

American Physical Society2012