SIAM Journal on Applied Mathematics
Approximate counting, uniform generation and rapidly mixing Markov chains
Information and Computation
A guided tour of Chernoff bounds
Information Processing Letters
Discrete Applied Mathematics
Automatic recording agent for digital video server
MULTIMEDIA '00 Proceedings of the eighth ACM international conference on Multimedia
The Mathematics of Infectious Diseases
SIAM Review
Spatial gossip and resource location protocols
STOC '01 Proceedings of the thirty-third annual ACM symposium on Theory of computing
ASA/MA 2000 Proceedings of the Second International Symposium on Agent Systems and Applications and Fourth International Symposium on Mobile Agents
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
FOCS '00 Proceedings of the 41st Annual Symposium on Foundations of Computer Science
Knowbot Programming: system support for mobile agents
IWOOOS '96 Proceedings of the 5th International Workshop on Object Orientation in Operating Systems (IWOOOS '96)
Threshold of Broadcast in Random Graphs
Threshold of Broadcast in Random Graphs
On the runtime and robustness of randomized broadcasting
Theoretical Computer Science
| Hi-index | 0.05 |
Mobile agents are software abstractions that can migrate across the links of a network. They naturally extend the object oriented program style and nicely correspond to agents as examined in game theory. In this paper, we introduce a simple, robust, and efficient randomized broadcast protocol within this mobile agent programming paradigm. We show that by using this scheme, broadcasting enquiries in a random graph of certain density O(lnn) steps, where n denotes the number of nodes in the graph. Then, we consider bounded degree graphs and prove that we are able to distribute an information among all nodes in O(D) steps, where D denotes the diameter of the graph. We also show that, in contrast to traditional randomized broadcasting (TRB), graphs exist in which agent-based randomized broadcasting requires @W(n^2) steps. On the other hand, some graphs which require @W(nlnn) steps to spread the information in the traditional broadcast model, allow very fast agent-based broadcasting. It should be noted that the previously mentioned results are guaranteed with probability 1-o(1/n).