Delay-Constrained Multi-Ring Construction for Ordered Multipoint-to-Multipoint Communications

  • Yassine Boujelben
  • André Girard
  • Jean-Charles Gregoire
Part of the Operations Research/Computer Science Interfaces Series book series (ORCS, volume 23)

Abstract

We describe a hierarchical topology for connecting users in large scale, Internet-based multipoint-to-multipoint applications. The multicast group is partitioned into sub-groups. Users who need to quickly transmit a lot of information to each other are gathered in the same sub-group which is connected by a sub-ring. All sub-rings are interconnected by a backbone ring. This two-level topology forms a multi-ring. We formulate an optimization problem to determine the topology that maximizes the bandwidth on the backbone, subject to delay constraints. We propose a heuristic to solve this problem and we show by simulation the good performance of our approximations. We show also that our heuristic is very promising in terms of computing time and backbone stability.

Keywords

Traffic Load Ring Topology Subgradient Method Backbone Ring Multicast Service 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Keywords

  1. Network design, multipoint-to-multipoint applications, multi-ring, delay bounds, Lagrangean decomposition.Google Scholar
  2. ReferencesGoogle Scholar
  3. [1]
    W. Aiello, S. N. Bhatt, F. R.K. Chung, A. L. Rosenberg, and R. K. Sitaraman. Augmented ring networks. IEEE trans, on Parallel and Distributed Systems, 12(6):598–609, June 2001.CrossRefGoogle Scholar
  4. [2]
    M. Biadi and Y. Ofek. Ring versus tree embedding for real-time group multicast. In Proc. IEEE 1NEOCOM’99, pages 1099–1106, 1999.Google Scholar
  5. [3]
    G. Carpaneto, M. Dell-Amico, and P. Toth. Algorithm 750: CDT: A Subroutine for the exact solution of large-scale, Asymmetric Travelling Salesman Problems. ACM Transactions on Mathematical Software, 21(4):410–415, December 1995.CrossRefGoogle Scholar
  6. [4]
    G. Carpaneto, M. Dell-Amico, and P. Toth. Exact solution of large-scale, Asymmetric Travelling Salesman Problems. ACM Transactions on Mathematical Software, 21 (4):394–409, December 1995.CrossRefGoogle Scholar
  7. [5]
    Y. Chu, S. G. Rao, and H. Zhang. A case for end system multicast. In Proceedings of ACM SIGMETRICS, Santa Clara,CA, pages 1–12, June 2000.Google Scholar
  8. [6]
    S. Deering. Host extensions for IP multicasting. RFC 1112, August 1989.Google Scholar
  9. [7]
    C. Diot, B. Levine, B. Lyles, H. Kassem, and D. Balsiefen. Deployment issues for the IP multicast service and architecture. IEEE Network, January 2000.Google Scholar
  10. [8]
    E. Koutsofios and S. C. North. Drawing graphs with dot. Technical report, August 1993.Google Scholar
  11. [9]
    B. N. Levine, J. Crowcroft, C. Diot, J.J. Garcia-Luna-Aceves, and J. F. Kurose. Consideration of receiver interest for IP multicast delivery. In Proc. IEEE INFOCOM’2000, pages 470–479, April 2000.Google Scholar
  12. [10]
    B. Quinn and K. Almeroth. IP Multicast applications: Challenges and solutions. RFC 3170, September 2001.Google Scholar
  13. [11]
    T. Wong, R. H. Katz, and S. McCanne. An evaluation on using preference clustering in large-scale multicast applications. In Proc. IEEE INFOCOM’2000, pages 451–460, April 2000.Google Scholar
  14. [12]
    B. Yener, S. Chen, and O. Günlük. Optimal packing of group multicastings. In Proc. IEEEINFOCOM’98, San Francisco, CA, April 1998.Google Scholar

Copyright information

© Springer Science+Business Media New York 2003

Authors and Affiliations

  • Yassine Boujelben
    • 1
  • André Girard
    • 1
  • Jean-Charles Gregoire
    • 1
  1. 1.INRS-EMT, Place BonaventureMontréalCanada

Personalised recommendations