(A) fair resource allocation in multicast tree with discrete rates

Abstract

The traffic in internet is increased explosively and demand of new service is created such as video conference, video on demand and online education. Because multicast sessions simultaneously share the network resources, multicast protocol has been more important for efficient use of network resources. Moreover, all sessions need a fair share of bandwidth in terms of network utility and fairness. In this paper, we study fairness in arbitrary networks with multicast traffic. Fair allocation of resources in multicast networks has several interesting problems to be solved. Intra-session fairness as well as inter-session fairness need to be considered. If discrete allocation of resources is considered, the problem becomes more complicated by the integer property of the solution. We assume that receiver’s weight is expected bandwidth to be allocated. We formulate this fairness problem and propose a heuristic approach for the lexicographic optimal solutions to allocate demands between various source-destination pairs. In computational results, we compare solution of proposed algorithm with existing algorithm when weights of receiver are equal. If weights of receiver are given differently, we compare minimum solution and lower bound.