• Title/Summary/Keyword: Multicasting Service

Search Result 95, Processing Time 0.024 seconds

Performance Analysis of DoS Security Algorithm for Multimedia Contents Services (멀티미디어 콘텐츠의 서비스거부 방지 알고리즘 성능분석)

  • Jang, Hee-Seon;Shin, Hyun-Chul;Lee, Hyun-Chang
    • Journal of the Korea Society of Computer and Information
    • /
    • v.15 no.4
    • /
    • pp.19-25
    • /
    • 2010
  • In this paper, the performance of the DoS information security algorithm is evaluated to provide the multimedia traffic between the nodes using the multicasting services. The essence technology for information security to distribute the multimedia contents is presented. Under the multicasting services, a node participating new group needs a new address and the node compares the collision with the existing nodes, then DoS attack can be occurred between the nodes by a malicious node. Using the NS2 simulator, the number of DoS attacks, the average number of trials to generate new address, and the average time to create address are analyzed. From simulation results, the efficient algorithm with relevant random number design according to the DRM network is needed to provide secure multimedia contents distribution.

Dynamic Multi-frame Transmission Technology Using the WiMedia MAC for Multi-hop N-screen Services

  • Hur, Kyeong
    • Journal of information and communication convergence engineering
    • /
    • v.14 no.1
    • /
    • pp.21-25
    • /
    • 2016
  • N-screen is a promising technology to improve support for multimedia multicasting, content sharing, content mobility, media scalability, and seamless mobility. In this paper, the WiMedia distributed-MAC (D-MAC) protocol is adopted for development of a seamless N-screen wireless service. Furthermore, to provide a multi-hop, one source multi-use N-screen service through point to point streaming in a seamless D-MAC protocol, a dynamic multi-frame transmission technology is proposed. In this technology, a dynamic time slot allocation scheme and a multi-hop resource reservation scheme are combined. In the proposed dynamic time slot allocation scheme, two thresholds, a hard threshold and a soft threshold, are included to satisfy the power consumption and delay requirements. A multi-frame DRP reservation scheme is proposed to minimize end-to-end delay during the multi-hop transmissions between N-screen devices. The proposed dynamic multi-frame transmission scheme enhances N-screen performance in terms of the multi-hop link establishment success rate and link establishment time compared to the conventional WiMedia D-MAC system.

Overlay Multicasting with Local Swap Option in a Personal Broadcasting System (로컬 스왑 기법을 적용한 오버레이 멀티캐스트 기반의 개인방송 시스템)

  • Kang, Mi-Young;Lee, Hyung-Ok;Nam, Ji-Seung
    • The Journal of the Korea Contents Association
    • /
    • v.8 no.8
    • /
    • pp.1-8
    • /
    • 2008
  • Overlay Multicast is an effective method for optimal utilization of system resources and network bandwidth without a need for hardware customization. It is an effective method of providing Personal Internet Broadcasting Service for better Quality of Service to many users. In this paper, we propose a multicast tree that uses Local Swap method. In order to prove the effectiveness of the new technique suggested here, using the proposed method and personal internet broadcasting service, information is abstracted, compared and analyzed under various overlay multicast algorithm conditions. We have proved that the suggested local swap technique is more effective by comparing it with other existing techniques in various methods such as using various overlay based multicast algorithm simulation.

Providing QoS in the Internet using Dynamic Node Setting Method (동적 노드 설정을 이용한 인터넷상의 QoS 제공)

  • 김중규
    • Journal of Korea Society of Industrial Information Systems
    • /
    • v.7 no.5
    • /
    • pp.103-111
    • /
    • 2002
  • Historically, IP-based internets have been able to provide a simple best-effort delivery service to all applications they carry. Best effort treats all packets equally, with no service level, packet loss, and delay. The best-effort style has generally worked fine. But the needs of users have changed. The want to use the new real-time, multimedia, and multicasting applications. Thus, there is a strong need to be able to support a variety of traffic with a variety of quality-of-service requirements, within the TCP/IP architecture. This paper propose a framework that offers QoS in a DS domain using dynamic node setting method.

  • 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.

