• Journal of KIISE:Information Networking
• /
• v.32 no.5
• /
• pp.593-602
• /
• 2005

Overlay multicast delivery method is a new approach in which multicast functionality is implemented at the end-hosts application layer in the timing of sparse deployment of IP multicast. However, existing overlay multicast protocols are not being standardization and many restrictions occur when delivering high capacity contents. Therefore, new delivery mechanism is required for the overlay multicast based high capacity contents delivery. In this paper. we separate group management and delivery management of overlay multicast and describe a capable group management. We also defined high speed delivery method better than that of existing overlay multicast through use of collaborated distribute downloading. This improved efficiency of massive contents transmission.

• The KIPS Transactions:PartC
• /
• v.14C no.4
• /
• pp.359-364
• /
• 2007

Current researches on the overlay multicast mechanism in the mobile ad hoc network (MANET) maintain the network topology information of the dynamically changing MANET, which may cause severe overhead. In this paper, we propose a new overlay multicast mechanism, the region-based overlay multicast in MANET(ROME), using the geometric locations of group members. In ROME, the physical topology is divided into small regions and the scope of location updates of group members is limited to a single region. ROME provides scalability by using the coordinate of the center point of a destination region as the destination of a data packet instead of the list of member addresses of that region. Our simulation results show that ROME gives better performance in terms of the packet overhead than other schemes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.2C
• /
• pp.139-147
• /
• 2006

This paper presents an overlay video multicast system over the Internet. The proposed system consists of two parts, i.e. overlay multicast tree suitable for the real-time video delivery and H.263+ rate control adaptive to overlay multicast tree. Overlay multicast tree is constructed to minimize the average time delay of members, and H.263+ rate control pursues a tradeoff between spatial and temporal qualities to enhance the human visual perceptual quality. Two systems are integrated and tested over the real Internet. And experimental results are provided to show the performance of the proposed system.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2006.05a
• /
• pp.1037-1040
• /
• 2006

This paper presents an efficient overlay multicast routing protocol (ROMP) and its architecture. ROMP using GPS and region map stands on the basis of scalable 2-tiered multicast architecture and maintains a global overlay multicast tree through reactive fashion. With this approach, the coarse-grain location-awareness for an efficient overlay multicasting and the determination of hot-spot area for efficient data delivery are feasible. The simulation results show that the localized control packets of ROMP prevent the overlay control packets from squandering the physical network resources.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.1
• /
• pp.171-192
• /
• 2017

The change of any element in the network is possible to cause performance degradation of the multicast network. So it is necessary to optimize the topology path through the multicast update strategy, which directly affects the performance and user experience of the overlay multicast. In view of the above, a new multicast tree update strategy based on perturbation theory Musp (Multicast Update Strategy based on Perturbation theory) is proposed, which reduces the data transmission interruption caused by the multicast tree update and improves user experiences. According to the multicast tree's elements performance and the topology structure, the Musp strategy defines the multicast metric matrix and based on the matrix perturbation theory it also defines the multicast fluctuation factor. Besides it also demonstrates the calculability of the multicast fluctuation factor presents the steps of the Musp algorithm and calculates the complexity. The experimental results show that compared with other update strategies, as for the sensitivity of the multicast fluctuation factor's energized multicast tree to the network disturbance, the maximum delay of the Musp update strategy is minimal in the case of the local degradation of network performance.

• The KIPS Transactions:PartC
• /
• v.15C no.6
• /
• pp.557-566
• /
• 2008

NGN(Next Generation Network) is a communication network which can make use of broadband and QoS-enabled transport technologies. One of the main service issues over NGN is a multimedia service, such as IPTV, using a multicast method. And overlay multicast technology is one of the promising solutions instead of traditional multicast technology which has a few problems, and supports flexibility and scalability for multicast services. Also, the main controversial topic in NGN and overlay multicast is QoS. In the present paper, we designed an agent in each receiver's network, and a manager which is in a source network and which manages the whole multicast network. Both of them are communicating with each other and applying resource policies to their multicast network. This mechanism enables overlay multicast to support QoS, focusing on RACF(Resource and Admission Control Functions) in NGN QoS architecture.

• Journal of Korea Multimedia Society
• /
• v.9 no.3
• /
• pp.315-322
• /
• 2006

In the application rising IP multicast, the waste of available bandwidth occurs of reducing of transmission rate in non-congestion local caused by reducing of transmission rate in congestion local. In this paper, to solve such a problem, we propose a dynamic multicast method using IP multicast and overlay multicast. In proposed method, we elected a local representative for overlay multicasting. When the transmission rate of a group is less than transmission rate threshold, the representative can transmits duplicative packets. In simulation results, it was known that proposed method uses bandwidth more efficiently.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.32 no.1A
• /
• pp.57-65
• /
• 2007

The overlay multicast that has been recently presented as IP alternative for the IP multicast has been getting much persuasion by the computing power of the hardware and the advancement of the network techniques to enforce Routing in application-level. In an overlay multicast, the system resource and the network bandwidth must be utilized efficiently to service real-time HDTV images. Specifically, the system must consider the delay and the jitter that can be incurred at the application-level. In this paper, we implement a server and a client to broadcast HDTV, in the session composed by the existing overlay multicast protocol. The broadcasting server performs the service using a TV tuner, An HDTV camcorder, and files, clients constituting a multicast group relay the received data to other clients. At this time, the information that the clients report periodically, including their delay and the network state, to the server is used as an important information to maintain an overlay session. The implementation is based on the DirectX and its performance is evaluated by the LAN test bed that has been set.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2003.10a
• /
• pp.912-915
• /
• 2003

To support emerging group applications such as network games and Internet live-casting efficiently. IP multicast mechanism is highly needed. But IP multicast still has not been deployed in the current Internet because of its difficulty to manage. Overlay multicast mechanisms are proposed to serve group communications more effectively in the current unicast oriented Internet. In this paper we categorize the proposed ones into topological view point.

• Journal of Communications and Networks
• /
• v.18 no.3
• /
• pp.446-459
• /
• 2016

In this paper, we propose virtual direction multicast (VDM) for video multicast applications on peer-to-peer overlay networks. It locates the end hosts relative to each other based on a virtualized orientation scheme using real-time measurements. It builds multicast tree by connecting the nodes, which are estimated to be in the same virtual direction. By using the concept of directionality, we target to use minimal resources in the underlying network while satisfying users' quality expectations. We compare VDM against host multicast tree protocol.We simulated the protocol in a network simulator and implemented in PlanetLab. Results both from simulation and PlanetLab implementation show that our proposed technique exhibits good performance in terms of defined metrics.