Construction of the Bounded Application-layer Multicast Tree in the Overlay Network Model by the Integer Linear Programming
Petr Jurčík, Zdeněk Hanzálek · 2006
The geographically distributed system can be interconnected via an overlay multicast network. In this overlay network the multicast data are routed and replicated on the application layer along a multicast tree. This paper presents the techniques of the network reduction and the multicast tree construction. The multicast tree in the form of shortest path tree (SPT) can be build up upon the linear programming formulation. To control the load of each host, the additional constraints on the maximal number of directly outgoing connections and integer variables are added and subsequently form the degree-bounded shortest path tree problem (db-SPT). This theoretically based problem is formulated in integer linear programming framework.