• Title/Summary/Keyword: Video Multicast

Search Result 152, Processing Time 0.023 seconds

A Study on the Traffic Agent System Using Unicast Method and P2P (유니캐스트 방식과 P2P를 응용한 트래픽 에이전트 시스템에 관한 연구)

  • Kim Hyun-Ki;Kim Song-Young;Cho Dae-Jea
    • Journal of Korea Multimedia Society
    • /
    • v.8 no.5
    • /
    • pp.707-741
    • /
    • 2005
  • In the multimedia streaming technology, the unicast method require additional cost by an increase traffic according to increase a number of users. The multicast method can solve this problem, but it don't have connection and control information of clients. Now, the most routers support only unicast. Also it has a problem with an exchange of service in other ISP. This paper proposes traffic agent system which is applied unicast and P2P(Peer to Peer) for distance video teaming to overcome this problem. The proposed system decrease the traffic of stream server by control agent, and cut down expenses of network. This system is tested under the distance video leaning using JMF and application software.

  • PDF

A Study on QoS Improvement for Overlay Multicast Using Modified Dijkstra Algorithm (변형된 Dijkstra 알고리즘을 활용한 오버레이 멀티캐스트 QoS 향상 기법 연구)

  • Lee, Hyung-Ok;Nam, Ji-Seung;Park, Jun-Seok
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.14 no.7
    • /
    • pp.3468-3473
    • /
    • 2013
  • Conditions that overlay multicast tree must satisfy for the real-time application system of a video-conference, an internet broadcasting is two things. First, the degree of nodes in a tree must be proper value. Second, the diameter of the multicast tree, distance between longest two users should be short. If the path between two users in the tree is long, the delay time in data transmission between two users great. So, it is not suitable to the application system such as video-conferences. In this paper, the cost of the dijkstra algorithm calculate with proposed score-function through checking the extra bandwidth, the delay and the requested bandwidth. It is composed the tree through the dijkstra algorithm.

ATM Multicast Cell Scheduling for Parallel Multicast Packet Switch (병렬 멀티캐스트 패킷스위치에서의 ATM 멀티캐스트 셀 스케쥴링)

  • 허영민;김진천
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 1998.11a
    • /
    • pp.472-482
    • /
    • 1998
  • 오늘날의 통신서비스들은 음성이나 데이터 서비스와 같은 전통적인 서비스 뿐만 아니라 비디오 서비스와 같은 대량의 데이터를 전송해야만 하는 멀티미디어 서비스를 포함한다. 이러한 요구를 수용하기 위해서 BISDN(Broadband Integated Digital Network)이 개발되었고 이의 기반 기술로 ATM이 채택되었다. 다양한 멀티미디어 응용들 중에서 VOD(Video On Demand), 화상회의 등은 데이터를 동시에 여러 목적지로 보내는 멀티캐스트 특성이 있다. 그러므로 멀티캐스트 능력은 멀티미디어 통신에서 매우 중요하다. 본 논문에서는 링망을 이용한 병렬 멀티캐스트 패킷스위치(Parallel Multicast Packet Switch with Ring Network: PMRN)에서의 분리된 HOL을 이용한 멀티캐스트 셀 스케줄링 기법을 제안한다. 이 기법은 입력버퍼의 앞단에 멀티캐스트 셀과 유니캐스트 셀을 위한 분리된 HOL을 두고 non-FIFO방식을 사용함으로서 입력버퍼 내에서 전송 가능한 멀티캐스트 셀과 유니캐스트 셀을 동시에 스케쥴링할 수 있도록 하여 입력버퍼 내에서의 지연을 감소시키고 링망과 일대일 연결 네트워크의 이용율을 높이며 스위치의 처리율을 높일 수 있다.

  • PDF

Overlay Multicast Standard Technologies and Application (오버레이 멀티캐스트 표준 기술 및 응용)

  • Jung, Ok-Jo;Kwon, Eui-Yeon;Park, Ju-Young;Kang, Shin-Gak
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • v.9 no.2
    • /
    • pp.528-530
    • /
    • 2005
  • Multicast is an efficient technology for internet video conference, internet live broadcast, data delivery and news services, and especially RMCP, which is a kind of overlay multicast, operates on network independently. It is considered to be deployed current internet network immediately. This paper describes various services using RMCP standard technology which is developed in ITU-T.

  • PDF

A Design of SVC Multicast Mechanism (SVC 멀티캐스트 메커니즘에 관한 설계)

  • Gao, Hui;Lee, Hyung-ok;Kwag, Young-wan;Nam, Ji-seung
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2011.11a
    • /
    • pp.573-576
    • /
    • 2011
  • Research on 4A(Any-time, Any-where, Any-device, Any-contents) services for the next-generation multimedia services is developed with the trend of the integration of wire and wireless networks and the convergence of telecommunications and broadcasting. In this paper we proposed a design of SVC(Scalable Video Coding) overlay multicast mechanism which can provide typical next-generation multimedia services such as SVC streaming. A novel overlay multicast algorithm called ACK-Flow tree optimization algorithm is proposed to guarantee SVC streaming with high efficiency.

