• Title/Summary/Keyword: Virtual Overlay Network

Search Result 24, Processing Time 0.029 seconds

High-Availability Virtual Communication for Cloud Access

  • Sirisutthidecha, Suthee;Maichalernnukul, Kiattisak
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.10 no.8
    • /
    • pp.3455-3473
    • /
    • 2016
  • Cloud computing is a paradigm in which information is permanently stored in servers on the Internet and cached temporarily on clients. Virtual private network (VPN) is the most widely used technology for secure cloud access. Unfortunately, VPN-based cloud services become unavailable when a VPN failure occurs. In this paper, we propose a new scheme to improve the availability of VPN connections against such failures, called high-availability virtual communication (HAVC). Unlike most of the multipath transmission schemes in the literature, the proposed scheme is implemented by using a virtualization technique, and its protocol functions are independent of existing networks - potential clients are not required to modify their applications or operating systems. Simulation results show that the HAVC can not only tolerate VPN failures but also achieve high transmission performance.

Path finding via VRML and VISION overlay for Autonomous Robotic (로봇의 위치보정을 통한 경로계획)

  • Sohn, Eun-Ho;Park, Jong-Ho;Kim, Young-Chul;Chong, Kil-To
    • Proceedings of the KIEE Conference
    • /
    • 2006.10c
    • /
    • pp.527-529
    • /
    • 2006
  • In this paper, we find a robot's path using a Virtual Reality Modeling Language and overlay vision. For correct robot's path we describe a method for localizing a mobile robot in its working environment using a vision system and VRML. The robt identifies landmarks in the environment, using image processing and neural network pattern matching techniques, and then its performs self-positioning with a vision system based on a well-known localization algorithm. After the self-positioning procedure, the 2-D scene of the vision is overlaid with the VRML scene. This paper describes how to realize the self-positioning, and shows the overlap between the 2-D and VRML scenes. The method successfully defines a robot's path.

  • PDF

