• Title/Summary/Keyword: Hierarchical overlay

Search Result 21, Processing Time 0.023 seconds

Failure Detection and Resilience in HRing Overlay Network (HRing 오버레이 네트워크에서 실패 탐지 및 회복)

  • Gu, Tae-Wan;Lee, Kwang-Mo
    • Journal of Internet Computing and Services
    • /
    • v.8 no.5
    • /
    • pp.21-33
    • /
    • 2007
  • An overlay network is a virtual network which is constructed on top of a physical computer network. A node in the overlay network is connected through virtual or logical links, where each link corresponds to a path of the links in the underlying physical network. Overlay networks are suitable for sharing heterogeneous resources in distributed environments, However, overlay networks are limited for achieving reliable communication that failure detection in overlay networks is a very important issue. In this paper, we review conditions of conventional failure detection and propose a new approach to failure detection and resilience which can be applied to HRing (Hierarchical Ring) overlay networks. The proposed method consists of the failure detection and the failure resilience phases. Because it utilizes the characteristics of the HRing overlay network for failure detection, it can reduce unnecessary network traffic and provide better scalability and flexibility. We also analyzed and evaluated the performance of the proposed approach through simulations.

  • PDF

Framework for End-to-End Optimal Traffic Control Law Based on Overlay Mesh

  • Liu, Chunyu;Xu, Ke
    • Journal of Communications and Networks
    • /
    • v.9 no.4
    • /
    • pp.428-437
    • /
    • 2007
  • Along with the development of network, more and more functions and services are required by users, while traditional network fails to support all of them. Although overlay is a good solution to some demands, using them in an efficient, scalable way is still a problem. This paper puts forward a framework on how to construct an efficient, scalable overlay mesh in real network. Main differences between other overlays and ours are that our overlay mesh processes some nice features including class-of-service(CoS) and traffic engineering(TE). It embeds the end-to-end optimal traffic control law which can distribute traffic in an optimal way. Then, an example is given for better understanding the framework. Particularly, besides good scalability, and failure recovery, it possesses other characteristics such as routing simplicity, self-organization, etc. In such an overlay mesh, an applicable source routing scheme called hierarchical source routing is used to transmit data packet based on UDP protocol. Finally, a guideline derived from a number of simulations is proposed on how to set various parameters in this overlay mesh, which makes the overlay more efficient.

DDoS Attack Tolerant Network using Hierarchical Overlay (계층적 오버레이를 이용한 DDoS 공격 감내 네트워크)

  • Kim, Mi-Hui;Chae, Ki-Joon
    • The KIPS Transactions:PartC
    • /
    • v.14C no.1 s.111
    • /
    • pp.45-54
    • /
    • 2007
  • As one of the most threatening attacks, DDoS attack makes distributed multiple agents consume some critical resources at the target within the short time, thus the extent and scope of damage is serious. Against the problems, the existing defenses focus on detection, traceback (identification), and filtering. Especially, in the hierarchical networks, the traffic congestion of a specific node could incur the normal traffic congestion of overall lower nodes, and also block the control traffic for notifying the attack detection and identifying the attack agents. In this paper, we introduce a DDoS attack tolerant network structure using a hierarchical overlay for hierarchical networks, which can convey the control traffic for defense such as the notification for attack detection and identification, and detour the normal traffic before getting rid of attack agents. Lastly, we analyze the overhead of overlay construction, the possibility of speedy detection notification, and the extent of normal traffic transmission in the attack case through simulation.

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.

Interference Resolving Radio Resource Allocation Scheme in a TDD-OFDMA/FDD-CDMA Hierarchical Over lay Cellular System

  • Lee, Yeonwoo;Kim, Kyung-Ho
    • Journal of Korea Multimedia Society
    • /
    • v.16 no.7
    • /
    • pp.862-869
    • /
    • 2013
  • In order to support a cell-independent traffic asymmetry, the conventional TDD system cannot avoid crossed time slot (CTS) interference. Moreover, the TDD/FDD hierarchical overlay cellular systems is taken into account as a generally accepted cell model in a heterogeneous radio environment. In this paper, we propose an interference resolving radio resource allocation technique in a TDD-OFDMA cellular system that overlays a FDD-CDMA cell. In our proposed scheme, we exploit under-used FDD-CDMA uplink resource by TDD mobile abiding by a region based time slot(TS) allocation which in turn mitigates CTS interference considerably. It is demonstrated that combined with under-used resource utilization scheme based on mobile's location, the proposed technique can reduce CTS interference considerably and support the asymmetric traffic in TDD system.

