• Journal of KIISE:Computing Practices and Letters
• /
• v.5 no.6
• /
• pp.771-781
• /
• 1999

오늘날의 컴퓨팅 환경은 통신 네트워크의 복잡성과 다양한 멀티미디어 서비스 처리를 위해 객체지향 기술을 분산 시스템에 도입하고 통신망을 소프트웨어 계층적 모델로 구조화한 개방형 정보 통신망 구조 연구가 활발히 진행되고 있다. 본 논문은 분산환경에서 멀티미디어 스트림 데이타를 전송하기 위한 아키텍쳐에 관한 모델의 설계 및 구현에 관한 것으로 분산 환경에서 멀티미디어 스트림 데이타를 효율적으로 전송할 수 있는 구조를 제시하고 있다. 설계한 구조는 Point-to-Point와 멀티캐스트를 지원하며 컴퓨터 통신망에서 멀티캐스트 연결을 효율적으로 관리하고 추후 기능 확장 및 기능 변경이 용이하도록 모듈화하고 유연성을 가지는 연결 관리 구조를 설계하고 구현하였다. 신호기능은 CORBA(Common Object Request Broker Architecture)의 ORB를 이용하여 실현하였으며, 데이타 전송 기능은 TCP/IP연결을 이용하였다. 이렇게 신호처리 부분과 데이타 전송 부분을 독립적으로 만들어서 하부망 기술에 독립적인 연결 관리 구조를 채택하고 있으므로 향후 다른 환경에서도 신호처리 부분을 그대로 적용할 수 있다. 분산 객체 개념을 적용하여 연결 관리 기능을 분산 객체화 하였으며 각 분산 객체간 인터페이스를 OMG(Object Management Group) IDL(Interface Definition Language)로 정의함으로써 유연성을 갖도록 하였다.AbstractThis paper proposes communication service architecture to support dynamic communication configuration and multiple connection management which are required to handle a variety of multimedia multicast application. Our communication service architecture was designed to fulfil the objectives as the following:- To build a common networking system for various multimedia multicast services- To build a platform for rapid service development and provisioning- To provide service networking independent on transport network technologiesWe implemented communication service architecture based on Common Object Request Broker Architecture (CORBA) for multimedia multicast applications. Our communication service architecture is distributed and object-oriented for extensibility and easy modification. The interfaces between the distributed objects are specified in (Object Management Group) OMGs Interface Definition Language.

• Journal of Communications and Networks
• /
• v.9 no.3
• /
• pp.296-311
• /
• 2007

Mobile multi-robot teams are useful in many critical applications such as search and rescue. Explicit communication among robots in such mobile multi-robot teams is useful for the coordination of such teams as well as exchanging data. Since many applications for mobile robots involve scenarios in which communication infrastructure may be damaged or unavailable, mobile robot teams frequently need to communicate with each other via ad hoc networking. In such scenarios, low-overhead and energy-efficient routing protocols for delivering messages among robots are a key requirement. Two important primitives for communication are essential for enabling a wide variety of mobile robot applications. First, unicast communication (between two robots) needs to be provided to enable coordination and data exchange. Second, in many applications, group communication is required for flexible control, organization, and management of the mobile robots. Multicast provides a bandwidth-efficient communication method between a source and a group of robots. In this paper, we first propose and evaluate two unicast routing protocols tailored for use in ad hoc networks formed by mobile multi-robot teams: Mobile robot distance vector (MRDV) and mobile robot source routing (MRSR). Both protocols exploit the unique mobility characteristics of mobile robot networks to perform efficient routing. Our simulation study show that both MRDV and MRSR incur lower overhead while operating in mobile robot networks when compared to traditional mobile ad hoc network routing protocols such as DSR and AODV. We then propose and evaluate an efficient multicast protocol mobile robot mesh multicast (MRMM) for deployment in mobile robot networks. MRMM exploits the fact that mobile robots know what velocity they are instructed to move at and for what distance in building a long lifetime sparse mesh for group communication that is more efficient. Our results show that MRMM provides an efficient group communication mechanism that can potentially be used in many mobile robot application scenarios.

• Journal of Internet Computing and Services
• /
• v.3 no.5
• /
• pp.87-94
• /
• 2002

This paper proposes a group key management protocol for a secure of all the multcast user in PIM-SM multicast group communication. Each subgroup manager gives a secure key to it's own transmitter and the transmitter compress the data with it's own secure key from the subgroup manager, Before the transmitter send the data to receiver, the transmitter prepares to encrypt a user's service by sending a encryption key to the receiver though the secure channel. after checking the user's validity through the secure channel, As the transmitter sending a data after then, the architecture is designed that the receiver will decode the received data with the transmitter's group key, Therefore, transmission time is shortened because there is no need to data translation by the group key on data sending and the data transmition is possible without new key distribution at path change to shortest path of the router characteristic.

• Journal of KIISE:Information Networking
• /
• v.30 no.3
• /
• pp.329-342
• /
• 2003

