Congestion control and routing in multicasting

Summary form only given. The author addresses the problems of congestion control and routing of multicast traffic in communication networks. The network is modeled by an arbitrary topology directed graph G=(V,E) and the capacity of edge e is C/sub e/. A multicast session is identified by the pair (v,S) where v is the source node of the session and S is the group of intended destination nodes. There are N multicast sessions (v/sub 1/,S/sub 1/),...,(v/sub n/,S/sub n/). A directed tree can carry the traffic of session n, therefore it is eligible for session n, if it is rooted in node v/sub n/ and its leaves are the nodes in S/sub n/. A collection T/sub n/ of eligible multicast trees for session n are prespecified as the trees through which session n traffic can be transported. For the results in this paper, the traffic may be either deterministic or a Markov modulated random process.