Sciweavers

2092 search results - page 134 / 419
» A Theory of Non-Deterministic Networks
Sort
View
SPAA
2009
ACM
16 years 8 days ago
Brief announcement: parameterized maximum and average degree approximation in topic-based publish-subscribe overlay network desi
Designing an overlay network for publish/subscribe communication in a system where nodes may subscribe to many different topics of interest is of fundamental importance. For scala...
Melih Onus, Andréa W. Richa
P2P
2007
IEEE
161views Communications» more  P2P 2007»
15 years 6 months ago
The BitCod Client: A BitTorrent Clone using Network Coding
Network coding is an emerging field of research with sound and mature theory supporting it. Recent works shows that it has many benefits like improved fault tolerance, higher ...
Danny Bickson, Roy Borer
MMB
2010
Springer
194views Communications» more  MMB 2010»
15 years 4 months ago
Searching for Tight Performance Bounds in Feed-Forward Networks
Abstract. Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently...
Andreas Kiefer, Nicos Gollan, Jens B. Schmitt
MOBIHOC
2007
ACM
15 years 11 months ago
Complexity in geometric SINR
In this paper we study the problem of scheduling wireless links in the geometric SINR model, which explicitly uses the fact that nodes are distributed in the Euclidean plane. We p...
Olga Goussevskaia, Yvonne Anne Oswald, Roger Watte...
SAGT
2009
Springer
136views Game Theory» more  SAGT 2009»
15 years 6 months ago
Doing Good with Spam Is Hard
We study economic means to improve network performance in the well-known game theoretic traffic model due to Wardrop. We introduce two sorts of spam flow - auxiliary and adversari...
Martin Hoefer, Lars Olbrich, Alexander Skopalik