Forming multiple multicast groups is a technique often used to deal with the problem of heterogeneous client capacities by allocating clients with different capacities to different groups. In this paper, we investigate the problem of allocating clients to constrained multicast servers, which, similar to clients, have different capacities. We explore several interesting issues caused by these constraints and propose a framework for generating optimal solutions to the allocation problem. We evaluate the method by simulation and show a substantial performance gain of our algorithm over those considering the server constraints separately.
|Number of pages||8|
|State||Published - Jul 21 2003|
Bibliographical noteFunding Information:
The work of Zongming Fei and Mengkun Yang was supported in part by the National Science Foundation under Grants CCR-0204304 and EIA-0101242. The work of Mostafa H. Ammar and Ellen W. Zegura was supported in part by the National Science Foundation under Grant ANI-9973115. We also want to thank anonymous reviewers for their valuable comments that help improve the paper.
- Rate constraint
- Server selection
ASJC Scopus subject areas
- Computer Networks and Communications