Allocating clients to constrained multicast servers: an optimal solution

Multicast communication enables a server to send content to multiple clients at the same time through a multicast tree. To deal with the heterogeneity of client capacities, multiple multicast groups can be used to allocate clients with similar capacity to the same group, so that the performance perceived by clients can be improved. We investigate the problem of allocating clients to constrained multicast servers, which, similar to clients, have different capacities. We explore some interesting issues raised by the constraints and propose an optimal solution to the allocation problem. We evaluate the solution and show substantial performance gain for our algorithm over those considering the server constraints separately.

[1]  Craig Partridge,et al.  Host Anycasting Service , 1993, RFC.

[2]  Donald F. Towsley,et al.  Efficient rate-controlled bulk data transfer using multiple multicast groups , 2003, TNET.

[3]  Ernst W. Biersack,et al.  Continuous multicast push of Web documents over the Internet , 1998, IEEE Netw..

[4]  Mark Crovella,et al.  Server selection using dynamic path characterization in wide-area networks , 1997, Proceedings of INFOCOM '97.

[5]  Ellen W. Zegura,et al.  Application-layer anycasting: a server selection architecture and use in a replicated Web service , 2000, TNET.

[6]  Ellen W. Zegura,et al.  A novel server selection technique for improving the response time of a replicated service , 1998, Proceedings. IEEE INFOCOM '98, the Conference on Computer Communications. Seventeenth Annual Joint Conference of the IEEE Computer and Communications Societies. Gateway to the 21st Century (Cat. No.98.

[7]  Ellen W. Zegura,et al.  Inter-receiver fairness: a novel performance measure for multicast ABR sessions , 1998, SIGMETRICS '98/PERFORMANCE '98.

[8]  Sneha Kumar Kasera,et al.  Scalable reliable multicast using multiple multicast channels , 2000, TNET.

[9]  Srinivasan Seshan,et al.  SPAND: Shared Passive Network Performance Discovery , 1997, USENIX Symposium on Internet Technologies and Systems.

[10]  Walid Dabbous,et al.  Multipoint Communication: A Survey of Protocols, Functions, and Mechanisms , 1997, IEEE J. Sel. Areas Commun..

[11]  Fang Hao,et al.  Supporting server selection in differentiated service networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[12]  Mostafa H. Ammar,et al.  Improving the throughput of point-to-multipoint ARQ protocols through destination set splitting , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.

[13]  Ellen W. Zegura,et al.  Application-layer anycasting , 1997, Proceedings of INFOCOM '97.

[14]  Peter A. Dinda,et al.  Performance characteristics of mirror servers on the Internet , 1999, IEEE INFOCOM '99. Conference on Computer Communications. Proceedings. Eighteenth Annual Joint Conference of the IEEE Computer and Communications Societies. The Future is Now (Cat. No.99CH36320).

[15]  Asit Dan,et al.  Scheduling policies for an on-demand video server with batching , 1994, MULTIMEDIA '94.

[16]  Dina Katabi,et al.  A framework for scalable global IP-anycast (GIA) , 2000, SIGCOMM 2000.