An ant approach to membership overlay design: Results on the dynamic global setting

Vittorio Maniezzo, Marco Boschetti, M. Jelasity

Research output: Chapter in Book/Report/Conference proceedingConference contribution

12 Citations (Scopus)

Abstract

Designing an optimal overlay communication network for a set of processes on the Internet is a central problem of peer-to-peer (P2P) computing. Such a network defines membership and allows for members to disseminate information within the group. The network has to be robust and the available bandwidth has to be utilized in an optimal manner to allow for maximally efficient communication. This problem can be formulated as a dynamic optimization problem where classical combinatorial optimization techniques must face the further challenge of time-varying input data. ACO systems appear to be particularly fit for this class of problems, being able to construct an internal model of the instance to face and to exploit it for fast adaptation to modified contexts. This paper proposes to use elements resulting from mathematical techniques, in this case Lagrangean relaxation, in an ACO framework in order to achieve sound hot start states for fast response to varying network structures.

Original languageEnglish
Title of host publicationLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Pages37-48
Number of pages12
Volume3172 LNCS
Publication statusPublished - 2004
Event4th International Workshop on Ant Colony Optimization and Swarm Intelligence, ANTS 2004 - Brussels, Belgium
Duration: Sep 5 2004Sep 8 2004

Publication series

NameLecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Volume3172 LNCS
ISSN (Print)03029743
ISSN (Electronic)16113349

Other

Other4th International Workshop on Ant Colony Optimization and Swarm Intelligence, ANTS 2004
CountryBelgium
CityBrussels
Period9/5/049/8/04

Fingerprint

Overlay networks
Global Dynamics
Combinatorial optimization
Overlay
Telecommunication networks
Acoustic waves
Internet
Bandwidth
Communication
Lagrangean Relaxation
Dynamic Optimization Problems
Overlay Networks
Peer-to-peer (P2P)
Combinatorial Optimization
Network Structure
Communication Networks
Optimization Techniques
Time-varying
Face
Internal

ASJC Scopus subject areas

  • Computer Science(all)
  • Theoretical Computer Science

Cite this

Maniezzo, V., Boschetti, M., & Jelasity, M. (2004). An ant approach to membership overlay design: Results on the dynamic global setting. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3172 LNCS, pp. 37-48). (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3172 LNCS).

An ant approach to membership overlay design : Results on the dynamic global setting. / Maniezzo, Vittorio; Boschetti, Marco; Jelasity, M.

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3172 LNCS 2004. p. 37-48 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics); Vol. 3172 LNCS).

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Maniezzo, V, Boschetti, M & Jelasity, M 2004, An ant approach to membership overlay design: Results on the dynamic global setting. in Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). vol. 3172 LNCS, Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), vol. 3172 LNCS, pp. 37-48, 4th International Workshop on Ant Colony Optimization and Swarm Intelligence, ANTS 2004, Brussels, Belgium, 9/5/04.
Maniezzo V, Boschetti M, Jelasity M. An ant approach to membership overlay design: Results on the dynamic global setting. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3172 LNCS. 2004. p. 37-48. (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
Maniezzo, Vittorio ; Boschetti, Marco ; Jelasity, M. / An ant approach to membership overlay design : Results on the dynamic global setting. Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Vol. 3172 LNCS 2004. pp. 37-48 (Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)).
@inproceedings{878cc34cf4f14e3fa60bc6e380b0de7e,
title = "An ant approach to membership overlay design: Results on the dynamic global setting",
abstract = "Designing an optimal overlay communication network for a set of processes on the Internet is a central problem of peer-to-peer (P2P) computing. Such a network defines membership and allows for members to disseminate information within the group. The network has to be robust and the available bandwidth has to be utilized in an optimal manner to allow for maximally efficient communication. This problem can be formulated as a dynamic optimization problem where classical combinatorial optimization techniques must face the further challenge of time-varying input data. ACO systems appear to be particularly fit for this class of problems, being able to construct an internal model of the instance to face and to exploit it for fast adaptation to modified contexts. This paper proposes to use elements resulting from mathematical techniques, in this case Lagrangean relaxation, in an ACO framework in order to achieve sound hot start states for fast response to varying network structures.",
author = "Vittorio Maniezzo and Marco Boschetti and M. Jelasity",
year = "2004",
language = "English",
isbn = "3540226729",
volume = "3172 LNCS",
series = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",
pages = "37--48",
booktitle = "Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)",

}

TY - GEN

T1 - An ant approach to membership overlay design

T2 - Results on the dynamic global setting

AU - Maniezzo, Vittorio

AU - Boschetti, Marco

AU - Jelasity, M.

PY - 2004

Y1 - 2004

N2 - Designing an optimal overlay communication network for a set of processes on the Internet is a central problem of peer-to-peer (P2P) computing. Such a network defines membership and allows for members to disseminate information within the group. The network has to be robust and the available bandwidth has to be utilized in an optimal manner to allow for maximally efficient communication. This problem can be formulated as a dynamic optimization problem where classical combinatorial optimization techniques must face the further challenge of time-varying input data. ACO systems appear to be particularly fit for this class of problems, being able to construct an internal model of the instance to face and to exploit it for fast adaptation to modified contexts. This paper proposes to use elements resulting from mathematical techniques, in this case Lagrangean relaxation, in an ACO framework in order to achieve sound hot start states for fast response to varying network structures.

AB - Designing an optimal overlay communication network for a set of processes on the Internet is a central problem of peer-to-peer (P2P) computing. Such a network defines membership and allows for members to disseminate information within the group. The network has to be robust and the available bandwidth has to be utilized in an optimal manner to allow for maximally efficient communication. This problem can be formulated as a dynamic optimization problem where classical combinatorial optimization techniques must face the further challenge of time-varying input data. ACO systems appear to be particularly fit for this class of problems, being able to construct an internal model of the instance to face and to exploit it for fast adaptation to modified contexts. This paper proposes to use elements resulting from mathematical techniques, in this case Lagrangean relaxation, in an ACO framework in order to achieve sound hot start states for fast response to varying network structures.

UR - http://www.scopus.com/inward/record.url?scp=28944448735&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=28944448735&partnerID=8YFLogxK

M3 - Conference contribution

AN - SCOPUS:28944448735

SN - 3540226729

SN - 9783540226727

VL - 3172 LNCS

T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

SP - 37

EP - 48

BT - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

ER -