A Congestion Control Scheme for transmittiing Connectionless Data Traffic in ATM Network (ATM망에서 비연결형 데이터 트래픽 전달을 위한 폭주 제어 방안)

  • Park, Chun-Kwan;Jeon, Byung-Chun;Kim, Young-Sun
    • Journal of the Korean Institute of Telematics and Electronics S
    • /
    • v.35S no.10
    • /
    • pp.42-51
    • /
    • 1998
  • This paper suggests a congestion control scheme for CL (ConnectionLess) overlay network using the feedback loops between CL user and CL server, between CL servers, and between end-to-end CL users, and the header translation table of CL server. The CL overlay network for CBDS(Connectionless Broadhand Data Service) defined by ITU-T((International Telecommunication Union-Telecommunication) consists of CL servers which route frames and links which connect between CL user and CL server or between CL servers. In the CL overlay network, two kinds of congestion, CL link congestion and CL server congestion, may occur. We considered the schemes to solve the congestion. link-by-link method[18] has used the ABR feedback loops of ATM layer between CL user and CL server or between CL servers, and the congestion table using header translation table of CL server. As in congestion of output virtual channel this method has an effect on all the traffic transmitting through the link, then it has an effect on the traffic that has not caused the congestion. As a result, the link utilization of output virtual channel that does not bring the congestion and outputs the traffic is decreased. To overcome this drawback of link-by-link, we proposed the hybrid method that are using the ABR feedback loops of link-by-link method, the feedback loop between CL users in end-to-end, the congestion table using and the header translation table. This scheme deals with teh congestion immediately by link-by-link loops and the header translation table, and then regulates the sending rate of CL user that causes the congestion by end-to-end loop.

  • PDF

Performance Modeling of STTC-based Dual Virtual Cell System under the Overlay Convergent Networks of Cognitive Networking (중첩 융합 네트워크 환경을 고려한 STTC기반 이중 셀 시스템 분석 모델)

  • Choi, YuMi;Kim, Jeong-Ho
    • Journal of the Institute of Electronics and Information Engineers
    • /
    • v.49 no.12
    • /
    • pp.20-26
    • /
    • 2012
  • The newly introduced model of a STTC-based Distributed Wireless Communication System (DWCS) can provide the capability of joint control of the signals at multiple cells. This paper has considered the virtual cell systems: the Dual Virtual Cell (DVC), and also proposes DVC employment strategy based on DWCS network. The considered system constructs DVC by using antenna selection method. Also, for multi-user high-rate data transmission, the proposed system introduces multiple antenna technology to get a spatial and temporal diversity gain and exploits space-time trellis codes known as STTC to increase a spectral efficiency.

A P2P Content Distribution Method Using Virtual Location in MANET (MANET에서 가상위치를 이용한 P2P 데이터 배포 방법)

  • Ko, Seok-Kap;Oh, Seung-Hun;Kim, Young-Han
    • Journal of the Institute of Electronics Engineers of Korea TC
    • /
    • v.46 no.5
    • /
    • pp.139-145
    • /
    • 2009
  • Recently P2P (Peer-to-Peer) networks and applications have been expanded to various field. However, because the construction of P2P network did not influence a underlying network topology or property, it may be inefficient. Especially, this inefficiency is more serious in MANET because MANET has narrow bandwidth and energy constraint. When we use a proactive routing protocol in MANET, we can know hop counts between two nodes. And, we can construct a P2P overlay network using this hop count information. However, In case of using hop count only, we can avoid a interference path selection problem and a zig-zag problem. We propose a method of improving P2P contents distribution using virtual positions. We calculate virtual positions from hop counts using the trigonometry. This method solves a interference path selection problem and a zig-zag problem. This method also allows a P2P network to influence underlying network topology. We adopt this method to a network which uses a virtual geographic routing, a proactive routing protocol, or a reactive routing protocol. We show that our proposed methods improve P2P contents distribution performance over MANET through a simulation.

Design and Implementation of an Automated Inter-connection Tool for Multi-Point OpenFlow Sites (다지점 오픈플로우 사이트들을 위한 자동화된 연동 도구의 설계 및 구현)

  • Na, TaeHeum;Kim, JongWon
    • KIISE Transactions on Computing Practices
    • /
    • v.21 no.1
    • /
    • pp.1-12
    • /
    • 2015
  • To realize futuristic services with agility, the role of the experimental facility (i.e., testbed) based on integrated resources has become important, so that developers can flexibly utilize the dynamic provisioning power of software-defined networking and cloud computing. Following this trend, an OpenFlow-based SDN testbed environment, denoted as OF@TEIN, connects multiple sites with unique SmartX Racks (i.e., virtualization-enabled converged resources). In this paper, in order to automate the multi-point L2 (i.e., Ethernet) inter-connection of OpenFlow islands, we introduce an automated tool to configure the required Network Virtualization using Generic Routing Encapsulation (NVGRE) tunneling. With the proposed automation tool, the operators can efficiently and quickly manage network inter-connections among multiple OpenFlow sites, while letting developers to control their own traffic flows for service realization experiments.

A Scalable P2P Overlay Network for the Inline Virtual World (온라인 가상 세계를 위한 확장성 있는 P2P 오버레이 네트워크)

  • Lee, Young-Jun;Jung, Min-Sun;Lee, Sang-Hwan
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2010.06d
    • /
    • pp.266-271
    • /
    • 2010
  • 최근 MMORPG 게임이나 가상현실 게임들은 대규모의 사용자가 가상세계에 접속하여 게임을 즐긴다. 이러한 환경에서 서버-클라이언트 모델은 서버에 많은 부하를 가져오게 되어, 게임 서비스의 QoS에 나쁜 영향을 준다. 이러한 방법을 해결하기 위해서 서버를 증설 할 수 있으나, 비용이 많이 들기 때문에 최근에 P2P 모델로 구현하려는 시도가 늘고 있다. 하지만 P2P 모델로 구현할 경우 서버의 부하는 쉽게 해결할 수 있으나, 데이터의 동기화에 문제가 생겨서 게임을 아예 진행할 수 없게 되거나, 사용자간의 잘못된 P2P망 구성으로 인해 서버-클라이언트 모델보다 안정적이지 못하다는 문제 점이 있다. 이 논문에서는 기존의 P2P 기법을 통한 영역 분할에 대해 살펴보고, 새로운 영혁 분할 기법을 제안하려고 한다.

  • PDF

A Path tracking algorithm and a VRML image overlay method (VRML과 영상오버레이를 이용한 로봇의 경로추적)

  • Sohn, Eun-Ho;Zhang, Yuanliang;Kim, Young-Chul;Chong, Kil-To
    • Proceedings of the IEEK Conference
    • /
    • 2006.06a
    • /
    • pp.907-908
    • /
    • 2006
  • We describe a method for localizing a mobile robot in its working environment using a vision system and Virtual Reality Modeling Language (VRML). The robot identifies landmarks in the environment, using image processing and neural network pattern matching techniques, and then its performs self-positioning with a vision system based on a well-known localization algorithm. After the self-positioning procedure, the 2-D scene of the vision is overlaid with the VRML scene. This paper describes how to realize the self-positioning, and shows the overlap between the 2-D and VRML scenes. The method successfully defines a robot's path.

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