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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.23 no.5
• /
• pp.1241-1248
• /
• 1998

The multicast scheme can improve the efficiency of multimedia retrieval service system, assuming that video transmission speed is faster than the playback rate and the store-and-play scheme. To best exploit the multicast benefits under bandwidth heterogeneous environment, we develop a multicast scheduling algorithm called MTS(Maximum Throughput Scheduling) which tries to maximize the amount of information transferred at each scheduling with subgrouping method. The MTS method compromises the multiple unicast method and the multicast method with lowest transmission rate. we compare the performance of MTS with that of MMS(Most Multicasting Scheduling) and EDS(Earliest Deadine Scheduling) via computer simulation. The performance results show that the MTS requires less number of service handlers to service the same number of subscribers.

• Journal of KIISE:Information Networking
• /
• v.27 no.1
• /
• pp.48-57
• /
• 2000

The need for high bandwidth, very dynamic secure internet multicast communications is increasingly evident in a wide variety of commercial, government, and internet communities. One of the most recently researches is mainly about the group key distribution schemes[1,3,4,5]. In this paper, we survey related group key distribution schemes and propose a new scalable distributed group key distribution scheme which is one of the most important parts in internet multicast environment. Then, we add this scheme to the existing multicast applications and analysis the test results. The proposed SDGD minimizes the times required to distribute and redistribute keys for joining and leaving the multicast group.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.11B
• /
• pp.991-1000
• /
• 2004

This paper presents an application layer multicast tree constructing algorithm to minimize the average time delay from the sender to end-systems for the effective real-time media delivery. Simultaneously, the proposed algorithm takes into account the computing power and the network condition of each end-system as a control variable and thus avoids the undesirable case that loads are concentrated to only several end-systems. The multicast tree is constructed by clustering technique and modified Dijkstra's algorithm in two steps, i.e. tree among proxy-senders and tree in each cluster. By the experimental results, we show that the proposed algorithm can provide an effective solution.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.35 no.4B
• /
• pp.713-720
• /
• 2010

Lately, IPTV is in the limelight using a broadband information service to provide video content and broadcast services. Current IPTV system is combining CAS and DRM system for VOD contents to protect transmitting contents and authentication, but it has drawbacks such as system's complexity and high construction costs. Multicast DRM system emerged as a method to improve them, but, in the multicast DRM system, if the key is intercepted by a malicious user, it can be viewed by an unauthorized user of illegal broadcasting which can be a problem. In this paper, we suggest to protect content from a malicious user by applying the techniques using user authentication in the multicast DRM system.

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

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.1A
• /
• pp.104-113
• /
• 2000

In this paper, we propose a protocol that makes use of a concept of a meta-group based on propagation trees to deal with duplicated members of the same multicast group. It is shown that, if multicast tree is composed ofthese meta-groups, the depth of the tree can be shortened and the ordering of the multicast that communicatesbetween multiple senders and receivers can be easier. In the protocol, we assign a Designated Manager(DM) toeach meta-group and make each DM do the role of the representative receiver of the meta group. In this Paper,the DM's are supposed to handle ACK and retransmission for the members in the same meta group. Hence, theDM's distribute the ACK from senders, and they can reduce the burden of senders by shortening commit delaytime. We also show, through a simulation analysis, that the new multicast protocol outperforms the existing onesnot only in message costs but also in commit delay times.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7C
• /
• pp.733-742
• /
• 2003

Unlikely unicast transmission, there are many elements that threaten security. Thus, key management of creating and distributing group keys to authorized group members is a critical aspect of secure multicast operations. To offer security in multicast environment, the recent researches are related to most group key distribution. In this thesis, we propose a group key management protocol for efficient, scalable, and multicast operation. This proposed protocol architecture can distribute traffic centralized to the key server. since the group key rekeyed by sub-group manager. The detailed simulation compared with other group key management protocol show that the proposed group key management protocol is better for join, leave, and data latency.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10B
• /
• pp.1004-1012
• /
• 2009

Although it is raising expectation of multimedia multicast services in various wireless networks, it requires an efficient IP multicast group membership management in wireless environment. However, the existing IGMPv3/MLDv2 protocols are too heavy; they are not suitable for wireless environment. Moreover they suffer from a number of problems, such as unreliable signaling, slow state transition, low spectral efficiency, bulk report, and interrupting dormant receivers. In this paper, we propose a wireless host agent (WHA)-based IP multicast group management scheme that requires a reduced number of signaling, which also solves such problems effectively. We develop an analytic model to quantify costs of bandwidth usage and signaling overhead, and perform comparison and analysis of the proposed scheme.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1A
• /
• pp.46-54
• /
• 2005

This paper presents an effcient mobile multicast method using the user pattern. We exploit the repetitive movement pattern of mobile node to reduce the total number of experience of graft and join procedure. We defined the locality scope by a movement pattern. While the network is included in the locality scope, the network should maintain a multicast tree even when the mobile node moves to the other network. In this way, the mobile host can receive a multicast service without a delay when it moves to the network in the locality scope later. We compare our scheme with existing schemes under the total signaling cost and the service delay time by using a discrete analytical model for cost analysis. Analytical results demonstrated that the total signaling cost and service delay time was significantly reduced through our proposed scheme.