RISS 학술연구정보서비스

검색

인기 검색어

    다국어 입력

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

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

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

    네트워크 코딩에서의 유한필드 연산의 구현과 성능 영향 평가

    한글로보기

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

    • 0

      상세조회
    • 0

      다운로드
    서지정보 열기
    • 내보내기
    • 내책장담기
    • 공유하기
    • 오류접수

    부가정보

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

    Using Network Coding in P2P systems yields great benefits, e.g., reduced download delay. The core notion of Network Coding is to allow encoding and decoding at intermediate nodes. which are prohibited in the traditional networking. However, improper implementation of Network Coding may reduce the overall performance of P2P systems. Network Coding cannot work with general arithmetic operations. since its arithmetic is over a Finite Field and the use of an efficient Finite Field arithmetic algorithm is the key to the performance of Network Coding. Also there are other important performance parameters in Network Coding such as Field size. In this paper we study how those factors influence the performance of Network Coding based systems. A set of experiments shows that overall performance of Network Coding can vary 2-5 times by those factors and we argue that when developing a network system using Network Coding those performance parameters must be carefully chosen.
    번역하기

    Using Network Coding in P2P systems yields great benefits, e.g., reduced download delay. The core notion of Network Coding is to allow encoding and decoding at intermediate nodes. which are prohibited in the traditional networking. However, improper i...

    Using Network Coding in P2P systems yields great benefits, e.g., reduced download delay. The core notion of Network Coding is to allow encoding and decoding at intermediate nodes. which are prohibited in the traditional networking. However, improper implementation of Network Coding may reduce the overall performance of P2P systems. Network Coding cannot work with general arithmetic operations. since its arithmetic is over a Finite Field and the use of an efficient Finite Field arithmetic algorithm is the key to the performance of Network Coding. Also there are other important performance parameters in Network Coding such as Field size. In this paper we study how those factors influence the performance of Network Coding based systems. A set of experiments shows that overall performance of Network Coding can vary 2-5 times by those factors and we argue that when developing a network system using Network Coding those performance parameters must be carefully chosen.

    더보기

    참고문헌 (Reference)

    1 T. Ho, "The benefits of coding over routing in a randomized setting" 442-, 2003

    2 P. Chou, "Practical Network Coding, Proceeding of Allerton Conference on Communication, Control, and Computing. Monticello" 2003

    3 R. Ahlswede, "Network Information Flow" 46 (46): 1204-1216, 2000

    4 C. Gkantsidis, "Network Coding for Large Scale Content Distribution" 2235-2245, 2005

    5 P. Montgomery, "Modular Multiplication without Trial Division" 44 (44): 519-521, 1985

    6 B. Cohen, "Incentives Build Robustness in BitTorrent" 2003

    7 J. Guajardo, "Efficient Software-Implementation of Finite Fields with Applications to Cryptography" 93 (93): 3-32, 2006

    8 U. Lee, "CodeTorrent: Content Distribution using Network Coding in VANETs" 2006

    9 J. Park, "CodeCast: A Network Coding Based Ad Hoc Multicast Protocol" 13 (13): 76-81, 2006

    10 C. Gkantsidis, "Anatomy of a P2P Content Distribution system with Network Coding" 2006

    1 T. Ho, "The benefits of coding over routing in a randomized setting" 442-, 2003

    2 P. Chou, "Practical Network Coding, Proceeding of Allerton Conference on Communication, Control, and Computing. Monticello" 2003

    3 R. Ahlswede, "Network Information Flow" 46 (46): 1204-1216, 2000

    4 C. Gkantsidis, "Network Coding for Large Scale Content Distribution" 2235-2245, 2005

    5 P. Montgomery, "Modular Multiplication without Trial Division" 44 (44): 519-521, 1985

    6 B. Cohen, "Incentives Build Robustness in BitTorrent" 2003

    7 J. Guajardo, "Efficient Software-Implementation of Finite Fields with Applications to Cryptography" 93 (93): 3-32, 2006

    8 U. Lee, "CodeTorrent: Content Distribution using Network Coding in VANETs" 2006

    9 J. Park, "CodeCast: A Network Coding Based Ad Hoc Multicast Protocol" 13 (13): 76-81, 2006

    10 C. Gkantsidis, "Anatomy of a P2P Content Distribution system with Network Coding" 2006

    11 R. Koetter, "An Algebraic Approach to Network Coding" 11 (11): 782-795, 2003

    12 S. Trenholme, "AES' Galois field"

    더보기

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

    동일학술지 더보기

    더보기

    분석정보

    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 자료

    나만을 위한 추천자료

    해외이동버튼