Multicasting for multimedia applications
IEEE INFOCOM '92 Proceedings of the eleventh annual joint conference of the IEEE computer and communications societies on One world through communications (Vol. 3)
Network flows: theory, algorithms, and applications
Network flows: theory, algorithms, and applications
The Steiner tree problem I: formulations, compositions and extension of facets
Mathematical Programming: Series A and B
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
A source-based algorithm for delay-constrained minimum-cost multicasting
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
An optimal establishment of virtual path connections for ATM networks
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
Address management and connection control for multicast communication applications
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
Degree-constrained multicasting in point-to-point networks
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 1)-Volume - Volume 1
Adaptive multicast routing in single rate loss networks
INFOCOM '95 Proceedings of the Fourteenth Annual Joint Conference of the IEEE Computer and Communication Societies (Vol. 2)-Volume - Volume 2
Redundant trees for preplanned recovery in arbitrary vertex-redundant or edge-redundant graphs
IEEE/ACM Transactions on Networking (TON)
Multicast Routing by Multiple Tree Routes
QoS-IP '01 Proceedings of the International Workshop on Quality of Service in Multiservice IP Networks
| Hi-index | 0.00 |
A number of multicast tree algorithms have been proposed in the literature. Their approach to modeling the problem has some drawbacks in applications for ATM networks since only a single multipoint connection request is considered in the presence of link capacity constraints. In this paper, we present a detailed mathematical model,for the generalized multicast arborescence(i.e., a rooted out-tree) problem in which there are a number of concurrent multipoint connections of various traffic types. Point-to-point connections are also considered as a special case of multipoint connections. A solution to the model determines, in the most economical way, an establishment of VPCs with reserved capacity and multicast arborescences using the established VPCs for multipoint connections. This model is a natural extension of the Virtual Channel Problem inbodirced by Kim[19]. Algorithms and numerical results are presented.