• Title/Summary/Keyword: 애니캐스트

Search Result 7, Processing Time 0.018 seconds

Potential-Field-Based Anycast Routing in Large-Scale Wireless Mesh Networks : A Distributed Algorithm based on Finite Difference Method (광역 무선 메쉬 네트워크에서 포텐셜 필드 기반 애니캐스트 라우팅 : 유한 차분법 응용 분산 알고리즘)

  • Jung, Sang-Su;Kserawi, Malaz;Rhee, June-Koo Kevin
    • Journal of KIISE:Computing Practices and Letters
    • /
    • v.16 no.6
    • /
    • pp.683-687
    • /
    • 2010
  • In this paper, we propose an anycast routing scheme for large-scale wireless mesh networks, which requires only one-hop local information with no flooding overhead. We develop an analytical model for anycast mesh networks based on an electrostatic theory. A finite difference method contributes to achieving gateway load balancing with constant control overheads. We verify the performance of the proposed scheme by simulations.

Fail-over Mechanisms based on Anycast for Stable IPv6 Recursive DNS Services (안정적인 IPv6 리커시브 DNS 서비스를 위한 애니캐스트 기반의 실패 복구 방안 연구)

  • Suh, Yu-Hwa;Kim, Kyung-Min;Shin, Yong-Tae;Song, Kwang-Ho;Kim, Weon;Park, Chan-Ki
    • The Journal of Korean Institute of Communications and Information Sciences
    • /
    • v.32 no.2B
    • /
    • pp.108-117
    • /
    • 2007
  • Recursive DNS is configured as primary or secondary DNS on user PC and performs domain name resolution corresponding user's DNS query. At present, the amount of DNS traffic is occupied high rate in the total internet traffic and the internet traffic would be increased by failure of IPv6 DNS queries and responses as IPv6 transition environment. Also, existing Recursive DNS service mechanisms is unstable on malicious user's attack same as DoS/DDoS Attack and isn't provide to user trust DNS service fail-over. In this paper, we propose IPv6 Recursive DNS service mechanisms for based on anycast for improving stability. It is that fail-over Recursive DNS is configured IPv6 Anycast address for primary Recursive DNS's foil-over. this mechanisms increases reliability and resiliency to DoS/DDoS attacks and reduces query latency and helps minimize DNS traffic as inducing IPv6 address.

Lightweight Home Network Middleware Security Mechanism supporting Mobility Management (이동성 관리를 지원하는 경량 홈 네트워크 미들웨어 보안 기술)

  • Koh Kwang-Man;Hyun Ho-Jae;Hong Ju-Hee;Han Sun-Young
    • The KIPS Transactions:PartC
    • /
    • v.13C no.3 s.106
    • /
    • pp.375-382
    • /
    • 2006
  • As various kinds of embedded systems (or devices) become widely available, research on home network middleware which can access and control embedded home appliances are actively being progressed. However, there is a significant problem in applying the home network technology to embedded systems because of their limited storage space and low computing power. In this paper, we present a lightweight middleware for home network on embedded systems. Also, we propose a mechanism for mobility management which adopts the anycast technology.

Research on Event Mechanism for Reducing Power Overheads in Cache Memory Synchronization (캐시 메모리 동기화 전력 감소를 위한 이벤트 메커니즘에 대한 연구)

  • Pak, Young-Jin;Jeong, Ha-Young;Lee, Yong-Surk
    • Journal of the Institute of Electronics Engineers of Korea CI
    • /
    • v.48 no.3
    • /
    • pp.69-75
    • /
    • 2011
  • In this paper, we propose an anycast event driven synchronization mechanism to reduce power overheads. Our proposed mechanism can reduce unnecessary polling operations on SHI(Snoop Hit Invalidate) or SHR(Snoop Hit Read) states. It prevents waisting bandwidth and reduces power overheads on polling operation. Also it decreases transition power of state change compared to broadcast model. Simulation results indicated that the proposed architecture had about 15.3% of power decrease compared to spin-lock model and about 4.7% of power decrease compared to broadcast model. Overall results indicated that proposed synchronization mechanism could increase power efficiency of multi-core system by reducing power overheads.

A Study of Tier 2 Nameserver Distribution for Reducing ENUM DNS Resolution Time (ENUM DNS 탐색시간 단축을 위한 계층 2 네임서버 분산 방안 연구)

  • Park, Jong-Il;Yoon, Mi-Youn;Shin, Yong-Tae;Choe, Jong-Won;Shin, Sung-Woo;Na, Jung-Jung;Kim, Won
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2003.10c
    • /
    • pp.379-381
    • /
    • 2003
  • ENUM은 전세계적으로 유일성이 보장된 ITU­T의 E.164 전화번호를 PSTN과 IP 네트워크를 연결하기 위한 식별자로써 사용하기 위해 정의된 새로운 인터넷 프로토콜이다. ENUM은 일종의 디렉토리 서비스로써 그 기반을 DNS에 두고 있지만, 캐싱의 비효율성과 이중 탐색으로 인한 지연이 발생한다는 단점을 가지고 있다. 본 논문은 CDN 환경과 애니캐스트를 응용하여, ENUM 서비스의 효율적인 제공을 위해 ENUM DNS의 탐색시간을 단축할 수 있는 방안을 제시하고자 한다.

  • PDF

A Case Study Of BGP Announcing Over GRE Tunneling (GRE 터널링을 이용한 BGP 어나운싱 방법에 대한 연구)

  • Hong, Yunseok;Han, Wooyoung;Park, Sungsu
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2022.01a
    • /
    • pp.103-105
    • /
    • 2022
  • 본 논문에서는 GRE 터널링을 사용한 원격지에서의 BGP 어나운싱 방법에 대해 서술한다. BGP 어나운스를 진행하기 위해서는 고가의 라우터 장비와, 고성능, 고가용성의 네트워크, 자율시스템 망 식별 번호 (AS Number)이 필요하지만 소형 네트워크 운영을 위해 위 요소들을 모두 구비하는 것은 어려운 점이 많기 때문에, BGP Announce를 지원하는 퍼블릭 클라우드와의 GRE 라우팅을 사용해서 저비용으로 안정적인 BGP Announce를 하는 방법과, 이에 필요한 소프트웨어적 구성에 대해서 기술한다.

  • PDF

Greedy Anycast Forwarding Protocol based on Vehicle Moving Direction and Distance (차량의 이동 방향과 거리 기반의 그리디 애니캐스트 포워딩 프로토콜)

  • Cha, Siho;Lee, Jongeon;Ryu, Minwoo
    • Journal of Korea Society of Digital Industry and Information Management
    • /
    • v.13 no.1
    • /
    • pp.79-85
    • /
    • 2017
  • Vehicular ad-hoc networks (VANETs) cause link disconnection problems due to the rapid speed and the frequent moving direction change of vehicles. Link disconnection in vehicle-to-vehicle communication is an important issue that must be solved because it decreases the reliability of packet forwarding. From the characteristics of VANETs, greedy forwarding protocols using the position information based on the inter-vehicle distance have gained attention. However, greedy forwarding protocols do not perform well in the urban environment where the direction of the vehicle changes greatly. It is because greedy forwarding protocols select the neighbor vehicle that is closest to the destination vehicle as the next transmission vehicle. In this paper, we propose a greedy anycast forwarding (GAF) protocol to improve the reliability of the inter-vehicle communication. The proposed GAF protocol combines the greedy forwarding scheme and the anycast forwarding method. Simulation results show that the GAF protocol can provide a better packet delivery rate than existing greedy forwarding protocols.