{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:36:59Z","timestamp":1750307819959,"version":"3.41.0"},"reference-count":35,"publisher":"Association for Computing Machinery (ACM)","issue":"3","license":[{"start":{"date-parts":[[2008,8,1]],"date-time":"2008-08-01T00:00:00Z","timestamp":1217548800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CMS-0427089"],"award-info":[{"award-number":["CMS-0427089"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000144","name":"Division of Computer and Network Systems","doi-asserted-by":"publisher","award":["CNS-0448246"],"award-info":[{"award-number":["CNS-0448246"]}],"id":[{"id":"10.13039\/100000144","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Auton. Adapt. Syst."],"published-print":{"date-parts":[[2008,8]]},"abstract":"<jats:p>\n            We present, and evaluate benefits of, a design methodology for translating natural phenomena represented as mathematical models, into novel, self-adaptive, peer-to-peer (p2p) distributed computing algorithms (\n            <jats:italic>protocols<\/jats:italic>\n            ). Concretely, our first contribution is a set of techniques to translate discrete\n            <jats:italic>sequence equations<\/jats:italic>\n            (also known as difference equations) into new p2p protocols called\n            <jats:italic>sequence protocols<\/jats:italic>\n            . Sequence protocols are self-adaptive, scalable, and fault-tolerant, with applicability in p2p settings like Grids. A sequence protocol is a set of probabilistic local and message-passing actions for each process. These actions are translated from terms in a set of source sequence equations. Individual processes do not simulate the source sequence equations completely. Instead, each process executes probabilistic local and message passing actions, so that the emergent round-to-round behavior of the sequence protocol in a p2p system can be probabilistically predicted by the source sequence equations. The article's second contribution is the design and evaluation of a set of sequence protocols for detection of two global triggers in a distributed system: threshold detection and interval detection. This article's third contribution is a new self-adaptive Grid computing protocol called HoneyAdapt. HoneyAdapt is derived from sequence equations modeling adaptive bee foraging behavior in nature. HoneyAdapt is intended for Grid applications that allow Grid clients, at run-time, a choice of algorithms for executing chunks of the application's dataset. HoneyAdapt tells each Grid client how to adaptively select at run-time, for each chunk it receives, a good algorithm for computing the chunk\u2014this selection is based on continuous feedback from other clients. Finally, we design a variant of HoneyAdapt, called HoneySort, for application to Grid parallelized sorting settings using the master-worker paradigm. Our evaluation of these contributions consists of mathematical analysis, large-scale trace-based simulation results, and experimental results from a HoneySort deployment.\n          <\/jats:p>","DOI":"10.1145\/1380422.1380426","type":"journal-article","created":{"date-parts":[[2008,8,12]],"date-time":"2008-08-12T13:10:22Z","timestamp":1218546622000},"page":"1-34","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":22,"title":["A new class of nature-inspired algorithms for self-adaptive peer-to-peer computing"],"prefix":"10.1145","volume":"3","author":[{"given":"Steven Y.","family":"Ko","sequence":"first","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Indranil","family":"Gupta","sequence":"additional","affiliation":[{"name":"University of Illinois at Urbana-Champaign, Urbana, IL"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yookyung","family":"Jo","sequence":"additional","affiliation":[{"name":"Cornell University, Ithaca, NY"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2008,8,13]]},"reference":[{"volume-title":"Difference Equations and Inequalities: Theory, Methods and Applications","author":"Agarwal R. P.","key":"e_1_2_1_1_1","unstructured":"Agarwal , R. P. 2000. Difference Equations and Inequalities: Theory, Methods and Applications , second edition. CRC. Agarwal, R. P. 2000. Difference Equations and Inequalities: Theory, Methods and Applications, second edition. CRC."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-005-0138-3"},{"key":"e_1_2_1_3_1","doi-asserted-by":"publisher","DOI":"10.1145\/281035.281048"},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of ACM-IEEE MEMOCODE. ACM","author":"Arvind","year":"2003","unstructured":"Arvind . 2003 . Bluespec: A language for hardware design, simulation, synthesis and verification . In Proceedings of ACM-IEEE MEMOCODE. ACM , New York, 249. Arvind. 2003. Bluespec: A language for hardware design, simulation, synthesis and verification. In Proceedings of ACM-IEEE MEMOCODE. ACM, New York, 249."},{"volume-title":"Proceedings of the European Conference on Complex Systems.","author":"Babaoglu O.","key":"e_1_2_1_5_1","unstructured":"Babaoglu , O. , Jelasity , M. , Canright , G. , Urnes , T. , Deutsch , A. , Ganguly , N. , di Caro , G. , Ducatelle , F. , Gambardella , L. M. , Montemanni , R. , and Montresor , A . 2005. Design patterns from biology for distributed computing . In Proceedings of the European Conference on Complex Systems. Babaoglu, O., Jelasity, M., Canright, G., Urnes, T., Deutsch, A., Ganguly, N., di Caro, G., Ducatelle, F., Gambardella, L. M., Montemanni, R., and Montresor, A. 2005. Design patterns from biology for distributed computing. In Proceedings of the European Conference on Complex Systems."},{"volume-title":"Proceedings of the IEEE International Conference on Distributed Computing Systems (ICDCS). IEEE, NY, 15","author":"Babaoglu O.","key":"e_1_2_1_6_1","unstructured":"Babaoglu , O. , Meling , H. , and Montresor , A . 2002. Anthill: A framework for the development of agent-based peer-to-peer systems . In Proceedings of the IEEE International Conference on Distributed Computing Systems (ICDCS). IEEE, NY, 15 . Babaoglu, O., Meling, H., and Montresor, A. 2002. Anthill: A framework for the development of agent-based peer-to-peer systems. In Proceedings of the IEEE International Conference on Distributed Computing Systems (ICDCS). IEEE, NY, 15."},{"volume-title":"Proceedings of the Usenix Symposium on Networked Systems Design and Implementation (NSDI). Usenix","author":"Bhagwan R.","key":"e_1_2_1_7_1","unstructured":"Bhagwan , R. , Tati , K. , Cheng , Y.-C. , Savage , S. , and Voelker , G. M . 2004. Total Recall: System support for automated availability management . In Proceedings of the Usenix Symposium on Networked Systems Design and Implementation (NSDI). Usenix , San Francisco, CA, 337--350. Bhagwan, R., Tati, K., Cheng, Y.-C., Savage, S., and Voelker, G. M. 2004. Total Recall: System support for automated availability management. In Proceedings of the Usenix Symposium on Networked Systems Design and Implementation (NSDI). Usenix, San Francisco, CA, 337--350."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.5555\/554879"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/214451.214456"},{"key":"e_1_2_1_10_1","unstructured":"Cormen T. Leiserson C. Rivest R. and Stein C. 2001. Introduction to Algorithms 2nd Ed. MIT Press Cambridge MA.   Cormen T. Leiserson C. Rivest R. and Stein C. 2001. Introduction to Algorithms 2nd Ed. MIT Press Cambridge MA."},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.5555\/1622797.1622806"},{"key":"e_1_2_1_12_1","unstructured":"D'Silva S. 1998. Collective decision making in honeybees. http:\/\/www.msu.edu\/user\/dsilva\/beepp2.ps.  D'Silva S. 1998. Collective decision making in honeybees. http:\/\/www.msu.edu\/user\/dsilva\/beepp2.ps."},{"key":"e_1_2_1_13_1","unstructured":"Gray J. 2005. Sorting benchmark. http:\/\/research.microsoft.com\/barc\/SortBenchmark.  Gray J. 2005. Sorting benchmark. http:\/\/research.microsoft.com\/barc\/SortBenchmark."},{"volume-title":"Department of Computing and Information Sciences","author":"Guo H.","key":"e_1_2_1_14_1","unstructured":"Guo , H. 2003. Algorithm selection for sorting and probabilistic inference: a machine-learning approach. Phd. Dissertation , Department of Computing and Information Sciences , Kansas State University . Guo, H. 2003. Algorithm selection for sorting and probabilistic inference: a machine-learning approach. Phd. Dissertation, Department of Computing and Information Sciences, Kansas State University."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1007\/s00446-007-0024-2"},{"volume-title":"Proceedings of International Conference on Machine Learning (ICML). ACM","author":"Herbster M.","key":"e_1_2_1_16_1","unstructured":"Herbster , M. and Warmuth , M. K . 1995. Tracking the best expert . In Proceedings of International Conference on Machine Learning (ICML). ACM , New York, 286--294. Herbster, M. and Warmuth, M. K. 1995. Tracking the best expert. In Proceedings of International Conference on Machine Learning (ICML). ACM, New York, 286--294."},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1275517.1275520"},{"volume-title":"Proceedings of the 44th IEEE Symposiumon on the Foundations of Computer Science (FOCS). IEEE, NY, 482--491","author":"Kempe D.","key":"e_1_2_1_18_1","unstructured":"Kempe , D. , Dobra , A. , and Gehrke , J . 2003. Computing aggregate information using gossip . In Proceedings of the 44th IEEE Symposiumon on the Foundations of Computer Science (FOCS). IEEE, NY, 482--491 . Kempe, D., Dobra, A., and Gehrke, J. 2003. Computing aggregate information using gossip. In Proceedings of the 44th IEEE Symposiumon on the Foundations of Computer Science (FOCS). IEEE, NY, 482--491."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1109\/SASO.2007.40"},{"volume-title":"Regional Conference Series in Applied Mathematics","author":"Kurtz T.","key":"e_1_2_1_20_1","unstructured":"Kurtz , T. 1981. Approximation of population processes . In Regional Conference Series in Applied Mathematics . SIAM , Philadelphia, PA . Kurtz, T. 1981. Approximation of population processes. In Regional Conference Series in Applied Mathematics. SIAM, Philadelphia, PA."},{"key":"e_1_2_1_21_1","doi-asserted-by":"publisher","DOI":"10.1145\/1095809.1095818"},{"key":"e_1_2_1_22_1","doi-asserted-by":"crossref","unstructured":"Maniezzo V. Boschetti M. A. and \n      Jelasity M\n  . \n  2004\n  . An ant approach to membership overlay design. In Proceedings of the International Workshop on Ant Colony Optimization and Swarm Intelligence (ANTS) Lecture Notes in Computer Science vol. \n  3172 37--48 Springer Berlin Germany.  Maniezzo V. Boschetti M. A. and Jelasity M. 2004. An ant approach to membership overlay design. In Proceedings of the International Workshop on Ant Colony Optimization and Swarm Intelligence (ANTS) Lecture Notes in Computer Science vol. 3172 37--48 Springer Berlin Germany.","DOI":"10.1007\/978-3-540-28646-2_4"},{"key":"e_1_2_1_23_1","unstructured":"MathWorld. 2007. Logistic map. http:\/\/mathworld.wolfram.com\/LogisticMap.html.  MathWorld. 2007. Logistic map. http:\/\/mathworld.wolfram.com\/LogisticMap.html."},{"volume-title":"Proceedings of the IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS). IEEE, NY, 346","author":"Medina A.","key":"e_1_2_1_24_1","unstructured":"Medina , A. , Lakhina , A. , Matta , I. , and Byers , J . 2001. BRITE: An approach to universal topology generation . In Proceedings of the IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS). IEEE, NY, 346 . Medina, A., Lakhina, A., Matta, I., and Byers, J. 2001. BRITE: An approach to universal topology generation. In Proceedings of the IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunications Systems (MASCOTS). IEEE, NY, 346."},{"key":"e_1_2_1_25_1","volume-title":"Proceedings of the International Conference on Distributed Computing (DISC). Lecture Notes in Computer Science","volume":"1914","author":"Merritt M.","unstructured":"Merritt , M. and Taubenfeld , G . 2000. Computing with infinitely many processes . In Proceedings of the International Conference on Distributed Computing (DISC). Lecture Notes in Computer Science , vol. 1914 , Springer Berlin, Germany, 164--178. Merritt, M. and Taubenfeld, G. 2000. Computing with infinitely many processes. In Proceedings of the International Conference on Distributed Computing (DISC). Lecture Notes in Computer Science, vol. 1914, Springer Berlin, Germany, 164--178."},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/357153.357156"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1109\/71.963420"},{"key":"e_1_2_1_28_1","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1983.48"},{"key":"e_1_2_1_29_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0065-2458(08)60520-3"},{"key":"e_1_2_1_30_1","volume-title":"Mute: Simple anonymous file sharing","author":"Rohrer J.","year":"2007","unstructured":"Rohrer , J. 2007 . Mute: Simple anonymous file sharing . http:\/\/mute-net.sourceforge.net\/. Rohrer, J. 2007. Mute: Simple anonymous file sharing. http:\/\/mute-net.sourceforge.net\/."},{"volume-title":"The state machine approach: A tutorial. Tech. rep. TR86-800","author":"Schneider F.","key":"e_1_2_1_31_1","unstructured":"Schneider , F. 1986. The state machine approach: A tutorial. Tech. rep. TR86-800 , Cornell University . Schneider, F. 1986. The state machine approach: A tutorial. Tech. rep. TR86-800, Cornell University."},{"volume-title":"The Wisdom of the Hive","author":"Seeley T.","key":"e_1_2_1_32_1","unstructured":"Seeley , T. 1996. The Wisdom of the Hive . Harvard University Press , Cambridge, MA . Seeley, T. 1996. The Wisdom of the Hive. Harvard University Press, Cambridge, MA."},{"volume-title":"Biology, Chemistry and Engineering","author":"Strogatz S. H.","key":"e_1_2_1_33_1","unstructured":"Strogatz , S. H. 2001. Nonlinear Dynamics and Chaos: With Applications to Physics , Biology, Chemistry and Engineering , Perseus Book Group , New York, NY . Strogatz, S. H. 2001. Nonlinear Dynamics and Chaos: With Applications to Physics, Biology, Chemistry and Engineering, Perseus Book Group, New York, NY."},{"key":"e_1_2_1_34_1","doi-asserted-by":"publisher","DOI":"10.1145\/79147.79162"},{"key":"e_1_2_1_35_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10922-005-4441-x"}],"container-title":["ACM Transactions on Autonomous and Adaptive Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1380422.1380426","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1380422.1380426","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T13:57:45Z","timestamp":1750255065000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1380422.1380426"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008,8]]},"references-count":35,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2008,8]]}},"alternative-id":["10.1145\/1380422.1380426"],"URL":"https:\/\/doi.org\/10.1145\/1380422.1380426","relation":{},"ISSN":["1556-4665","1556-4703"],"issn-type":[{"type":"print","value":"1556-4665"},{"type":"electronic","value":"1556-4703"}],"subject":[],"published":{"date-parts":[[2008,8]]},"assertion":[{"value":"2007-09-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-05-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2008-08-13","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}