• The KIPS Transactions:PartC
• /
• v.12C no.2 s.98
• /
• pp.267-280
• /
• 2005

In this paper, we implement and verify XMIP integrating IETF Mobile IP and the Explicit Multicast mechanism for a great number of small group multicast communications. U a source node sends Xcast packets explicitly inserting destination nodes into the headers, each Xcast router decides routes and forwards the packets toward each destination node based on unicast routing table without the support of multicast trees. n is a straightforward and simple multicast mechanism just based on a unicast routing table without maintaining multicast states because of the inheritance from the Explicit Multicast mechanism. This research modifies and extends the functionality of IETF Mobile IP's mobility agents, such as HA/FA to HA+/FA+ respectively, considering interworking with Xcast networks. Xcast packets captured by HA+ are forwarded into X-in-X tunnel interfaces for each FA+ referred to the binding table of HA.. This X-in-X tunneling mechanism can effectively solve the traffic concentration problem of IETF Mobile IP multicast services. Finally WLAN-based testbed is built and a multi-user Instant messenger system is developed as a Xcast application for finally verify the feasibility of the implemented XMIP/Xcast protocols.

• Journal of the Korea Society of Computer and Information
• /
• v.26 no.3
• /
• pp.1-7
• /
• 2021

In this paper, optimized media data retrieval and transmission based on the Hybrid CDN/P2P architecture and selective storage through user's prediction of requestability enable seamless data transfer to users and reduction of unnecessary traffic. We also propose a new media management method to minimize the possibility of transmission delay and packet loss so that media can be utilized in real time. To this end, we construct each media into logical segments, continuously compute weights for each segment, and determine whether to store segment data based on the calculated weights. We also designate scattered computing nodes on the network as local groups by distance and ensure that storage space is efficiently shared and utilized within those groups. Experiments conducted to verify the efficiency of the proposed technique have shown that the proposed method yields a relatively good performance evaluation compared to the existing methods, which can enable both initial latency reduction and seamless transmission.

• Journal of Korea Multimedia Society
• /
• v.6 no.6
• /
• pp.1025-1033
• /
• 2003

The CDN is proposed as a solution of network bottleneck problem resulting from the rapid growth of Internet user and multimedia contents on the Internet. This paper suggests MDC and path diversity between CDN Edge server and end-user, and multicast transmission among CDN servers based on CDN infrastructure. It may be a solution for reliable and fast transmission of rich multimedia contents. These research will support to solve the unreliable transmission problem of multicasting and to create the new business models in the field of web contents.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.11a
• /
• pp.211-214
• /
• 2004

두 시스템간의 MPEG-2 데이터를 전송할 때 발생되는 여러 가지의 지연으로 인하여 데이터를 제때 재생하지 못하는 경우가 발생할 수 있다. 본 논문에서는 이러한 문제점을 보완하기 위하여 전송률을 제어하는 에이전트를 설계하고 네트워크 상태에 따라 MPEG-2의 스케일링 기법(시간적, 공간적 스케일링 기법)을 적용하여 전송률을 조절하는 전송률 제어방식을 제시한다. 특히 공간적 스케일링 기법에서는 충실도에 따라 그룹별로 계층화하는데 있어서 블록의 EOB 위치를 조정하여 MPEG-2 비디오 비트스트림을 네트워크 QoS에 따라 다양한 화질로 전송될 수 있도록 하고 있다.

• Journal of KIISE:Information Networking
• /
• v.36 no.4
• /
• pp.263-274
• /
• 2009

Decentralized group key management mechanisms offer beneficial solutions to enhance the scalability and reliability of a secure multicast framework by confining the impact of a membership change in a local area. However, many of the previous decentralized solutions reveal the plaintext to the intermediate relaying proxies, or require the key distribution center to coordinate secure group communications between subgroups. In this study, we propose a decentralized group key management scheme that features a mechanism allowing a service provider to deliver the group key to valid members in a distributed manner using the proxy cryptography. In the proposed scheme, the key distribution center is eliminated while data confidentiality of the transmitted message is provided during the message delivery process. The proposed scheme can support a secure group communication in dynamic network environments where there is no trusted central controller for the whole network and the network topology changes frequently.

• Journal of Korea Multimedia Society
• /
• v.15 no.3
• /
• pp.372-379
• /
• 2012

