File Download
  Links for fulltext
     (May Require Subscription)
Supplementary

Article: Approximate algorithms for document placement in distributed Web servers

TitleApproximate algorithms for document placement in distributed Web servers
Authors
KeywordsDistributed Web server
load balancing
document placement
document replication
file allocation problem
Issue Date2005
PublisherIEEE. The Journal's web site is located at http://www.computer.org/tpds
Citation
IEEE Transactions on Parallel and Distributed Systems, 2005, v. 16 n. 6, p. 489-496 How to Cite?
AbstractWe study approximate algorithms for placing a set of documents into M distributed Web servers in this paper. We define the load of a server to be the summation of loads induced by all documents stored. The size of a server is defined in a similar manner. We propose five algorithms. Algorithm 1 balances the loads and sizes of the servers by limiting the loads to k/sub l/ and the sizes to k/sub s/ times their optimal values, where 1/k/sub l/-1 + 1/k/sub n/-1. This result improves the bounds on load and size of servers in (L.C. Chen et al., 2001). Algorithm 2 further reduces the load bound on each server by using partial document replication, and algorithm 3 by sorting. Algorithm 4 employs both partial replication and sorting. Last, without using sorting and replication, we give algorithm 5 for the dynamic placement at the cost of a factor Q(log M) in the time-complexity.
Persistent Identifierhttp://hdl.handle.net/10722/47089
ISSN
2015 Impact Factor: 2.661
2015 SCImago Journal Rankings: 1.590
ISI Accession Number ID

 

DC FieldValueLanguage
dc.contributor.authorTse, SSHen_HK
dc.date.accessioned2007-10-30T07:06:53Z-
dc.date.available2007-10-30T07:06:53Z-
dc.date.issued2005en_HK
dc.identifier.citationIEEE Transactions on Parallel and Distributed Systems, 2005, v. 16 n. 6, p. 489-496en_HK
dc.identifier.issn1045-9219en_HK
dc.identifier.urihttp://hdl.handle.net/10722/47089-
dc.description.abstractWe study approximate algorithms for placing a set of documents into M distributed Web servers in this paper. We define the load of a server to be the summation of loads induced by all documents stored. The size of a server is defined in a similar manner. We propose five algorithms. Algorithm 1 balances the loads and sizes of the servers by limiting the loads to k/sub l/ and the sizes to k/sub s/ times their optimal values, where 1/k/sub l/-1 + 1/k/sub n/-1. This result improves the bounds on load and size of servers in (L.C. Chen et al., 2001). Algorithm 2 further reduces the load bound on each server by using partial document replication, and algorithm 3 by sorting. Algorithm 4 employs both partial replication and sorting. Last, without using sorting and replication, we give algorithm 5 for the dynamic placement at the cost of a factor Q(log M) in the time-complexity.en_HK
dc.format.extent379120 bytes-
dc.format.extent1780 bytes-
dc.format.mimetypeapplication/pdf-
dc.format.mimetypetext/plain-
dc.languageengen_HK
dc.publisherIEEE. The Journal's web site is located at http://www.computer.org/tpdsen_HK
dc.rightsCreative Commons: Attribution 3.0 Hong Kong License-
dc.rights©2005 IEEE. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE.en_HK
dc.subjectDistributed Web serveren_HK
dc.subjectload balancingen_HK
dc.subjectdocument placementen_HK
dc.subjectdocument replicationen_HK
dc.subjectfile allocation problemen_HK
dc.titleApproximate algorithms for document placement in distributed Web serversen_HK
dc.typeArticleen_HK
dc.identifier.openurlhttp://library.hku.hk:4550/resserv?sid=HKU:IR&issn=1045-9219&volume=16&issue=6&spage=489&epage=496&date=2005&atitle=Approximate+algorithms+for+document+placement+in+distributed+Web+serversen_HK
dc.description.naturepublished_or_final_versionen_HK
dc.identifier.doi10.1109/TPDS.2005.63en_HK
dc.identifier.scopuseid_2-s2.0-21244454554-
dc.identifier.isiWOS:000228524500002-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats