Handbook of Optimization in Telecommunications, Springer, pp. 701-731, 2006.
ABSTRACTMulticasting 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.
PDF file of full paper
Mauricio G.C. Resende's Home PageLast modified: 7 July 2006