Publication

Content Management in Mobile Wireless Networks

Publications associées (111)

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

Signaling and Reciprocity

Wojciech Galuba

Complex networks exist for a number of purposes. The neural, metabolic and food networks ensure our survival, while the social, economic, transportation and communication networks allow us to prosper. Independently of the purposes and particularities of th ...

EPFL2011

Bringing Stability to Wireless Mesh Networks

Adel Aziz

Wireless mesh networks were designed as a mean to rapidly deliver large-scale communication capabilities without the support of any prior infrastructure. Among the different properties of mesh networks, the self-organizing feature is particularly interesti ...

EPFL2011

Graph-based codes for quantize-map-and-forward relaying

Christina Fragouli, Suhas Diggavi, Ayfer Özgür Aydin, Siddhartha Brahma, Ayan Sengupta

We present a structured Quantize-Map-and- Forward (QMF) scheme for cooperative communication over wireless networks, that employs LDPC ensembles for the node operations and message-passing algorithms for decoding. We demonstrate through extensive simulatio ...

Ieee Service Center, 445 Hoes Lane, Po Box 1331, Piscataway, Nj 08855-1331 Usa2011

Analysis of Spatial and Incremental LMS Processing for Distributed Estimation

Ali H. Sayed

Consider a set of nodes distributed spatially over some region forming a network, where every node takes measurements of an underlying process. The objective is for every node in the network to estimate some parameter of interest from these measurements by ...

IEEE2011

Fuzzynet: Ringless Routing in a Ring-like Structured Overlay

Karl Aberer, Anwitaman Datta, Wojciech Galuba, Sarunas Girdzijauskas

Many structured overlay networks rely on a ring invariant as a core network connectivity element. The responsibility ranges of the participating peers and navigability principles (greedy routing) heavily depend on the ring structure. For correctness guaran ...

2011

Energy Efficient Offloading of 3G Networks

Jean-Yves Le Boudec, Nikodin Ristanovic

A huge increase in the amount of data consumed by smartphone users is becoming a serious problem for mobile operators. In three years, mobile data traffic in the AT&T's network rose 5000%. The US operators invest 50 billion dollars in their data networks e ...

2011

The Memory's Ark –

Manuel Philippe Henri Potterat

Un espace de stockage et de conservation des contenus nativement digitaux. A Place of Storage and Preservation of nativly digital Contents. Text: m.ark is information; m.ark is immaterial; m.ark is hardware m.ark is storage; m.ark is material; m.ark is con ...

2011

Agile Views in a Dynamic Data Management System

Christoph Koch, Yanif Ahmad

This paper calls for a new breed of lightweight systems - dynamic data management systems (DDMS). In a nutshell, a DDMS manages large dynamic data structures with agile, frequently fresh views, and provides a facility for monitoring these views and trigger ...

2011

Tuning Paxos for high-throughput with batching and pipelining

André Schiper, Nuno Filipe de Sousa Santos

Paxos is probably the most popular state machine replication protocol. Two optimizations that can greatly improve its performance are batching and pipelining. Nevertheless, tuning these two optimizations to achieve optimal performance can be challenging, a ...

2011

Fast download but eternal seeding: The reward and punishment of Sharing Ratio Enforcement

Rameez Rahman

Many private BitTorrent communities employ Sharing Ratio Enforcement (SRE) schemes to incentivize users to contribute their upload resources. It has been demonstrated that communities that use SRE are greatly oversupplied, i.e., they have much higher seede ...

IEEE2011