• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.12 no.6
• /
• pp.93-112
• /
• 2002

Since the multicast group which is composed of various members is dynamic, members of the group frequently join or leave. So, for a new session, group keys are efficiently updated and distributed. In this paper, we describe very simple and new efficient logical key hierarchy(ELKH) protocol which is based on an one-way function. In the previous schemes, when the group controller distributes new created keys or updated keys to the members the information is usally encryted and then transmited over a multicast channel. But ELKH secretes the multicast message by using the one-way function and XOR operator instead of encrypting it. Hence our main construction improves the computational efficiency required from the group controller and group memebers while doesn't increase size of re-keying message when compared to $EHBT^{[12]}$. Assuming the security of an underlying one-way function, we prove that our scheme satisfies forward secrecy and backward secrecy.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.21 no.11
• /
• pp.2886-2896
• /
• 1996

The Type of Service based multicast routing algorithm is necessary to support efficiently herogeneous applications in ATM network. In this paper I propose the Constrained Multicast Tree with Virtual Destination(DMTVD) heuristic algorithm as least cost multicast routing algorithm. The service is categorized into two types, as delay sensitive and non in CMTVD algorithm. For the delay sensitive service type, the cost optimized route is the Minimum Cost Stenier Tree connecting all the destination node group, virtual destination node group and source node with least costs, subject to the delay along the path being less than the maximum allowable end to end delay. The other side for the non-delay sensitive service, the cost optimized route is the MCST connecting all the multicast groups with least costs, subject to the traffic load is balanced in the network. The CMTVD algorithm is based on the Constrained Multicasting Tree algorithm but regards the nodes branching multiple destination nodes as virtural destination node. The experimental results show that the total route costs is enhanced 10%-15% than the CTM algorithm.

• Journal of KIISE:Information Networking
• /
• v.29 no.2
• /
• pp.197-203
• /
• 2002

This paper proposes a new agent based mechanism called a Multicast Handoff Agent (MHA) to reduce handoff latency for IP multicast. The MHA acts as a proxy for an Internet Group Management Protocol (IGMP) of Mobile Nodes (MNs) at each Base Station (BS) and keeps information for members of multicast groups in a cell. When an MN moves to a next cell, the MHA immediately sends unsolicited reports without waiting for the IGMP query. The mechanism was evaluated through simulation and analysis and compared with the IGMPv2 for micro-mobility and the IGMP traffic. Simulation results show that handoff latency for micro-mobility can be largely reduced and the IGMP control traffic on the wireless links during the duration of membership can be eliminated. Thus, this mechanism is superior to the existing mechanism in both micro-mobility and battery duration, as the need not to reply to a query conserves battery power.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.11 no.9
• /
• pp.3495-3501
• /
• 2010

Because the application simultaneously to transmit large amounts of data (Video conferencing, Internet broadcasting, Online games etc.) to multiple users increases, the importance and utilization of group communication was greater. So the security was recognized as a important issue. To provide security in multicast environment, A study of single group management server using protocol based on Key Tree Scheme was proposed. But the paper proposes secure group key management scheme to be a relatively low-overhead. Therefore proposed paper is demonstrated to be excellent by comparing the effectiveness of existing and proposed group key management scheme.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.42 no.10 s.340
• /
• pp.9-16
• /
• 2005

The growth of the Internet over the last several years has placed a tremendous strain on the high bandwidth Hence, the amount of internet traffic has risen sharply and it has demanded to use the limited resource. MPLS (Multiprotocol Label Switching) is regarded as a core technology for migrating to the next generation Internet. It is important to reduce the number of labels and LSP(Label Switched Path)s for network resource management. In this thesis, we considered an MPLS multicast mechanism in the current Internet. The scalability problem due to lack of labels and multicast property is one of the serious problems in MPLS multicast mechanism, we proposed a Label Aggregation algorithm that the multicast packets on same link in MPLS allocates the same label for the scalability problem. In order to support the proposed algorithm we defined a new LDP(Label Distribution Protocol) multicast field and multicast packet is copied and transmitted for multicast group links of next node in LSR(label Switch Router).

• Proceedings of the IEEK Conference
• /
• 2001.06c
• /
• pp.125-128
• /
• 2001

Nowadays, Internet users are widespread internationally. Fallowing the users requirements, server has to transfer real-time multimedia data to many clients. Multicast can significantly reduce the system overhead and the network resource waste, so it supports efficient mechanism when server has to transfer same data to many clients. We can deliver multimedia data transfer in real-time using Patching Algorithm which has no delay for service request. And multicast algorithm can support different network bandwidth using Receiver driven Layered Multicast under heterogeneous environment network. The purpose of this paper is to suggest an algorithm that can create new multicast group adequately and transfer real-time multimedia data efficiently under heterogeneous environment.

• ETRI Journal
• /
• v.28 no.4
• /
• pp.517-520
• /
• 2006

In this letter, a new sharing mechanism, SRLG sharing, is proposed, which allows the links of the same shared risk link group (SRLG) in a primary light tree to share protections in WDM optical networks. In previous studies, how to share spare resources with SRLG constraints has not been studied in multicast optical networks. In this letter, considering SRLG sharing, we propose a novel algorithm -multicast with SRLG sharing (MSS)- to establish a protection light tree. Finally, the algorithm MSS and the algorithm multicast with no SRLG sharing (MNSS) are compared through a simulation to show that our new sharing scheme of SRLG sharing is more efficient than that of no SRLG sharing in terms of spare resource utilization and blocking probability.

• The Journal of Society for e-Business Studies
• /
• v.7 no.1
• /
• pp.66-74
• /
• 2002

Through the increment of requirement for EC(Electronic Commerce) oriented communication services, security multicast communications is becoming more important. However, multicast to EC environment is much different from unicast concept most network security protocols. On the network security, using mandatory access control of multilevel architecture which assigns a specific meaning to each subject, so we accomplish access control. In this way, access control security based on the information security level is proposed. A security protocol based on the architecture proposed in this paper would be utilized in security multicast communications, group key management service and leveled security service through multilevel EC security policy, Also we discuss and propose the security level scaleability and key management method on the network.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.3B
• /
• pp.493-503
• /
• 2000

Multicast routing algorithms such PIM, CBT, BGMP use shared multicast routing trees and the location of the multicast tree has great impact on the packet delay. In this pater we propose three new center location algorithms and analyze their performance through simulation studies. these three algorithms consider as candidates for the center not only multicast group members but also a few non-members nodes. To select these non-member nodes, we first find all the shortest paths among every couple of members and consider either nodes which are most frequently visited during the process of finding shortest paths or nodes which lie at the center of a shortest path and are most frequently visited during the same process. There the proposed algorithms are able to find the better center than not only algorithms which consider only member nodes but also other algorithms which consider selected non-member nodes in addition ot member nodes. The proposed algorithms either incur too much overhead nor depend upon unicasting algorithms.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1259-1262
• /
• 2004

Detecting environmental hazards and monitoring remote terrain are among many sensor network applications. In case of fire detection, it is significantly valuable to monitor fire-spot's shape and trend in time. Mobile ad hoc sensor nodes right round are responsible for sensoring, processing and networking packets, or even launching extinguisher. In this paper, we proposed a ring-oriented Multicast architecture based on "Fisheye State Routing" (MFSR) to organize a group of mobile ad hoc sensor nodes in a multicast way. It is familiar with traditional mesh-based multicast protocol [1] in mobile ad hoc network, trying to concentrates on efficiency and robustness simultaneously. Certain applications-based solution for hazards is proposed, quantitative results including architecture and recovery algorithms of MFSR are also investigated in this paper.