본문 바로가기
KERD
논문KCI 등재

P2P 오버레이 네트워크에서 효과적인 Peer 검색을 위한 B-Chord

Effective B-Chord look-up peer in P2P overlay network

1

조회

0

다운로드

2

인용

0

참고문헌

키워드

초록

In this paper, search-efficient Bi-directional-Chord(B-Chord) is proposed in P2P (Peer-to-Peer) overlay network. Chord is the most popular P2P Look-up protocol. However,it applied to the mobile environment, the search success rate become lower and the request delay time increases. That is big problem. Thus, by improving the existing Chord, in this paper proposed B-Chord reduces the request delay time to in a mobile environment. Proposed B-Chord have the two Finger table and can search by selecting Finger table depending on the value of Key. By use these bi-directional, it can reduce the number of nodes Hop and search delay time. Thus, As a result, it will be able to increase the search success rate in a mobile environment.

Abstract

In this paper, search-efficient Bi-directional-Chord(B-Chord) is proposed in P2P (Peer-to-Peer) overlay network. Chord is the most popular P2P Look-up protocol. However,it applied to the mobile environment, the search success rate become lower and the request delay time increases. That is big problem. Thus, by improving the existing Chord, in this paper proposed B-Chord reduces the request delay time to in a mobile environment. Proposed B-Chord have the two Finger table and can search by selecting Finger table depending on the value of Key. By use these bi-directional, it can reduce the number of nodes Hop and search delay time. Thus, As a result, it will be able to increase the search success rate in a mobile environment.

참고문헌 (8)

  1. 김대업, "이용수준에 따른 모바일 엔터테인먼트 서비스 만족도에 관한 연구", (사)디지털산업정보학회 논문지, 1(2), pp.79~89 (2005), (사)디지털산업정보학회
  2. 권준희, "유비쿼터스 환경에서 상황 데이터 기반 모바일 콘텐츠 서비스를 위한 추천 기법", (사)디지털산업정보학회 논문지, 6(2), pp.1~9 (2010), (사)디지털산업정보학회
  3. M. Dischinger, "Mobility Enhancements to an Appoach for Structured Overlay Routing in Wireless Moblie Ad Hoc Networks", Diploma Thesis, System Architecture Group (2005), University or Karlsruhe
  4. "Consistent hashing and random trees"[URL]
  5. I. Stoica, "Chord : A Scalable P2P Lookup Service for Internet Applications", IEEE, 2004, pp.12(2), 205~218
  6. "Chord project"[URL]
  7. 윤영효, "모바일 P2P 환경에서 효율적인 네트워크 자원 활용을 위한 반응적인 코드", 정보과학회논문지 : 정보통신, 36(2), pp.80~89 (2009), 한국정보과학회
  8. 이세연, "Backtracking을 이용한 모바일 에드혹 네트워크에서 Chord 검색 방법", 한국정보과학회 춘계학술발표회, 31(1) (2004)

관련 논문AI추천

이 간행물의 다른 논문 (19건)