Reliable overlay multicast trees for private Internet broadcasting with multiple sessions

Cited 2 time in webofscience Cited 0 time in scopus
  • Hit : 721
  • Download : 395
With rapid advances of computing technologies and high speed networks, various high volume multimedia services have become popular in the Internet. Private Internet broadcasting is a typical way to support these services and overlay multicast technology is known to be a promisin g solution to support this method. In an overlay multicast network, members are dynamically joining or leaving their multicast group. To reduce frequent updates of multicast members and provide a reliable multicast route, overlay multicast trees are investiuated. The problem is formulated as a binary integer programming which maximizes the minimum link reliability for all multicast sessions. Tabu search heuristic is developed with repeated intensification and diversification. Robust computational result is obtained that is comparable to the optimal solution and applicable in real time. (c) 2005 Elsevier Ltd. All rights reserved.
Publisher
PERGAMON-ELSEVIER SCIENCE LTD
Issue Date
2007-09
Language
English
Article Type
Article
Keywords

SERVICE

Citation

COMPUTERS & OPERATIONS RESEARCH, v.34, no.9, pp.2849 - 2864

ISSN
0305-0548
DOI
10.1016/j.cor.2005.11.003
URI
http://hdl.handle.net/10203/7237
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 2 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0