• Title/Summary/Keyword: Multicast communication

Search Result 334, Processing Time 0.029 seconds

MPLS and Video Stream broadcast multicast transport optimization through convergence (MPLS와 멀티캐스트 융합을 통한 Video Stream 방송 전송 최적화)

  • Hwang, Seong-Kyu;Han, Seung-Jo
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.18 no.6
    • /
    • pp.1330-1336
    • /
    • 2014
  • QoS techniques and transmitted in real-time communication with the advancement of technology a variety of applications and services are available these days, mobile devices bogeuphwa LTE technology to the development of multimedia services with high quality can be realized. In order to satisfy this condition simply with a router with an increased bandwidth expansion by considering the increase in the routing table of the network scalability problems included. Burst traffic data to be distributed according to the environment is to be centered. To do this, the destination -based routing method to transmit the current paper -based (Source routing) routing settings are required. In this paper, published by the IETF, IP switching system based on standardized protocol Label Switching Multi-Protocol Label Switching (MPLS) network by using the existing Best Effect is difficult to guarantee QoS for multimedia transmission in MPLS network environment using optimized QoS guarantees to transmit the multicast.

Congestion Control of CBT Multicast Routing Mechanism with load balancing methods (로드 밸런싱을 이용한 CBT 멀티캐스트 라우팅 프로토콜의 혼잡제어기법)

  • Yoe, Hyun;So, Sun-Hwe;Lee, Yoon-Ju
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.5 no.6
    • /
    • pp.1083-1088
    • /
    • 2001
  • In this paper, we propose a new CBT(core-based tree)multicast routing Mechanism by load balancing mechanism. CBT may result in traffic concentration and bottlenecks near the core routers since traffic from all sources nodes the same set of links as approaches the core. So the router have to load packet to new core router for such congestion. Congestion information is given by rtt(round trip time) between designed core router and the other router.

  • PDF

Premium IP Multicast Technology (프리미엄 IP 멀티캐스트 기술)

  • Oh, Hyun-Woo;Cho, Kee-Seong;Kim, Sang-Ha
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.117-118
    • /
    • 2006
  • Recently, the fusion of communication and broadcasting surfaces streaming service such as IPTV with killer application of BcN. In this paper, Premium IP multicast is called as transport service technology that transfer streaming service such as IPTV through integrated, controllable, maintainable network in order to guarantee end-to-end QoS to predefined person. It capacitates billing of multicast service instead of network operator guarantees high quality QoS to subscriber. So, network operators are able to create benefits and find benefit models. The other side, subscribers can use various high quality streaming services.

  • PDF

Ad hoc Network for Dynamic Multicast Routing Protocol Using ADDMRP

  • Chi, Sam-Hyun;Kim, Sung-Uk;Lee, Kang-Whan
    • Journal of information and communication convergence engineering
    • /
    • v.5 no.3
    • /
    • pp.209-214
    • /
    • 2007
  • In this paper, we proposed a new MANET (Mobile Ad hoc Networks) technology of routing protocol. The MANET has a mobility formation of mobile nodes in the wireless networks. Wireless network have two types architecture: the Tree based multicast and shared tree based. The two kind's architecture of general wireless networks have difficult to solve the problems existing in the network, such as connectivity, safety, and reliability. For this purpose, as using that ADDMRP (Ad hoc network Doppler effect-based for Dynamic Multicast Routing Protocol), this study gives the following suggestion for new topology through network durability and Omni-directional information. The proposed architectures have considered the mobility location, mobility time, density, velocity and simultaneous using node by Doppler effects and improved the performance.

A Performance Analysis of Efficient Wormhole Routing for Multicast Communication in Torus Networks (토러스에서 다중전송을 위한 효율적 웜홀 라우팅의 성능 분석)

  • 김소은;김창수;윤성대
    • Proceedings of the Korea Association of Information Systems Conference
    • /
    • 1998.10a
    • /
    • pp.145-149
    • /
    • 1998
  • 본 논문에서는 동일한 목적지 노드들의 집합을 가지는 다중 멀티캐스트(multiple multicast)가 동시에 일어날 경우 노드간의 경쟁을 최소화하고 메시지 전송 경로를 단축시 키기 위한 알고리즘을 제시하고, 2차원 네트워크인 토러스 구조에서 제시된 본 논문의 알고 리즘을 기존 알고리즘과 비교한다. 기존 논문에서는 멀티캐스트 메시지 패싱 시스템 (multicast message-passing system)에서 여러 개의 소스노드로부터 목적지 노드가 중첩 되는 다중 멀티캐스트를 구현하기 위한 방법으로 2차원 메쉬 구조의 특징을 이용한 SCHL(Source-Centered Hierarchical Leader) 기법[7,8]이 제안되었다. 본 논문에서는 이 를 토러스 구조에 적합하게 변형하여, 기존의 메쉬 구조에 적용된 SCHL 기법[7]과 성능을 분석함으로써 제안된 알고리즘이 메쉬 구조보다 토로스 구조에서 구현될 때, 더 향상된 성 능을 가진다는 것을 보인다. 본 논문에서의 메시지 전송기법은 결정적 웜홀 라우팅 방식을 이용한다.

  • PDF

