File Download

There are no files associated with this item.

  • Find it @ UNIST can give you direct access to the published full text of this article. (UNISTARs only)
Related Researcher

이재용

Lee, Jaiyong
Read More

Views & Downloads

Detailed Information

Cited time in webofscience Cited time in scopus
Metadata Downloads

Topology-Aware Fanout Set Division Scheme for QoS-Guaranteed Multicast Transmission

Author(s)
Kim, KyungminLee, Jaiyong
Issued Date
2013-12
DOI
10.1109/JCN.2013.000111
URI
https://scholarworks.unist.ac.kr/handle/201301/32165
Fulltext
https://ieeexplore.ieee.org/document/6713778
Citation
JOURNAL OF COMMUNICATIONS AND NETWORKS, v.15, no.6, pp.614 - 634
Abstract
The proliferation of real-time multimedia services requires huge amounts of data transactions demanding strict quality-of-service (QoS) guarantees. Multicast transmission is a promising technique because of its efficient network resource utilization. However, high head-of-line (HOL) blocking probability and lack of service-specific QoS control should be addressed for practical implementations of multicast networks. In this paper, a topology aware fanout set division (TAFD) scheme is proposed to resolve these problems. The proposed scheme is composed of two techniques that reduce HOL blocking probability and expedite packet delivery for large-delay branches regarding multicast tree topology. Since management of global topology information is not necessary, scalability of the proposed scheme is guaranteed. Mathematical analysis investigates effects of the proposed scheme and derives optimal operational parameters. The evaluation results show that the TAFD scheme achieves significant delay reduction and satisfies required delay bounds on various multicast networks.
Publisher
KOREAN INST COMMUNICATIONS SCIENCES (K I C S)
ISSN
1229-2370
Keyword (Author)
Combined input and crossbar queued (CICQ)fanout setmulticast quality-of-service (QoS)multicast router
Keyword
SCHEDULING ALGORITHMINPUTDELAYSERVICE

qrcode

Items in Repository are protected by copyright, with all rights reserved, unless otherwise indicated.