Content distributing algorithm for replicated Web servers based on market models

A content distributing algorithm based on market models for a replication distribution scheme of Web contents is proposed. In general, replication distribution is considered to effectively utilize the time and space local properties of access from a client and has been the topic of numerous studies....

Full description

Saved in:
Bibliographic Details
Published inElectronics & communications in Japan. Part 2, Electronics Vol. 84; no. 11; pp. 9 - 19
Main Authors Nishimura, Kenji, Yamamoto, Miki, Ikeda, Hiromasa
Format Journal Article
LanguageEnglish
Published New York John Wiley & Sons, Inc 01.11.2001
Subjects
Online AccessGet full text

Cover

Loading…
Abstract A content distributing algorithm based on market models for a replication distribution scheme of Web contents is proposed. In general, replication distribution is considered to effectively utilize the time and space local properties of access from a client and has been the topic of numerous studies. However, maintaining QoS (such as shortening the content obtaining time) in replicated servers when servers are in a congested state has not been considered in these studies. Since replicated servers constitute a resource shared by multiple ISPs (Internet Service Providers), the accesses need to be limited to replicated servers in case of a congested state to maintain the QoS enjoyed by each client. Thus, in this paper, a scheme for determining allocation of access to replicated servers for each content during congestion based on market models is proposed. The analytical and simulation results have confirmed that the proposed method controls the QoS in accordance with the access arrival rate to each content. © 2001 Scripta Technica, Electron Comm Jpn Pt 2, 84(11): 9–19, 2001
AbstractList A content distributing algorithm based on market models for a replication distribution scheme of Web contents is proposed. In general, replication distribution is considered to effectively utilize the time and space local properties of access from a client and has been the topic of numerous studies. However, maintaining QoS (such as shortening the content obtaining time) in replicated servers when servers are in a congested state has not been considered in these studies. Since replicated servers constitute a resource shared by multiple ISPs (Internet Service Providers), the accesses need to be limited to replicated servers in case of a congested state to maintain the QoS enjoyed by each client. Thus, in this paper, a scheme for determining allocation of access to replicated servers for each content during congestion based on market models is proposed. The analytical and simulation results have confirmed that the proposed method controls the QoS in accordance with the access arrival rate to each content.
Abstract A content distributing algorithm based on market models for a replication distribution scheme of Web contents is proposed. In general, replication distribution is considered to effectively utilize the time and space local properties of access from a client and has been the topic of numerous studies. However, maintaining QoS (such as shortening the content obtaining time) in replicated servers when servers are in a congested state has not been considered in these studies. Since replicated servers constitute a resource shared by multiple ISPs (Internet Service Providers), the accesses need to be limited to replicated servers in case of a congested state to maintain the QoS enjoyed by each client. Thus, in this paper, a scheme for determining allocation of access to replicated servers for each content during congestion based on market models is proposed. The analytical and simulation results have confirmed that the proposed method controls the QoS in accordance with the access arrival rate to each content. © 2001 Scripta Technica, Electron Comm Jpn Pt 2, 84(11): 9–19, 2001
A content distributing algorithm based on market models for a replication distribution scheme of Web contents is proposed. In general, replication distribution is considered to effectively utilize the time and space local properties of access from a client and has been the topic of numerous studies. However, maintaining QoS (such as shortening the content obtaining time) in replicated servers when servers are in a congested state has not been considered in these studies. Since replicated servers constitute a resource shared by multiple ISPs (Internet Service Providers), the accesses need to be limited to replicated servers in case of a congested state to maintain the QoS enjoyed by each client. Thus, in this paper, a scheme for determining allocation of access to replicated servers for each content during congestion based on market models is proposed. The analytical and simulation results have confirmed that the proposed method controls the QoS in accordance with the access arrival rate to each content. © 2001 Scripta Technica, Electron Comm Jpn Pt 2, 84(11): 9–19, 2001
Author Nishimura, Kenji
Yamamoto, Miki
Ikeda, Hiromasa
Author_xml – sequence: 1
  givenname: Kenji
  surname: Nishimura
  fullname: Nishimura, Kenji
  organization: Department of Communications Engineering, Graduate School of Engineering, Osaka University, Suita, 565-0871 Japan
