Sciweavers

5658 search results - page 877 / 1132
» An Efficient Counting Network
Sort
View
APPROX
2010
Springer
179views Algorithms» more  APPROX 2010»
15 years 8 months ago
Rumor Spreading on Random Regular Graphs and Expanders
Broadcasting algorithms are important building blocks of distributed systems. In this work we investigate the typical performance of the classical and well-studied push model. Assu...
Nikolaos Fountoulakis, Konstantinos Panagiotou
MMNS
2007
105views Multimedia» more  MMNS 2007»
15 years 8 months ago
Monitoring Flow Aggregates with Controllable Accuracy
In this paper, we show the feasibility of real-time flow monitoring with controllable accuracy in today’s IP networks. Our approach is based on Netflow and A-GAP. A-GAP is a prot...
Alberto Gonzalez Prieto, Rolf Stadler
CONEXT
2009
ACM
15 years 7 months ago
Virtually eliminating router bugs
Software bugs in routers lead to network outages, security vulnerabilities, and other unexpected behavior. Rather than simply crashing the router, bugs can violate protocol semant...
Eric Keller, Minlan Yu, Matthew Caesar, Jennifer R...
BMCBI
2007
114views more  BMCBI 2007»
15 years 6 months ago
Large scale statistical inference of signaling pathways from RNAi and microarray data
Background: The advent of RNA interference techniques enables the selective silencing of biologically interesting genes in an efficient way. In combination with DNA microarray tec...
Holger Fröhlich, Mark Fellmann, Holger Sü...
CN
2008
127views more  CN 2008»
15 years 6 months ago
Decentralized detection of global threshold crossings using aggregation trees
The timely detection that a monitored variable has crossed a given threshold is a fundamental requirement for many network management applications. A challenge is the detection of ...
Fetahi Wuhib, Mads Dam, Rolf Stadler