Sciweavers

357 search results - page 27 / 72
» Fault-Tolerant Aggregation for Dynamic Networks
Sort
View
IPPS
2007
IEEE
14 years 3 months ago
Gossip-based Reputation Aggregation for Unstructured Peer-to-Peer Networks
: Peer-to-Peer (P2P) reputation systems are needed to evaluate the trustworthiness of participating peers and to combat selfish and malicious peer behaviors. The reputation system ...
Runfang Zhou, Kai Hwang
SENSYS
2004
ACM
14 years 2 months ago
Synopsis diffusion for robust aggregation in sensor networks
Previous approaches for computing duplicate-sensitive aggregates in sensor networks (e.g., in TAG) have used a tree topology, in order to conserve energy and to avoid double-count...
Suman Nath, Phillip B. Gibbons, Srinivasan Seshan,...
IPPS
2006
IEEE
14 years 3 months ago
Trust overlay networks for global reputation aggregation in P2P grid computing
1 This paper presents a new approach to trusted Grid computing in a Peer-to-Peer (P2P) setting. Trust and security are essential to establish lasting working relationships among th...
Runfang Zhou, Kai Hwang
WAOA
2010
Springer
264views Algorithms» more  WAOA 2010»
13 years 6 months ago
An FPTAS for Flows over Time with Aggregate Arc Capacities
We study flows over time in networks with transit times on the arcs. Transit times describe how long it takes to traverse an arc. A flow over time specifies for each arc a time-dep...
Daniel Dressler, Martin Skutella
CORR
2010
Springer
139views Education» more  CORR 2010»
13 years 7 months ago
Centrality Metric for Dynamic Networks
Centrality is an important notion in network analysis and is used to measure the degree to which network structure contributes to the importance of a node in a network. While many...
Kristina Lerman, Rumi Ghosh, Jeon Hyung Kang