– sequence: 2
  givenname: Miki
  surname: Yamamoto
  fullname: Yamamoto, Miki
  organization: Department of Communications Engineering, Graduate School of Engineering, Osaka University, Suita, 565-0871 Japan
– sequence: 3
  givenname: Hiromasa
  surname: Ikeda
  fullname: Ikeda, Hiromasa
  organization: Department of Communications Engineering, Graduate School of Engineering, Osaka University, Suita, 565-0871 Japan
BookMark eNp1kEFLwzAUx4NMcJse_AY5CR7q0qRNm6OWOZWhQyYTL6FNX2Zn18ykU_ftzejw5un9efz-j8dvgHqNaQCh85BchYTQEahV4RNPj1A_jCkJeMRoD_XTJOYB5-z1BA2cWxFCBI9pH80y07TQtLisXGurYttWzRLn9dLYqn1fY20strCpK5W3UOIFFNiB_QLrcJE7vzENXuf2A1q8NiXU7hQd67x2cHaYQ_RyO55nd8H0aXKfXU8DxThNAw1CxCIClpBSlZT4CEJREaXAtM5FEoeUcxFrQdMyUpRrokQehSVjHJggbIguursbaz634Fq5rpyCus4bMFsnfZvzOA09eNmByhrnLGi5sZV_eSdDIvfO5N6Z3Dvz7Khjv6sadv-Dcpw93BwaQdfw-uDnr-GNSJ6wJJaLx4kM5-nsbZoJ-cx-Abg9f3M
Cites_doi 10.1016/0169-7552(96)00030-X
10.1016/S0169-7552(97)00032-9
10.1109/4434.580451
10.1016/S0169-7552(97)00041-X
ContentType Journal Article
Copyright Copyright © 2001 Scripta Technica
Copyright_xml – notice: Copyright © 2001 Scripta Technica
DBID BSCLL
AAYXX
CITATION
7SP
8FD
L7M
DOI 10.1002/ecjb.1068
DatabaseName Istex
CrossRef
Electronics & Communications Abstracts
Technology Research Database
Advanced Technologies Database with Aerospace
DatabaseTitle CrossRef
Technology Research Database
Advanced Technologies Database with Aerospace
Electronics & Communications Abstracts
DatabaseTitleList Technology Research Database
CrossRef

DeliveryMethod fulltext_linktorsrc
Discipline Engineering
EISSN 1520-6432
EndPage 19
ExternalDocumentID 10_1002_ecjb_1068
ECJB1068
ark_67375_WNG_1T8PZLC9_R
Genre article
GrantInformation_xml – fundername: Scientific Research Fund, Ministry of Education
GroupedDBID .GA
.Y3
10A
1OB
1OC
31~
4.4
51W
51X
52N
52P
52S
52X
5VS
7PT
8-1
AAEVG
AAHHS
AANLZ
AAXRX
AAZKR
ABCUV
ABDBF
ABIJN
ACAHQ
ACBWZ
ACCFJ
ACCZN
ACPOU
ACXBN
ACXQS
ADEOM
ADIZJ
ADMGS
ADOZA
ADZOD
AEEZP
AEIGN
AEIMD
AEQDE
AEUQT
AEUYR
AFBPY
AFFPM
AFGKR
AFPWT
AFZJQ
AHBTC
AI.
AITYG
AIURR
AIWBW
AJBDE
ALMA_UNASSIGNED_HOLDINGS
ALUQN
AMBMR
AMYDB
ASPBG
ATUGU
AVWKF
AZFZN
BDRZF
BFHJK
BRXPI
BSCLL
BY8
CMOOK
DCZOG
DR2
DRFUL
DRSTM
EBS
EJD
ESX
FEDTE
G-S
GNP
GODZA
HF~
HGLYW
HVGLF
I-F
IX1
KQQ
LATKE
LAW
LEEKS
LH4
LITHE
LOXES
LUTES
LYRES
M59
MEWTI
MK~
ML~
MRFUL
MRSTM
MSFUL
MSSTM
MXFUL
MXSTM
PALCI
QB0
RIWAO
ROL
RWI
RYL
SAMSI
SUPJJ
TUS
UB1
VH1
W99
WH7
WIH
WIK
WQJ
WWI
WXSBR
XG1
XV2
ZZTAW
AAYXX
CITATION
7SP
8FD
L7M
ID FETCH-LOGICAL-c3628-fe99594e370dcd2094ee9c2948e3ffa975126695f928d4c26f0c9a41d336e3903
IEDL.DBID DR2
ISSN 8756-663X
IngestDate Fri Aug 16 21:17:25 EDT 2024
Fri Aug 23 03:47:04 EDT 2024
Sat Aug 24 01:00:41 EDT 2024
Wed Oct 30 10:01:33 EDT 2024
IsPeerReviewed true
IsScholarly true
Issue 11
Language English
LinkModel DirectLink
MergedId FETCHMERGED-LOGICAL-c3628-fe99594e370dcd2094ee9c2948e3ffa975126695f928d4c26f0c9a41d336e3903
Notes ark:/67375/WNG-1T8PZLC9-R
ArticleID:ECJB1068
istex:0803D1BBA1F10AF7572CD1428D1FEBBFDD461CE4
Scientific Research Fund, Ministry of Education
ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 23
PQID 26666581
PQPubID 23500
PageCount 11
ParticipantIDs proquest_miscellaneous_26666581
crossref_primary_10_1002_ecjb_1068
wiley_primary_10_1002_ecjb_1068_ECJB1068
istex_primary_ark_67375_WNG_1T8PZLC9_R
PublicationCentury 2000
PublicationDate November 2001
PublicationDateYYYYMMDD 2001-11-01
PublicationDate_xml – month: 11
  year: 2001
  text: November 2001
