Dynamic Placement Using Ants for Object Based Simulations
Identifieur interne : 000534 ( Istex/Corpus ); précédent : 000533; suivant : 000535Dynamic Placement Using Ants for Object Based Simulations
Auteurs : Cyrille Bertelle ; Antoine Dutot ; Frédéric Guinand ; Damien OlivierSource :
- Lecture Notes in Computer Science [ 0302-9743 ] ; 2003.
Abstract
Abstract: A distributed application may be considered as a set of interacting entities continuously evolving. Such application can be modeled as a graph with one-to-one mappings between vertices and entities and between edges and communications. Performances depend directly on a good load balancing of the entities between available computing devices and on the minimization of the impact of the communications between them. However, both objectives are contradictory and good performances are achieved if and only if a good tradeoff is found. Our method for finding such a tradeoff is new and based on colored ant colonies. Each computing resource is associated to one ant colony characterized by a color, allowing an implicit consideration of the load balancing constraint. Then, using colored pheromones, ants are just seeking for communicating structures. The method operates on graphs which structural and numerical parameters may change dynamically during the execution.
Url:
DOI: 10.1007/978-3-540-39964-3_80
Links to Exploration step
ISTEX:86F02A6F73616FBB8601044F1E6EEE3AE30DFF86Le document en format XML
<record><TEI wicri:istexFullTextTei="biblStruct"><teiHeader><fileDesc><titleStmt><title xml:lang="en">Dynamic Placement Using Ants for Object Based Simulations</title><author><name sortKey="Bertelle, Cyrille" sort="Bertelle, Cyrille" uniqKey="Bertelle C" first="Cyrille" last="Bertelle">Cyrille Bertelle</name><affiliation><mods:affiliation>Laboratoire d’Informatique du Havre, Université du Havre, 25 rue Philippe Lebon, 76600, Le Havre</mods:affiliation></affiliation></author><author><name sortKey="Dutot, Antoine" sort="Dutot, Antoine" uniqKey="Dutot A" first="Antoine" last="Dutot">Antoine Dutot</name><affiliation><mods:affiliation>Laboratoire d’Informatique du Havre, Université du Havre, 25 rue Philippe Lebon, 76600, Le Havre</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: Antoine.Dutot@univ-lehavre.fr</mods:affiliation></affiliation></author><author><name sortKey="Guinand, Frederic" sort="Guinand, Frederic" uniqKey="Guinand F" first="Frédéric" last="Guinand">Frédéric Guinand</name><affiliation><mods:affiliation>Laboratoire d’Informatique du Havre, Université du Havre, 25 rue Philippe Lebon, 76600, Le Havre</mods:affiliation></affiliation></author><author><name sortKey="Olivier, Damien" sort="Olivier, Damien" uniqKey="Olivier D" first="Damien" last="Olivier">Damien Olivier</name><affiliation><mods:affiliation>Laboratoire d’Informatique du Havre, Université du Havre, 25 rue Philippe Lebon, 76600, Le Havre</mods:affiliation></affiliation></author></titleStmt><publicationStmt><idno type="wicri:source">ISTEX</idno><idno type="RBID">ISTEX:86F02A6F73616FBB8601044F1E6EEE3AE30DFF86</idno><date when="2003" year="2003">2003</date><idno type="doi">10.1007/978-3-540-39964-3_80</idno><idno type="url">https://api.istex.fr/document/86F02A6F73616FBB8601044F1E6EEE3AE30DFF86/fulltext/pdf</idno><idno type="wicri:Area/Istex/Corpus">000534</idno></publicationStmt><sourceDesc><biblStruct><analytic><title level="a" type="main" xml:lang="en">Dynamic Placement Using Ants for Object Based Simulations</title><author><name sortKey="Bertelle, Cyrille" sort="Bertelle, Cyrille" uniqKey="Bertelle C" first="Cyrille" last="Bertelle">Cyrille Bertelle</name><affiliation><mods:affiliation>Laboratoire d’Informatique du Havre, Université du Havre, 25 rue Philippe Lebon, 76600, Le Havre</mods:affiliation></affiliation></author><author><name sortKey="Dutot, Antoine" sort="Dutot, Antoine" uniqKey="Dutot A" first="Antoine" last="Dutot">Antoine Dutot</name><affiliation><mods:affiliation>Laboratoire d’Informatique du Havre, Université du Havre, 25 rue Philippe Lebon, 76600, Le Havre</mods:affiliation></affiliation><affiliation><mods:affiliation>E-mail: Antoine.Dutot@univ-lehavre.fr</mods:affiliation></affiliation></author><author><name sortKey="Guinand, Frederic" sort="Guinand, Frederic" uniqKey="Guinand F" first="Frédéric" last="Guinand">Frédéric Guinand</name><affiliation><mods:affiliation>Laboratoire d’Informatique du Havre, Université du Havre, 25 rue Philippe Lebon, 76600, Le Havre</mods:affiliation></affiliation></author><author><name sortKey="Olivier, Damien" sort="Olivier, Damien" uniqKey="Olivier D" first="Damien" last="Olivier">Damien Olivier</name><affiliation><mods:affiliation>Laboratoire d’Informatique du Havre, Université du Havre, 25 rue Philippe Lebon, 76600, Le Havre</mods:affiliation></affiliation></author></analytic><monogr></monogr><series><title level="s">Lecture Notes in Computer Science</title><imprint><date>2003</date></imprint><idno type="ISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="ISSN">0302-9743</idno></series><idno type="istex">86F02A6F73616FBB8601044F1E6EEE3AE30DFF86</idno><idno type="DOI">10.1007/978-3-540-39964-3_80</idno><idno type="ChapterID">80</idno><idno type="ChapterID">Chap80</idno></biblStruct></sourceDesc><seriesStmt><idno type="ISSN">0302-9743</idno></seriesStmt></fileDesc><profileDesc><textClass></textClass><langUsage><language ident="en">en</language></langUsage></profileDesc></teiHeader><front><div type="abstract" xml:lang="en">Abstract: A distributed application may be considered as a set of interacting entities continuously evolving. Such application can be modeled as a graph with one-to-one mappings between vertices and entities and between edges and communications. Performances depend directly on a good load balancing of the entities between available computing devices and on the minimization of the impact of the communications between them. However, both objectives are contradictory and good performances are achieved if and only if a good tradeoff is found. Our method for finding such a tradeoff is new and based on colored ant colonies. Each computing resource is associated to one ant colony characterized by a color, allowing an implicit consideration of the load balancing constraint. Then, using colored pheromones, ants are just seeking for communicating structures. The method operates on graphs which structural and numerical parameters may change dynamically during the execution.</div></front></TEI><istex><corpusName>springer</corpusName><author><json:item><name>Cyrille Bertelle</name><affiliations><json:string>Laboratoire d’Informatique du Havre, Université du Havre, 25 rue Philippe Lebon, 76600, Le Havre</json:string></affiliations></json:item><json:item><name>Antoine Dutot</name><affiliations><json:string>Laboratoire d’Informatique du Havre, Université du Havre, 25 rue Philippe Lebon, 76600, Le Havre</json:string><json:string>E-mail: Antoine.Dutot@univ-lehavre.fr</json:string></affiliations></json:item><json:item><name>Frédéric Guinand</name><affiliations><json:string>Laboratoire d’Informatique du Havre, Université du Havre, 25 rue Philippe Lebon, 76600, Le Havre</json:string></affiliations></json:item><json:item><name>Damien Olivier</name><affiliations><json:string>Laboratoire d’Informatique du Havre, Université du Havre, 25 rue Philippe Lebon, 76600, Le Havre</json:string></affiliations></json:item></author><language><json:string>eng</json:string></language><originalGenre><json:string>proceedings</json:string></originalGenre><abstract>Abstract: A distributed application may be considered as a set of interacting entities continuously evolving. Such application can be modeled as a graph with one-to-one mappings between vertices and entities and between edges and communications. Performances depend directly on a good load balancing of the entities between available computing devices and on the minimization of the impact of the communications between them. However, both objectives are contradictory and good performances are achieved if and only if a good tradeoff is found. Our method for finding such a tradeoff is new and based on colored ant colonies. Each computing resource is associated to one ant colony characterized by a color, allowing an implicit consideration of the load balancing constraint. Then, using colored pheromones, ants are just seeking for communicating structures. The method operates on graphs which structural and numerical parameters may change dynamically during the execution.</abstract><qualityIndicators><score>5.51</score><pdfVersion>1.3</pdfVersion><pdfPageSize>430 x 660 pts</pdfPageSize><refBibsNative>false</refBibsNative><keywordCount>0</keywordCount><abstractCharCount>977</abstractCharCount><pdfWordCount>3770</pdfWordCount><pdfCharCount>20386</pdfCharCount><pdfPageCount>12</pdfPageCount><abstractWordCount>145</abstractWordCount></qualityIndicators><title>Dynamic Placement Using Ants for Object Based Simulations</title><chapterId><json:string>80</json:string><json:string>Chap80</json:string></chapterId><genre><json:string>conference</json:string></genre><serie><editor><json:item><name>Gerhard Goos</name><affiliations><json:string>Karlsruhe University, Germany</json:string></affiliations></json:item><json:item><name>Juris Hartmanis</name><affiliations><json:string>Cornell University, NY, USA</json:string></affiliations></json:item><json:item><name>Jan van Leeuwen</name><affiliations><json:string>Utrecht University, The Netherlands</json:string></affiliations></json:item></editor><issn><json:string>0302-9743</json:string></issn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>Lecture Notes in Computer Science</title><copyrightDate>2003</copyrightDate></serie><host><editor><json:item><name>Robert Meersman</name><affiliations><json:string>STARLab, Vrije Universiteit Brussel (VUB), Bldg G/10, Pleinlaan 2, 1050, Brussels, Belgium</json:string><json:string>E-mail: meersman@vub.ac.be</json:string></affiliations></json:item><json:item><name>Zahir Tari</name><affiliations><json:string>School of Computer Science and Information Technology, RMIT University, Bld 10.10, 376-392 Swanston Street, VIC 3001, Melbourne, Australia</json:string><json:string>E-mail: zahir.tari@rmit.edu.au</json:string></affiliations></json:item><json:item><name>Douglas C. Schmidt</name><affiliations><json:string>Department of Electrical Engineering and Computer Science, Vanderbilt University, TN 37203, Nashville, USA</json:string><json:string>E-mail: schmidt@dre.vanderbilt.edu</json:string></affiliations></json:item></editor><subject><json:item><value>Computer Science</value></json:item><json:item><value>Computer Science</value></json:item><json:item><value>Database Management</value></json:item><json:item><value>Computer Communication Networks</value></json:item><json:item><value>Software Engineering</value></json:item><json:item><value>Information Storage and Retrieval</value></json:item><json:item><value>Information Systems Applications (incl.Internet)</value></json:item><json:item><value>Business Information Systems</value></json:item></subject><isbn><json:string>978-3-540-20498-5</json:string></isbn><language><json:string>unknown</json:string></language><eissn><json:string>1611-3349</json:string></eissn><title>On The Move to Meaningful Internet Systems 2003: CoopIS, DOA, and ODBASE</title><bookId><json:string>978-3-540-39964-3</json:string></bookId><volume>2888</volume><pages><last>1274</last><first>1263</first></pages><issn><json:string>0302-9743</json:string></issn><genre><json:string>book-series</json:string></genre><eisbn><json:string>978-3-540-39964-3</json:string></eisbn><copyrightDate>2003</copyrightDate><doi><json:string>10.1007/b94348</json:string></doi></host><publicationDate>2003</publicationDate><copyrightDate>2003</copyrightDate><doi><json:string>10.1007/978-3-540-39964-3_80</json:string></doi><id>86F02A6F73616FBB8601044F1E6EEE3AE30DFF86</id><score>0.3474297</score><fulltext><json:item><original>true</original><mimetype>application/pdf</mimetype><extension>pdf</extension><uri>https://api.istex.fr/document/86F02A6F73616FBB8601044F1E6EEE3AE30DFF86/fulltext/pdf</uri></json:item><json:item><original>false</original><mimetype>application/zip</mimetype><extension>zip</extension><uri>https://api.istex.fr/document/86F02A6F73616FBB8601044F1E6EEE3AE30DFF86/fulltext/zip</uri></json:item><istex:fulltextTEI uri="https://api.istex.fr/document/86F02A6F73616FBB8601044F1E6EEE3AE30DFF86/fulltext/tei"><teiHeader><fileDesc><titleStmt><title level="a" type="main" xml:lang="en">Dynamic Placement Using Ants for Object Based Simulations</title><respStmt><resp>Références bibliographiques récupérées via GROBID</resp><name resp="ISTEX-API">ISTEX-API (INIST-CNRS)</name></respStmt></titleStmt><publicationStmt><authority>ISTEX</authority><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><availability><p>Springer-Verlag Berlin Heidelberg, 2003</p></availability><date>2003</date></publicationStmt><sourceDesc><biblStruct type="inbook"><analytic><title level="a" type="main" xml:lang="en">Dynamic Placement Using Ants for Object Based Simulations</title><author xml:id="author-1"><persName><forename type="first">Cyrille</forename><surname>Bertelle</surname></persName><affiliation>Laboratoire d’Informatique du Havre, Université du Havre, 25 rue Philippe Lebon, 76600, Le Havre</affiliation></author><author xml:id="author-2"><persName><forename type="first">Antoine</forename><surname>Dutot</surname></persName><email>Antoine.Dutot@univ-lehavre.fr</email><affiliation>Laboratoire d’Informatique du Havre, Université du Havre, 25 rue Philippe Lebon, 76600, Le Havre</affiliation></author><author xml:id="author-3"><persName><forename type="first">Frédéric</forename><surname>Guinand</surname></persName><affiliation>Laboratoire d’Informatique du Havre, Université du Havre, 25 rue Philippe Lebon, 76600, Le Havre</affiliation></author><author xml:id="author-4"><persName><forename type="first">Damien</forename><surname>Olivier</surname></persName><affiliation>Laboratoire d’Informatique du Havre, Université du Havre, 25 rue Philippe Lebon, 76600, Le Havre</affiliation></author></analytic><monogr><title level="m">On The Move to Meaningful Internet Systems 2003: CoopIS, DOA, and ODBASE</title><title level="m" type="sub">OTM Confederated International Conferences, CoopIS, DOA, and ODBASE 2003, Catania, Sicily, Italy, November 3-7, 2003. Proceedings</title><idno type="pISBN">978-3-540-20498-5</idno><idno type="eISBN">978-3-540-39964-3</idno><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="DOI">10.1007/b94348</idno><idno type="book-ID">978-3-540-39964-3</idno><idno type="book-title-ID">80684</idno><idno type="book-sequence-number">2888</idno><idno type="book-volume-number">2888</idno><idno type="book-chapter-count">95</idno><editor><persName><forename type="first">Robert</forename><surname>Meersman</surname></persName><email>meersman@vub.ac.be</email><affiliation>STARLab, Vrije Universiteit Brussel (VUB), Bldg G/10, Pleinlaan 2, 1050, Brussels, Belgium</affiliation></editor><editor><persName><forename type="first">Zahir</forename><surname>Tari</surname></persName><email>zahir.tari@rmit.edu.au</email><affiliation>School of Computer Science and Information Technology, RMIT University, Bld 10.10, 376-392 Swanston Street, VIC 3001, Melbourne, Australia</affiliation></editor><editor><persName><forename type="first">Douglas</forename><forename type="first">C.</forename><surname>Schmidt</surname></persName><email>schmidt@dre.vanderbilt.edu</email><affiliation>Department of Electrical Engineering and Computer Science, Vanderbilt University, TN 37203, Nashville, USA</affiliation></editor><imprint><publisher>Springer Berlin Heidelberg</publisher><pubPlace>Berlin, Heidelberg</pubPlace><date type="published" when="2003"></date><biblScope unit="volume">2888</biblScope><biblScope unit="page" from="1263">1263</biblScope><biblScope unit="page" to="1274">1274</biblScope></imprint></monogr><series><title level="s">Lecture Notes in Computer Science</title><editor><persName><forename type="first">Gerhard</forename><surname>Goos</surname></persName><affiliation>Karlsruhe University, Germany</affiliation></editor><editor><persName><forename type="first">Juris</forename><surname>Hartmanis</surname></persName><affiliation>Cornell University, NY, USA</affiliation></editor><editor><persName><forename type="first">Jan</forename><surname>van Leeuwen</surname></persName><affiliation>Utrecht University, The Netherlands</affiliation></editor><biblScope><date>2003</date></biblScope><idno type="pISSN">0302-9743</idno><idno type="eISSN">1611-3349</idno><idno type="series-Id">558</idno></series><idno type="istex">86F02A6F73616FBB8601044F1E6EEE3AE30DFF86</idno><idno type="DOI">10.1007/978-3-540-39964-3_80</idno><idno type="ChapterID">80</idno><idno type="ChapterID">Chap80</idno></biblStruct></sourceDesc></fileDesc><profileDesc><creation><date>2003</date></creation><langUsage><language ident="en">en</language></langUsage><abstract xml:lang="en"><p>Abstract: A distributed application may be considered as a set of interacting entities continuously evolving. Such application can be modeled as a graph with one-to-one mappings between vertices and entities and between edges and communications. Performances depend directly on a good load balancing of the entities between available computing devices and on the minimization of the impact of the communications between them. However, both objectives are contradictory and good performances are achieved if and only if a good tradeoff is found. Our method for finding such a tradeoff is new and based on colored ant colonies. Each computing resource is associated to one ant colony characterized by a color, allowing an implicit consideration of the load balancing constraint. Then, using colored pheromones, ants are just seeking for communicating structures. The method operates on graphs which structural and numerical parameters may change dynamically during the execution.</p></abstract><textClass><keywords scheme="Book-Subject-Collection"><list><label>SUCO11645</label><item><term>Computer Science</term></item></list></keywords></textClass><textClass><keywords scheme="Book-Subject-Group"><list><label>I</label><label>I18024</label><label>I13022</label><label>I14029</label><label>I18032</label><label>I18040</label><label>W26007</label><item><term>Computer Science</term></item><item><term>Database Management</term></item><item><term>Computer Communication Networks</term></item><item><term>Software Engineering</term></item><item><term>Information Storage and Retrieval</term></item><item><term>Information Systems Applications (incl.Internet)</term></item><item><term>Business Information Systems</term></item></list></keywords></textClass></profileDesc><revisionDesc><change when="2003">Published</change><change xml:id="refBibs-istex" who="#ISTEX-API" when="2016-09-22">References added</change></revisionDesc></teiHeader></istex:fulltextTEI><json:item><original>false</original><mimetype>text/plain</mimetype><extension>txt</extension><uri>https://api.istex.fr/document/86F02A6F73616FBB8601044F1E6EEE3AE30DFF86/fulltext/txt</uri></json:item></fulltext><metadata><istex:metadataXml wicri:clean="Springer, Publisher found" wicri:toSee="no header"><istex:xmlDeclaration>version="1.0" encoding="UTF-8"</istex:xmlDeclaration><istex:docType PUBLIC="-//Springer-Verlag//DTD A++ V2.4//EN" URI="http://devel.springer.de/A++/V2.4/DTD/A++V2.4.dtd" name="istex:docType"></istex:docType><istex:document><Publisher><PublisherInfo><PublisherName>Springer Berlin Heidelberg</PublisherName><PublisherLocation>Berlin, Heidelberg</PublisherLocation></PublisherInfo><Series><SeriesInfo SeriesType="Series" TocLevels="0"><SeriesID>558</SeriesID><SeriesPrintISSN>0302-9743</SeriesPrintISSN><SeriesElectronicISSN>1611-3349</SeriesElectronicISSN><SeriesTitle Language="En">Lecture Notes in Computer Science</SeriesTitle></SeriesInfo><SeriesHeader><EditorGroup><Editor AffiliationIDS="Aff1"><EditorName DisplayOrder="Western"><GivenName>Gerhard</GivenName><FamilyName>Goos</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff2"><EditorName DisplayOrder="Western"><GivenName>Juris</GivenName><FamilyName>Hartmanis</FamilyName></EditorName></Editor><Editor AffiliationIDS="Aff3"><EditorName DisplayOrder="Western"><GivenName>Jan</GivenName><Particle>van</Particle><FamilyName>Leeuwen</FamilyName></EditorName></Editor><Affiliation ID="Aff1"><OrgName>Karlsruhe University</OrgName><OrgAddress><Country>Germany</Country></OrgAddress></Affiliation><Affiliation ID="Aff2"><OrgName>Cornell University</OrgName><OrgAddress><State>NY</State><Country>USA</Country></OrgAddress></Affiliation><Affiliation ID="Aff3"><OrgName>Utrecht University</OrgName><OrgAddress><Country>The Netherlands</Country></OrgAddress></Affiliation></EditorGroup></SeriesHeader><Book Language="En"><BookInfo BookProductType="Proceedings" ContainsESM="No" Language="En" MediaType="eBook" NumberingDepth="2" NumberingStyle="ContentOnly" OutputMedium="All" TocLevels="0"><BookID>978-3-540-39964-3</BookID><BookTitle>On The Move to Meaningful Internet Systems 2003: CoopIS, DOA, and ODBASE</BookTitle><BookSubTitle>OTM Confederated International Conferences, CoopIS, DOA, and ODBASE 2003, Catania, Sicily, Italy, November 3-7, 2003. Proceedings</BookSubTitle><BookVolumeNumber>2888</BookVolumeNumber><BookSequenceNumber>2888</BookSequenceNumber><BookDOI>10.1007/b94348</BookDOI><BookTitleID>80684</BookTitleID><BookPrintISBN>978-3-540-20498-5</BookPrintISBN><BookElectronicISBN>978-3-540-39964-3</BookElectronicISBN><BookChapterCount>95</BookChapterCount><BookCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2003</CopyrightYear></BookCopyright><BookSubjectGroup><BookSubject Code="I" Type="Primary">Computer Science</BookSubject><BookSubject Code="I18024" Priority="1" Type="Secondary">Database Management</BookSubject><BookSubject Code="I13022" Priority="2" Type="Secondary">Computer Communication Networks</BookSubject><BookSubject Code="I14029" Priority="3" Type="Secondary">Software Engineering</BookSubject><BookSubject Code="I18032" Priority="4" Type="Secondary">Information Storage and Retrieval</BookSubject><BookSubject Code="I18040" Priority="5" Type="Secondary">Information Systems Applications (incl.Internet)</BookSubject><BookSubject Code="W26007" Priority="6" Type="Secondary">Business Information Systems</BookSubject><SubjectCollection Code="SUCO11645">Computer Science</SubjectCollection></BookSubjectGroup><BookContext><SeriesID>558</SeriesID></BookContext></BookInfo><BookHeader><EditorGroup><Editor AffiliationIDS="Aff4"><EditorName DisplayOrder="Western"><GivenName>Robert</GivenName><FamilyName>Meersman</FamilyName></EditorName><Contact><Email>meersman@vub.ac.be</Email></Contact></Editor><Editor AffiliationIDS="Aff5"><EditorName DisplayOrder="Western"><GivenName>Zahir</GivenName><FamilyName>Tari</FamilyName></EditorName><Contact><Email>zahir.tari@rmit.edu.au</Email></Contact></Editor><Editor AffiliationIDS="Aff6"><EditorName DisplayOrder="Western"><GivenName>Douglas</GivenName><GivenName>C.</GivenName><FamilyName>Schmidt</FamilyName></EditorName><Contact><Email>schmidt@dre.vanderbilt.edu</Email></Contact></Editor><Affiliation ID="Aff4"><OrgDivision>STARLab</OrgDivision><OrgName>Vrije Universiteit Brussel (VUB)</OrgName><OrgAddress><Street>Bldg G/10, Pleinlaan 2</Street><Postcode>1050</Postcode><City>Brussels</City><Country>Belgium</Country></OrgAddress></Affiliation><Affiliation ID="Aff5"><OrgDivision>School of Computer Science and Information Technology</OrgDivision><OrgName>RMIT University</OrgName><OrgAddress><Street>Bld 10.10, 376-392 Swanston Street</Street><Postcode>VIC 3001</Postcode><City>Melbourne</City><Country>Australia</Country></OrgAddress></Affiliation><Affiliation ID="Aff6"><OrgDivision>Department of Electrical Engineering and Computer Science</OrgDivision><OrgName>Vanderbilt University</OrgName><OrgAddress><Postcode>TN 37203</Postcode><City>Nashville</City><Country>USA</Country></OrgAddress></Affiliation></EditorGroup></BookHeader><Part ID="Part3"><PartInfo TocLevels="0"><PartID>3</PartID><PartSequenceNumber>3</PartSequenceNumber><PartTitle>Distributed Objects and Applications (DOA) 2003 International Conference</PartTitle><PartChapterCount>30</PartChapterCount><PartContext><SeriesID>558</SeriesID><BookTitle>On The Move to Meaningful Internet Systems 2003: CoopIS, DOA, and ODBASE</BookTitle></PartContext></PartInfo><SubPart ID="SubPart22"><SubPartInfo><SubPartID>22</SubPartID><SubPartSequenceNumber>22</SubPartSequenceNumber><SubPartTitle>Adaptibility and Mobility</SubPartTitle><SubPartChapterCount>8</SubPartChapterCount></SubPartInfo><Chapter ID="Chap80" Language="En"><ChapterInfo ChapterType="OriginalPaper" ContainsESM="No" NumberingDepth="2" NumberingStyle="ContentOnly" TocLevels="0"><ChapterID>80</ChapterID><ChapterDOI>10.1007/978-3-540-39964-3_80</ChapterDOI><ChapterSequenceNumber>80</ChapterSequenceNumber><ChapterTitle Language="En">Dynamic Placement Using Ants for Object Based Simulations</ChapterTitle><ChapterFirstPage>1263</ChapterFirstPage><ChapterLastPage>1274</ChapterLastPage><ChapterCopyright><CopyrightHolderName>Springer-Verlag Berlin Heidelberg</CopyrightHolderName><CopyrightYear>2003</CopyrightYear></ChapterCopyright><ChapterGrants Type="Regular"><MetadataGrant Grant="OpenAccess"></MetadataGrant><AbstractGrant Grant="OpenAccess"></AbstractGrant><BodyPDFGrant Grant="Restricted"></BodyPDFGrant><BodyHTMLGrant Grant="Restricted"></BodyHTMLGrant><BibliographyGrant Grant="Restricted"></BibliographyGrant><ESMGrant Grant="Restricted"></ESMGrant></ChapterGrants><ChapterContext><SeriesID>558</SeriesID><PartID>3</PartID><BookID>978-3-540-39964-3</BookID><BookTitle>On The Move to Meaningful Internet Systems 2003: CoopIS, DOA, and ODBASE</BookTitle></ChapterContext></ChapterInfo><ChapterHeader><AuthorGroup><Author AffiliationIDS="Aff7"><AuthorName DisplayOrder="Western"><GivenName>Cyrille</GivenName><FamilyName>Bertelle</FamilyName></AuthorName></Author><Author AffiliationIDS="Aff7"><AuthorName DisplayOrder="Western"><GivenName>Antoine</GivenName><FamilyName>Dutot</FamilyName></AuthorName><Contact><Email>Antoine.Dutot@univ-lehavre.fr</Email></Contact></Author><Author AffiliationIDS="Aff7"><AuthorName DisplayOrder="Western"><GivenName>Frédéric</GivenName><FamilyName>Guinand</FamilyName></AuthorName></Author><Author AffiliationIDS="Aff7"><AuthorName DisplayOrder="Western"><GivenName>Damien</GivenName><FamilyName>Olivier</FamilyName></AuthorName></Author><Affiliation ID="Aff7"><OrgDivision>Laboratoire d’Informatique du Havre</OrgDivision><OrgName>Université du Havre</OrgName><OrgAddress><Street>25 rue Philippe Lebon</Street><Postcode>76600</Postcode><City>Le Havre</City></OrgAddress></Affiliation></AuthorGroup><Abstract ID="Abs1" Language="En"><Heading>Abstract</Heading><Para>A distributed application may be considered as a set of interacting entities continuously evolving. Such application can be modeled as a graph with one-to-one mappings between vertices and entities and between edges and communications. Performances depend directly on a good load balancing of the entities between available computing devices and on the minimization of the impact of the communications between them. However, both objectives are contradictory and good performances are achieved if and only if a good tradeoff is found. Our method for finding such a tradeoff is new and based on colored ant colonies. Each computing resource is associated to one ant colony characterized by a color, allowing an implicit consideration of the load balancing constraint. Then, using colored pheromones, ants are just seeking for communicating structures. The method operates on graphs which structural and numerical parameters may change dynamically during the execution.</Para></Abstract><KeywordGroup Language="En"><Heading>Keywords</Heading><Keyword>Ant algorithms</Keyword><Keyword>dynamic graph</Keyword><Keyword>clustering</Keyword><Keyword>auto-organization</Keyword><Keyword>distributed applications</Keyword></KeywordGroup></ChapterHeader><NoBody></NoBody></Chapter></SubPart></Part></Book></Series></Publisher></istex:document></istex:metadataXml><mods version="3.6"><titleInfo lang="en"><title>Dynamic Placement Using Ants for Object Based Simulations</title></titleInfo><titleInfo type="alternative" contentType="CDATA" lang="en"><title>Dynamic Placement Using Ants for Object Based Simulations</title></titleInfo><name type="personal"><namePart type="given">Cyrille</namePart><namePart type="family">Bertelle</namePart><affiliation>Laboratoire d’Informatique du Havre, Université du Havre, 25 rue Philippe Lebon, 76600, Le Havre</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Antoine</namePart><namePart type="family">Dutot</namePart><affiliation>Laboratoire d’Informatique du Havre, Université du Havre, 25 rue Philippe Lebon, 76600, Le Havre</affiliation><affiliation>E-mail: Antoine.Dutot@univ-lehavre.fr</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Frédéric</namePart><namePart type="family">Guinand</namePart><affiliation>Laboratoire d’Informatique du Havre, Université du Havre, 25 rue Philippe Lebon, 76600, Le Havre</affiliation><role><roleTerm type="text">author</roleTerm></role></name><name type="personal"><namePart type="given">Damien</namePart><namePart type="family">Olivier</namePart><affiliation>Laboratoire d’Informatique du Havre, Université du Havre, 25 rue Philippe Lebon, 76600, Le Havre</affiliation><role><roleTerm type="text">author</roleTerm></role></name><typeOfResource>text</typeOfResource><genre type="conference" displayLabel="proceedings"></genre><originInfo><publisher>Springer Berlin Heidelberg</publisher><place><placeTerm type="text">Berlin, Heidelberg</placeTerm></place><dateIssued encoding="w3cdtf">2003</dateIssued><copyrightDate encoding="w3cdtf">2003</copyrightDate></originInfo><language><languageTerm type="code" authority="rfc3066">en</languageTerm><languageTerm type="code" authority="iso639-2b">eng</languageTerm></language><physicalDescription><internetMediaType>text/html</internetMediaType></physicalDescription><abstract lang="en">Abstract: A distributed application may be considered as a set of interacting entities continuously evolving. Such application can be modeled as a graph with one-to-one mappings between vertices and entities and between edges and communications. Performances depend directly on a good load balancing of the entities between available computing devices and on the minimization of the impact of the communications between them. However, both objectives are contradictory and good performances are achieved if and only if a good tradeoff is found. Our method for finding such a tradeoff is new and based on colored ant colonies. Each computing resource is associated to one ant colony characterized by a color, allowing an implicit consideration of the load balancing constraint. Then, using colored pheromones, ants are just seeking for communicating structures. The method operates on graphs which structural and numerical parameters may change dynamically during the execution.</abstract><relatedItem type="host"><titleInfo><title>On The Move to Meaningful Internet Systems 2003: CoopIS, DOA, and ODBASE</title><subTitle>OTM Confederated International Conferences, CoopIS, DOA, and ODBASE 2003, Catania, Sicily, Italy, November 3-7, 2003. Proceedings</subTitle></titleInfo><name type="personal"><namePart type="given">Robert</namePart><namePart type="family">Meersman</namePart><affiliation>STARLab, Vrije Universiteit Brussel (VUB), Bldg G/10, Pleinlaan 2, 1050, Brussels, Belgium</affiliation><affiliation>E-mail: meersman@vub.ac.be</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Zahir</namePart><namePart type="family">Tari</namePart><affiliation>School of Computer Science and Information Technology, RMIT University, Bld 10.10, 376-392 Swanston Street, VIC 3001, Melbourne, Australia</affiliation><affiliation>E-mail: zahir.tari@rmit.edu.au</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Douglas</namePart><namePart type="given">C.</namePart><namePart type="family">Schmidt</namePart><affiliation>Department of Electrical Engineering and Computer Science, Vanderbilt University, TN 37203, Nashville, USA</affiliation><affiliation>E-mail: schmidt@dre.vanderbilt.edu</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><genre type="book-series" displayLabel="Proceedings"></genre><originInfo><copyrightDate encoding="w3cdtf">2003</copyrightDate><issuance>monographic</issuance></originInfo><subject><genre>Book-Subject-Collection</genre><topic authority="SpringerSubjectCodes" authorityURI="SUCO11645">Computer Science</topic></subject><subject><genre>Book-Subject-Group</genre><topic authority="SpringerSubjectCodes" authorityURI="I">Computer Science</topic><topic authority="SpringerSubjectCodes" authorityURI="I18024">Database Management</topic><topic authority="SpringerSubjectCodes" authorityURI="I13022">Computer Communication Networks</topic><topic authority="SpringerSubjectCodes" authorityURI="I14029">Software Engineering</topic><topic authority="SpringerSubjectCodes" authorityURI="I18032">Information Storage and Retrieval</topic><topic authority="SpringerSubjectCodes" authorityURI="I18040">Information Systems Applications (incl.Internet)</topic><topic authority="SpringerSubjectCodes" authorityURI="W26007">Business Information Systems</topic></subject><identifier type="DOI">10.1007/b94348</identifier><identifier type="ISBN">978-3-540-20498-5</identifier><identifier type="eISBN">978-3-540-39964-3</identifier><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="BookTitleID">80684</identifier><identifier type="BookID">978-3-540-39964-3</identifier><identifier type="BookChapterCount">95</identifier><identifier type="BookVolumeNumber">2888</identifier><identifier type="BookSequenceNumber">2888</identifier><identifier type="PartChapterCount">30</identifier><part><date>2003</date><detail type="part"><title>Distributed Objects and Applications (DOA) 2003 International Conference</title></detail><detail type="volume"><number>2888</number><caption>vol.</caption></detail><extent unit="pages"><start>1263</start><end>1274</end></extent></part><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2003</recordOrigin></recordInfo></relatedItem><relatedItem type="series"><titleInfo><title>Lecture Notes in Computer Science</title></titleInfo><name type="personal"><namePart type="given">Gerhard</namePart><namePart type="family">Goos</namePart><affiliation>Karlsruhe University, Germany</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Juris</namePart><namePart type="family">Hartmanis</namePart><affiliation>Cornell University, NY, USA</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><name type="personal"><namePart type="given">Jan</namePart><namePart type="family">van Leeuwen</namePart><affiliation>Utrecht University, The Netherlands</affiliation><role><roleTerm type="text">editor</roleTerm></role></name><originInfo><copyrightDate encoding="w3cdtf">2003</copyrightDate><issuance>serial</issuance></originInfo><identifier type="ISSN">0302-9743</identifier><identifier type="eISSN">1611-3349</identifier><identifier type="SeriesID">558</identifier><recordInfo><recordOrigin>Springer-Verlag Berlin Heidelberg, 2003</recordOrigin></recordInfo></relatedItem><identifier type="istex">86F02A6F73616FBB8601044F1E6EEE3AE30DFF86</identifier><identifier type="DOI">10.1007/978-3-540-39964-3_80</identifier><identifier type="ChapterID">80</identifier><identifier type="ChapterID">Chap80</identifier><accessCondition type="use and reproduction" contentType="copyright">Springer-Verlag Berlin Heidelberg, 2003</accessCondition><recordInfo><recordContentSource>SPRINGER</recordContentSource><recordOrigin>Springer-Verlag Berlin Heidelberg, 2003</recordOrigin></recordInfo></mods></metadata><enrichments><json:item><type>multicat</type><uri>https://api.istex.fr/document/86F02A6F73616FBB8601044F1E6EEE3AE30DFF86/enrichments/multicat</uri></json:item><istex:refBibTEI uri="https://api.istex.fr/document/86F02A6F73616FBB8601044F1E6EEE3AE30DFF86/enrichments/refBib"><teiHeader></teiHeader><text><front></front><body></body><back><listBibl><biblStruct xml:id="b0"><analytic><title level="a" type="main">Dimants: a distributed multi-castes ant system for dna sequencing by hybridization</title><author><persName><forename type="first">C</forename><surname>Bertelle</surname></persName></author><author><persName><forename type="first">A</forename><surname>Dutot</surname></persName></author><author><persName><forename type="first">F</forename><surname>Guinand</surname></persName></author><author><persName><forename type="first">D</forename><surname>Olivier</surname></persName></author></analytic><monogr><title level="m">NETTAB 2002 AAMAS 2002 Conf</title><meeting><address><addrLine>Bologna (Italy</addrLine></address></meeting><imprint><date type="published" when="2002-07-15"></date><biblScope unit="page" from="1" to="7"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b1"><analytic><title level="a" type="main">Distributed multi-agents systems used for dynamic aquatic simulations</title><author><persName><forename type="first">C</forename><surname>Bertelle</surname></persName></author><author><persName><forename type="first">V</forename><surname>Jay</surname></persName></author><author><persName><forename type="first">D</forename><surname>Olivier</surname></persName></author></analytic><monogr><title level="j">Congress</title><editor>D.P.F. M ller</editor><imprint><biblScope unit="page" from="504" to="508"></biblScope><date type="published" when="2000-09"></date></imprint></monogr></biblStruct><biblStruct xml:id="b2"><monogr><title level="m" type="main">Antnet: A mobile agents approach to adaptive routing</title><author><persName><forename type="first">G</forename></persName></author><author><persName><forename type="first">Di</forename><surname>Caro</surname></persName></author><author><persName><forename type="first">M</forename><surname>Dorigo</surname></persName></author><imprint><date type="published" when="1997"></date></imprint></monogr></biblStruct><biblStruct xml:id="b3"><analytic><title level="a" type="main">Ant can colour graphs</title><author><persName><forename type="first">D</forename><surname>Costa</surname></persName></author><author><persName><forename type="first">A</forename><surname>Hertz</surname></persName></author></analytic><monogr><title level="j">Journal of Operation Research Society</title><imprint><biblScope unit="issue">48</biblScope><biblScope unit="page" from="105" to="128"></biblScope><date type="published" when="1997"></date></imprint></monogr></biblStruct><biblStruct xml:id="b4"><analytic><title level="a" type="main">Ant colony system: A cooperative learning approach to the traveling salesman problem</title><author><persName><forename type="first">M</forename><surname>Dorigo</surname></persName></author><author><persName><forename type="first">L</forename><forename type="middle">M</forename><surname>Gambardella</surname></persName></author></analytic><monogr><title level="j">IEEE Transactions on Evolutionary Computation</title><imprint><biblScope unit="volume">1</biblScope><biblScope unit="issue">1</biblScope><biblScope unit="page" from="53" to="66"></biblScope><date type="published" when="1997"></date></imprint></monogr></biblStruct><biblStruct xml:id="b5"><analytic><title level="a" type="main">The ant system: optimization by a colony of cooperating agents</title><author><persName><forename type="first">M</forename><surname>Dorigo</surname></persName></author><author><persName><forename type="first">V</forename><surname>Maniezzo</surname></persName></author><author><persName><forename type="first">A</forename><surname>Colorni</surname></persName></author></analytic><monogr><title level="j">IEEE Trans. Systems Man Cybernet</title><imprint><biblScope unit="volume">26</biblScope><biblScope unit="page" from="29" to="41"></biblScope><date type="published" when="1996"></date></imprint></monogr></biblStruct><biblStruct xml:id="b6"><analytic><title level="a" type="main">Diversity and adaptation in populations of clustering ants</title><author><persName><forename type="first">B</forename><surname>Faieta</surname></persName></author><author><persName><forename type="first">E</forename><surname>Lumer</surname></persName></author></analytic><monogr><title level="m">Conference on Simulation of Adaptive Behaviour</title><meeting><address><addrLine>Brighton</addrLine></address></meeting><imprint><date type="published" when="1994"></date></imprint></monogr></biblStruct><biblStruct xml:id="b7"><analytic><title level="a" type="main">The expandable network of ant exploration</title><author><persName><forename type="first">D</forename><forename type="middle">M</forename><surname>Gordon</surname></persName></author></analytic><monogr><title level="j">Animal Behaviour</title><imprint><biblScope unit="volume">50</biblScope><biblScope unit="page" from="995" to="1007"></biblScope><date type="published" when="1995"></date></imprint></monogr></biblStruct><biblStruct xml:id="b8"><analytic><title level="a" type="main">A colony of ant-like agents for partitioning in vlsi technology</title><author><persName><forename type="first">P</forename><surname>Kuntz</surname></persName></author><author><persName><forename type="first">P</forename><surname>Layzell</surname></persName></author><author><persName><forename type="first">D</forename><surname>Snyers</surname></persName></author></analytic><monogr><title level="m">Fourth European Conference on Artificial Life</title><meeting><address><addrLine>Cambridge, MA</addrLine></address></meeting><imprint><publisher>MIT Press</publisher><date type="published" when="1997"></date><biblScope unit="page" from="417" to="424"></biblScope></imprint></monogr></biblStruct><biblStruct xml:id="b9"><monogr><title level="m" type="main">Artificial Life</title><editor>C.G. Langton</editor><imprint><date type="published" when="1987"></date><publisher>Addison Wesley</publisher></imprint></monogr></biblStruct><biblStruct xml:id="b10"><monogr><title level="m" type="main">Routing with swarm intelligence</title><author><persName><forename type="first">T</forename><surname>White</surname></persName></author><imprint><date type="published" when="1997"></date></imprint></monogr></biblStruct></listBibl></back></text></istex:refBibTEI><json:item><type>refBibs</type><uri>https://api.istex.fr/document/86F02A6F73616FBB8601044F1E6EEE3AE30DFF86/enrichments/refBibs</uri></json:item></enrichments></istex></record>Pour manipuler ce document sous Unix (Dilib)
EXPLOR_STEP=$WICRI_ROOT/Wicri/France/explor/LeHavreV1/Data/Istex/Corpus
HfdSelect -h $EXPLOR_STEP/biblio.hfd -nk 000534 | SxmlIndent | more
Ou
HfdSelect -h $EXPLOR_AREA/Data/Istex/Corpus/biblio.hfd -nk 000534 | SxmlIndent | more
Pour mettre un lien sur cette page dans le réseau Wicri
{{Explor lien
|wiki= Wicri/France
|area= LeHavreV1
|flux= Istex
|étape= Corpus
|type= RBID
|clé= ISTEX:86F02A6F73616FBB8601044F1E6EEE3AE30DFF86
|texte= Dynamic Placement Using Ants for Object Based Simulations
}}
| This area was generated with Dilib version V0.6.25. |  |