Optimal multicast route packing

Cited 6 time in webofscience Cited 0 time in scopus
  • Hit : 342
  • Download : 0
This paper considers the hop-constrained multicast route packing problem with a bandwidth reservation to build QOS-guaranteed multicast routing trees with a minimum installation cost. Given a set of multicast sessions. each of which has a hop limit constraint and a bandwidth requirement, the problem is to determine the set of multicast routing trees in an arc-capacitated network with the objective of minimizing the cost. For the problem, we propose a branch-and-cut-and-price algorithm, which can be viewed as a branch-and-bound method incorporating both the strong cutting plane algorithm and the column generation method. We implemented and tested the proposed algorithm on randomly generated problem instances with sizes up to 30 nodes. 570 arcs, and 10 multicast sessions. The test results show that the algorithm can obtain the optimal Solution to practically sized problem instances within a reasonable time limit in most cases (C) 2008 Elsevier B.V. All rights reserved
Publisher
ELSEVIER SCIENCE BV
Issue Date
2009-07
Language
English
Article Type
Article
Keywords

BRANCH-AND-PRICE; ALGORITHM; CONSTRAINTS; STREAMS

Citation

EUROPEAN JOURNAL OF OPERATIONAL RESEARCH, v.196, no.1, pp.351 - 359

ISSN
0377-2217
DOI
10.1016/j.ejor.2008.03.006
URI
http://hdl.handle.net/10203/93679
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 6 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0