A survey of combinatorial optimization problems in multicast routing

  • Authors:
  • Carlos A. S. Oliveira;Panos M. Pardalos

  • Affiliations:
  • Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL;Department of Industrial and Systems Engineering, University of Florida, Gainesville, FL

  • Venue:
  • Computers and Operations Research
  • Year:
  • 2005

Quantified Score

Hi-index 0.01

Visualization

Abstract

In multicasting routing, the main objective is to send data from one or more sources to multiple destinations, while at the same time minimizing the usage of resources. Examples of resources which can be minimized include bandwidth, time and connection costs. In this paper, we survey applications of combinatorial optimization to multicast routing. We discuss the most important problems considered in this area, as well as their models. Algorithms for each of the main problems are also presented.