• Journal of Communications and Networks
• /
• v.18 no.1
• /
• pp.123-131
• /
• 2016

The high-availability seamless redundancy (HSR) protocol is one of the most important redundancy IEC standards that has garnered a great deal of attention because it offers a redundancy with zero recovery time, which is a feature that is required by most of the modern substation, smart grid, and industrial field applications. However, the HSR protocol consumes a lot of network bandwidth compared to the Ethernet standard. This is due to the duplication process for every sent frame in the HSR networks. In this paper, a novel algorithm known as the reducing multicast traffic (RMT) is presented to reduce the unnecessary redundant multicast traffic in HSR networks by limiting the spreading of the multicast traffic to only the rings that have members associated with that traffic instead of spreading the traffic into all the network parts, as occurs in the standard HSR protocol. The mathematical and the simulation analyses show that the RMT algorithm offers a traffic reduction percentage with a range of about 60-87% compared to the standard HSR protocol. Consequently, the RMT algorithm will increase the network performance by freeing more bandwidth so as to reduce HSR network congestion and also to minimize any intervention from the network administrator that would be required when using traditional traffic filtering techniques.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.3
• /
• pp.180-187
• /
• 2014

This paper introduces reliable multicast MAC protocol for cooperative unmanned vehicles. cooperative unmanned vehicles communicate with infrastructure and other unmanned vehicles in order to increase driving safety. They exchange information related to driving and thus it requires real-time and reliable multicast. However, the international vehicular communication standard, IEEE 802.11p WAVE, does not provide a reliable multicast scheme on the MAC layer. To address the problems of reliability, we propose a reliable multicast protocol called WiVCL, which avoids contention and collision. Our evaluation shows that the WiVCL achieves a high degree of reliability and real-time features.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.2
• /
• pp.525-527
• /
• 2005

the multicast services with multiple senders is interested according to the internet services such as multiple audio/video conference services. With the N-plex multicast protocols, multicast session manager is also needed for membership control and session control. RMCP-3 is designed for N:N group communications which is standardizing in ITU-T and supports multiple senders who join sessions. In this paper, we consider requirements of multicast manager for multiplex multicast communication protocol which many a joiner has a role in sender such conference application.

• Journal of Communications and Networks
• /
• v.13 no.5
• /
• pp.525-535
• /
• 2011

In this paper, we study the contribution of network coding (NC) in improving the multicast capacity of random wireless ad hoc networks when nodes are endowed with multi-packet transmission (MPT) and multi-packet reception (MPR) capabilities. We show that a per session throughput capacity of ${\Theta}$(nT$^3$(n)) can be achieved as a tight bound when each session contains a constant number of sinks where n is the total number of nodes and T(n) is the transmission range. Surprisingly, an identical order capacity can be achieved when nodes have only MPR and MPT capabilities. This result proves that NC does not contribute to the order capacity of multicast traffic in wireless ad hoc networks when MPR and MPT are used in the network. The result is in sharp contrast to the general belief (conjecture) that NC improves the order capacity of multicast. Furthermore, if the communication range is selected to guarantee the connectivity in the network, i.e., ${\Omega}$($\sqrt{log\;n/n}$)=T(n) = O(log log n / log n), then the combination of MPR and MPT achieves a throughput capacity of ${\Theta}$(log$^{\frac{3}{2}}$ n/$\sqrt{n}$) which provides an order capacity gain of ${\Theta}$(log$^2$ n) compared to the point-to-point multicast capacity with the same number of destinations.

• Proceedings of the IEEK Conference
• /
• 2003.11c
• /
• pp.145-148
• /
• 2003

A lot of institutes have proposed RMT (Reliable Multicast Transport) techniques over IP multicast environment which provides only best-effort services. The ECTP (Enhanced Communications Transport Protocol) is a kind of RMT technique and an international standard of ITU-T and JTC1/SC6. It is a protocol that provides reliability fer IP multicast environment. In this paper, we tested ECTP applications which are MFTP (Multicast file transport protocol) and WB (white Board) on the APAN (Asia-Pacific Advanced Network) with the Kyushu University in Japan. We measured ECTP traffic using a packet capture tool that programmed by Pcap library that is developed in Lawrence Berkeley institute. In according to the result, we think that ECTP is an efficient protocol in transporting files to many receivers simultaneously.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.6A
• /
• pp.583-588
• /
• 2004

