• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.6
• /
• pp.2492-2512
• /
• 2018

Multicast communication can effectively reduce network resources consumption in contrast with unicast. With the advent of SDN, current researches on multicast traffic are mainly conducted in the SDN scenario, thus to mitigate the problems of IP multicast such as the unavoidable difficulty in traffic engineering and high security risk. However, migration to SDN cannot be achieved in one step, hybrid SDN emerges as a transitional networking form for ISP network. In hybrid SDN, for acquiring similar TE and security performance as in SDN multicast, we redirect every multicast traffic to an appropriate SDN node before reaching the destinations of the multicast group, thus to build up a core-based multicast tree substantially which is first introduced in CBT. Based on the core SDN node, it is possible to realize dynamic control over the routing paths to benefit traffic engineering (TE), while multicast traffic manageability can also be obtained, e.g., access control and middlebox-supported network services. On top of that, multiple core-based multicast trees are constructed for each multicast group by fully taking advantage of the routing flexibility of SDN nodes, in order to further enhance the TE performance. The multicast routing and splitting (MRS) algorithm is proposed whereby we jointly and efficiently determine an appropriate core SDN node for each group, as well as optimizing the traffic splitting fractions for the corresponding multiple core-based trees to minimize the maximum link utilization. We conduct simulations with different SDN deployment rate in real network topologies. The results indicate that, when 40% of the SDN switches are deployed in HSDN as well as calculating 2 trees for each group, HSDN multicast adopting MRS algorithm can obtain a comparable TE performance to SDN multicast.

• 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.

• Journal of Korea Game Society
• /
• v.2 no.1
• /
• pp.30-35
• /
• 2002

The deployment of multicast communication services in the Internet is expected to lead a stable packet transfer even in heavy traffic as in On-Line Game environment. The Core Based Tree scheme among many multicast protocols is the most popular and suggested recently. However, CBT exhibit two major deficiencies such as traffic concentration or poor core placement problem. So, measuring the bottleneck link bandwidth along a path is important for understanding the performance of multicast. We propose not only a definition of CBT's core link state that Steady-State(SS), Normal-State(NS) and Bottleneck State(BS) according to the estimation link speed rate, but also the changeover of multicast routing scheme for traffic overload. In addition, we introduce anycast routing tree, a efficient architecture for construct shard multicast trees.

• Proceedings of the KIEE Conference
• /
• 2005.07d
• /
• pp.2936-2938
• /
• 2005

The deployment of multicast communication services in the internet is expected to lead a stable packet transfer even in heavy traffic as in network system environment. The core based tree scheme among many multicast protocols is the most popular and suggested recently. However, CBT exhibit two major deficiencies such as traffic concentration or poor core placement problem. so, measuring the bottleneck link bandwidth along a path is important for understanding th performance of multicast. We propose not only a definition of CBT's core link state that Steady-State, Normal-State and Bottleneck State according to the estimation link speed rate, but also the changeover of multicast routing scheme for traffic overload. In addition, we introduce anycast routing tree, a efficient architecture for construst shard multicast trees.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.19 no.11
• /
• pp.2215-2227
• /
• 1994

A multicast switch, which can provide a single uniform switching function for vastly different classes of traffic, is crucial for the successful deployment of intergrated broadband networks. In this paper, we study the call blocking probability of heterogeneous circuit emulated traffic in a multicast switch. A previous work on the analysis of homogeneous traffic, where all calls have the same fan-out, show the performance showed that the call blocking probability increases rapidly as fan out increases. We study the performance of heterogeneous traffic, which consists of calls of different fan out, and show the performance gaps between larger fan-out traffic and smaller fan-out traffic are larger than those of homogeneous traffic these results indicate the necessity of efficient resource allocation policies to improve the performance of multicast calls. We conclude the paper introducing several methods to improve the performance of multicast traffic.

• Journal of Game and Entertainment
• /
• v.2 no.1
• /
• pp.8-16
• /
• 2006

The development of multicast communication services in the Internet is expected to lead a stable packet transfer even though On-Line Games generate heavy traffic. The Core Based Tree scheme among many multicast protocols is the most popular and suggested recently. However, CBT exhibits two major deficiencies traffic concentration or poor core placement problem. Thus, measuring the bottleneck link bandwidth along a path is important to understand the performance of multicast. We propose a method in which the core router's state is classified into SS(Steady State), NS(Normal State) and BS(Bottleneck State) according to the estimated link speed rate, and also the changeover of multicast routing scheme for traffic overload. In addition, we introduce Anycast routing tree, an efficient architecture for constructing shard multicast trees.

• Journal of KIISE:Information Networking
• /
• v.29 no.1
• /
• pp.48-56
• /
• 2002

This paper proposes an IP(Internet Protocol) multicast routing method by multiple tree routes. Multiple trees, instead of a single tree, improve the quality of multicast services with nonlinear link cost and huge traffic demand. The proposed method adds tree routes until it satisfies target conditions, and it splits the multicast traffic demand into the chosen tree routes. We develop a mathematical model and optimal conditions for traffic splitting. The method works on the problems with many different simultaneous multicast traffic. Various experiments were carried and the results show that the new multicasting is fairly effective on end-to-end quality of services.

• 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.25 no.10B
• /
• pp.1665-1674
• /
• 2000

This paper treats the interworking of LAN-based networks like TCP over the ATM protocol stack in an ATM multicast session. Multicast connection will cause CIP since multicast group members form a connection tree by some tree methods and share the connected tree. The paper solve the CIP problem through a block-by-block transmission using ABT/IT method. ABT/IT RM cell is modified and block scheduling algorithm considering the traffic types is applied to each ATM switch using the enhanced RM cell. Block scheduling algorithm will avoid the indiscriminate discard of UBR traffic when congestion occurs and it can provide an efficient and fair service. The paper builds a block scheduler system and suggests the block scheduling algorithm for a multicast session in an ATM switch. UBR traffics arriving at the switch trough each VC is classified by the traffic type and stored at class buffer and thereafter indisciminately transmitted. When block scheduling algorithm is applied it will improve the UBR traffic performance such as end-to-end delay cell block loss ration etc. This paper evaluated the performance of block scheduling algorithm through the simulation using the C language and data structure.

• ETRI Journal
• /
• v.24 no.2
• /
• pp.172-175
• /
• 2002

This paper considers a packet-scheduling algorithm for a given combined traffic of unicast and multicast data packets and proposes a hybrid router with several dedicated buses for multicast traffic. Our objective is to develop a scheduling algorithm that minimizes schedule length for the given traffic in the hybrid router. We derive a lower bound and develop an optimal solution algorithm for the hybrid router.