Optimal allocation of clients to replicated multicast servers

Zongming Fei, Mostafa H. Ammar, Ellen W. Zegura

Research output: Contribution to conferencePaperpeer-review

7 Scopus citations

Abstract

In this paper we investigate multicast server selection problems. First we give a definition of the static multicast server selection problem, in which we assume a set of static clients and multicast servers and consider how one might produce an optimal allocation of the clients to the servers. We use a transformation method for deriving multicast server selection algorithms from traditional multicast routing algorithms. To investigate the dynamic behavior of client join and leave and the cost incurred during the process, we next define the dynamic multicast server selection problem, in which the clients join and leave the multicast session dynamically. The goal is to produce an optimal allocation of clients to servers with an emphasis on how this allocation behaves over time. We formulate the problem as a Markovian Decision Process (MDP). Our analysis of the problem leads to two heuristics which we use to propose a simple selection algorithm. Our simulation compares the performance of our proposed algorithm with other multicast server selection algorithms.

Original languageEnglish
Pages69-76
Number of pages8
StatePublished - 1999
EventProceedings of the 1999 7th International Conference on Network Protocols (ICNP'99) - Toronto, Can
Duration: Oct 31 1999Nov 3 1999

Conference

ConferenceProceedings of the 1999 7th International Conference on Network Protocols (ICNP'99)
CityToronto, Can
Period10/31/9911/3/99

ASJC Scopus subject areas

  • Software

Fingerprint

Dive into the research topics of 'Optimal allocation of clients to replicated multicast servers'. Together they form a unique fingerprint.

Cite this