<mets:mets OBJID="oai:generic.eprints.org:278" LABEL="Eprints Item" xsi:schemaLocation="http://www.loc.gov/METS/ http://www.loc.gov/standards/mets/mets.xsd http://www.loc.gov/mods/v3 http://www.loc.gov/standards/mods/v3/mods-3-0.xsd" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xmlns:mods="http://www.loc.gov/mods/v3" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mets="http://www.loc.gov/METS/"><mets:metsHdr CREATEDATA="2012-02-09T06:00:17Z"><mets:agent TYPE="ORGANIZATION" ROLE="CUSTODIAN"><mets:name>The MIIS Eprints Archive</mets:name></mets:agent></mets:metsHdr><mets:dmdSec ID="DMD_oai:generic.eprints.org:278_mods"><mets:mdWrap MDTYPE="mods"><mets:xmlData><mods:titleInfo><mods:title>Multipoint-to-multipoint network communication</mods:title></mods:titleInfo><mods:name type="personal"><mods:namePart type="given">Philip</mods:namePart><mods:namePart type="family">Kilby</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:name type="personal"><mods:namePart type="given">Desmond</mods:namePart><mods:namePart type="family">Lun</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:name type="personal"><mods:namePart type="given">Giang</mods:namePart><mods:namePart type="family">Nguyen</mods:namePart><mods:role><mods:roleTerm type="text">author</mods:roleTerm></mods:role></mods:name><mods:abstract>We have formulated an exact ILP model for the problem of communicating on a virtual network. While this ILP model was successful in solving small problems, it is not recommended to handle larger instances, due to the fact that the number of variables in the model grows exponentially as the graph size grows. However, this ILP model can provide a benchmark for heuristic algorithms developed for this problem.&#13;
&#13;
We have also described a heuristic approach, and explored several variants of the algorithm. We found a solution that seems to perform well with reasonable computation time. The heuristic is able to find solutions that respect the degree constraints, but show a small number of violations of the desired time constraints.&#13;
Tests on small problems show that heuristic is not always able to find feasible solutions, even though the exact method has shown they exist. It would be interesting in the future to look at whether insights gained by looking at exact solutions can be used to improve the heuristic.</mods:abstract><mods:classification authority="lcc">Information and communication technology</mods:classification><mods:originInfo><mods:dateIssued encoding="iso8061">2009</mods:dateIssued></mods:originInfo><mods:genre>Study Group Report</mods:genre></mets:xmlData></mets:mdWrap></mets:dmdSec><mets:amdSec ID="TMD_oai:generic.eprints.org:278"><mets:rightsMD ID="rights_oai:generic.eprints.org:278_mods"><mets:mdWrap MDTYPE="mods"><mets:xmlData><mods:useAndReproduction>
<p xmlns="http://www.w3.org/1999/xhtml"><strong>For work being deposited by its own author:</strong> 
In self-archiving this collection of files and associated bibliographic 
metadata, I grant The MIIS Eprints Archive the right to store 
them and to make them permanently available publicly for free on-line. 
I declare that this material is my own intellectual property and I 
understand that The MIIS Eprints Archive does not assume any 
responsibility if there is any breach of copyright in distributing these 
files or metadata. (All authors are urged to prominently assert their 
copyright on the title page of their work.)</p>

<p xmlns="http://www.w3.org/1999/xhtml"><strong>For work being deposited by someone other than its 
author:</strong> I hereby declare that the collection of files and 
associated bibliographic metadata that I am archiving at 
The MIIS Eprints Archive) is in the public domain. If this is 
not the case, I accept full responsibility for any breach of copyright 
that distributing these files or metadata may entail.</p>

<p xmlns="http://www.w3.org/1999/xhtml">Clicking on the deposit button indicates your agreement to these 
terms.</p>
    </mods:useAndReproduction></mets:xmlData></mets:mdWrap></mets:rightsMD></mets:amdSec><mets:fileSec><mets:fileGrp USE="reference"><mets:file SIZE="288130" ID="oai:generic.eprints.org:278_277_1" MIMETYPE="application/octet-stream" OWNERID="http://www.maths-in-industry.org/miis/278/1/ictrmisg2009.pdf"><mets:FLocat LOCTYPE="URL" xlink:href="http://www.maths-in-industry.org/miis/278/1/ictrmisg2009.pdf" xlink:type="simple"></mets:FLocat></mets:file></mets:fileGrp></mets:fileSec><mets:structMap><mets:div DMDID="DMD_oai:generic.eprints.org:278_mods" AMDID="TMD_oai:generic.eprints.org:278"><mets:fptr FILEID="oai:generic.eprints.org:278_277_1"></mets:fptr></mets:div></mets:structMap></mets:mets>
