東華大學圖書館 |

語系: 繁體中文

說明(常見問題)

回圖書館首頁

手機版館藏查詢

登入

回首頁

切換: 標籤 | MARC模式 | ISBD

An analytical study of server select...

Wu, Tao.

FindBook

Google Book

Amazon

博客來

An analytical study of server selection for scalable Internet services.

紀錄類型:	書目-語言資料,印刷品 : Monograph/item
正題名/作者:	An analytical study of server selection for scalable Internet services./
作者:	Wu, Tao.
面頁冊數:	113 p.
附註:	Adviser: David Starobinski.
Contained By:	Dissertation Abstracts International68-04B.
標題:	Computer Science. -
電子資源:	http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3259905

An analytical study of server selection for scalable Internet services.
Wu, Tao.

An analytical study of server selection for scalable Internet services. - 113 p.

Adviser: David Starobinski.

Thesis (Ph.D.)--Boston University, 2007.

Content replication has become one of the most important paradigms in modern Internet architectures because of its inherent scalability and availability. A key aspect of replication is that of server selection, which directly affects the performance, stability and fairness of content replication networks, such as content delivery networks (CDNs) and peer-to-peer (P2P) networks. While there exist numerous server selection policies, systematic and analytical study of these policies' characteristics remains limited.Subjects--Topical Terms:

626642
Computer Science.

An analytical study of server selection for scalable Internet services.
LDR:03293nam 2200313 a 45 001 947786
005 20110524
008 110524s2007 ||||||||||||||||| ||eng d
035 $a (UMI)AAI3259905
035 $a AAI3259905
040 $a UMI $c UMI
100 1 $a Wu, Tao. $3 1271259
245 1 3 $a An analytical study of server selection for scalable Internet services.
300 $a 113 p.
500 $a Adviser: David Starobinski.
500 $a Source: Dissertation Abstracts International, Volume: 68-04, Section: B, page: 2567.
502 $a Thesis (Ph.D.)--Boston University, 2007.
520 $a Content replication has become one of the most important paradigms in modern Internet architectures because of its inherent scalability and availability. A key aspect of replication is that of server selection, which directly affects the performance, stability and fairness of content replication networks, such as content delivery networks (CDNs) and peer-to-peer (P2P) networks. While there exist numerous server selection policies, systematic and analytical study of these policies' characteristics remains limited.
520 $a In this work, we analytically investigate the strengths and weaknesses of existing server selection policies for single- and multi-class content replication networks. We develop a theoretical benchmark to evaluate the performance of two general server selection policies, referred to as EQ_DELAY and EQ_LOAD, which characterize a wide range of existing server selection algorithms.
520 $a For single-class networks, we find that EQ_LOAD achieves an average delay always higher than or equal to that of EQ_DELAY. A key theoretical result of this work is that in an N-server single-class network, the worst-case delay ratio between EQ_DELAY or EQ_LOAD and the minimal average delay (obtained from the benchmark) is precisely N. We constructively show how this worst-case scenario can arise in highly heterogeneous systems. This result, when interpreted in the context of selfish routing, means that the price of anarchy in unbounded delay networks depends on the topology and can potentially be very large. These results are based on an M/G/ 1 Processor Sharing queueing-theoretic model and are extended to the G/G/1 First-Come First-Serve model at high load.
520 $a For multi-class networks, we first evaluate the performance of EQ_DELAY and EQ_LOAD in simple network topologies, and obtain their delay expressions in all configurations. We then extend these results to more general settings under low and high load regimes and derive similar bounds as in single-class networks.
520 $a Our analytical findings are supported by simulations run for various arrival and service processes, different scheduling disciplines, and workload exhibiting temporal locality and non-negligible network delays. The simulation results indicate that our analysis is applicable to realistic scenarios and that the worst-case performance of EQ_DELAY and EQ_LOAD is likely to occur in single-class networks.
590 $a School code: 0017.
650 4 $a Computer Science. $3 626642
650 4 $a Engineering, Electronics and Electrical. $3 626636
690 $a 0544
690 $a 0984
710 2 $a Boston University. $3 1017454
773 0 $t Dissertation Abstracts International $g 68-04B.
790 $a 0017
790 1 0 $a Starobinski, David, $e advisor
791 $a Ph.D.
792 $a 2007
856 4 0 $u http://pqdd.sinica.edu.tw/twdaoapp/servlet/advanced?query=3259905