×

A lexicographically fair allocation of discrete bandwidth for multirate multicast traffics. (English) Zbl 1072.68023

Summary: Fair bandwidth allocation is an important issue in the multicast network to serve each multicast traffic at a fair rate commensurate with the receiver’s capabilities and the capacity of the path of the traffic. Lexicographically fair bandwidth layer allocation problem is considered and formulated as a nonlinear integer programming problem. A nonincreasing convex function of the bandwidth layers of the virtual sessions is employed to maximize the bandwidth of each virtual session from the smallest.
To solve the fairness problem a Genetic Algorithm (GA) is developed based on the fitness function, ranking selection and the shift crossover. Outstanding performance is obtained by the proposed GA in various multicast networks. The effectiveness of the GA becomes more powerful as the network size increases.

MSC:

68M20 Performance evaluation, queueing, and scheduling in the context of computer systems
Full Text: DOI

References:

[1] Shannon N. Multipoint communication by hierarchically encoded data. Proceedings of IEEE INFOCOM ’92, Florence, Italy, 1992. p. 2107-14.; Shannon N. Multipoint communication by hierarchically encoded data. Proceedings of IEEE INFOCOM ’92, Florence, Italy, 1992. p. 2107-14.
[2] Li X, Paul S, Ammar M. Layered video multicast with retransmissions (LVMR): evaluation of hierarchical rate control. Proceedings of IEEE INFOCOM ’98, San Francisco, USA, 1998. p. 1062-72.; Li X, Paul S, Ammar M. Layered video multicast with retransmissions (LVMR): evaluation of hierarchical rate control. Proceedings of IEEE INFOCOM ’98, San Francisco, USA, 1998. p. 1062-72.
[3] McCanne S, Jacobson V, Vetterli M. Receiver-driven layered multicast. Proceedings of ACM SIGCOMM’96, Stanford, Canada, 1996. p. 117-30.; McCanne S, Jacobson V, Vetterli M. Receiver-driven layered multicast. Proceedings of ACM SIGCOMM’96, Stanford, Canada, 1996. p. 117-30.
[4] Sarkar S, Tassiulas L. Fair allocation of resource in multirate multicast trees. Global Telecom Global Telecommunications Conference GLOBECOM ’99, Rio de Janeiro, Brazil, 1999. p. 240-45.; Sarkar S, Tassiulas L. Fair allocation of resource in multirate multicast trees. Global Telecom Global Telecommunications Conference GLOBECOM ’99, Rio de Janeiro, Brazil, 1999. p. 240-45.
[5] Bertsekas, D.; Gallager, R., Data networks (1987), Prentice-Hall: Prentice-Hall Englewood Cliffs, NJ
[6] Sarkar S, Tassiulas L. Distributed algorithms for computation of fair rates in multirate multicast trees. Proceedings of IEEE INFOCOM ’00, Tel Aviv, Israel, 2000. p. 52-61.; Sarkar S, Tassiulas L. Distributed algorithms for computation of fair rates in multirate multicast trees. Proceedings of IEEE INFOCOM ’00, Tel Aviv, Israel, 2000. p. 52-61.
[7] Sarkar S, Tassiulas L. Fair allocation of discrete bandwidth layers in multicast networks. Technical Research Report 99-43, 1999.; Sarkar S, Tassiulas L. Fair allocation of discrete bandwidth layers in multicast networks. Technical Research Report 99-43, 1999.
[8] Sarkar S, Tassiulas L. Fair allocation of discrete bandwidth layers in multicast networks. Proceedings of IEEE INFOCOM ’00, Tel Aviv, Israel, 2000. p. 1491-500.; Sarkar S, Tassiulas L. Fair allocation of discrete bandwidth layers in multicast networks. Proceedings of IEEE INFOCOM ’00, Tel Aviv, Israel, 2000. p. 1491-500.
[9] Sarkar, S.; Tassiulas, L., Fair allocation of utilities in multirate multicast networks a framework for unifying diverse fairness objectives, IEEE Transactions on Automatic Control, 47, 6, 931-944 (2002) · Zbl 1364.90095
[10] Kar, K.; Sarkar, S.; Tassiulas, L., A scalable low-overhead rate control algorithm for multirate multicast sessions, IEEE Journal on Selected Areas in Communications, 20, 8, 1541-1557 (2002)
[11] Kelly, F., Changing and rate control for elastic traffic, European Transactions on Telecommunications, 8, 33-37 (1997)
[12] Tzeng, H.; Siu, K., On max-min fair congestion control for multicast ABR service in ATM, Journal on Selected Areas in Communications, 15, 545-546 (1997)
[13] Goldberg D, Deb K. A comparative analysis of selection schemes used in genetic algorithms. Proceedings of Fifth International Conference on GAs, San Mateo, Canada, 1991. p. 69-93.; Goldberg D, Deb K. A comparative analysis of selection schemes used in genetic algorithms. Proceedings of Fifth International Conference on GAs, San Mateo, Canada, 1991. p. 69-93.
[14] Eshelman L, Schaffer J. Real-coded genetic algorithms and interval-schemata. Proceedings of Foundations of GAs, Colorado, USA, 1992. p. 187-202.; Eshelman L, Schaffer J. Real-coded genetic algorithms and interval-schemata. Proceedings of Foundations of GAs, Colorado, USA, 1992. p. 187-202.
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.