分散式個人Proxy伺服器

碩士 === 國立臺灣大學 === 資訊工程學研究所 === 90 === Traditionally, a proxy server caches the requested data in its cache pool and fetches data from other neighbor proxy servers whenever the data is missing. However, the neighbor proxy servers are usually predefined and amount is also fixed. These situa...

Full description

Bibliographic Details
Main Author: 李昭賢
Other Authors: 李肇林
Format: Others
Language:zh-TW
Published: 2002
Online Access:http://ndltd.ncl.edu.tw/handle/03952977762273811580
id ndltd-TW-090NTU00392108
record_format oai_dc
spelling ndltd-TW-090NTU003921082015-10-13T14:38:19Z http://ndltd.ncl.edu.tw/handle/03952977762273811580 分散式個人Proxy伺服器 李昭賢 碩士 國立臺灣大學 資訊工程學研究所 90 Traditionally, a proxy server caches the requested data in its cache pool and fetches data from other neighbor proxy servers whenever the data is missing. However, the neighbor proxy servers are usually predefined and amount is also fixed. These situations result in a low probability of successful hit. In order to improve the described situation, we developed a peer-to-peer-based architecture, such as Nasper, to make the predefined list of each client being able to serve as a proxy server. Hence, the probability of an access hit would be vastly improved while the predefined list is growing bigger. This architecture not only improved the hit rate but also decreasing the loading of a traditional proxy server. 李肇林 2002 學位論文 ; thesis 0 zh-TW
collection NDLTD
language zh-TW
format Others
sources NDLTD
description 碩士 === 國立臺灣大學 === 資訊工程學研究所 === 90 === Traditionally, a proxy server caches the requested data in its cache pool and fetches data from other neighbor proxy servers whenever the data is missing. However, the neighbor proxy servers are usually predefined and amount is also fixed. These situations result in a low probability of successful hit. In order to improve the described situation, we developed a peer-to-peer-based architecture, such as Nasper, to make the predefined list of each client being able to serve as a proxy server. Hence, the probability of an access hit would be vastly improved while the predefined list is growing bigger. This architecture not only improved the hit rate but also decreasing the loading of a traditional proxy server.
author2 李肇林
author_facet 李肇林
李昭賢
author 李昭賢
spellingShingle 李昭賢
分散式個人Proxy伺服器
author_sort 李昭賢
title 分散式個人Proxy伺服器
title_short 分散式個人Proxy伺服器
title_full 分散式個人Proxy伺服器
title_fullStr 分散式個人Proxy伺服器
title_full_unstemmed 分散式個人Proxy伺服器
title_sort 分散式個人proxy伺服器
publishDate 2002
url http://ndltd.ncl.edu.tw/handle/03952977762273811580
work_keys_str_mv AT lǐzhāoxián fēnsànshìgèrénproxycìfúqì
_version_ 1717755497776414720