PublicationDecade 2000
PublicationPlace New York
PublicationPlace_xml – name: New York
PublicationTitle Electronics & communications in Japan. Part 2, Electronics
PublicationTitleAlternate Electron. Comm. Jpn. Pt. II
PublicationYear 2001
Publisher John Wiley & Sons, Inc
Publisher_xml – name: John Wiley & Sons, Inc
References Imano H, Yamashita H. Nonlinear design methods. Nika Giren Shuppansha; 1978.
Scheuermann P, Shim J, Vingralek R. A case for delay-conscious caching of Web documents. Computer Networks ISDN Syst 1997;29:997-1005.
Wooster RP, Abrams M. Proxy caching that estimates page load delays. Computer Networks ISDN Syst 1997;29:977-986.
Murphy J, Murphy L, Posner EC. Distributed pricing for embedded ATM networks. ITC 14, p 1053-1063, 1994.
Luenberger DG. Linear and nonlinear programming, 2nd ed. Addison-Wesley; 1994.
Bestavros A. WWW traffic reduction and load balancing through server-based caching. IEEE Concurrency, p 56-66, Jan.-March 1997.
Baentsch M, Molter G, Strum P. Introducing application-level replication and naming into today's Web. Computer Networks ISDN Syst 1996;28:921-930.
1998
1997; 29
1997
1994; 14
1994
1996; 28
1978
e_1_2_1_6_2
e_1_2_1_7_2
e_1_2_1_4_2
Imano H (e_1_2_1_10_2) 1978
e_1_2_1_5_2
e_1_2_1_2_2
e_1_2_1_3_2
Luenberger DG (e_1_2_1_9_2) 1994
Murphy J (e_1_2_1_8_2) 1994; 14
References_xml – volume: 14
  start-page: 1053
  year: 1994
  end-page: 1063
  article-title: Distributed pricing for embedded ATM networks
  publication-title: ITC
– start-page: 56
  issue: Jan.‐March
  year: 1997
  end-page: 66
  article-title: WWW traffic reduction and load balancing through server‐based caching
  publication-title: IEEE Concurrency
– volume: 29
  start-page: 977
  year: 1997
  end-page: 986
  article-title: Proxy caching that estimates page load delays
  publication-title: Computer Networks ISDN Syst
– year: 1978
– volume: 29
  start-page: 997
  year: 1997
  end-page: 1005
  article-title: A case for delay‐conscious caching of Web documents
  publication-title: Computer Networks ISDN Syst
