The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. ex. Some numerals are expressed as "XNUMX".
Copyrights notice
The original paper is in English. Non-English content has been machine-translated and may contain typographical errors or mistranslations. Copyrights notice
HSPA(고속 패킷 액세스) 기술로 업그레이드된 UMTS(Universal Mobile Telecommunications System) 네트워크에서는 높은 액세스 대역폭과 고급 모바일 장치를 통해 PXNUMXP 애플리케이션을 통해 모바일 사용자 간에 대용량 파일을 공유할 수 있습니다. 파일 공유 애플리케이션을 사용하는 모바일 사용자에게는 파일을 빠르게 수신하는 것이 필수적입니다. 그 이유는 주로 불안정한 신호 강도와 배터리 고장에 취약하기 때문입니다. 많은 연구에서 모바일 환경에서 PXNUMXP 파일 공유 아키텍처를 제시하는 반면, 사용자 간에 파일을 배포하는 데 소요되는 시간을 줄이는 데 초점을 맞춘 연구는 거의 없습니다. 본 논문에서는 AFAM(uMts 네트워크를 위한 적응형 효율적인 파일 공유)이라는 HSPA 네트워크를 위한 효율적인 PXNUMXP 파일 공유 설계를 제시합니다. AFAM은 모바일 노드의 업로드 대역폭을 효율적으로 활용하여 전파 시간을 줄일 수 있습니다. 이는 노드의 동시 업로드 수를 낮추는 동시에 노드의 업로드 대역폭을 효율적으로 활용할 수 있도록 하는 노드 동시 업로드의 적응형 재배열을 사용합니다. AFAM은 또한 블록 선택 및 수신기 선택을 위해 URF(Upload Rarest First) 정책을 사용합니다. 이는 블록 확산에 대해 가장 희귀한 우선을 달성하고 파일 공유 애플리케이션에서 "마지막 블록" 문제를 효과적으로 방지합니다. 우리의 시뮬레이션에 따르면 AFAM은 BulletPrime 및 모바일 환경을 위한 BitTorrent의 직접 구현을 포함한 다른 프로토콜보다 전파 시간이 훨씬 짧습니다.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
부
Kai WANG, Li PAN, Jianhua LI, "Peer-to-Peer Based Fast File Dissemination in UMTS Networks" in IEICE TRANSACTIONS on Communications,
vol. E91-B, no. 12, pp. 3860-3871, December 2008, doi: 10.1093/ietcom/e91-b.12.3860.
Abstract: In UMTS (universal mobile telecommunications system) networks upgraded with HSPA (high speed packet access) technology, the high access bandwidth and advanced mobile devices make it applicable to share large files among mobile users by peer-to-peer applications. To receive files quickly is essential for mobile users in file sharing applications, mainly because they are subject to unstable signal strength and battery failures. While many researches present peer-to-peer file sharing architectures in mobile environments, few works focus on decreasing the time spent in disseminating files among users. In this paper, we present an efficient peer-to-peer file sharing design for HSPA networks called AFAM -- Adaptive efficient File shAring for uMts networks. AFAM can decrease the dissemination time by efficiently utilizing the upload-bandwidth of mobile nodes. It uses an adaptive rearrangement of a node's concurrent uploads, which causes the count of the node's concurrent uploads to lower while ensuring that the node's upload-bandwidth can be efficiently utilized. AFAM also uses URF -- Upload Rarest First policy for the block selection and receiver selection, which achieves real rarest-first for the spread of blocks and effectively avoids the "last-block" problem in file sharing applications. Our simulations show that, AFAM achieves much less dissemination time than other protocols including BulletPrime and a direct implementation of BitTorrent for mobile environments.
URL: https://global.ieice.org/en_transactions/communications/10.1093/ietcom/e91-b.12.3860/_p
부
@ARTICLE{e91-b_12_3860,
author={Kai WANG, Li PAN, Jianhua LI, },
journal={IEICE TRANSACTIONS on Communications},
title={Peer-to-Peer Based Fast File Dissemination in UMTS Networks},
year={2008},
volume={E91-B},
number={12},
pages={3860-3871},
abstract={In UMTS (universal mobile telecommunications system) networks upgraded with HSPA (high speed packet access) technology, the high access bandwidth and advanced mobile devices make it applicable to share large files among mobile users by peer-to-peer applications. To receive files quickly is essential for mobile users in file sharing applications, mainly because they are subject to unstable signal strength and battery failures. While many researches present peer-to-peer file sharing architectures in mobile environments, few works focus on decreasing the time spent in disseminating files among users. In this paper, we present an efficient peer-to-peer file sharing design for HSPA networks called AFAM -- Adaptive efficient File shAring for uMts networks. AFAM can decrease the dissemination time by efficiently utilizing the upload-bandwidth of mobile nodes. It uses an adaptive rearrangement of a node's concurrent uploads, which causes the count of the node's concurrent uploads to lower while ensuring that the node's upload-bandwidth can be efficiently utilized. AFAM also uses URF -- Upload Rarest First policy for the block selection and receiver selection, which achieves real rarest-first for the spread of blocks and effectively avoids the "last-block" problem in file sharing applications. Our simulations show that, AFAM achieves much less dissemination time than other protocols including BulletPrime and a direct implementation of BitTorrent for mobile environments.},
keywords={},
doi={10.1093/ietcom/e91-b.12.3860},
ISSN={1745-1345},
month={December},}
부
TY - JOUR
TI - Peer-to-Peer Based Fast File Dissemination in UMTS Networks
T2 - IEICE TRANSACTIONS on Communications
SP - 3860
EP - 3871
AU - Kai WANG
AU - Li PAN
AU - Jianhua LI
PY - 2008
DO - 10.1093/ietcom/e91-b.12.3860
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E91-B
IS - 12
JA - IEICE TRANSACTIONS on Communications
Y1 - December 2008
AB - In UMTS (universal mobile telecommunications system) networks upgraded with HSPA (high speed packet access) technology, the high access bandwidth and advanced mobile devices make it applicable to share large files among mobile users by peer-to-peer applications. To receive files quickly is essential for mobile users in file sharing applications, mainly because they are subject to unstable signal strength and battery failures. While many researches present peer-to-peer file sharing architectures in mobile environments, few works focus on decreasing the time spent in disseminating files among users. In this paper, we present an efficient peer-to-peer file sharing design for HSPA networks called AFAM -- Adaptive efficient File shAring for uMts networks. AFAM can decrease the dissemination time by efficiently utilizing the upload-bandwidth of mobile nodes. It uses an adaptive rearrangement of a node's concurrent uploads, which causes the count of the node's concurrent uploads to lower while ensuring that the node's upload-bandwidth can be efficiently utilized. AFAM also uses URF -- Upload Rarest First policy for the block selection and receiver selection, which achieves real rarest-first for the spread of blocks and effectively avoids the "last-block" problem in file sharing applications. Our simulations show that, AFAM achieves much less dissemination time than other protocols including BulletPrime and a direct implementation of BitTorrent for mobile environments.
ER -