For the Explicit Multicast (Xcast) scheme, we propose a scheme that provides dynamic group membership and supports a large, dense multicast group. To do so, we use a hierarchical joining mechanism, where a domain agent joins a group on behalf of hosts. In our scheme, a sender transmits multicast packets to a domain agent, and then the agent forwards the packets to receivers in a domain. A host can join or leave a group at my time via the domain agent. Thus, a destination field of the Xcast header has addresses of domain agents instead of hosts. Simulation results show that our scheme can reduce more the Xcast header size and cost in forwarding packets than the Xcast, especially for a large multicast group. Like traditional multicast schemes, our scheme can support large multicast group members.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.2B
• /
• pp.120-130
• /
• 2011

Recently the multicast based contents transmission is rapidly increasing due to the various multimedia services and the importance of switching technology to handle it is increasing as a consequence. Though the CICQ architecture has advantages that reduction of HoL blocking probability and simple scheduling using cross point buffer, it has disadvantage that the processing rate of multicast traffic can be significantly degraded corresponds to the traffic load increment. Several schemes have been proposed to solve this problem however they still can't provide enough processing ratio for multicast traffic. Therefore this paper proposes the BA cell assignment scheme and the VT scheme, and the processing rate of multicast traffic can be guaranteed by reducing the HoL blocking probability of multicast traffic and reservation of cross point buffer. Also simulation results verify that using the proposed scheme, the QoS of multicast service can be improved.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3B
• /
• pp.305-313
• /
• 2004

Group multicast refers to the kind of multicast in which every member of a group is allowed to transmit data to the group. The goal of routing algorithms for group multicast is to construct a set of low cost multicast trees including all the group members with QoS (e.g., bandwidth) constraint. There have been several algorithms proposed: source tree and shared tree approaches. However, the latter approach has a low success rate in constructing a shared multicast tree, and the former approach suffers from high control overhead and low scalability as stoup size increases. In this paper, we present a heuristic algorithm which varies the number of multicast trees according to the network load. The simulation results show not only that our algorithm outperforms the shared tree approach in terms of the success rate, but also that it has lower control overhead than the source tree approach while guaranteeing the same success rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.36 no.3A
• /
• pp.205-214
• /
• 2011

In 3rd generation project partnership long term evolution, wireless multicast techniques which send the same data to multiple users under single frequency networks have attracted much attention. In the multicast system, the transmission mode needs to be selected for efficient data transfer while satisfying the multicast coverage requirement. To achieve this, users' channel state information (CSI) should be available at the transmitter. However, it requires too much uplink feedback resource if all the users are allowed to transmit their CSI at all the time. To solve this problem, in this paper, the multicast coverage prediction is suggested. In the proposed algorithm, each user measures its transition probabilities between the success and the fail state of the decoding. Then, it periodically transmits its CSI to the basestation. Using these feedbacks, the basestation can predict the multicast coverage. From the simulation results, we demonstrate that the proposed scheme can predict the multicast system coverage.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.3B
• /
• pp.349-359
• /
• 2004

To provide multicasting service, several multicast protocols for mobile hosts have been proposed. But they include glitches such as a non-optimal delivery route, data loss when hosts move another network, therefore they have some insecure problems about multicast data transmission. In this paper, we consider these problems and propose a new reliable and efficient multicast routing protocol for Mobile If networks. The proposed protocol provides reliable multicast transmission by compensating data loss from the previous agent when a mobile host moves another network. Also it provides additional function that is directly to connect a multicast tree according to the status of agents. It provides more efficient and optimal multicast path. The performance of the proposed protocol is proved by simulation of various conditions.