Study of Parallel Access Schemes to Speed up the Internet
Study of Parallel Access Schemes to Speed up the Internet
复制标题
加速互联网并行访问方案的研究
DOI:
--
复制
发表时间:
1999
期刊:
影响因子:
--
通讯作者:
Andreas Kirpal
中科院分区:
文献类型:
--
作者:
Andreas Kirpal
The exponential growth of the Internet is overloading popular servers, increasing the demands for bandwidth and increasing the clients’ retrieval times. In order to reduce these problems, multiple servers are geographically distributed to store copies of popular documents. For example, with network caching, the origin server stores a master copy of the document and all the geographically dispersed caches store and pull copies of this document. With mirror site replication, documents are replicated into secondary sites, in an effort to both distribute the load of requests across servers and to decrease clients’ retrieval latencies. However, choosing the best server is not obvious and the obtained performance can dramatically vary depending on the selected server. To eliminate complex selection processes and reduce the downloading times, clients could be enabled to download a document in parallel from multiple sources. In this thesis we examine and evaluate different strategies to download documents from multiple sources in parallel. We first consider an open loop distribution with very small feedback information. This scenario is well suited for wireless or satellite communications, where feedback channels are very week; it is also well suited for multicast scenarios where it is very complex to handle feedback information from many clients. We study different scheduling mechanisms in terms of speedup, loss rate, number of sources, and temporal displacement between the sources. To cope with the high heterogeneity of different sources/clients, we also consider the use of forward error correction codes. Then we develop analytical models to evaluate different stopping mechanisms in an open loop-loop distribution and study its performance in terms of bandwidth wasted and speedup reduction. We consider a TCP-based scenario where client-servers negotiate which packets to transmit. We present a new parallel access scheme that automatically schedules the transmission between the different sources to minimize clients’ retrieval times. This TCP-based parallel access scheme does not require to re-encode the documents at the sources and uses the existing network protocols. Based on experimental results we show that a TCP based parallel access scheme gives very good performance in terms of speedup, eliminates the need for a complex selection algorithm and balances the load between several sources.
影响因子:
3.7
作者:
Fan, L;Cao, P;Broder, AZ
通讯作者:
Broder, AZ