• Title/Summary/Keyword: IP Multicast

Search Result 267, Processing Time 0.037 seconds

Fast Join Mechanism that considers the switching of the tree in Overlay Multicast (오버레이 멀티캐스팅에서 트리의 스위칭을 고려한 빠른 멤버 가입 방안에 관한 연구)

  • Cho, Sung-Yean;Rho, Kyung-Taeg;Park, Myong-Soon
    • The KIPS Transactions:PartC
    • /
    • v.10C no.5
    • /
    • pp.625-634
    • /
    • 2003
  • More than a decade after its initial proposal, deployment of IP Multicast has been limited due to the problem of traffic control in multicast routing, multicast address allocation in global internet, reliable multicast transport techniques etc. Lately, according to increase of multicast application service such as internet broadcast, real time security information service etc., overlay multicast is developed as a new internet multicast technology. In this paper, we describe an overlay multicast protocol and propose fast join mechanism that considers switching of the tree. To find a potential parent, an existing search algorithm descends the tree from the root by one level at a time, and it causes long joining latency. Also, it is try to select the nearest node as a potential parent. However, it can't select the nearest node by the degree limit of the node. As a result, the generated tree has low efficiency. To reduce long joining latency and improve the efficiency of the tree, we propose searching two levels of the tree at a time. This method forwards joining request message to own children node. So, at ordinary times, there is no overhead to keep the tree. But the joining request came, the increasing number of searching messages will reduce a long joining latency. Also searching more nodes will be helpful to construct more efficient trees. In order to evaluate the performance of our fast join mechanism, we measure the metrics such as the search latency and the number of searched node and the number of switching by the number of members and degree limit. The simulation results show that the performance of our mechanism is superior to that of the existing mechanism.

Reliable Hybrid Multicast using Multi-layer Transmission Path (다계층 전송경로를 이용한 신뢰성 있는 하이브리드 멀티캐스트)

  • Gu, Myeong-Mo;Kim, Bong-Gi
    • 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.

A Practical RTP Packetization Scheme for SVC Video Transport over IP Networks

  • Seo, Kwang-Deok;Kim, Jin-Soo;Jung, Soon-Heung;Yoo, Jeong-Ju
    • ETRI Journal
    • /
    • v.32 no.2
    • /
    • pp.281-291
    • /
    • 2010
  • Scalable video coding (SVC) has been standardized as an extension of the H.264/AVC standard. This paper proposes a practical real-time transport protocol (RTP) packetization scheme to transport SVC video over IP networks. In combined scalability of SVC, a coded picture of a base or scalable enhancement layer is produced as one or more video layers consisting of network abstraction layer (NAL) units. The SVC NAL unit header contains a (DID, TID, QID) field to identify the association of each SVC NAL unit with its scalable enhancement layer without parsing the payload part of the SVC NAL unit. In this paper, we utilize the (DID, TID, QID) information to derive hierarchical spatio-temporal relationship of the SVC NAL units. Based on the derivation using the (DID, TID, QID) field, we propose a practical RTP packetization scheme for generating single RTP sessions in unicast and multicast transport of SVC video. The experimental results indicate that the proposed packetization scheme can be efficiently applied to transport SVC video over IP networks with little induced delay, jitter, and computational load.

An Efficient Shared Loaming Scheme for Layered Video Streaming over Application Layer Multicast (응용 계층 멀티캐스트에서 계층형 비디오 스트리밍의 안정성 향상을 위한 효율적인 공유 학습 기법)

  • Park, Jong-Min;Lee, Seung-Ik;Ko, Yang-Woo;Lee, Dong-Man
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.2
    • /
    • pp.181-185
    • /
    • 2008
  • Layered video multicast such as RLM Receiver-driven layered multicast) is a premising technique for delivering streaming video to a set of heterogeneous receivers over ALM(Application Layer Multicast) as well as over IP multicast. However, this approach may suffer from unnecessary fluctuation of video quality due to overlapped and failed join-experiments. Though a shared teaming scheme was introduced to resolve these problems, it may cause high control overhead and slow convergence problem when used with ALM. In this paper, we propose a new shared learning scheme for ALM-based layered video multicast which reduces control overhead and convergence latency while keeping the number of fluctuation reasonably small. The simulation results show that the proposed scheme performs better than an ALM-based layered video multicast with shared learning in terms of control overhead and convergence latency.

A Parallel Transmission Overlay Multicast Scheme for Massive Contents Delivery (대용량 콘텐츠 전송을 위한 병렬전송 오버레이 멀티캐스트)

  • Park, Jin-Hong;;Kim, Seon-Ho;Shin, Yong-Tae;Shin, Seok-Kyoo
    • 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.

