File Download
There are no files associated with this item.
Links for fulltext
(May Require Subscription)
- Publisher Website: 10.1016/S0743-7315(03)00095-9
- Scopus: eid_2-s2.0-0242595900
- WOS: WOS:000186261500003
- Find via
Supplementary
- Citations:
- Appears in Collections:
Article: Document replication and distribution in extensible geographically distributed web servers
Title | Document replication and distribution in extensible geographically distributed web servers |
---|---|
Authors | |
Keywords | Distributed Web Servers Document Replication And Distribution |
Issue Date | 2003 |
Publisher | Academic Press. The Journal's web site is located at http://www.elsevier.com/locate/jpdc |
Citation | Journal Of Parallel And Distributed Computing, 2003, v. 63 n. 10, p. 927-944 How to Cite? |
Abstract | A geographically distributed web server (GDWS) system consists of multiple server nodes interconnected by a metropolitan area network (MAN) or a wide area network (WAN). It can achieve better efficiency in handling ever-increasing web requests than centralized web servers because its throughput will not be limited by available bandwidth connecting to a central server. The key research issue in the design of GDWS is how to replicate and distribute the documents of a website among the server nodes. This paper proposes a density-based replication scheme and applies it to our proposed Extensible GDWS architecture. We adopted a partial duplication scheme where document replication targets only at hot objects in a website. To distribute the replicas generated via the density-based replication scheme, we propose four different document distribution algorithms: Greedy-cost, Maximal-density, Greedy-penalty, and Proximity-aware. A proximity-based routing mechanism is designed to incorporate these algorithms for achieving better web server performance in a WAN environment. Simulation results show that the Greedy-penalty algorithm yields most stable load-balancing performance, and the Greedy-cost algorithm causes least internal traffic. Our scheme can achieve 80% of the performance of full-replication, with half the disk space. © 2003 Elsevier Inc. All rights reserved. |
Persistent Identifier | http://hdl.handle.net/10722/152305 |
ISSN | 2023 Impact Factor: 3.4 2023 SCImago Journal Rankings: 1.187 |
ISI Accession Number ID | |
References |
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Zhuo, L | en_US |
dc.contributor.author | Wang, CL | en_US |
dc.contributor.author | Lau, FCM | en_US |
dc.date.accessioned | 2012-06-26T06:37:04Z | - |
dc.date.available | 2012-06-26T06:37:04Z | - |
dc.date.issued | 2003 | en_US |
dc.identifier.citation | Journal Of Parallel And Distributed Computing, 2003, v. 63 n. 10, p. 927-944 | en_US |
dc.identifier.issn | 0743-7315 | en_US |
dc.identifier.uri | http://hdl.handle.net/10722/152305 | - |
dc.description.abstract | A geographically distributed web server (GDWS) system consists of multiple server nodes interconnected by a metropolitan area network (MAN) or a wide area network (WAN). It can achieve better efficiency in handling ever-increasing web requests than centralized web servers because its throughput will not be limited by available bandwidth connecting to a central server. The key research issue in the design of GDWS is how to replicate and distribute the documents of a website among the server nodes. This paper proposes a density-based replication scheme and applies it to our proposed Extensible GDWS architecture. We adopted a partial duplication scheme where document replication targets only at hot objects in a website. To distribute the replicas generated via the density-based replication scheme, we propose four different document distribution algorithms: Greedy-cost, Maximal-density, Greedy-penalty, and Proximity-aware. A proximity-based routing mechanism is designed to incorporate these algorithms for achieving better web server performance in a WAN environment. Simulation results show that the Greedy-penalty algorithm yields most stable load-balancing performance, and the Greedy-cost algorithm causes least internal traffic. Our scheme can achieve 80% of the performance of full-replication, with half the disk space. © 2003 Elsevier Inc. All rights reserved. | en_US |
dc.language | eng | en_US |
dc.publisher | Academic Press. The Journal's web site is located at http://www.elsevier.com/locate/jpdc | en_US |
dc.relation.ispartof | Journal of Parallel and Distributed Computing | en_US |
dc.subject | Distributed Web Servers | en_US |
dc.subject | Document Replication And Distribution | en_US |
dc.title | Document replication and distribution in extensible geographically distributed web servers | en_US |
dc.type | Article | en_US |
dc.identifier.email | Wang, CL:clwang@cs.hku.hk | en_US |
dc.identifier.email | Lau, FCM:fcmlau@cs.hku.hk | en_US |
dc.identifier.authority | Wang, CL=rp00183 | en_US |
dc.identifier.authority | Lau, FCM=rp00221 | en_US |
dc.description.nature | link_to_subscribed_fulltext | en_US |
dc.identifier.doi | 10.1016/S0743-7315(03)00095-9 | en_US |
dc.identifier.scopus | eid_2-s2.0-0242595900 | en_US |
dc.identifier.hkuros | 92483 | - |
dc.relation.references | http://www.scopus.com/mlt/select.url?eid=2-s2.0-0242595900&selection=ref&src=s&origin=recordpage | en_US |
dc.identifier.volume | 63 | en_US |
dc.identifier.issue | 10 | en_US |
dc.identifier.spage | 927 | en_US |
dc.identifier.epage | 944 | en_US |
dc.identifier.isi | WOS:000186261500003 | - |
dc.publisher.place | United States | en_US |
dc.identifier.scopusauthorid | Zhuo, L=36945795200 | en_US |
dc.identifier.scopusauthorid | Wang, CL=7501646188 | en_US |
dc.identifier.scopusauthorid | Lau, FCM=7102749723 | en_US |
dc.identifier.issnl | 0743-7315 | - |