• Title/Summary/Keyword: overlay scheme

Search Result 94, Processing Time 0.02 seconds

Rosary : Topology-Aware Structured P2P Overlay Network for CDN System (Rosary : CDN 시스템을 위한 구조화된 토폴러지-인식 P2P 오버레이 네트워크)

  • Shin Soo-Young;Namgoong Jung-ll;Park Soo-Hyun
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.30 no.12B
    • /
    • pp.818-830
    • /
    • 2005
  • Recently, Peer-to-Peer (P2P) overlay networks like CAN, Chord, Pastry and Tapestry offer a novel platform for scalable and decentralized distributed applications. These systems provide efficient and fault-tolerant routing, object location, and load balancing within a self-organizing overlay network. Content Delivery Network (CDN) is an intermediate layer of infrastructure that helps to efficiently deliver the multimedia content from content providers to clients. In this paper, We propose a topology-aware P2P overlay network for CDN, Rosary, in which CDN servers perform Intra-Pastry and Inter-Pastry routing based on a two-level structured overlay network. This proposed system extends pastry by adapting itself to CDN environments, where a semi-hashing based scheme for Intra-Pastry routing is introduced, and dynamic landmark technology is used to construct the topology-aware overlay network. Through simulations on NS-2, it is shown that Rosary is scalable, efficient, and flexible.

EPON Upgrade Strategy Using WDM Overlay (WDM 기반을 이용한 EPON 진화 전략)

  • Hyun, Jae-Myoung;Cho, Won-Kuk;Kim, Byoung-Whi;Park, Young-Il
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.31 no.10A
    • /
    • pp.929-934
    • /
    • 2006
  • A scheme to easily upgrade TDM-PON using WDM overlay is proposed. To maintain the colorless characteristics of ONU transmitters, a wavelength-conversion ONU is adopted for each TDM-PON group, where all upstream signals from regular ONUs are adjusted to an assigned wavelength. An implementation scheme for remote node and wavelength conversion node is suggested and the test results are shown.

M-ary orthogonal CDMA Using Time Hopping Codes (시간도약부호를 사용하는 M진직교 부호분할 다원접속)

  • 김일규;김동인;노종선
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.19 no.7
    • /
    • pp.1374-1389
    • /
    • 1994
  • In this paper, a novel M-ary orthogonal CDMA scheme which utilizes time hopping codes and binary orthogonal sequences is proposed for personal communication system. Its modulated output signal has the characteristics of greater bandwidth occupancy and lower spectral density level as well. So this scheme is useful for spectrum overlay with existing narrowband communication systems which occupy current radio frequency channels. This paper investigates system characteristics through the analysis of modulated output signal power spectrum, and demonstrates the possibility of spectrum overlay.

  • PDF

An Efficient Scheme to Create Data Delivery Tree for Community Group Communication (커뮤니티 그룹 통신을 위한 효율적인 데이터 전달 트리 구성 방안)

  • Oh, Je-Jun;Kang, Nam-Hi;Kim, Yong-Hyuk;Kim, Young-Han
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.44 no.10
    • /
    • pp.55-63
    • /
    • 2007
  • Multicast is an efficient transport mechanism for community communications and MANET is recently regarded as a promising solution for support ubiquitous computing as an underlying network technology. However, it is hard to deploy multicast mechanism into MANET owing to scarce resources in wireless networks and unpredictable changes in network topology. Several multicast mechanisms have been proposed in the literature to overcome the limitations. Especially, overlay multicasting schemes present several advantages over network based multicasting schemes. Yet, the overlay multicasting schemes still introduce redundant data transmissions that waste network bandwidth and battery of relay nodes. As a result the performance of the network is degraded. To reduce the redundancy, we propose an efficient way to construct an overlay structure as a multicast data delivery tree that utilizes a branch node which belongs to the tree. By using network simulation, we show that the proposed scheme presents higher packet delivery ratio and lower transmission cost than previously proposed schemes.

Virtual Direction Multicast: An Efficient Overlay Tree Construction Algorithm

  • Mercan, Suat;Yuksel, Murat
    • Journal of Communications and Networks
    • /
    • v.18 no.3
    • /
    • pp.446-459
    • /
    • 2016
  • In this paper, we propose virtual direction multicast (VDM) for video multicast applications on peer-to-peer overlay networks. It locates the end hosts relative to each other based on a virtualized orientation scheme using real-time measurements. It builds multicast tree by connecting the nodes, which are estimated to be in the same virtual direction. By using the concept of directionality, we target to use minimal resources in the underlying network while satisfying users' quality expectations. We compare VDM against host multicast tree protocol.We simulated the protocol in a network simulator and implemented in PlanetLab. Results both from simulation and PlanetLab implementation show that our proposed technique exhibits good performance in terms of defined metrics.