A Restricted retransimission Mechanism for Error Recovery in a Multicast Group (멀티캐스트 그룹에서의 오류 회복을 위한 재전송 제한 기법)

  • Kim, Eun-Suk;Choe, Jong-Won
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.26 no.8
    • /
    • pp.957-965
    • /
    • 1999
  • 그룹간 공동 작업이나 화상 회의와 같은 그룹 통신의 수요가 늘어나면서 멀티캐스팅을 이용한 효율적인 데이타 전송에 대한 요구가 증가하고 있다. 특히 오디오나 비디오 데이타와는 달리 공동 문서 작업이나 그룹간 문서 전송을 위한 데이타 처리를 위해서는 어느 정도의 시간 손실이 있더라도 신뢰성을 보장할 수 있는 멀티캐스트 프로토콜이 요구된다. 그러나 멀티캐스트 전송에서의 신뢰성을 보장하기 위하여 손실 패킷에 대한 재전송 패킷이 전체 그룹으로 멀티캐스트 되는 것은 네트워크 상에 트래픽을 폭증시키는 요인이 된다. 이에 본 논문에서는 지역 그룹에서의 오류 회복을 위한 재전송 제한 기법을 제안하여 손실 패킷의 재전송 과정에서 발생하는 트래픽의 폭주를 제어하고자 한다. 이것은 재전송 패킷이 중복없이 다중 수신자에게 전송될 수 있도록 하여 그룹 내의 재전송 패킷의 양을 줄이고 필요없는 중복 패킷이 네트워크의 효율을 저하시키는 것을 방지하고자 하는 데 그 목적이 있다. Abstract As the size and the geographic span of communication groups increases, efficient data transmission schemes using Multicast service become more and more essential. Especially, unlike audio and video applications, for some collaborative applications and other data delivery components which require ordered and lossless delivery of data, Reliable Multicast Service is needed to ensure consistent presentation across multiple views. Thus error recovery by retransmission of loss data is provided in order to guarantee the reliability of multicast transmission protocol. However, redundant retransmission packets by multicast may cause traffic implosion on the Internet and it can be aggravated with continuous retransmission.This paper describes a Restricted Retransmission Mechanism as an error recovery method of multicast service in a local group, which can handle traffic implosion in retransmission process. It reduces redundant retransmission packets flowing into a local group and supports reliable multicast transmission. The goal of this mechanism is to reduce retransmission packets and decrease the load for group members and networks.

Resource Reallocation Algorithm for Layered Video Multicast (계층적 비디오 멀티캐스트를 위한 자원 재할당 알고리즘)

  • Yun, Jiun;Park, Dong Chan;Hwang, Sung Sue;Kim, Min Ki;Kim, Suk Chan
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.39A no.5
    • /
    • pp.293-301
    • /
    • 2014
  • It has been grown interests ot the convergence services about broadcasting and multicasting services such as Mobile IPTV. It needs the efficient scheduling and resource allocation algorithm because video contents have the large data. This paper proposes the resource allocation algorithm for the layered-encoded video coding in the multicasting services. Existing approaches only deal with the utility maximization in the current video frames. However, these algorithms have a problem for the Quality of Services(QoS) if the user's channel states are not good. We apply the delay constraint and find to maximize the utility values using the current content's frames and already assigned content's frames within the constraint periods. The performance of the proposed algorithm is evaluated by the higher layer transmission rates compared the existing algorithm and significantly improved for the QoS.

Determination of Reserved Channel Capacity for Popular Videos in Video-on-Demand Systems (주문형 비디오 시스템에서 인기 비디오를 위한 예약 채널 용량의 결정)

  • 하숙정;배인한
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.5_6
    • /
    • pp.223-231
    • /
    • 2003
  • Video-on-Demand (VOD) service needs high resource consumption because of high bandwidth and long playback duration which are characteristics of multimedia. Various techniques such as Patching and Channel-Reserving Patching have been proposed to reduce the demand on the network-I/O bandwidth. Patching allows new clients to join an existing multicast for realization of true VOD, and Channel-Reserving Patching reserves the part of total channel capacity of video server in order to serve the requests for popular videos on which requests of users concentrate. To improve the performance of Channel-Reserving Patching, we propose the method that determines the reserved channel capacity of video server for the popular videos in this paper. The performance of our method is evaluated in terms of average servile latency, defection ratio and fairness through simulation, and is compared with those of Patching and another Channel-Reserving Patching.

View-switchable High-Definition Multi-View Broadcasting over IP Networks (IP 네트워크에서 시점전환이 가능한 고화질 다시점 방송 시스템)

  • Lee, Seok-Hee;Lee, Ki-Young;Kim, Man-Bae;Han, Chung-Shin;Yoo, Ji-Sang;Kim, Jong-Won
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.13 no.4
    • /
    • pp.205-212
    • /
    • 2007
  • In this paper, we present a prototype of view-switchable high-definition (HD) multi-view video transmission system. One of the major bottlenecks for the multi-view broadcasting system has been the hardware cost and transmission bandwidth. The proposed system focuses on software-based design, transmission over IP multicast networks, and flexible system configuration to address aforementioned problems. In the proposed system, we implement software stereo HD multiplexing, demultipiexing and decoding, and take advantage of high-speed broadband convergence networks to deliver HD video in real-time. Moreover, the proposed system can be scalable and flexible in terms of the number of views. Furthermore, in order to display any multiview video on 3D display monitor, a face tracking system is integrated to our system. Therefore, users can watch the different stereoscopic video at its related locations.

An Mechanism to Support IP Multicast over ATM Network (ATM망에서의 IP 멀티캐스트 지원 메커니즘)

  • 안광수
    • 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.

  • PDF