Information Processing Letters
Efficient algorithms for distributed snapshots and global virtual time approximation
Journal of Parallel and Distributed Computing - Special issue on parallel and discrete event simulation
Distributed snapshots: determining global states of distributed systems
ACM Transactions on Computer Systems (TOCS)
Multi-Agent Systems: An Introduction to Distributed Artificial Intelligence
Multi-Agent Systems: An Introduction to Distributed Artificial Intelligence
Optimizing information exchange in cooperative multi-agent systems
AAMAS '03 Proceedings of the second international joint conference on Autonomous agents and multiagent systems
A Complex Adaptive System Perspective of Enterprise Architecture in Electronic Government
HICSS '06 Proceedings of the 39th Annual Hawaii International Conference on System Sciences - Volume 04
CoMon: a mostly-scalable monitoring system for PlanetLab
ACM SIGOPS Operating Systems Review
Complex Adaptive Systems: An Introduction to Computational Models of Social Life (Princeton Studies in Complexity)
Aggregation methods for large-scale sensor networks
ACM Transactions on Sensor Networks (TOSN)
Complexity: A Guided Tour
Efficient Algorithms for Global Snapshots in Large Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
Efficient threshold detection in a distributed environment: extended abstract
Proceedings of the 29th ACM SIGACT-SIGOPS symposium on Principles of distributed computing
Fast and Message-Efficient Global Snapshot Algorithms for Large-Scale Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
An efficient decentralized algorithm for the distributed trigger counting problem
ICDCN'11 Proceedings of the 12th international conference on Distributed computing and networking
Improved Algorithms for the Distributed Trigger Counting Problem
IPDPS '11 Proceedings of the 2011 IEEE International Parallel & Distributed Processing Symposium
DCTC: dynamic convoy tree-based collaboration for target tracking in sensor networks
IEEE Transactions on Wireless Communications
Flexible Symmetrical Global-Snapshot Algorithms for Large-Scale Distributed Systems
IEEE Transactions on Parallel and Distributed Systems
| Hi-index | 0.00 |
Distributed trigger counting (DTC) is a problem related to the detection of w triggers with n nodes in large-scale distributed systems that have general characteristics of complex adaptive systems. The triggers come from an external source, and no a priori information about the triggers is given. DTC algorithms can be used for distributed monitoring and global snapshots. When designing an efficient DTC algorithm, the following goals should be considered: minimizing the overall message complexity and distributing the loads for detecting triggers among nodes. In this paper, we propose a randomized algorithm called TreeFill, which satisfies the message complexity of O(nlog(w/n)) with high probability. The maximum number of received messages to detect w triggers in each node is O(log(w/n)) with high probability. These results satisfy the lower bounds of DTC problems. We prove the upper bounds of TreeFill. The performance of TreeFill is also evaluated by means of an agent-based simulation using NetLogo. The simulation results show that TreeFill uses about 54-69% of the messages used in a previous work called CoinRand. The maximum number of received messages in each node of TreeFill is also smaller than that in the previous work.