• Title/Summary/Keyword: multicast communications

Search Result 247, Processing Time 0.026 seconds

New conter location algorithms for shared multicast trees (공유된 멀티캐스트 트리에서 센터 위치 결정을 위한 새 알고리즘)

  • 강신규;심영철
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.25 no.3B
    • /
    • pp.493-503
    • /
    • 2000
  • Multicast routing algorithms such PIM, CBT, BGMP use shared multicast routing trees and the location of the multicast tree has great impact on the packet delay. In this pater we propose three new center location algorithms and analyze their performance through simulation studies. these three algorithms consider as candidates for the center not only multicast group members but also a few non-members nodes. To select these non-member nodes, we first find all the shortest paths among every couple of members and consider either nodes which are most frequently visited during the process of finding shortest paths or nodes which lie at the center of a shortest path and are most frequently visited during the same process. There the proposed algorithms are able to find the better center than not only algorithms which consider only member nodes but also other algorithms which consider selected non-member nodes in addition ot member nodes. The proposed algorithms either incur too much overhead nor depend upon unicasting algorithms.

  • PDF

An Efficient Multicast Scheme for Hierarchical Mobile IPv6 (계층적 Mobile IPv6를 위한 효율적 멀티캐스트 방안)

  • Kim, Byung-Soon
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.7A
    • /
    • pp.597-602
    • /
    • 2005
  • This paper proposes an efficient multicast scheme for the hierarchical mobile IPv6(HMIPv6). If a mobility anchor point(MAP) in a new domain does not support multicasting, an entering group member cannot join the multicast group through the new MAP The group member thus keeps receiving multicast packets from its home agent(HA) using Mobile IPv6 (MIPv6). This increases the propagation delay of binding update (BU) messages. However, our scheme enables an entering group member to keep receiving packets from the old multicast MAP. It can also reduce tunneling costs, total delivery costs and handover latency. We simulated the performance of our scheme by comparing it with the seamless multicast handover in a hierarchical mobile Pv6 (M-HMIPv6) using the delivery cost and handover latency factors.

Virtual Euc1idean Point based Multicast routing scheme in Underwater Acoustic sensor networks (수중 센서 네트워크에서 가상의 유클리디언 포인트를 이용한 멀티캐스트 전송기법)

  • Kim, Tae-Sung;Park, Kyung-Min;Kim, Young-Yong
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.7B
    • /
    • pp.886-891
    • /
    • 2011
  • Multicast has been a key routing service for efficient data dissemination in underwater acoustic sensor networks. In sensor networks, there are several multicast routing protocol which reflects sensor network nature. However, existing routing scheme was not targeted at underwater acoustic sensor networks which is hard to provide battery continually. Therefore, a specialized routing algorithm is essential for acoustic sensor networks. In this paper, we propose angle aided multicast routing algorithm for decreasing routing computation complexity, including virtual Euclidean Steiner point. Simulation results show better performance than exist routing Position Based Multicast, Geographic Multicast Routing. such as low computation capability and limited power consumption.

Joint Resource Allocation for Cellular and D2D Multicast Based on Cognitive Radio

  • Wu, Xiaolu;Chen, Yueyun
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.8 no.1
    • /
    • pp.91-107
    • /
    • 2014
  • Device-to-device (D2D) communication is an excellent technology to improve the system capacity by sharing the spectrum resources of cellular networks. Multicast service is considered as an effective transmission mode for the future mobile social contact services. Therefore, multicast based on D2D technology can exactly improve the spectrum resource efficiency. How to apply D2D technology to support multicast service is a new issue. In this paper, a resource allocation scheme based on cognitive radio (CR) for D2D underlay multicast communication (CR-DUM) is proposed to improve system performance. In the cognitive cellular system, the D2D users as secondary users employing multicast service form a group and reuse the cellular resources to accomplish a multicast transmission. The proposed scheme includes two steps. First, a channel allocation rule aiming to reduce the interference from cellular networks to receivers in D2D multicast group is proposed. Next, to maximize the total system throughput under the condition of interference and noise impairment, we formulate an optimal transmission power allocation jointly for the cellular and D2D multicast communications. Based on the channel allocation, optimal power solution is in a closed form and achieved by searching from a finite set and the interference between cellular and D2D multicast communication is coordinated. The simulation results show that the proposed method can not only ensure the quality of services (QoS), but also improve the system throughput.

Design and Evaluation of NACK Based Reliable Multicast Protocol (NACK 기반 신뢰적 멀티캐스트 프로토콜의 설계 및 평가)

  • Jung Sun-Hwa;Park Seok-Cheon
    • Journal of Internet Computing and Services
    • /
    • v.4 no.3
    • /
    • pp.47-55
    • /
    • 2003
  • Multicast protocols ore developed in order to support group communications efficiently, However. there still exist some issues to be solved for deploy multicast protocol in the public internet. This paper refers problem of existing Reliable Multicast Protocols and redesigns component function, and proposes enhanced reliable multicast transport protocol, This paper proposed a improved multicast transport scheme in NACK based reliable multicast. This scheme is much faster than by sender-initiated or receiver-initiated recovery and latency is smaller. Designed components are implemented in UNIX environment using C programming longuage. Then the protocol was evaluated performance through simulation. As the result, proposed protocol is better than existing protocols in both of transmission delay and packet loss. Especially, proposed protocol in this paper con be used in multicast services needed high reliability.

  • PDF

