File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.3837/tiis.2012.12.005
- Scopus: eid_2-s2.0-84871814911
- WOS: WOS:000315021200005
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Optimization of Tree-like Core Overlay in Hybrid-structured Application-layer Multicast
Title | Optimization of Tree-like Core Overlay in Hybrid-structured Application-layer Multicast |
---|---|
Authors | |
Keywords | Tree-like core overlay Application-layer multicast Out-degree weighted reliability Evolutionary programming |
Issue Date | 2012 |
Publisher | Korea Society of Internet Information (KSII). The Journal's web site is located at http://www.itiis.org/ |
Citation | KSII Transactions on Internet and Information Systems, 2012, v. 6 n. 12, p. 3117-3132 How to Cite? |
Abstract | The tree topology in multicast systems has high transmission efficiency, low latency, but poor resilience to node failures. In our work, some nodes are selected as backbone nodes to construct a tree-like core overlay. Backbone nodes are reliable enough and have strong upload capacity as well, which is helpful to overcome the shortcomings of tree topology. The core overlay is organized into a spanning tree while the whole overlay is of mesh-like topology. This paper focuses on improving the performance of the application-layer multicast overlay by optimizing the core overlay which is periodically adjusted with the proposed optimization algorithm. Our approach is to construct the overlay tree based on the out-degree weighted reliability where the reliability of a node is weighted by its upload bandwidth (out-degree). There is no illegal solution during the evolution which ensures the evolution efficiency. Simulation results show that the proposed approach greatly enhances the reliability of the tree-like core overlay systems and achieves shorter delay simultaneously. Its reliability performance is better than the reliability-first algorithm and its delay is very close to that of the degree-first algorithm. The complexity of the proposed algorithm is acceptable for application. Therefore the proposed approach is efficient for the topology optimization of a real multicast overlay. |
Persistent Identifier | http://hdl.handle.net/10722/184762 |
ISSN | 2023 Impact Factor: 1.2 2023 SCImago Journal Rankings: 0.331 |
ISI Accession Number ID |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Weng, J | en_US |
dc.contributor.author | Zou, X | en_US |
dc.contributor.author | Wang, M | en_US |
dc.date.accessioned | 2013-07-15T10:08:04Z | - |
dc.date.available | 2013-07-15T10:08:04Z | - |
dc.date.issued | 2012 | en_US |
dc.identifier.citation | KSII Transactions on Internet and Information Systems, 2012, v. 6 n. 12, p. 3117-3132 | en_US |
dc.identifier.issn | 1976-7277 | - |
dc.identifier.uri | http://hdl.handle.net/10722/184762 | - |
dc.description.abstract | The tree topology in multicast systems has high transmission efficiency, low latency, but poor resilience to node failures. In our work, some nodes are selected as backbone nodes to construct a tree-like core overlay. Backbone nodes are reliable enough and have strong upload capacity as well, which is helpful to overcome the shortcomings of tree topology. The core overlay is organized into a spanning tree while the whole overlay is of mesh-like topology. This paper focuses on improving the performance of the application-layer multicast overlay by optimizing the core overlay which is periodically adjusted with the proposed optimization algorithm. Our approach is to construct the overlay tree based on the out-degree weighted reliability where the reliability of a node is weighted by its upload bandwidth (out-degree). There is no illegal solution during the evolution which ensures the evolution efficiency. Simulation results show that the proposed approach greatly enhances the reliability of the tree-like core overlay systems and achieves shorter delay simultaneously. Its reliability performance is better than the reliability-first algorithm and its delay is very close to that of the degree-first algorithm. The complexity of the proposed algorithm is acceptable for application. Therefore the proposed approach is efficient for the topology optimization of a real multicast overlay. | - |
dc.language | eng | en_US |
dc.publisher | Korea Society of Internet Information (KSII). The Journal's web site is located at http://www.itiis.org/ | - |
dc.relation.ispartof | KSII Transactions on Internet and Information Systems | en_US |
dc.subject | Tree-like core overlay | - |
dc.subject | Application-layer multicast | - |
dc.subject | Out-degree weighted reliability | - |
dc.subject | Evolutionary programming | - |
dc.title | Optimization of Tree-like Core Overlay in Hybrid-structured Application-layer Multicast | en_US |
dc.type | Article | en_US |
dc.identifier.email | Wang, M: magwang@hku.hk | en_US |
dc.identifier.authority | Wang, M=rp00967 | en_US |
dc.identifier.doi | 10.3837/tiis.2012.12.005 | - |
dc.identifier.scopus | eid_2-s2.0-84871814911 | - |
dc.identifier.hkuros | 215638 | en_US |
dc.identifier.volume | 6 | en_US |
dc.identifier.issue | 12 | en_US |
dc.identifier.spage | 3117 | en_US |
dc.identifier.epage | 3132 | en_US |
dc.identifier.isi | WOS:000315021200005 | - |
dc.publisher.place | Korea | - |
dc.identifier.issnl | 1976-7277 | - |