An Efficient Core-Based Multicast Tree using Weighted Clustering in Ad-hoc Networks (애드혹 네트워크에서 가중치 클러스터링을 이용한 효율적인 코어-기반 멀티캐스트 트리)

  • Park, Yang-Jae;Han, Seung-Jin;Lee, Jung-Hyun
    • The KIPS Transactions:PartC
    • /
    • v.10C no.3
    • /
    • pp.377-386
    • /
    • 2003
  • This study suggested a technique to maintain an efficient core-based multicast tree using weighted clustering factors in mobile Ad-hoc networks. The biggest problem with the core-based multicast tree routing is to decide the position of core node. The distance of data transmission varies depending on the position of core node. The overhead's effect on the entire network is great according to the recomposition of the multicast tree due to the movement of core node, clustering is used. A core node from cluster head nodes on the multicast tree within core area whose weighted factor is the least is chosen as the head core node. Way that compose multicast tree by weighted clustering factors thus and propose keeping could know that transmission distance and control overhead according to position andmobility of core node improve than existent multicast way, and when select core node, mobility is less, and is near in center of network multicast tree could verification by simulation stabilizing that transmission distance is short.

Pre-Planned Tree Reconfiguration Mechanism for QoS Multicast Routing (QoS 멀티캐스트 라우팅을 위한 계획된 트리 재구성 방법)

  • Han, Seung-Jae;Park, Sun-Ju
    • Journal of KIISE:Information Networking
    • /
    • v.34 no.2
    • /
    • pp.120-133
    • /
    • 2007
  • A multicast tree includes several, possibly a large number of, paths connecting source-receiver pairs, and network failure may disable part of the multicast tree. Reconstruction of the entire multicast tree to recover from a component failure is highly undesirable, because some group members have to suffer service disruptions even though the communication paths to/from them are not affected by the failure. To limit reconfiguration region and to maximize the likelihood of successful reconfiguration, we propose and evaluate a pre-planned reconfiguration policy for QoS multicast sessions. Specifically, we equip a reconfiguration path (RP) with each end-to-end path that connects a source-receiver pair in the multicast tree, and reserve resources in advance along the RPs. Efficient resource-sharing techniques are applied to reduce the amount of resources reserved for RPs but not used in the absence of failures. This way, we prevent uncontrolled competition among different multicast sessions which may simultaneously try to recover from failures. We evaluate the performance of the proposed scheme using simulation on randomly-generated networks. We use the shortest-path routing for QoS multicast sessions, and simulate both source-based and shared multicast trees. The evaluation results indicates that successful pre-planned reconfiguration can be achieved for all group members with reasonable overhead. Our scheme is also shown to adapt well to dynamic changes of group membership.

Efficient Multicast Tree Algorithm for Acceptable Delay and Minimum Delay Variation (지연시간 한계의 만족과 효율적인 최소 지연변이 멀티캐스트 트리 생성 알고리즘)

  • Kim Moon-Seong;Choo Hyun-Seung;Lee Young-Ro
    • The KIPS Transactions:PartC
    • /
    • v.12C no.1 s.97
    • /
    • pp.105-110
    • /
    • 2005
  • With the proliferation of multimedia group applications, the construction of multicast trees satisfying QoS requirements is becoming a problem of prime importance. In this paper, we study the delay- and delay variation-bounded multicast tree (DVBMT) problem which is NP-complete. The problem is to construct a spanning tree for destination node, which has the minimized multicast delay variation, and the delay on the path from the source to each destination is bounded. A solution to this problem is required to provide decent real-time communication services such as on-line games, shopping, and teleconferencing. Performance comparison shows that the proposed scheme outperforms DDVCA which is known to be effective so far in any network topology. The enhancement is up to about $3.6{\%}{\~}11.1{\%}$ in terms of normalized surcharge for DUVCA. The time complexity of our algorithm is $O(mn^2)$.

Multicast Methods in Support of Internet Host Mobility (인터넷 상에서 호스트 이동성을 지원하는 멀티캐스트 방안)

  • Bang, Sang-Won;Jo, Gi-Hwan;Kim, Byeong-Gi
    • The Transactions of the Korea Information Processing Society
    • /
    • v.4 no.5
    • /
    • pp.1231-1242
    • /
    • 1997
  • This paper deals with an IP mukticast protocol in support of host mobility. Most of the previous multicast schemes have utilized an underlying logical strucuture of network topology,in order to provide a certain degree of order and predictability.On the other hand,mobility implies that a host location relaative to the rest of the net-work changes with time;the physical connectivity of the entire network is thus modified as move.In this case.some multicast datagrams nay not delivered properly,or may delivered twice or more,to a mobile host because the destinations will keep moving whlist datagrams are dekivered with different time delay.This paper first describes the relation between host mobility and multicast, by exploring the possible interactions,and presents a multicast scheme in support of Internet host mobility.A revised scheme is then proposed to adapt the multicast semantic and to optimize the communication overhead.

  • PDF

A Multicast-based Mobility Support Scheme in IPv6 Networks (IPv6 네트워크에서 멀티캐스트 기반 이동성 제공 방안)

  • Woo Mi ae;Jun Hong sun;Park Ho hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.4B
    • /
    • pp.210-217
    • /
    • 2005
  • With rapid advance in wireless communication technologies, many researches are conducted for providing Internet data services while users are roaming around. Efficient management of mobility of mobile nodes is essential as the use of real-time application program grows. In this paper, we propose a multicast-based localized mobility support scheme in IPv6 networks. The proposed scheme utilizes a class of multicast routing protocol for the localized mobility support. Features of the proposed scheme are use of join to a multicast group and leave from that group to localize binding update information and provision of an extended multicast group management mechanism to reduce leave latency. The results of simulation show that the proposed scheme out-performs Mobile IPv6 and Hierarchical Mobile IPv6 in UDP and TCP traffic performance and in wasted bandwidth.