IDEAS home Printed from https://ideas.repec.org/h/spr/sprchp/978-0-387-30165-5_25.html
   My bibliography  Save this book chapter

Optimization Problems in Multicast Tree Construction

In: Handbook of Optimization in Telecommunications

Author

Listed:
  • Carlos A.S. Oliveira

    (Oklahoma State University, School of Industrial Engineering and Management)

  • Panos M. Pardalos

    (University of Florida, Center for Applied Optimization Department of Industrial and Systems Engineering)

  • Mauricio G.C. Resende

    (Shannon Laboratory, Internet & Network Systems Research Center AT&T Labs Research)

Abstract

Multicasting is a technique for data routing in networks that allows multiple destinations to be addressed simultaneously. The implementation of multicasting requires, however, the solution of difficult combinatorial optimization problems. In this chapter, we discuss combinatorial issues occurring in the implementation of multicast routing, including multicast tree construction, minimization of the total message delay, center-based routing, and multicast message packing. Optimization methods for these problems are discussed and the corresponding literature reviewed. Mathematical programming as well as graph models for these problems are discussed.

Suggested Citation

  • Carlos A.S. Oliveira & Panos M. Pardalos & Mauricio G.C. Resende, 2006. "Optimization Problems in Multicast Tree Construction," Springer Books, in: Mauricio G. C. Resende & Panos M. Pardalos (ed.), Handbook of Optimization in Telecommunications, chapter 25, pages 701-731, Springer.
    • Handle: RePEc:spr:sprchp:978-0-387-30165-5_25
    DOI: 10.1007/978-0-387-30165-5_25
    as

    Download full text from publisher

    To our knowledge, this item is not available for download. To find whether it is available, there are three options:
    1. Check below whether another version of this item is available online.
    2. Check on the provider's web page whether it is in fact available.
    3. Perform a
    for a similarly titled item that would be available.

    More about this item

    Keywords

    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;
    ;

    Statistics

    Access and download statistics

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:spr:sprchp:978-0-387-30165-5_25. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sonal Shukla or Springer Nature Abstracting and Indexing (email available below). General contact details of provider: http://www.springer.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.