Location of Repository

Multipoint-to-multipoint network communication

By Philip Kilby, Desmond Lun and Giang Nguyen

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.\ud \ud 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.\ud 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

Topics: Information and communication technology
Year: 2009
OAI identifier: oai:generic.eprints.org:278/core70

Suggested articles

Preview

Citations

  1. (2007). An approach to achieve scalability through a structured peer-to-peer network for massively multiplayer online role playing games, doi
  2. (1995). Artificial Intelligence: A Modern Approach, doi
  3. (2001). Comparison of algorithms for the degree constrained minimum spanning tree,
  4. (1979). Computers and Intractability: A Guide to the Theory of NP-Completeness, doi
  5. (1989). Introduction to Algorithms, doi
  6. (2005). Latency and scalability: A survey of issues and techinques for supporting networked games,
  7. (1999). Nonlinear Programming, Athena Scientific,
  8. (1985). The Traveling Salesman Problem: A Guided Tour of Combinatorial Optimization, doi

To submit an update or takedown request for this paper, please submit an Update/Correction/Removal Request.