QoS-driven multicast tree generation using tabu search
��������Many multimedia communication applications require a source to transmit messages to multiple destinations subject to Quality-of-Service (QoS) delay constraint. The problem to be solved is to find a minimum cost multicast treee where each source to destination path is contrained by a delay bo...
Saved in:
| Main Author: | |
|---|---|
| Other Authors: | , , , |
| Format: | article |
| Published: |
2020
|
| Subjects: | |
| Online Access: | https://eprints.kfupm.edu.sa/id/eprint/273/1/J_Youssef_CC_July2002.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1864513388493668352 |
|---|---|
| author | Youssef, H. |
| author2 | Al-Mulhem, Abdulaziz Sait, Sadiq M. TAHIR, MUHAMMAD ATIF unknown |
| author2_role | author author author author |
| author_facet | Youssef, H. Al-Mulhem, Abdulaziz Sait, Sadiq M. TAHIR, MUHAMMAD ATIF unknown |
| author_role | author |
| dc.creator.none.fl_str_mv | Youssef, H. Al-Mulhem, Abdulaziz Sait, Sadiq M. TAHIR, MUHAMMAD ATIF unknown |
| dc.date.*.fl_str_mv | 2020 |
| dc.format.none.fl_str_mv | application/pdf |
| dc.identifier.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/273/1/J_Youssef_CC_July2002.pdf QoS-driven multicast tree generation using tabu search. COMPUTER COMMUNICATIONS 25 (11-12): 1140-1149 Sp. Iss. SI JUL 1 2002. |
| dc.language.none.fl_str_mv | en |
| dc.relation.none.fl_str_mv | https://eprints.kfupm.edu.sa/id/eprint/273/ |
| dc.rights.*.fl_str_mv | info:eu-repo/semantics/openAccess |
| dc.subject.none.fl_str_mv | Computer |
| dc.title.none.fl_str_mv | QoS-driven multicast tree generation using tabu search |
| dc.type.none.fl_str_mv | Article PeerReviewed info:eu-repo/semantics/publishedVersion info:eu-repo/semantics/article |
| description | ��������Many multimedia communication applications require a source to transmit messages to multiple destinations subject to Quality-of-Service (QoS) delay constraint. The problem to be solved is to find a minimum cost multicast treee where each source to destination path is contrained by a delay bound. This problem to be solved is to find a minimum cost multicast treee where each source to destination path is constrained by a delay bound. This problem has been proven to be NP-complete. In this paper, we present a Tabu Search (TS) algorithm to construct a minimum cost delay bounded multiacst tree. The proposed algorithm is then compared with many existing multicast algorithms. Results show that on almost all test cases, TS algorithm exhibits more intelligent search of the solution subspace and is able to find better solutions than other reported multicast algorithms. |
| eu_rights_str_mv | openAccess |
| format | article |
| id | KFUPM_5f296d7091548f00b677d86c0632425a |
| identifier_str_mv | QoS-driven multicast tree generation using tabu search. COMPUTER COMMUNICATIONS 25 (11-12): 1140-1149 Sp. Iss. SI JUL 1 2002. |
| language_invalid_str_mv | en |
| network_acronym_str | KFUPM |
| network_name_str | King Fahd University of Petroleum and Minerals |
| oai_identifier_str | oai::273 |
| publishDate | 2020 |
| repository.mail.fl_str_mv | |
| repository.name.fl_str_mv | |
| repository_id_str | |
| spelling | QoS-driven multicast tree generation using tabu searchYoussef, H.Al-Mulhem, AbdulazizSait, Sadiq M.TAHIR, MUHAMMAD ATIFunknownComputer��������Many multimedia communication applications require a source to transmit messages to multiple destinations subject to Quality-of-Service (QoS) delay constraint. The problem to be solved is to find a minimum cost multicast treee where each source to destination path is contrained by a delay bound. This problem to be solved is to find a minimum cost multicast treee where each source to destination path is constrained by a delay bound. This problem has been proven to be NP-complete. In this paper, we present a Tabu Search (TS) algorithm to construct a minimum cost delay bounded multiacst tree. The proposed algorithm is then compared with many existing multicast algorithms. Results show that on almost all test cases, TS algorithm exhibits more intelligent search of the solution subspace and is able to find better solutions than other reported multicast algorithms.ArticlePeerReviewedinfo:eu-repo/semantics/publishedVersioninfo:eu-repo/semantics/articleapplication/pdfhttps://eprints.kfupm.edu.sa/id/eprint/273/1/J_Youssef_CC_July2002.pdf QoS-driven multicast tree generation using tabu search. COMPUTER COMMUNICATIONS 25 (11-12): 1140-1149 Sp. Iss. SI JUL 1 2002. enhttps://eprints.kfupm.edu.sa/id/eprint/273/2020info:eu-repo/semantics/openAccessoai::2732019-11-01T13:23:22Z |
| spellingShingle | QoS-driven multicast tree generation using tabu search Youssef, H. Computer |
| status_str | publishedVersion |
| title | QoS-driven multicast tree generation using tabu search |
| title_full | QoS-driven multicast tree generation using tabu search |
| title_fullStr | QoS-driven multicast tree generation using tabu search |
| title_full_unstemmed | QoS-driven multicast tree generation using tabu search |
| title_short | QoS-driven multicast tree generation using tabu search |
| title_sort | QoS-driven multicast tree generation using tabu search |
| topic | Computer |
| url | https://eprints.kfupm.edu.sa/id/eprint/273/1/J_Youssef_CC_July2002.pdf |