A Fully Distributed Lagrangean Solution for a Peer-to-Peer Overlay Network Design Problem

References

• Agar M. C. S., Salhi S. Lagrangean heuristics applied to a variety of large capacitated plant location problems. J. Oper. Res. Soc. (1998) 49(10):1072–1084Crossref, Google Scholar
• Barcelo J., Casanova J. A heuristic Lagrangean algorithm for the capacitated plant location problem. Eur. J. Oper. Res. (1984) 15(12):212–226Crossref, Google Scholar
• Beasley J. E. Lagrangean heuristics for location problems. Eur. J. Oper. Res. (1993) 65(3):383–399Crossref, Google Scholar
• Bertsimas D., Demir R. An approximate dynamic programming approach to multidimensional knapsack problems. Management Sci. (2002) 48(4):550–565Link, Google Scholar
• Birattari M., Paquete L., Stützle T., Varrentrapp K. Classification of metaheuristics and design of experiments for the analysis of components. (2005) . Technical Report, AIDA-01-05, Technical University Darmstadt, GermanyGoogle Scholar
• BitTorrent BitTorrent website. (2008) . Accessed November 29, 2009, http://www.bittorrent.comGoogle Scholar
• Boschetti M., Maniezzo V. Benders decomposition, Lagrangean relaxation and metaheuristic design. J. Heuristics (2009) 15(3):283–312Crossref, Google Scholar
• Boyd S., Xiao L., Mutapcic A. Subgradient methods. (2003) October 1(Stanford University, Stanford, CA) Lecture notes http://www.stanford.edu/class/ee392o/subgrad_method.pdfGoogle Scholar
• Chen X., Li Z., Zhuang Y., Han J., Chen L., Gerndt M., Kranzlmueller D. HAND: An overlay optimization algorithm in peer-to-peer systems. Proc. HPCC 2006 (2006) 4208(Springer-Verlag, Heidelberg, Germany) 290–299Lecture Notes in Computer ScienceCrossref, Google Scholar
• Dean A. M., Voss D. T.Design and Analysis of Experiments (1999) (Springer, New York) Crossref, Google Scholar
• Demers A., Greene D., Hauser C., Irish W., Larson J., Shenker S., Sturgis H., Swinehart D., Terry D. Epidemic algorithms for replicated database management. Proc. 6th Annual ACM Sympos. Principles Distributed Comput. (PODC'87) (1987) (ACM, New York) 1–12Crossref, Google Scholar
• El-Ansary S., Haridi S., Wu J. An overview of structured P2P overlay networks. Handbook on Theoretical and Algorithmic Aspects of Sensor, Ad Hoc Wireless, and Peer-to-Peer Networks (2006) (Auerbach Publications, Boca Raton, FL) 665–684Google Scholar
• Eugster P-T., Guerraoui R., Kermarrec A.-M., Massoulié L. From epidemics to distributed computing. IEEE Comput. (2004) 37(5):60–67Crossref, Google Scholar
• Gnutelliums Gnutella forums. (2008) . Accessed November 29, 2009, http://www.gnutellaforums.comGoogle Scholar
• Hansen P., Mladenovic N. Variable neighborhood search: Principles and applications. Eur. J. Oper. Res. (2001) 130(3):449–467Crossref, Google Scholar
• Held M., Karp R. M. The traveling-salesman problem and minimum spanning trees. Oper. Res. (1970) 18(6):1138–1162Link, Google Scholar
• Held M., Karp R. M. The traveling-salesman problem and minimum spanning trees: Part II. Math. Programming (1971) 1(1):6–25Crossref, Google Scholar
• Held M., Wolfe F., Crowder H. P. Validation of subgradient optimization. Math. Programming (1974) 6(1):62–88Crossref, Google Scholar
• Holmberg K., Ling J. A Lagrangean heuristic for the facility location problem with staircase costs. Eur. J. Oper. Res. (1997) 97(1):63–74Crossref, Google Scholar
• Jelasity M., Montresor A. Epidemic-style proactive aggregation in large overlay networks. Proc. 24th Internat. Conf. Distributed Comput. Systems (ICDCS 2004) (2004) (IEEE Computer Society, Washington, DC) 102–109Crossref, Google Scholar
• Liu Y., Xiao L., Esfahanian A.-H., Ni L. Approaching optimal peer-to-peer overlays. Proc. 15th Internat. Sympo. Model. Anal. Simulation Comput. Telecomm. Systems (MASCOTS'05) (2005) (IEEE Computer Society, Washington, DC) 407–414Google Scholar
• Loguinov D., Kumar A., Rai V., Ganesh S. Graph-theoretic analysis of structured peer-to-peer systems: Routing distances and fault resilience. SIGCOMM'03: Proc. 2003 Conf. Appl., Technologies, Architectures, Protocols Comput. Comm. (2003) (ACM, New York) 395–406Crossref, Google Scholar
• Magazine M. J., Chern M.-S. A note on approximation schemes for multidimensional knapsack problems. Math. Oper. Res. (1984) 9(2):244–247Link, Google Scholar
• Maniezzo V., Boschetti M. A., Jelasity M., Dorigo M., Birattari M., Blum C., Gambardella L. M., Mondada F., Stützle T. An ant approach to membership overlay design: Results on the Dynamic Global Setting. Ant Colony, Optim. Swarm Intelligence: Proc. ANTS 2004 (2004) 3172(Springer-Verlag, Berlin) 37–48Lecture Notes in Computer ScienceCrossref, Google Scholar
• Maniezzo V., Boschetti M. A., Jelasity M. A fully distributed lagrangean metaheuristic for a P2P overlay network design problem. Proc. 6th Metaheuristics Internat. Conf. (MIC 2005) (2005) Vienna:775–780Google Scholar
• Martello S., Toth P.Knapsack Problems: Algorithms and Computer Implementations (1990) (John Wiley & Sons, New York) Google Scholar
• Milojicic D. S., Kalogeraki V., Lukose R., Nagaraja K., Pruyne J., Richard B., Rollins S., Xu Z. Peer-to-peer computing. (2002) . Technical Report HPL-2002-57R1, HP Labs, Palo Alto, CA. http://www.hpl.hp.com/techreports/2002/HPL-2002-57R1.htmlGoogle Scholar
• Mladenovic N., Hansen P. Variable neighborhood search. Comput. Oper. Res. (1997) 24(11):1097–1100Crossref, Google Scholar
• Montresor A., Jelasity M., Babaoglu O. Robust aggregation protocols for large-scale overlay networks. Proc. Distributed Systems and Networks (DSN 2004) (2004) (IEEE Computer Society, Washington, DC) 19–28Crossref, Google Scholar
• MOPinstances MOP data instances. (2008) . Accessed November 29, 2009, http://astarte.csr.unibo.it/dataGoogle Scholar
• Naicken S., Livingston B., Basu A., Rodhetbhai S., Wakeman I., Chalmers D. The state of peer-to-peer simulators and simulations. SIGCOMM Comput. Commun. Rev. (2007) 37(2):95–98 http://doi.acm.org/10.1145/1232919.1232932Crossref, Google Scholar
• Napster Napster Free. (2008) . Accessed November 29, 2009, http://free.napster.comGoogle Scholar
• PeerSim PeerSim: A peer-to-peer simulator. (2008) . Accessed November 29, 2009, http://peersim.sourceforge.netGoogle Scholar
• Polyak B. T. Minimization of unsmooth functionals. USSR Comput. Math. Math. Phys. (1969) 9:14–29Crossref, Google Scholar
• Rardin R. L., Uzsoy R. Experimental evaluation of heuristic optimization algorithms: A tutorial. J. Heuristics (2001) 7(3):261–304Crossref, Google Scholar
• Saroiu S., Krishna Gummadi P., Gribble S. D. A measurement study of peer-to-peer file sharing systems. Proc. ACM Multimedia Comput. Networking 2002 (MMCN'02) (2002) San Jose, CA:156–170Google Scholar
• Shor N. Z.Minimization Methods for Non-Differentiable Functions (1985) (Springer-Verlag, Berlin) Crossref, Google Scholar
• Sridharan R. A Lagrangian heuristic for the capacitated plant location problem with single source constraints. Eur. J. Oper. Res. (1991) 66(3):305–312Crossref, Google Scholar
• Tanenbaum A. S.Modern Operating Systems (1992) (Prentice Hall, Upper Saddle River, NJ) Google Scholar
• Wang W., Zeng G. A generic trust overlay simulator for P2P networks. PRDC'06, Proc. 12th Pacific Rim Internat. Sympos. Dependable Comput. (2006) (IEEE Computer Society, Washington, DC) 401–402Crossref, Google Scholar
• Wikipedia contributors FastTrack. . Wikipedia, The Free Encyclopedia, Accessed November 29, 2009, http://en.wikipedia.org/wiki/FastTrackGoogle Scholar