• Title/Summary/Keyword: real-time multicast

Search Result 112, Processing Time 0.025 seconds

Maximization of Path Reliabilities in Overlay Multicast Trees for Realtime Internet Service (실시간 인터넷 서비스를 위한 오브레이 말티케스트 트리의 패스 신뢰성 최대화)

  • Lee, Jung-H.;Lee, Chae-Y.
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.33 no.2
    • /
    • pp.103-114
    • /
    • 2008
  • Overlay Multicast is a promising approach to overcome the implementation problem of IP multicast. Real time services like Internet broadcasting are provided by the overlay multicast technology due to the complex nature and high cost of IP multicast. To reduce frequent updates of multicast members and to support real time service without delay, we suggest a reliable overlay multicast tree based on members' sojourn probabilities. Path reliabilities from a source to member nodes are considered to maximize the reliability of an overlay multicast tree. The problem is formulated as a binary integer programming with degree and delay bounds. A tabu search heuristic is developed to solve the NP-complete problem. Outstanding results are obtained which is comparable to the optimal solution and applicable in real time.

Multicast Tree to Minimize Maximum Delay in Dynamic Overlay Network

  • Lee Chae-Y.;Baek Jin-Woo
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.05a
    • /
    • pp.1609-1615
    • /
    • 2006
  • Overlay multicast technique is an effective way as an alternative to IP multicast. Traditional IP multicast is not widely deployed because of the complexity of IP multicast technology and lack of application. But overlay multicast can be easily deployed by effectively reducing complexity of network routers. Because overlay multicast resides on top of densely connected IP network, In case of multimedia streaming service over overlay multicast tree, real-time data is sensitive to end-to-end delay. Therefore, moderate algorithm's development to this network environment is very important. In this paper, we are interested in minimizing maximum end-to-end delay in overlay multicast tree. The problem is formulated as a degree-bounded minimum delay spanning tree, which is a problem well-known as NP-hard. We develop tabu search heuristic with intensification and diversification strategies. Robust experimental results show that is comparable to the optimal solution and applicable in real time

  • PDF

Path Level Reliability in Overlay Multicast Tree for Realtime Service

  • Lee, Chae-Y.;Lee, Jung-H.
    • Proceedings of the Korean Operations and Management Science Society Conference
    • /
    • 2006.11a
    • /
    • pp.312-315
    • /
    • 2006
  • Overlay Multicast is a promising approach to overcome the implementation problem of IP multicast. Real time services like internet broadcasting are provided by overlay multicast technology due to the complex nature of IP multicast and the high cost to support multicast function. Since multicast members can dynamically join or leave their multicast group, it is necessary to keep a reliable overlay multicast tree to support real time service without delay. In this paper, we consider path level reliability that connects each member node. The problem is formulated as a binary integer programming which maximizes the reliability of multicast tree. Tabu search based algorithm is presented to solve the NP-hard problem.

  • PDF

Multicast Algorithm of Multimedia data over Heterogeneous User Environment (상이한 사용자 환경을 고려한 멀티미디어 데이터의 멀티캐스트 알고리즘)

  • Lee, Seung-Ha;Na, Yun-Ju;Kim, Sung;Nam, Ji-Seung;Jun, Hyung-Kook;Jo, Chang-Sik
    • 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.

  • PDF

A new mobile multicast scheme for real-time communication (실시간 통신을 위한 새로운 이동 멀티캐스트 방안)

  • Nam Sea-Hyeon
    • Proceedings of the IEEK Conference
    • /
    • 2004.06a
    • /
    • pp.253-256
    • /
    • 2004
  • A new multicast scheme for mobile nodes is proposed to support real-time communication in a more efficient way. In the proposed multicast scheme, the Explicit multicast (Xcast) is integrated with the Session Initiation Protocol (SIP). The proposed scheme reduces unnecessary network traffic and achieves low latency of packets in the network.

  • PDF

Application Layer Multicast Tree Constructing Algorithm for Real-time Media Delivery (실시간 미디어 전송을 위한 응용계층 멀티캐스트 트리 구성 알고리즘)

  • Song Hwangjun;Lee Dong Sup
    • 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.

Real-time Overlay Video Multicast System (실시간 동영상 오버레이 멀티캐스트 시스템)

  • Kang, Ho-Jong;Song, Hwang-Jun;Min, Kyung-Won
    • 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.

A Scheme to Support a Low-delay Multicast Service on Differentiated Services Network (차별화 서비스 망에서 low-delay 멀티캐스트 서비스 제공 방안)

  • 문영성;조승윤;정병철
    • Journal of Internet Computing and Services
    • /
    • v.2 no.2
    • /
    • pp.23-36
    • /
    • 2001
  • To support real-time multicast, the existing DS network may use the EF PHB for transmission, However, because of the dynamic characteristics of the multicast flow and the features of the EF PHB. it is very difficult to make a provision of resources or to manage the network when EF multicast flows increase, Also, the existing LBE PHB can not guarantee the transmission delay bounds required for the real-time multicast traffic, In this paper. a new concept of PHB. namely, low-delay multicast PHB, that may guarantee approximately the per-hop delay is proposed, For the low-delay multicast PHB, router architectures are devised, The queue management algorithm on a low-delay multicast queue and a scheduling method are also devised. This new architecture of the LDM AF class is simple to be implemented.

  • PDF

Hybrid Monitoring Scheme for End-to-End Performance Enhancement of Real-time Media Transport (실시간 미디어 전송의 종단간 성능 향상을 위한 혼성 모니터링 기법)

  • Park Ju-Won;Kim JongWon
    • 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.

Overlay Multicast Tree Construction Algorithm for Synchronized Real-time Media Multicast Service over the Internet (동기화된 실시간 미디어 멀티캐스트 서비스에 적합한 오버레이 멀티캐스트 트리 구성 알고리즘)

  • Joo, Hyun-Chul;Song, Hwang-Jun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.11A
    • /
    • pp.1037-1043
    • /
    • 2006
  • This work presents an effective overlay multicast tree construction algorithm for synchronized real-time media multicast service over the Internet. The proposed algorithm is designed to minimize delay variance among group members to provide the synchronized service as well as average delay of group members in order to support the service in real-time. Basically, of orthogonal genetic algorithm is employed to obtain the near optimal tree with a low computational complexity since the given problem is NP-complete. Finally, experimental results are provided to show the superior performance of the proposed algorithm.