This paper presents a group based propagation method for multi-hop transmission, in order to deliver an emergency message to the reasonable size of vehicle troop. A group head is selected in considering of the position information of vehicles and radio transmission range. With benefits of the group based transmission, it is possible to minimize the unnecessary transmissions and the possibility of message collisions. We evaluate the performance of the proposed scheme compared with conventional schemes. Simulation results show that the message propagation performance is so stable regardless of vehicle's congestion degree.

• Journal of KIISE:Information Networking
• /
• v.28 no.1
• /
• pp.143-153
• /
• 2001

본 논문에서는 에드-혹 망의 멀티캐스트 라우팅 프로토콜인 ODMRP(On-Demand Multicast Routing Protocol)를 확장한 PatchODMRP를 제안한다. ODMRP는 네트워크 상에서 멀티캐스트그룹의 송신원으로부터 수신원에 이르는 경로 상에 있는 노드들을 FG(Forwarding Group) 노드로 선출하여 이들이 해당 멀티캐스트그룹에 속하는 패킷을 모두 플러딩하도록 함으로써 멀티캐스트 그룹데이타 전송을 담당하는 메쉬를 구성하도록 하는 방안이다. 그런데 ODMRP는 주기적으로 이 메쉬를 구성하는 FG 노드들을 재 선정하기 때문에 이 주기가 길어지면 메쉬 구성이 네트워크 노드들의 이동성을 따라가지 못해 메쉬분리가 발생하고 데이터가 손실될수 있다. 반면에 이 주기를 짧게 하면 오버헤드가 지나치게 커질수 있다. 특히 송신원의 수가 적은 경우 ODMRP의 메쉬는 매우 성기게 형성되는데 이때 호스트들의 이동성이 크면 메쉬 연결을 유지하기 위하여 이 주기를 짧게 잡아주거나 높은 데이터 손실율을 감수해야한다. 본 논문에서는 이 문제점을 해결하고자 각 FG 노드들이 BEACON 신호를 이용해 자신에 인접한 메쉬에 손실이 발생한 것을 인지하고 이를 국부적인 플러딩을 통하여 빠르게 복구하는 메커니즘을 ODMRP에 추가한 PatchODMRP 방식을 제안한다. 시뮬레이션을 통하여 기존의 ODMRP와 제안하는 PatchODMRP의 성능을 비교한 결과 PatchODMRP가 호스트의 이동성에 훨씬 강하며 ODMRP에 비하여 낮은 오버헤드로 높은 데이터 전송률을 제공할 수 있음을 보여주었다.

• Journal of the Korea Convergence Society
• /
• v.6 no.6
• /
• pp.81-86
• /
• 2015

The threats to privacy and security have received increasing attention as ubiquitous healthcare applications over the Internet become more prevalent, mobile and universal. In particular, we address the communication security issues of access sharing of health information resources in the ubiquitous healthcare environment. The proposed scheme resolves the sender and data authentication problem in information systems and group communications. We propose a novel key management scheme for generating and distributing cryptographic keys to constituent users to provide form of data encryption method for certain types of data concerning resource constraints for secure communications in the ubiquitous healthcare domains.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.5B
• /
• pp.310-316
• /
• 2005

In this paper, we proposed and evaluated ARAH(Adaptive Random Access algorithm for HIPERLAN/2) to improve system performance. In this paper, HIPERLAN/2 uses OFDM(Orthogonal Frequency Division Multiplexing) modulation scheme to select appropriate PHY mode by Radio Channel Quality, Proposed the ARAH scheme uses these 7 PHY mode when mobile terminal determines the RCH(Random CHannel) number for random access. In this paper, these 7 PHY mode divided into two group, good and bad, and will be given high priority to mobile terminals which are in a good group. In the result of performance evaluation. ARAH algorithm, ARAH has a better performance of throughput and delay than existing algorithm.

• Journal of the Korea Society of Computer and Information
• /
• v.8 no.4
• /
• pp.117-125
• /
• 2003

The proposed mechanism has an group management server, which manages the information about both the receivers and the senders. Any receiver can dynamically join/leave the multicast VC. The signaling overload due to group membership changes is not concentrated on the sender, but it is distributed to many receivers for the scalability improvement. The associated signaling messages propagates from the receivers to the ATM switch dedicated to the multicast VC, and hence no signaling overload exists in the shared links there is no latency for the receiver to wait. Our proposed scheme is superior in the view of scalability, the efficiency and the latency to other schemes.