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

• Journal of KIISE:Information Networking
• /
• v.31 no.6
• /
• pp.608-619
• /
• 2004

Application layer multicast(ALM) has been developed as an alternative to support the multi-receiver applications due to the slow deployment of IP multicast. Unlike routers in IP multicast, end systems participating in a ALM session are not optimized for relaying data and have various processing and network capacity. Therefore, with the increased role of end systems, the delay incurred at the end systems occupy large portion of the end-to-end delay. In this paper, we model the end system delay of ALM sessions and analyze its impact on the performance of the existing ALM schemes. Furthermore, we propose an enhanced scheme, based on the existing mesh-based scheme, which reflects the end system delay We also evaluate the performance of the proposed scheme by simulation and show that it reduces the end-to-end delay compared with the existing scheme.

• The KIPS Transactions:PartB
• /
• v.11B no.3
• /
• pp.361-368
• /
• 2004

This paper proposes an interactive VOD system to serve truly interactive VCR services using multicast delivery, client buffer and web-caching technique which implements the distributed proxy in Head-End- Network(HNET). This technique adopts some caches in the HNET that consists of a Switching Agent(SA), some Head-End-Nodes(HEN) and many clients. In this model, HENs distributively store the requested video under the control of SA. Also, client buffer dynamically expands to support various VCR playback rate. Thus, interactive services are offered with transmitting video streams from network, HENs and stored streams on buffer. Therefore this technique makes the load of network occur In the limited area, minimizes the additional channel allocation from server and restricts the transmission of duplicated video contents

• 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.28 no.12B
• /
• pp.1100-1105
• /
• 2003

In this paper, we propose a solution, called DQDMR, for generating delay-constrained bandwidth- appropriated multicast routing trees to reduce end-to-end delay and conserved bandwidth resources. At the current router system the router keep the information of link which neighboring node in the routing table to guarantee QoS(Quality of Service). When we construct multicast tree, DQDMR algorithm dynamically adjusts the path in the least delay and appropriate bandwidth. Through simulations comparing to another multicast algorithms, we reach a conclusion that DQDMR algorithm can simply and dynamically adjusts the construction of multicast tree in hight-speed and conserve bandwidth resources.

• Journal of Korea Multimedia Society
• /
• v.17 no.9
• /
• pp.1084-1091
• /
• 2014

When demand for transmitting multimedia data increases, network congestion is more likely to occur and users will suffer high loss rate as well as high delay. In order to enhance quality-of-service (QoS) of video multicasting, we need to raise transmission reliability and reduce end-to-end delay. This paper proposes a routing mechanism for a OpenFlow-based small-scale network in order to multicast video reliably with low delay. In our method, multipath routing will be applied to Multiple Description (MD) Coded video to exploit its multi-description property. Through performance evaluation, our method shows improvement on loss rate, delay and video distortion.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2001.11a
• /
• pp.335-354
• /
• 2001

.Next Generation Multimedia Streaming Technology Massive Scale Support $\rightarrow$ Clustered Solution Adaptive to Heterogeneous Network daptive to Heterogeneous Terminal Capability Presentation Technique .SMART Server Architecture .HERMES File System .Clustered Solution . High Speed Storage Interconnect .' Content Partitioning . Load Management . Support for Heterogeniety . Adaptive End to End Streaming Transport: Unicast vs. Multicast '. Scalable Encoding

• The KIPS Transactions:PartA
• /
• v.13A no.2 s.99
• /
• pp.147-156
• /
• 2006

Recently, streaming service accounts for large part of internet traffic and it is becoming the most popular service. Because of P2P's scalability, P2P-based streaming system is proposed. There are frequent leave and join of a node. To overcome the group dynamics, Multiple Multicast Trees Methods were suggested. However, since they did not consider discrepancy in peers' capacity, it may cause the trees to be long and unstable. So we suggest Resilient Capacity-Aware Multicast Tree construction scheme (R-CAT) that promotes superior peer to upper position in the tree and construct more stable and short multicast trees. By simulation we can show that R-CAT cost more overhead packets for tree joining process, but it reduce the end-to-end delay of the resulting tree and the number of packets lost during the node joining and leaving processes much more than SplitStream.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.1B
• /
• pp.27-38
• /
• 2005

IP Multicast has not been deployed because of hardware problems. So a new scheme that is called Overlay Multicast for group communication has been emerged. It supports IP Multicast functions, which is located on application level. For developing it, we have been focused on efficient overlay tree construction among group members with low stretch and stress. However, we should consider a variety of transmission or receipt condition since a real internet environment has users with various transmission/receipt rates. Thus, we make one-time source specific tree depending on required bandwidth informationof group members when a member requests data transmission. Our mechanism provides satisfied data quality limited maximum transmission rate of the source to each group members. Furthermore, we manage a large group enough as distributing control information to cores that are designated membersfor maintaining host member information. Lastly, we prove that our tree guarantees data quality to each group members, and show low tree consruction time is required. In addition, for evaluating group scalability, we analyze control information increasing rate via group size, and validate its scalability.