Providing QoS in the Internet using Dynamic Node Setting Method (동적 노드 설정을 이용한 인터넷상의 QoS 제공)

  • 김중규
    • Proceedings of the Korea Society of Information Technology Applications Conference
    • /
    • 2002.11a
    • /
    • pp.400-406
    • /
    • 2002
  • Historically, IP-based internets have been able to provide a simple best-effort delivery service to all applications they carry. Best effort treats all packets equally, with no service level, packet loss, and delay. The best-effort style has generally worked fine. But the needs of users have changed. The want to use the new real-time, multimedia, and multicasting applications. Thus, there is a strong need to be able to support a variety of traffic with a variety of quality-of-service requirements, within the TCP/IP architecture. This paper propose a framework that offers QoS in a DS domain using dynamic node setting method.

  • PDF

Providing QoS in the Internet using Dynamic Node Setting Method (동적 노드 설정을 이용한 인터넷상의 QoS 제공)

  • 김중규
    • Proceedings of the Korea Society for Industrial Systems Conference
    • /
    • 2002.11a
    • /
    • pp.400-406
    • /
    • 2002
  • Historically, IP-based internets have been able to provide a simple best-effort delivery service to all applications they carry. Best effort treats all packets equally, with no service level, packet loss, and delay. The best-effort style has generally worked One. But the needs of users have changed. The want to use the new real-time multimedia, and multicasting applications. Thus, there is a strong need to be able to support a variety of traffic with a variety of quality-or-service requirements, within the TCP/IP architecture. This paper propose a framework that offers QoS in a DS domain using dynamic node setting method.

  • PDF

Event Routing Algorithms Using the Reverse Paths of Event Subscription Spanning Trees (이벤트 등록 스패닝트리의 역경로 정보를 이용한 이벤트 라우팅 알고리즘)

  • Ryu, Ki-Yeol;Lee, Jung-Tae
    • The KIPS Transactions:PartA
    • /
    • v.9A no.1
    • /
    • pp.19-28
    • /
    • 2002
  • A new class of applications based on event interactions are emerging for the wide-area network such as Internet, which is characterized as loose coupling, heterogeneity. and asynchrony. Content-barred publish/subscribe systems are widely being studied to implement the extent notification service for wide-area networks. In this paper, we analyze some problems of the content-based routing algorithm in SIENA, a recently developed as a representative event notification service architecture, and develop an enhanced routing algorithm.

A Seamless Multicast Scheme to Prevent Packet Loss in Proxy Mobile IPv6 Networks (Proxy Mobile IPv6 네트워크에서 패킷 유실을 방지하는 끊김 없는 멀티캐스트 기법)

  • Kim, Jong-Min;Kim, Hwa-Sung
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.36 no.1B
    • /
    • pp.7-20
    • /
    • 2011
  • Recently, Proxy Mobile IPv6(PMIPv6) networks have been studied as the mobility management protocol to effectively use limited wireless resources. And the multicasting, which is core technology of the Internet broadcast system such as mobile IPTV, has been discussed mainly based on PMIPv6 network. However, multicasting based on PMIPv6 network causes disconnection of services because it does not solve problems of packet loss during binding and group joining procedure. Hence, we propose a seamless multicast scheme which prevents packet loss in PMIPv6 networks. The proposed scheme achieves lower latency than the existing scheme because it combines binding and group joining procedure, a1so it does not cause about packet losses due to performing buffering. We proved the performance using the simulations.

Performance Analysis of TNS System for Improving DDS Discovery (DDS 검색 방식 개선을 위한 TNS 시스템 성능 분석)

  • Yoon, Gunjae;Choi, Jeonghyun;Choi, Hoon
    • The Journal of Korean Institute of Next Generation Computing
    • /
    • v.14 no.6
    • /
    • pp.75-86
    • /
    • 2018
  • The DDS (Data Distribution Service) specification defines a discovery method for finding participants and endpoints in a DDS network. The standard discovery mechanism uses the multicast protocol and finds all the endpoints in the network. Because of using multicasting, discovery may fail in a network with different segments. Other problems include that memory space wastes due to storing information of all the endpoints. The Topic Name Service (TNS) solves these problems by unicasting only the endpoints, which are required for communication. However, an extra delay time is inevitable in components of TNS, i.e, a front-end server, topic name servers, and a terminal server. In this paper, we analyze the performance of TNS. Delay times in the servers of TNS and time required to receive endpoint information are measured. Time to finish discovery and number of receiving endpoints compare with the standard discovery method.