Mobile IP Multicast Protocol Losing Local Broadcast (로컬 브로드캐스트를 이용한 이동 IP 멀티캐스트 프로토콜)

  • 차용주;김화종
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.26 no.12C
    • /
    • pp.208-217
    • /
    • 2001
  • In mobile Internet environment, providing multicast requires much more complex mechanism comparing with the unicast Mobile IP routing protocol. This is because multicast datagrams are sent to a group address that do not belong to a specific network. The IETF Mobile IP suggested two approaches for mobile multicasting, namely remote subscription and hi-directional tunneling. In remote subscription, a mobile node may join a group via a local multicast router on the visited subnet. Therefore remote subscription may cause much datagram loss while reconstructing the delivery tee. In bi-directional tunneling, a mobile node may join a group via a hi-directional tunnel to its home agent. Bi-directional tunneling may suffer from inefficient routing. In this paper, we proposed a new mobile multicasting protocol, Mobile If Multicast using Local Broadcast(MIMLB) which can receive multicast datagrams as fast as possible and optimize routing path for multicast delivery. The MIMLB protocol uses hi-directional tunneling to receive multicast datagrams. And the MIMLB protocol can resolve datagram duplicated problem and optimize routing path by using local broadcast. Simulation results show that MIMLB reduces delivery path length and optimizes multicast routing path when a mobile nod? moves into a foreign network.

  • PDF

Distributed Medium Access Control for N-Screen Multicast Services in Home Networks

  • Hur, Kyeong
    • Journal of Korea Multimedia Society
    • /
    • v.19 no.3
    • /
    • pp.567-572
    • /
    • 2016
  • N-screen is an emerging technology to support multimedia multicasting, content sharing and content mobility. N-screen service providers should obtain the technology that provides the highest quality content seamlessly. Distributed nature of WiMedia distributed-MAC protocol can provide full mobility support, and achieves seamless medium access method in contrast to IEEE 802.15.3. So, in this paper, WiMedia distributed-MAC protocol is adopted and an asynchronous multicast transmission (AMT) technology is proposed to enhance performance of seamless N-screen wireless service based on distributed-MAC. The ACK frame transmissions are not required for multicast transmissions. By using this property in AMT, if a device is a multicast receiver, its reserved time slots can be reserved by the other devices with 1-hop distance. Furthermore, each N-screen device broadcasts and shares the information including an order in asynchronous traffic reservations to reduce conflicts in determining the transmission order of asynchronous N-screen packets. Therefore, AMT scheme expands the number of time slots available and throughputs for multicast and asynchronous traffic reservations when comparing with the distributed-MAC standard system. N-screen communications based on distributed-MAC with the proposed AMT shows a new framework for realizing N-screen wireless service with the full content mobility.

A QoS Multicast Routing Optimization Algorithm Based on Genetic Algorithm

  • Sun Baolin;Li Layuan
    • Journal of Communications and Networks
    • /
    • v.8 no.1
    • /
    • pp.116-122
    • /
    • 2006
  • Most of the multimedia applications require strict quality of service (QoS) guarantee during the communication between a single source and multiple destinations. This gives rise to the need for an efficient QoS multicast routing strategy. Determination of such QoS-based optimal multicast routes basically leads to a multi-objective optimization problem, which is computationally intractable in polynomial time due to the uncertainty of resources in Internet. This paper describes a network model for researching the routing problem and proposes a new multicast tree selection algorithm based on genetic algorithms to simultaneously optimize multiple QoS parameters. The paper mainly presents a QoS multicast routing algorithm based on genetic algorithm (QMRGA). The QMRGA can also optimize the network resources such as bandwidth and delay, and can converge to the optimal or near-optimal solution within few iterations, even for the networks environment with uncertain parameters. The incremental rate of computational cost can close to polynomial and is less than exponential rate. The performance measures of the QMRGA are evaluated using simulations. The simulation results show that this approach has fast convergence speed and high reliability. It can meet the real-time requirement in multimedia communication networks.

Design and Implementation of ECTP for Reliable Group Communications (신뢰적 그룹통신을 위한 ECTP 설계 및 구현)

  • 박주영;정옥조;강신각
    • Proceedings of the Korean Institute of Information and Commucation Sciences Conference
    • /
    • 2003.10a
    • /
    • pp.916-919
    • /
    • 2003
  • Reliable multicast data transmission in a 1:N environment needs more sophisticated error control mechanism than that of in 1:1 environment due to ACK implosion and duplicated retransmission. Although there have been many related research on error control in reliable multicast, real implemented protocols are rare. As one of the reliable multicast transport protocols, ECTP is selected as an international standard reliable multicast protocol by ITU-T and ISO and implemented on RedHat 7.2 machine by us. In this paper, we evaluate the performance of the error control mechanism in the respect of throughput and generated control packet numbers with a real implementation code. From the results, it is concluded that the suitable values of error control parameters can be obtained from the local group size and network environments.

  • PDF

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.