RISS 학술연구정보서비스

검색

인기 검색어

    다국어 입력

    http://chineseinput.net/에서 pinyin(병음)방식으로 중국어를 변환할 수 있습니다.

    변환된 중국어를 복사하여 사용하시면 됩니다.

    예시)
    • 中文 을 입력하시려면 zhongwen을 입력하시고 space를누르시면됩니다.
    • 北京 을 입력하시려면 beijing을 입력하시고 space를 누르시면 됩니다.
    닫기
    KCI등재

    DHT 기반 P2P 시스템을 위한 그룹 라우팅 알고리즘에 관한 연구

    한글로보기

    https://www.riss.kr/link?id=A101698371

    • 0

      상세조회
    • 0

      다운로드
    서지정보 열기
    • 내보내기
    • 내책장담기
    • 공유하기
      • URL 복사
    • 오류접수
    인용문이 복사되었습니다.

    부가정보

    다국어 초록 (Multilingual Abstract) kakao i 다국어 번역

    As the P2P System is a distributed system that shares resources of nodes that participate in the system, all the nodes serve as a role of server and client. Currently, although systematic, structured P2P systems such as Chord, Pastry, and Tapestry were suggested based on the distributed hash table, these systems are limited to log₂N for performance efficiency. For this enhanced performance efficiency limited, the article herein suggests group routing algorithm. The suggested algorithm is a node-to-group routing algorithm which divides circular address space into groups and uses a concept of pointer representing each group, which is an algorithm where routing is performed based on pointer. To evaluate algorithm performance, a comparative analysis was conducted on average hops, routing table size, and delayed transmission for chord and routing, a signature algorithm in P2P systems. Therefore, enhanced performance is verified for comparative items from the simulation results.
    번역하기

    As the P2P System is a distributed system that shares resources of nodes that participate in the system, all the nodes serve as a role of server and client. Currently, although systematic, structured P2P systems such as Chord, Pastry, and Tapestry wer...

    As the P2P System is a distributed system that shares resources of nodes that participate in the system, all the nodes serve as a role of server and client. Currently, although systematic, structured P2P systems such as Chord, Pastry, and Tapestry were suggested based on the distributed hash table, these systems are limited to log₂N for performance efficiency. For this enhanced performance efficiency limited, the article herein suggests group routing algorithm. The suggested algorithm is a node-to-group routing algorithm which divides circular address space into groups and uses a concept of pointer representing each group, which is an algorithm where routing is performed based on pointer. To evaluate algorithm performance, a comparative analysis was conducted on average hops, routing table size, and delayed transmission for chord and routing, a signature algorithm in P2P systems. Therefore, enhanced performance is verified for comparative items from the simulation results.

    더보기

    참고문헌 (Reference)

    1 "What Is Web 2. 0"

    2 B. O. Kim, "Trend of Distributed Hash Tables-Based P2P" 2006

    3 B. Y. Zhao, "Tapestry : An Infrastructure for Fault-tolerantWide-area Location and Routing" UC Berkeley, EECS 2001

    4 H. C. Kwon, "Standardization and Technology Trend of Peer-to-Peer Communication" 2007

    5 Antony Rowstron, "Pastry : Scalable, decentralized object location, and routing for large-scale peer-to-peer systems" 329-350, 2001

    6 H. J. Park, "P2P Technology Trend and Application to Home Network" 2006

    7 "GT-ITM"

    8 Ion Stoica, "Chord : A scalable Peer-To-Peer lookup service for internet applications" 149-160, 2001

    9 Evangelia Kalyvianaki, "Building adaptive peer-to-peer systems" 268-269, 2004

    10 R. Lobb, "Adaptive Overlay Topology for Mesh-based p2p-tv"

    1 "What Is Web 2. 0"

    2 B. O. Kim, "Trend of Distributed Hash Tables-Based P2P" 2006

    3 B. Y. Zhao, "Tapestry : An Infrastructure for Fault-tolerantWide-area Location and Routing" UC Berkeley, EECS 2001

    4 H. C. Kwon, "Standardization and Technology Trend of Peer-to-Peer Communication" 2007

    5 Antony Rowstron, "Pastry : Scalable, decentralized object location, and routing for large-scale peer-to-peer systems" 329-350, 2001

    6 H. J. Park, "P2P Technology Trend and Application to Home Network" 2006

    7 "GT-ITM"

    8 Ion Stoica, "Chord : A scalable Peer-To-Peer lookup service for internet applications" 149-160, 2001

    9 Evangelia Kalyvianaki, "Building adaptive peer-to-peer systems" 268-269, 2004

    10 R. Lobb, "Adaptive Overlay Topology for Mesh-based p2p-tv"

    11 I. W. Lee, "A Trend of P2P-Based Service and Charging Technics" 2007

    12 S. Androutsellis-Theotokis, "A Survey of Peer-to-Peer File Sharing Technologies" Athens Univ. of Economics and Business White Paper 2002

    13 E. K. Lua, "A Survey and Comparison of Peer-to-Peer Overlay Network Schemes" 2004

    더보기

    동일학술지(권/호) 다른 논문

    동일학술지 더보기

    더보기

    분석정보

    View

    상세정보조회

    0

    Usage

    원문다운로드

    0

    대출신청

    0

    복사신청

    0

    EDDS신청

    0

    동일 주제 내 활용도 TOP

    더보기

    주제

    연도별 연구동향

    연도별 활용동향

    연관논문

    연구자 네트워크맵

    공동연구자 (7)

    유사연구자 (20) 활용도상위20명

    인용정보 인용지수 설명보기

    학술지 이력

    학술지 이력
    연월일 이력구분 이력상세 등재구분
    2026 평가 재인증평가 신청대상 (재인증)
    2020-01-01 등재 등재학술지 유지 (재인증) KCI등재
    2017-01-01 등재 등재학술지 유지 (계속평가) KCI등재
    2013-01-01 등재 등재학술지 유지 (등재유지) KCI등재
    2010-01-01 등재 등재학술지 유지 (등재유지) KCI등재
    2007-01-01 등재 등재학술지 선정 (등재후보2차) KCI등재
    2006-01-01 등재 등재후보 1차 PASS (등재후보1차) KCI등재후보
    2004-07-01 등재 등재후보학술지 선정 (신규평가) KCI등재후보
    더보기

    학술지 인용정보

    학술지 인용정보
    기준연도 WOS-KCI 통합IF(2년) KCIF(2년) KCIF(3년)
    2016 0.44 0.44 0.44
    KCIF(4년) KCIF(5년) 중심성지수(3년) 즉시성지수
    0.43 0.38 0.58 0.15
    더보기

    이 자료와 함께 이용한 RISS 자료

    나만을 위한 추천자료

    해외이동버튼