Efficient stream distribution algorithm for heterogeneous multimedia multicast with link capacity constraint

Abstract

In heterogeneous multimedia multicast, a recipient bids for what it wants to receive and the source gains the same amount when a connection is established. The problem of distributing streams for heterogeneous multicast to maximize the source's gain, can be solved using a 0-1 integer programming, known as NP-complete. We consider the problem with constraint on link capacity and propose an efficient stream distribution algorithm, which has better both time and space complexity compared with any existing one, In addition, distributed implementation is straightforward, which is very useful for large networks. (C) 1997 Elsevier Science B.V.