Sciweavers

263 search results - page 19 / 53
» Efficient gossip-based aggregate computation
Sort
View
MMNS
2007
105views Multimedia» more  MMNS 2007»
14 years 11 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
CLUSTER
2010
IEEE
14 years 1 months ago
Middleware support for many-task computing
Many-task computing aims to bridge the gap between two computing paradigms, high throughput computing and high performance computing. Many-task computing denotes highperformance co...
Ioan Raicu, Ian T. Foster, Mike Wilde, Zhao Zhang,...
CCS
2010
ACM
14 years 10 months ago
Dialog-based payload aggregation for intrusion detection
Network-based Intrusion Detection Systems (IDSs) such as Snort or Bro that have to analyze the packet payload for all the received data show severe performance problems if used in...
Tobias Limmer, Falko Dressler
CN
2008
127views more  CN 2008»
14 years 10 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
TKDE
2008
137views more  TKDE 2008»
14 years 10 months ago
GossipTrust for Fast Reputation Aggregation in Peer-to-Peer Networks
Abstract-- In peer-to-peer (P2P) networks, reputation aggregation and peer ranking are the most time-consuming and spacedemanding operations. This paper proposes a gossip-based rep...
Runfang Zhou, Kai Hwang, Min Cai