• Title/Summary/Keyword: Multicast Protocol

Search Result 339, Processing Time 0.025 seconds

Multicast using Label Aggregation in MPLS Environment (MPLS환경에서의 Label Aggregation을 통한 Multicast 지원 방안)

  • Park, Pong-Min;Kim, Gyeong-Mok;Oh, Young-Hwan
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.42 no.10 s.340
    • /
    • pp.9-16
    • /
    • 2005
  • The growth of the Internet over the last several years has placed a tremendous strain on the high bandwidth Hence, the amount of internet traffic has risen sharply and it has demanded to use the limited resource. MPLS (Multiprotocol Label Switching) is regarded as a core technology for migrating to the next generation Internet. It is important to reduce the number of labels and LSP(Label Switched Path)s for network resource management. In this thesis, we considered an MPLS multicast mechanism in the current Internet. The scalability problem due to lack of labels and multicast property is one of the serious problems in MPLS multicast mechanism, we proposed a Label Aggregation algorithm that the multicast packets on same link in MPLS allocates the same label for the scalability problem. In order to support the proposed algorithm we defined a new LDP(Label Distribution Protocol) multicast field and multicast packet is copied and transmitted for multicast group links of next node in LSR(label Switch Router).

A Study on Hierarchical Overlay Multicast Architecture in Mobile Ad Hoc Networks (Mobile Ad Hoc 네트워크를 위한 계층적 오버레이 멀티캐스트 구조 연구)

  • Kim, Kap-Dong;Park, Jun-Hee;Lee, Kwang-Il;Kim, Hag-Young;Kim, Sang-Ha
    • The KIPS Transactions:PartC
    • /
    • v.13C no.5 s.108
    • /
    • pp.627-634
    • /
    • 2006
  • Overlay network eliminates the need to change the application-layer tree when the underlying network changes and enables the overlay network to survive in environments where nonmember nodes do not support multicast functionality. An overlay protocol monitors group dynamics, while underlying unicast protocols track network dynamics, resulting in more stable protocol operation and low control overhead even in a highly dynamic environment. But, if overlay multicast protocols does not know the location information of node, this makes it very difficult to build an efficient multicasting tree. So, we propose a Hierarchical Overlay Multicast Architecture (HOMA) with the location information. Because proposed architecture makes static region-based dynamic group by multicast members, it is 2-tired overlay multicasts of application layer that higher layer forms overlay multicast network between members that represent group, and support multicast between multicast members belonging to region at lower layer. This use GPS, take advantage of geographical region, and realizes a region-sensitive higher layer overlay multicast tree which is impervious to the movements of nodes. The simulation results show that our approach solves the efficiency problem effectively.

An Efficient Core Migration Protocol for Tree Building in Mobile Ad Hoc Multicast Protocol (Ad Hoc네트워크에서 효율적인 코어-기반 멀티캐스트 트리 구축)

  • 이창순;김갑식
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.8 no.3
    • /
    • pp.99-104
    • /
    • 2003
  • Ad-hoc is the wireless network and consists of moving Hosts in environments which don't have a network-based Frame. Because ad-hoc is considered as broadcast network and network which has useful benefits, multicast muting protocols have been studied on ad-hoc network For this work we scrutinized ad-hoc and multicast routing protocols presented in previous works. And we presents a protocol for Ad-hoc network.

  • PDF

