Abstract
The proliferation of realtime 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.
| Original language | English |
|---|---|
| Article number | 6713778 |
| Pages (from-to) | 614-634 |
| Number of pages | 21 |
| Journal | Journal of Communications and Networks |
| Volume | 15 |
| Issue number | 6 |
| DOIs | |
| Publication status | Published - 2013 Dec 1 |
Fingerprint
All Science Journal Classification (ASJC) codes
- Information Systems
- Computer Networks and Communications
Cite this
}
Topology-aware fanout set division scheme for QoS-guaranteed multicast transmission. / Kim, Kyungmin; Lee, Jaiyong.
In: Journal of Communications and Networks, Vol. 15, No. 6, 6713778, 01.12.2013, p. 614-634.Research output: Contribution to journal › Article
TY - JOUR
T1 - Topology-aware fanout set division scheme for QoS-guaranteed multicast transmission
AU - Kim, Kyungmin
AU - Lee, Jaiyong
PY - 2013/12/1
Y1 - 2013/12/1
N2 - The proliferation of realtime 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.
AB - The proliferation of realtime 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.
UR - http://www.scopus.com/inward/record.url?scp=84893425865&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84893425865&partnerID=8YFLogxK
U2 - 10.1109/JCN.2013.000111
DO - 10.1109/JCN.2013.000111
M3 - Article
AN - SCOPUS:84893425865
VL - 15
SP - 614
EP - 634
JO - Journal of Communications and Networks
JF - Journal of Communications and Networks
SN - 1229-2370
IS - 6
M1 - 6713778
ER -