A hierarchical overlay structure for video transmission in P2P cloud storage systems (P2P 클라우드 스토리지에서 비디오 전송을 위한 계층적 오버레이 구조)

  • Lee, Kyung-Jin;Kim, Eunsam
    • Journal of Digital Contents Society
    • /
    • v.18 no.1
    • /
    • pp.133-139
    • /
    • 2017
  • To address the problems caused by such high installation and maintenance cost in the conventional server-based cloud systems, researches on P2P cloud storages have been conducted recently. In this paper, we propose a hierachical overlay structure that can improve the playback quality in P2P cloud storage systems for video transmission. In this structure, after we make groups by clustering the participating peers based on their similarities, we construct subgroups by geographically dividing the peers belonging to a specific group considering the physical proximities among them. Therefore, when a request for video playback is issued, we can minimize the transmission delay by selecting the source peers depending on their locality. By simulations, we show that our proposed hierarchical overlay structure considering the peers' locality outperforms the structure where source peers are selected randomly.

Performance Evaluation and Analysis of Implicit Cluster-based Ad hoc Multicast Mechanism (암시적 클러스터기반 애드 혹 멀티캐스트 기법 성능 평가 및 분석)

  • Choi, Young-Hwan;Park, Soo-Chang;Lee, Eui-Sin;Yu, Fucai;Kim, Sang-Ha
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.5
    • /
    • pp.457-461
    • /
    • 2008
  • Previous studies on overlay ad hoc multi-casting are mainly divided into two categories: hierarchical structure-based multicast schemes and non-hierarchical structure-based multicast schemes. They do not reflect their real-time location information for routing updates. This can be a cause of low performance on energy consumption, throughput, and latency. For improving the problems, we propose an implicit cluster based overlay ad hoc multicast scheme with analysis of related work, and then we evaluate performance through computer simulation.

Adaptive Proportional Fair Scheduling for WWAN/WLAN Two-Hop Wireless Relay Networks (WWAN/WLAN 2-홉 무선 중계 네트워크를 위한 적응형 비례 공정 스케줄링 기법)

  • Koo, Young-Dae;Park, Joon-Sang;Han, Seung-Jae
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.14 no.7
    • /
    • pp.743-747
    • /
    • 2008
  • Hierarchical overlay of heterogeneous wireless cells is considered as a promising architecture for next-generation wireless networks. This paper considers a special form of such architecture, WWAN/WLAN two-hop wireless relay networks. We first describe an undesirable scheduling phenomenon that the conventional proportional fair algorithm can cause in such networks. We, then, propose an enhanced proportional fair scheduling to remedy this problem. We demonstrate the performance of the proposed scheme via a simulation of UMTS/WLAN networks using NS-2.

Membership Management based on a Hierarchical Ring for Large Grid Environments

  • Gu, Tae-Wan;Hong, Seong-Jun;Uhmn, Saang-Yong;Lee, Kwang-Mo
    • Journal of Information Processing Systems
    • /
    • v.3 no.1
    • /
    • pp.8-15
    • /
    • 2007
  • Grid environments provide the mechanism to share heterogeneous resources among nodes. Because of the similarity between grid environments and P2P networks, the structures of P2P networks can be adapted to enhance scalability and efficiency in deployment and to search for services. In this paper, we present a membership management based on a hierarchical ring which constructs P2P-like Grid environments. The proposed approach uses only a limited number of connections, reducing communication cost. Also, it only keeps local information for membership, which leads to a further reduction in management cost. This paper analyzes the performance of the approach by simulation and compares it with other approaches.

A Scalable Multicasting with Group Mobility Support in Mobile Ad Hoc Networks

  • Kim, Kap-Dong;Lee, Kwang-Il;Park, Jun-Hee;Kim, Sang-Ha
    • Journal of Information Processing Systems
    • /
    • v.3 no.1
    • /
    • pp.1-7
    • /
    • 2007
  • In mobile ad hoc networks, an application scenario requires mostly collaborative mobility behavior. The key problem of those applications is scalability with regard to the number of multicast members as well as the number of the multicast group. To enhance scalability with group mobility, we have proposed a multicast protocol based on a new framework for hierarchical multicasting that is suitable for the group mobility model in MANET. The key design goal of this protocol is to solve the problem of reflecting the node's mobility in the overlay multicast tree, the efficient data delivery within the sub-group with group mobility support, and the scalability problem for the large multicast group size. The results obtained through simulations show that our approach supports scalability and efficient data transmission utilizing the characteristic of group mobility.