eprintid: 278
rev_number: 9
eprint_status: archive
userid: 7
dir: disk0/00/00/02/78
datestamp: 2010-02-16 16:10:24
lastmod: 2015-05-29 19:53:53
status_changed: 2010-02-16 16:10:24
type: report
metadata_visibility: show
item_issues_count: 0
creators_name: Kilby, Philip
creators_name: Lun, Desmond
creators_name: Nguyen, Giang
corp_creators: Farzad Safaei
title: Multipoint-to-multipoint network communication
ispublished: pub
subjects: telecom
studygroups: misg26
companyname: ICT Research Institute
full_text_status: public
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.

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.
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.
date: 2009
citation:   Kilby, Philip and Lun, Desmond and Nguyen, Giang  (2009) Multipoint-to-multipoint network communication.  [Study Group Report]     
document_url: http://miis.maths.ox.ac.uk/miis/278/1/ictrmisg2009.pdf