Performance Evaluation of User Mobility Management Scheme based-on Dwell Time Optimization for Effective Inter-working with Heterogeneous Networks under Cognitive Networking Environments (인지 네트워킹 환경 하에서 체류시간 관리 최적화를 통한 사용자 이동성 모델 기반 이동성 관리방법의 성능평가)

  • Choi, Yu-Mi;Kim, Jeong-Ho
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.49 no.5
    • /
    • pp.77-83
    • /
    • 2012
  • The importance of mobility management is becoming to be one of the upcomming issues to be addressed to provide the converged services and the convergence of the heterogeneous network environments. In this paper, the new user mobility management scheme which can be utilized to model the user's mobility behaviors for interworking with heterogeneous overlay convergent networks under the time-varying radio propagation environment has been proposed. Thus user mobility management scheme based on user mobility model is considered in order to optimize the dwell time of users in the overlay convergent networks. This Mobile IP user mobility management will be very useful to model the user mobility behaviors and can be used to estimate the signaling traffic and frequency spectrum demands for massive data transfer for the heterogeneous overlay convergent networks.

An Efficient Overlay Multicast Scheduling for Composite Stream in P2P Environment (P2P 환경에서 복합 스트림 서비스를 위한 효율적인 오버레이 멀티캐스트 스케줄링)

  • Kim, Jong-Gyung;Choi, Sung-Uk
    • Journal of the Korea Society of Computer and Information
    • /
    • v.13 no.6
    • /
    • pp.233-241
    • /
    • 2008
  • The overlay multicast that has been recently presented as an alternative for the IP multicast needs scheduling method that can apply the system resource and the network bandwidth for the many users. We propose a efficient overlay multicasting network policy for multimedia services with composite stream service topology. And in order to evaluate the ability of the proposed scheme's performance, We test the performance of multi_casting nodes with RTT values, the bandwidth attrition rate for building the network topology and MOR effects with Overcast[5] The result of simulation shows improves about $8{\sim}20%$ of performance.

  • PDF

A Node Management Scheduling for Efficient Guarantee of QOS based on Overlay Multicast Environment (오버레이 멀티캐스트 환경에서 효율적인 QOS의 보장을 위한 노드관리 스케줄링)

  • Choi, Sung-Uk
    • Journal of the Korea Academia-Industrial cooperation Society
    • /
    • v.10 no.7
    • /
    • pp.1614-1620
    • /
    • 2009
  • The overlay multicast that has been recently presented as an alternative for the IP multicast has been getting much persuasion by the system resource and the network bandwidth and the advancement of the network cost. we propose a overlay multi_casting network policy for efficient multimedia services with P2P join scheduling. In order to evaluate the performance of proposed scheme, We test the performance of multi_casting nodes with average join count, the maximum guaranteed waiting time and buffer starvation ratio with similar techniques. The result of simulation shows improved about 15${\sim}$20% of performance.

Implementation of Static Address-Internetworking Scheme between Wireless Sensor Network and Internet (센서 네트워크와 인터넷과의 정적 주소 연동 방안 구현)

  • Kim, Jeong-Hee;Kwon, Hoon;Kwak, Ho-Young;Do, Yang-Hoi;Byun, Yung-Cheol;Kim, Do-Hyeun
    • The Journal of the Korea Contents Association
    • /
    • v.6 no.12
    • /
    • pp.40-49
    • /
    • 2006
  • As a promising integrated circuit, wireless communication and micro-computing technology, the technology of sensor network that will lead the information technology industries of the next generation and realize the ubiquitous computing is one of the most active research topics and its research activities are also making today. From now on, each node, the network formation, and even the sensor network itself will interact with the generic network and evolve dynamically according to environmental changes in a process of continual creation and extinction. Therefore, address-internetworking between sensor network and generic network which are used different address mechanism is required. In this paper, we propose a static address-internetworking scheme for interactive networking between a sensor network and the Internet. The proposed scheme that possess a gateway approach to perform the protocol translation from one protocol to another, an overlay approach to constructs an overlay network on the WSNs and enables static internetworking between a sensor network address scheme based on Zigbee and the Internet address scheme based on the Internet Protocol. In addition, we verify the proposed scheme by an interconnection experiment.

  • PDF

Overlay Multicast for File Distribution using Virtual Sources (파일전송의 성능향상을 위한 다중 가상소스 응용계층 멀티캐스트)

  • Lee Soo-Jeon;Lee Dong-Man;Kang Kyung-Ran
    • Journal of KIISE:Information Networking
    • /
    • v.33 no.4
    • /
    • pp.289-298
    • /
    • 2006
  • Algorithms for application-level multicast often use trees to deliver data from the source to the multiple receivers. With the tree structure, the throughput experienced by the descendant nodes will be determined by the performance of the slowest ancestor node. Furthermore, the failure of an ancestor node results in the suspension of the session of all the descendant nodes. This paper focuses on the transmission of data using multiple virtual forwarders, and suggests a scheme to overcome the drawbacks of the plain tree-based application layer multicast schemes. The proposed scheme elects multiple forwarders other than the parent node of the delivery tree. A receiver receives data from the multiple forwarders as well as the parent node and it can increase the amount of receiving data per time unit. The multiple forwarder helps a receiver to reduce the impact of the failure of an ancestor node. The proposed scheme suggests the forwarder selection algorithm to avoid the receipt of duplicate packets. We implemented the proposed scheme using MACEDON which provides a development environment for application layer multicast. We compared the proposed scheme with Bullet by applying the implementation in PlanetLab which is a global overlay network. The evaluation results show that the proposed scheme enhanced the throughput by 20 % and reduced the control overhead over 90 % compared with Bullet.