{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T15:10:28Z","timestamp":1778253028091,"version":"3.51.4"},"publisher-location":"Berlin, Heidelberg","reference-count":25,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540226727","type":"print"},{"value":"9783540286462","type":"electronic"}],"license":[{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2004,1,1]],"date-time":"2004-01-01T00:00:00Z","timestamp":1072915200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-28646-2_4","type":"book-chapter","created":{"date-parts":[[2010,9,21]],"date-time":"2010-09-21T15:30:21Z","timestamp":1285083021000},"page":"37-48","source":"Crossref","is-referenced-by-count":7,"title":["An Ant Approach to Membership Overlay Design"],"prefix":"10.1007","author":[{"given":"Vittorio","family":"Maniezzo","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Marco","family":"Boschetti","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mark","family":"Jelasity","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"4_CR1","doi-asserted-by":"crossref","unstructured":"Blum, C.: Aco applied to group shop scheduling: A case study on intensification and diversification. In: Proc. ANTS 2002 (2002)","DOI":"10.1007\/3-540-45724-0_2"},{"key":"4_CR2","unstructured":"Boschetti, M., Jelasity, M., Maniezzo, V.: A local approach to membership overlay design. Working paper, Department of Computer Science, University of Bologna (2004)"},{"key":"4_CR3","volume-title":"Introduction to Algorithms","author":"T. Corman","year":"1990","unstructured":"Corman, T., Leiserson, C., Rivest, R.: Introduction to Algorithms. MIT Press, Cambridge (1990)"},{"key":"4_CR4","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/41840.41841","volume-title":"Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing (PODC 1987)","author":"A. Demers","year":"1987","unstructured":"Demers, A., Greene, D., Hauser, C., Irish, W., Larson, J., Shenker, S., Sturgis, H., Swinehart, D., Terry, D.: Epidemic algorithms for replicated database management. In: Proceedings of the 6th Annual ACM Symposium on Principles of Distributed Computing (PODC 1987), Vancouver, August 1987, pp. 1\u201312. ACM, New York (1987)"},{"key":"4_CR5","unstructured":"Eugster, P.T., Guerraoui, R., Kermarrec, A.-M., Massouli\u00e9, L.: . From epidemics to distributed computing. IEEE Computer (to appear)"},{"key":"4_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"88","DOI":"10.1007\/3-540-45724-0_8","volume-title":"Ant Algorithms","author":"C.J. Eyckelhof","year":"2002","unstructured":"Eyckelhof, C.J., Snoek, M.: Ant systems for a dynamic tsp: Ants caught in a traffic jam. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol.\u00a02463, p. 88. Springer, Heidelberg (2002)"},{"issue":"1","key":"4_CR7","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1287\/mnsc.27.1.1","volume":"27","author":"M.L. Fisher","year":"1981","unstructured":"Fisher, M.L.: The lagrangean relaxation method for solving integer programming problems. Management Science\u00a027(1), 1\u201318 (1981)","journal-title":"Management Science"},{"key":"4_CR8","doi-asserted-by":"crossref","unstructured":"Ganesh, A.J., Kermarrec, A.-M., Massouli\u00e9, L.: Peer-to-peer membership management for gossip-based protocols. IEEE Transactions on Computers\u00a052(2) (February 2003)","DOI":"10.1109\/TC.2003.1176982"},{"key":"4_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"250","DOI":"10.1007\/3-540-45724-0_23","volume-title":"Ant Algorithms","author":"R.M. Garlick","year":"2002","unstructured":"Garlick, R.M., Barr, R.S.: Dynamic wavelength routing in wdm networks via ant colony optimization. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol.\u00a02463, p. 250. Springer, Heidelberg (2002)"},{"key":"4_CR10","unstructured":"Gnutelliums, \n                      http:\/\/www.gnutelliums.com\/"},{"key":"4_CR11","unstructured":"Guntsch, M., Branke, J., Middendorf, M., Schmeck, H.: Aco strategies for dynamic tsp. In: ANTS 2000 - From Ant Colonies to Artificial Ants: Second International Workshop on Ant Algorithms (2000)"},{"key":"4_CR12","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"111","DOI":"10.1007\/3-540-45724-0_10","volume-title":"Ant Algorithms","author":"M. Guntsch","year":"2002","unstructured":"Guntsch, M., Middendorf, M.: Applying population based aco to dynamic optimization problems. In: Dorigo, M., Di Caro, G., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol.\u00a02463, p. 111. Springer, Heidelberg (2002)"},{"issue":"3","key":"4_CR13","doi-asserted-by":"publisher","first-page":"188","DOI":"10.1137\/0203015","volume":"3","author":"T.C. Hu","year":"1974","unstructured":"Hu, T.C.: Optimum communication spanning trees. SIAM Journal on Computing\u00a03(3), 188\u2013195 (1974)","journal-title":"SIAM Journal on Computing"},{"key":"4_CR14","volume-title":"The Steiner Tree Problem","author":"F.K. Hwang","year":"1992","unstructured":"Hwang, F.K., Richards, D.S., Winter, P.: The Steiner Tree Problem. North-Holland, Amsterdam (1992)"},{"key":"4_CR15","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1109\/ICDCS.2004.1281573","volume-title":"Proceedings of The 24th International Conference on Distributed Computing Systems (ICDCS 2004)","author":"M. Jelasity","year":"2004","unstructured":"Jelasity, M., Montresor, A.: Epidemic-style proactive aggregation in large overlay networks. In: Proceedings of The 24th International Conference on Distributed Computing Systems (ICDCS 2004), Tokyo, Japan, pp. 102\u2013109. IEEE Computer Society, Los Alamitos (2004)"},{"key":"4_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"364","DOI":"10.1007\/3-540-48254-7_25","volume-title":"Dependable Computing - EDDC-3","author":"M.-J. Lin","year":"1999","unstructured":"Lin, M.-J., Marzullo, K.: Directional gossip: Gossip in a wide area network. In: Hlavicka, J., Maehle, E., Pataricza, A. (eds.) EDDC 1999. LNCS, vol.\u00a01667, pp. 364\u2013379. Springer, Heidelberg (1999)"},{"issue":"2-3","key":"4_CR17","first-page":"209","volume":"9","author":"H. Louren\u00e7o","year":"2002","unstructured":"Louren\u00e7o, H., Serra, D.: Adaptive search heuristics for the generalized assignment problem. Mathware and Soft Computing\u00a09(2-3), 209\u2013234 (2002)","journal-title":"Mathware and Soft Computing"},{"issue":"4","key":"4_CR18","doi-asserted-by":"publisher","first-page":"358","DOI":"10.1287\/ijoc.11.4.358","volume":"11","author":"V. Maniezzo","year":"1999","unstructured":"Maniezzo, V.: Exact and approximate nondeterministic tree-search procedures for the quadratic assignment problem. INFORMS J. on Computing\u00a011(4), 358\u2013369 (1999)","journal-title":"INFORMS J. on Computing"},{"key":"4_CR19","volume-title":"Knapsack problems: algorithms and computer implementations","author":"S. Martello","year":"1990","unstructured":"Martello, S., Toth, P.: Knapsack problems: algorithms and computer implementations. John Wiley & Sons, Chichester (1990)"},{"key":"4_CR20","doi-asserted-by":"crossref","unstructured":"Massouli\u00e9, L., Kermarrec, A.-M., Ganesh, A.J.: Network awareness and failure resilience in self-organising overlays networks. In: Proceedings of the 22nd Symposium on Reliable Distributed Systems (SRDS 2003), Florence, Italy, pp. 47\u201355 (2003)","DOI":"10.1109\/RELDIS.2003.1238054"},{"key":"4_CR21","unstructured":"Milojicic, D.S., Kalogeraki, V., Lukose, R., Nagaraja, K., Pruyne, J., Richard, B., Rollins, S., Xu, Z.: Peer-to-peer computing. Technical Report HPL-2002-57, HP Labs, Palo Alto (2002)"},{"key":"4_CR22","doi-asserted-by":"crossref","unstructured":"Montresor, A., Jelasity, M., Babaoglu, O.: Robust aggregation protocols for large-scale overlay networks. Technical Report UBLCS-2003-16, University of Bologna, Department of Computer Science, Bologna, Italy, December 2003. To appear in the proceedings of Distributed Systems and Networks (DSN 2004)","DOI":"10.1109\/DSN.2004.1311873"},{"key":"4_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"28","DOI":"10.1007\/3-540-45724-0_3","volume-title":"Ant Algorithms","author":"S. Nouyan","year":"2002","unstructured":"Nouyan, S.: Agent-based approach to dynamic task allocation. In: Dorigo, M., Di Caro, G.A., Sampels, M. (eds.) Ant Algorithms 2002. LNCS, vol.\u00a02463, p. 28. Springer, Heidelberg (2002)"},{"key":"4_CR24","unstructured":"FastTrack: Wikipedia page, \n                      http:\/\/en.wikipedia.org\/wiki\/FastTrack"},{"key":"4_CR25","unstructured":"Saroiu, S., Krishna Gummadi, P., Gribble, S.D.: A measurement study of peerto- peer file sharing systems. In: Proceedings of Multimedia Computing and Networking 2002 (MMCN 2002), San Jose, CA (2002)"}],"container-title":["Lecture Notes in Computer Science","Ant Colony Optimization and Swarm Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-28646-2_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,5,8]],"date-time":"2026-05-08T14:18:45Z","timestamp":1778249925000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-28646-2_4"}},"subtitle":["Results on the Dynamic Global Setting"],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540226727","9783540286462"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-28646-2_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2004]]}}}