A Design and Implementation of Media Gateway for Explicit multicast with Mobile IP (모바일 IP 상에서 명시적 멀티캐스트를 지원하기 위한 미디어 게이트웨이 설계 및 구현)

  • 양정승;박용진;김원태
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2002.10e
    • /
    • pp.433-435
    • /
    • 2002
  • All IP Mobile Network 하에서의 효율적인 멀티캐스트 전송의 필요성이 부각되고있다. Mobile IP프로토콜은 기본적으로 유니캐스트전송을 지원하며, 멀티캐스트 전송에 대해서는 효과적으로 정의하지 못하고 있다. 본 연구는 Mobile IP 망에 명시적 라우팅 프로토콜을 적용할 경우 기존 멀티캐스트 라우팅 도매인과의 연동을 하기 위한 미디어 게이트웨이(MGEM)를 설계하고 개발한다. 기존 멀티캐스트 트래픽을 1:N tunnel 의 특성을 가지는 명시적 멀티캐스트 전송방식을 사용하여 멀티캐스트 패킷을 이동단말들에 전송하기 위해서는 Mobile IP 홈에이젼트가 MGEM으로 확장되어야 하며, 이는 IGMP, SDP, 확장 HA 및 멀티캐스트 라우터 기능을 갖도록 요구된다.

  • PDF

Efficient Multicast Routing Scheme at Mobile Environment using Regional Registration (이동 환경에서의 지역적 등록을 이용한 효과적인 멀티캐스트 라우팅 방법)

  • 박태현;김철순;곽경섭
    • Journal of Korea Multimedia Society
    • /
    • v.6 no.7
    • /
    • pp.1231-1238
    • /
    • 2003
  • As the demand on multicast services increases to support the terminal mobility in the midst of the development of wireless mobile communication technology, many new methods have been studied. However, previous methods occur delay and packet loss during re-joining to multicast service group when moving mobile node. In this paper, we will propose a scheme that decreases packet loss using regional registration method. Proposed scheme modified signaling message of previous regional-registration and added caching. In case move to same GFA, we can prevent packet loss by keeping registration to FA until perfectly registration ends. Also, In case move to other GFA, we can reduce packet loss by using cache. Therefore, we can receive efficient multicast service.

  • PDF

Mobile Multicast Method using the User Pattern (사용자 성향에 기반한 이동 멀티캐스트 기법)

  • Sung Sulyun;Jeon Jinyong;Seo Yuhwa;Shin Yongtae
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.1A
    • /
    • pp.46-54
    • /
    • 2005
  • This paper presents an effcient mobile multicast method using the user pattern. We exploit the repetitive movement pattern of mobile node to reduce the total number of experience of graft and join procedure. We defined the locality scope by a movement pattern. While the network is included in the locality scope, the network should maintain a multicast tree even when the mobile node moves to the other network. In this way, the mobile host can receive a multicast service without a delay when it moves to the network in the locality scope later. We compare our scheme with existing schemes under the total signaling cost and the service delay time by using a discrete analytical model for cost analysis. Analytical results demonstrated that the total signaling cost and service delay time was significantly reduced through our proposed scheme.

Handoff Scheme to support Multicast in IPv6 (IPv6에서 멀티캐스트 지원을 위한 핸드오프 기법)

  • Kim, Ki-Young
    • Journal of the Korea Society of Computer and Information
    • /
    • v.10 no.4 s.36
    • /
    • pp.285-293
    • /
    • 2005
  • Whenever mobile node moves a new domain in multicast environments. Both handoff and join multicast group always occur. These procedures take a much of delay time and lost the packets in flight. Handoff delay is a significant factor fot the QoS of mobile node in mobile environments. In this paper. we propose a new handoff scheme which supports multicast and guarantees a low handoff delay in IPv6. The scheme makes adjacent subnets the member of multicast tree. After that, this eliminates packet loss and reduces the handoff delay time. Simulation shows that the proposed scheme takes a low delay and lower packet loss rate than the remote-subscription scheme.

  • PDF

An Improved Route Optimization Algorithm for RMTP Support in the NEMO Environment (NEMO 환경에서 RMTP를 지원하기 위한 개선된 경로 최적화 알고리즘)

  • Joe, In-Whee;Kim, Jae-Young
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.1A
    • /
    • pp.67-72
    • /
    • 2011
  • There are lots of researches for mobility of MS(mobile station) in All IP based network. Specially, NEMO(NEwork MObility) is not supporting mobility of each MS but supporting mobility of network that include group of MS. Some research try to overcome limitation of wireless with the protocol in wired state and it maintains the performance such as wire environment. There are no researches about multicast with reliability in NEMO. Therefore, this paper suggests efficient algorithm to solve problems when RMTP(Reliable Multicast Transport Protocol) apply to NEMO environment to support high reliability with multicast. And this paper shows the better performance of proposed algorithm for delay and transmission rate between AR and TLMR comparing with RMTP in NEMO.