(A Centroid-based Backbone Core Tree Generation Algorithm for IP Multicasting) (IP 멀티캐스팅을 위한 센트로이드 기반의 백본코아트리 생성 알고리즘)

  • 서현곤;김기형
    • Journal of KIISE:Information Networking
    • /
    • v.30 no.3
    • /
    • pp.424-436
    • /
    • 2003
  • In this paper, we propose the Centroid-based Backbone Core Tree(CBCT) generation algorithm for the shared tree-based IP multicasting. The proposed algorithm is based on the Core Based Tree(CBT) protocol. Despite the advantages over the source-based trees in terms of scalability, the CBT protocol still has the following limitations; first, the optimal core router selection is very difficult, and second, the multicast traffic is concentrated near a core router. The Backbone Core Tree(BCT) protocol, as an extension of the CBT protocol has been proposed to overcome these limitations of the CBT Instead of selecting a specific core router for each multicast group, the BCT protocol forms a backbone network of candidate core routers which cooperate with one another to make multicast trees. However, the BCT protocol has not mentioned the way of selecting candidate core routers and how to connect them. The proposed CBCT generation algorithm employs the concepts of the minimum spanning tree and the centroid. For the performance evaluation of the proposed algorithm, we showed the performance comparison results for both of the CBT and CBCT protocols.

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.

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

A Simulation to Test Join Latency for PIM-DM Multicast (PIM-DM 멀티캐스트에서 그룹 가입 지연시간에 대한 성능 모의 실험)

  • Kim, Han-Soo;Jang, Ju-Wook
    • The KIPS Transactions:PartC
    • /
    • v.10C no.2
    • /
    • pp.179-184
    • /
    • 2003
  • One of the remarkable problems in PIM-DM (Protocol Independent Multicast - Dense Mode) is the join latency time, increasing for specific periods. The reason of this problem is proved to the confusion of flooding prune message and leave prune message. We propose a new solution to this problem, reducing the average join latency by 37.4%, and prove the proposed solution by network simulation.

A Performance Analysis of Region-based Overlay Multicast Routing Protocol for Ad Hoc Networks (Ad Hoc 네트워크를 위한 지역기반 오버레이 멀티캐스트 라우팅 프로토콜의 성능 분석)

  • Kim Kap-Dong;Park Jun-Hee;Lee Kwang-Il;Kim Hag-Young;Kim Sang-Ha
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2006.05a
    • /
    • pp.1037-1040
    • /
    • 2006
  • This paper presents an efficient overlay multicast routing protocol (ROMP) and its architecture. ROMP using GPS and region map stands on the basis of scalable 2-tiered multicast architecture and maintains a global overlay multicast tree through reactive fashion. With this approach, the coarse-grain location-awareness for an efficient overlay multicasting and the determination of hot-spot area for efficient data delivery are feasible. The simulation results show that the localized control packets of ROMP prevent the overlay control packets from squandering the physical network resources.

  • PDF

Multicast Schemes for DMSP Handoff in Mobile IP Networks (이동 IP 망에서의 DMSP 핸드오프를 위한 멀티캐스트 방안)

  • Nam Sea-Hyeon
    • Journal of Internet Computing and Services
    • /
    • v.6 no.4
    • /
    • pp.115-124
    • /
    • 2005
  • The packet loss problem that occurs in the mobile multicast (MoM) protocol due to designated multicast service provider(DMSP) handoff is investigated through simulation experiments for several DMSP selection policies. Then, two enhanced DMSP schemes are proposed to minimize the packet loss of the MoM protocol with single DMSP. The first scheme uses a backup DMSP and greatly reduces the packet loss rate at the expense of the increased network traffic. The second scheme utilizes the extended DMSP operation and shows many desirable features such as the almost zero packet loss rate and relatively low network traffic.

  • PDF

Authenticated IGMP for Controlling Access to Multicast Distribution Tree (멀티캐스트 분배트리 접근제어를 위한 Authenticated IGMP)

  • Park, Chang-Seop;Kang, Hyun-Sun
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.17 no.2
    • /
    • pp.3-17
    • /
    • 2007
  • Receiver access control scheme is proposed to protect multicast distribution tree from DoS(Denial-of Service) attack induced by unauthorized use of IGMP(Internet group management protocol), by extending the security-related functionality of IGMP. Based on a specific network and business model adopted for commercial deployment of IP multicast applications, key management scheme is also presented for bootstrapping the proposed access control as well as accounting and billing for CP(Content Provider), NSP(Network Service Provider), and group members.