Efficient algorithms for the multicast trees under the packet-replication restrictions
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Chung, SJ | - |
dc.contributor.author | Hong, SP | - |
dc.contributor.author | Chung, HS | - |
dc.date.accessioned | 2023-03-09T03:46:48Z | - |
dc.date.available | 2023-03-09T03:46:48Z | - |
dc.date.issued | 2001-09 | - |
dc.identifier.issn | 0916-8516 | - |
dc.identifier.issn | 1745-1345 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/cau/handle/2019.sw.cau/66200 | - |
dc.description.abstract | In this paper, we are concerned in obtaining multicast trees in packet-switched networks such as ATM nets, when there exist constraints on the packet (cell)-replication capabilities of the individual switching nodes. This problem can be formulated as the Steiner tree problem with degree bounds on the nodes, so we call it the Degree-Constrained Steiner Tree problem (DCST). Four heuristic algorithms are proposed: the first is a combined version of two well-known Steiner tree algorithms, heuristic Naive and the shortest path heuristic (SPH), and the second is a relaxation algorithm based on a mathematical formulation of the DCST, and the last two use a tree reconfiguration scheme based on the concept of 'logical link.' We experimentally compare our algorithms with the previous ones in three respects; number of solved instances, objective value or tree cost, and computation time. The experimental results show that there are few instances unsolved by our algorithms, and the objective values are mostly within 5% of optimal. Computation times are also acceptable. | - |
dc.format.extent | 11 | - |
dc.language | 영어 | - |
dc.language.iso | ENG | - |
dc.publisher | IEICE-INST ELECTRONICS INFORMATION COMMUNICATIONS ENG | - |
dc.title | Efficient algorithms for the multicast trees under the packet-replication restrictions | - |
dc.type | Article | - |
dc.identifier.bibliographicCitation | IEICE TRANSACTIONS ON COMMUNICATIONS, v.E84-B, no.9, pp 2670 - 2680 | - |
dc.description.isOpenAccess | N | - |
dc.identifier.wosid | 000171701000042 | - |
dc.identifier.scopusid | 2-s2.0-0035444191 | - |
dc.citation.endPage | 2680 | - |
dc.citation.number | 9 | - |
dc.citation.startPage | 2670 | - |
dc.citation.title | IEICE TRANSACTIONS ON COMMUNICATIONS | - |
dc.citation.volume | E84-B | - |
dc.type.docType | Article; Proceedings Paper | - |
dc.publisher.location | 일본 | - |
dc.subject.keywordAuthor | multicasting | - |
dc.subject.keywordAuthor | degree-constrained steiner tree | - |
dc.subject.keywordAuthor | tree reconfiguration | - |
dc.subject.keywordAuthor | logical link | - |
dc.subject.keywordAuthor | relaxation algorithm | - |
dc.subject.keywordPlus | STEINER PROBLEM | - |
dc.subject.keywordPlus | GRAPHS | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Telecommunications | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
84, Heukseok-ro, Dongjak-gu, Seoul, Republic of Korea (06974)02-820-6194
COPYRIGHT 2019 Chung-Ang University All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.