Most of the existing multicast routing protocols for ad-hoc networks do not take into account the efficiency of the protocol for the cases when there are large number of sources in the multicast group, resulting in either large overhead or poor data delivery ratio when the number of sources is large. In this paper, we propose a multicast routing protocol for ad-hoc networks, which particularly considers the scalability of the protocol in terms of the number of sources in the multicast groups. The proposed protocol designates a set of sources as the core sources. Each core source is a root of each tree that reaches all the destinations of the multicast group. The union of these trees constitutes the data delivery mesh, and each of the non-core sources finds the nearest core source in order to delegate its data delivery. For the efficient operation of the proposed protocol, it is important to have an appropriate number of core sources. Having too many of the core sources incurs excessive control and data packet overhead, whereas having too little of them results in a vulnerable and overloaded data delivery mesh. The data delivery mesh is optimally reconfigured through the periodic control message flooding from the core sources, whereas the connectivity of the mesh is maintained by a persistent local mesh recovery mechanism. The simulation results show that the proposed protocol achieves an efficient multicast communication with high data delivery ratio and low communication overhead compared with the other existing multicast routing protocols when there are multiple sources in the multicast group.

• Proceedings of the Korean Institute of Communication Sciences Conference
• /
• 2004.11a
• /
• pp.183-183
• /
• 2004

• The Journal of Information Technology
• /
• v.4 no.4
• /
• pp.65-72
• /
• 2001

This paper investigates the Performance of MSA l (group partition based reservation scheduling algorithm) and MSA ll (group based reservation scheduling algorithm) for multicast service in single-hop WDM networks. Simulation results show that MSA l produces lower mean packet delay than MSA ll when the channel resource is sufficient. However, when the channel resource is limited, MSA ll produces lower mean packet delay than MSA I when traffic load is heavy.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.1
• /
• pp.35-40
• /
• 2019

It is important to constantly provide service in real-time multimedia applications using multicast. Transmission path reconstruction occurs in hybrid multicast using Internet Protocol (IP) multicast and ALM in order to adapt the network status to things like congestion. So, there is a problem in which real-time QoS is reduced, caused by an increase in end-to-end delay. In this paper, we want to solve this problem through multi-layer transmission path construction. In the proposed method, we deploy the control server and application layer overlay host (ALOH) in each multicast domain (MD) for hybrid multicast construction. After the control server receives the control information from an ALOH that joins the MD, it makes a group based on the hop count and sends it to the ALOH in each MD. The ALOH in the MD performs the role of sending the packet to another ALOH and constructs the multi-layered transmission path in order of priority by using control information that is received from the control server and based on the delay between neighboring ALOHs. When congestion occurs in, or is absent from, the ALOH in the upper MD, the ALOH selects the path with the highest priority in order to reduce end-to-end delay. Simulation results show that the proposed method could reduce the end-to-end delay to less than 289 ms, on average, under congestion status.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.44 no.10
• /
• pp.55-63
• /
• 2007

Multicast is an efficient transport mechanism for community communications and MANET is recently regarded as a promising solution for support ubiquitous computing as an underlying network technology. However, it is hard to deploy multicast mechanism into MANET owing to scarce resources in wireless networks and unpredictable changes in network topology. Several multicast mechanisms have been proposed in the literature to overcome the limitations. Especially, overlay multicasting schemes present several advantages over network based multicasting schemes. Yet, the overlay multicasting schemes still introduce redundant data transmissions that waste network bandwidth and battery of relay nodes. As a result the performance of the network is degraded. To reduce the redundancy, we propose an efficient way to construct an overlay structure as a multicast data delivery tree that utilizes a branch node which belongs to the tree. By using network simulation, we show that the proposed scheme presents higher packet delivery ratio and lower transmission cost than previously proposed schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.10B
• /
• pp.630-638
• /
• 2005

As real-time media applications based on IP multicast networks spread widely, the end-to-end QoS (quality of service) provisioning for these applications have become very important. To guarantee the end-to-end QoS of multi-party media applications, it is essential to monitor the time-varying status of both network metrics (i.e., delay, jitter and loss) and system metrics (i.e., CPU and memory utilization). In this paper, targeting the multicast-enabled AG (Access Grid) group collaboration tool based on multi-Party real-time media services, a hybrid monitoring scheme that can monitor the status of both multicast network and node system is investigated. It combines active monitoring and passive monitoring approaches to measure multicast network. The active monitoring measures network-layer metrics (i.e., network condition) with probe packets while the passive monitoring checks application-layer metrics (i.e., user traffic condition by analyzing RTCP packets). In addition, it measures node system metrics from system API. By comparing these hybrid results, we attempt to pinpoint the causes of performance degradation and explore corresponding reactions to improve the end-to-end performance. The experimental results show that the proposed hybrid monitoring can provide useful information to coordinate the performance improvement of multi-party real-time media applications.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2001.10a
• /
• pp.113-116
• /
• 2001

In this paper, a new multicasting scheduling is proposed for WDM single-hop broadcast network. The main idea of traditional multicast scheduling algorithms is partitioning the multicast group into several subgroups to reduce the delay time after receiving previous message. Those partitioning algorithms are grouping method of receivers already tuned to transmitters wavelength. However, multicast scheduling shows better performance by considering the previous status of receivers. Thus, in this paper, a new subgrouping method is proposed to minimize delay through collecting the current status of receivers. This method is operated by using the tunable transceiver in WDM single hop broadcasting network and uses fixed control channel for collecting the status of receivers. In addition, we analyzed the performance of proposed method through the computer simulation and then compared with existing multicast scheduling algorithm.