Discrete bandwidth allocation considering fairness and transmission load in multicast networks

Cited 9 time in webofscience Cited 11 time in scopus
  • Hit : 1242
  • Download : 491
As a promising solution to tackle the network heterogeneity in multicasting, layered multicast protocols such as receiver-driven layered multicast (RLM) and layered video multicast with retransmission (LVMR) have been proposed. This paper considers fairness as well as transmission load in the layered multicasting. Lexicographically fair bandwidth allocation among multicast receivers is considered under the constraint of minimum bandwidth requirement and the link capacity of the network. The problem of transmission load in the layer multicasting due to various user requirements is also examined by minimizing the number of layers. The bandwidth allocation is formulated as a nonlinear integer programming problem. A dual-objective tabu search is proposed to solve the fairness and transmission load problem in multicast networks. Outstanding performance is obtained by the proposed tabu search. When the fairness objective is considered, the solution gap from the optimal solution is less than 2% in problems with 50 virtual sessions. The complexity of the dual objective largely depends on the weighting factor of the two objectives. Even in tough cases the proposed tabu search provides excellent solution, whose gap is within 6% from the optimal solution. (c) 2005 Elsevier Ltd. All rights reserved.
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
2007-03
Language
English
Article Type
Article
Citation

COMPUTERS & OPERATIONS RESEARCH, v.34, no.3, pp.884 - 899

ISSN
0305-0548
DOI
10.1016/j.cor.2005.05.016
URI
http://hdl.handle.net/10203/7239
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 9 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0