– year: 1994
– volume: 28
  start-page: 921
  year: 1996
  end-page: 930
  article-title: Introducing application‐level replication and naming into today's Web
  publication-title: Computer Networks ISDN Syst
– year: 1998
– ident: e_1_2_1_6_2
  doi: 10.1016/0169-7552(96)00030-X
– volume-title: Nonlinear design methods
  year: 1978
  ident: e_1_2_1_10_2
  contributor:
    fullname: Imano H
– ident: e_1_2_1_7_2
– volume: 14
  start-page: 1053
  year: 1994
  ident: e_1_2_1_8_2
  article-title: Distributed pricing for embedded ATM networks
  publication-title: ITC
  contributor:
    fullname: Murphy J
– volume-title: Linear and nonlinear programming
  year: 1994
  ident: e_1_2_1_9_2
  contributor:
    fullname: Luenberger DG
– ident: e_1_2_1_2_2
  doi: 10.1016/S0169-7552(97)00032-9
– ident: e_1_2_1_5_2
  doi: 10.1109/4434.580451
– ident: e_1_2_1_3_2
  doi: 10.1016/S0169-7552(97)00041-X
– ident: e_1_2_1_4_2
SSID ssj0009652
Score 1.5313448
Snippet A content distributing algorithm based on market models for a replication distribution scheme of Web contents is proposed. In general, replication distribution...
Abstract A content distributing algorithm based on market models for a replication distribution scheme of Web contents is proposed. In general, replication...
SourceID proquest
crossref
wiley
istex
SourceType Aggregation Database
Publisher
StartPage 9
SubjectTerms market models
replication distribution
utilization factor assignment
World Wide Web
Title Content distributing algorithm for replicated Web servers based on market models
URI https://api.istex.fr/ark:/67375/WNG-1T8PZLC9-R/fulltext.pdf
https://onlinelibrary.wiley.com/doi/abs/10.1002%2Fecjb.1068
https://search.proquest.com/docview/26666581
Volume 84
hasFullText 1
inHoldings 1
isFullTextHit
isPrint
link http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3fSxwxEB5EX9qH_i692tpQSunL6u5mL7vBJ-_0KtKKiOJRCiGbzGqr7sndHkj_-s5k3VMLhdK3PGTZZCaT-ZLMfAPwIbfk4xLryJAyGWU50j4otYuclF7HyATsfKH_dV_tHmd74_54CTa7XJiWH2Jx4caWEfZrNnBbzjZuSUPR_SyprTjRN5E5h3NtH95SR2kVqu0QHFcRedVxxyoUpxuLL-_5ohUW6_U9oHkXrgZ_M3oM37uRtmEm5-vzplx3v_4gcfzPqTyBRzc4VGy1C-cpLGH9DB7eYSd8DgeBuapuhGdy3VAXqz4V9uJ0Mv3RnF0Kgrtiiu37N3pxgqXgK17Ck4J9oxeTWlyGpGoR6u3MXsDxaOdouBvdFGAgVam0iCpkNrIMZR5751M6CSJql-qsQFlVpGVCC0rpfqXTwmcuVVXstM0SL6VCqWP5EpbrSY2vQGir4gJV7qymA2icWlUiOcfCMx9bkrkevO9UYa5ang3TMiqnhsVjWDw9-BiUtOhBc-DAtLxvTvY_m-SoOPj2ZajNYQ_edVo0ZC78BmJrnMxnhsarCHQlPfgUNPL3n5md4d6AG6__vesqPAgxaiFX8Q0sN9M5viXQ0pRrsLI12B6M1sIq_Q1V8ejA
link.rule.ids 315,783,787,1378,27938,27939,46308,46732
linkProvider Wiley-Blackwell
linkToHtml http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3fTxQxEJ4gPKgP4i_CKUpjjPFlYXe7190mvsAJnnhcCDnCxcQ0u-0sgrJnjr3E8Ncz02UPMDExvvWhm207nc7X6cw3AG_TnGxclFtSpEQGSYp0DkptAyul0yEyATs79PeHqn-U7I274wX40ObCNPwQc4cba4Y_r1nB2SG9ecMaivasoLbK7sESqbvk-gUfD2_Io7Ty9XYIkKuA7Oq45RUK4835p3es0RIv7O87UPM2YPUWZ3cZvrVjbQJNfmzM6mLDXv5B4_i_k3kMj66hqNhq9s4TWMDqKTy8RVD4DA48eVVVC8f8ur40VnUi8p8nk-lp_f1cEOIVU2yewNGJYywEe3kJUgo2j05MKnHu86qFL7lz8RyOdndGvX5wXYOBpKXiLCiRCckSlGnorIvpMoiobayTDGVZkqAJMCilu6WOM5fYWJWh1XkSOSkVSh3KFVisJhWugtC5CjNUqc013UHDOFcFkn3MHFOyRYntwJtWFuZXQ7VhGlLl2PDyGF6eDrzzUpr3oDlwbFraNcfDTyYaZQdfBz1tDjuw3orRkMbwM0he4WR2YWi8inBX1IH3XiR__5nZ6e1tc-PFv3ddh_v90f7ADD4Pv7yEBz5kzacursFiPZ3hK8IwdfHab9Urh7nraA
linkToPdf http://utb.summon.serialssolutions.com/2.0.0/link/0/eLvHCXMwnV3dS-QwEB88BTkfPL0PXL07gxziS7VtummDT3er6_eyiOIiB6FNpn53Ze2C-Nc7Se36AcJxb3lI02Qmk_klmfwG4Fecko8LUk2GFHEvipHWQS61pzk30kdLwG4P9A86Yvs42u01e2OwXr-FqfghRgdu1jLcem0N_Nbka8-koagvMyqL5ANMUIu-jefaOHzmjpLCpdshPC48cqu9mlbID9dGn75yRhNWrvevkOZLvOocTvsT_K27WsWZXK0Oy2xVP7xhcfzPsczA9BMQZb-rmTMLY1h8hqkX9IRfoOuoq4qSGcuu6xJjFWcsvT7rDy7K8xtGeJcNsLoAR8NOMGP2jJcAJbPO0bB-wW7cq2rmEu7cfYXj9uZRa9t7ysBAuhJh4uVo6cgi5LFvtAlpK4godSijBHmek5oJLgghm7kMExPpUOS-lmkUGM4FcunzbzBe9AucAyZT4ScoYp1K2oH6YSoyJO-YGEvIFkS6AUu1KtRtRbShKkrlUFnxKCueBiw7JY1q0BhsZFrcVCedLRUcJd3T_ZZUhw1YrLWoyF7sJUhaYH94p6i_glBX0IAVp5H3f6Y2W7t_bGH-36suwmR3o632dzp7C_DRxau5d4vfYbwcDPEHAZgy--km6iPcWuoX
openUrl ctx_ver=Z39.88-2004&ctx_enc=info%3Aofi%2Fenc%3AUTF-8&rfr_id=info%3Asid%2Fsummon.serialssolutions.com&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Ajournal&rft.genre=article&rft.atitle=Content+distributing+algorithm+for+replicated+Web+servers+based+on+market+models&rft.jtitle=Electronics+%26+communications+in+Japan.+Part+2%2C+Electronics&rft.au=Nishimura%2C+Kenji&rft.au=Yamamoto%2C+Miki&rft.au=Ikeda%2C+Hiromasa&rft.date=2001-11-01&rft.pub=John+Wiley+%26+Sons%2C+Inc&rft.issn=8756-663X&rft.eissn=1520-6432&rft.volume=84&rft.issue=11&rft.spage=9&rft.epage=19&rft_id=info:doi/10.1002%2Fecjb.1068&rft.externalDBID=n%2Fa&rft.externalDocID=ark_67375_WNG_1T8PZLC9_R
thumbnail_l http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/lc.gif&issn=8756-663X&client=summon
thumbnail_m http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/mc.gif&issn=8756-663X&client=summon
thumbnail_s http://covers-cdn.summon.serialssolutions.com/index.aspx?isbn=/sc.gif&issn=8756-663X&client=summon