File Download

There are no files associated with this item.

  Links for fulltext
     (May Require Subscription)
Supplementary

Article: A novel game particle-field approach to parallel cache resource allocation of CDN

TitleA novel game particle-field approach to parallel cache resource allocation of CDN
內容分布網絡緩存資源并行分配的博弈粒子場方法
Authors
KeywordsCache resource allocation (緩存資源分配)
Content Delivery Networks (CDN) (內容分發網絡)
Distributed and parallel algorithm (分布并行算法)
Game particle-field (博弈粒子場)
Issue Date2007
Citation
Chinese Journal Of Computers, 2007, v. 30 n. 3, p. 368-379 How to Cite?
計算機學報, 2007, v. 30 n. 3, p. 368-379 How to Cite?
AbstractThis paper proposes a general expression for the framework of content delivery network and a novel and interesting game particle-field (G-PF) approach to content distribution problem. The game particle-field approach maps publisher-surrogate cache resource allocation problem to the movement of particles in two dual particle-fields by corresponding mathematical model in which all particles move according to certain defined rules until reaching a stable state. By anti-mapping the stable state, the solution to publisher-surrogate cache resource allocation problem can be obtained. The authors give proofs of the proposed approach in the consistency between physical model and mathematical model, the feasibility and correctness of the approach, and the existing and convergence of the solution. A distributed and parallel game particle-field replacement algorithm for cache resource allocation is introduced. As this replacement is cooperation-based, it has advantages over other replacement algorithms such as MFU, LFU, LRU. The authors prove that the replacement algorithm can reach Pareto optimization can approach the optimal solution achievable by any replacement algorithm.
Persistent Identifierhttp://hdl.handle.net/10722/89168
ISSN
2015 SCImago Journal Rankings: 0.338
References

 

DC FieldValueLanguage
dc.contributor.authorFeng, Xen_HK
dc.contributor.authorLau, FCMen_HK
dc.contributor.authorShuai, DXen_HK
dc.date.accessioned2010-09-06T09:53:14Z-
dc.date.available2010-09-06T09:53:14Z-
dc.date.issued2007en_HK
dc.identifier.citationChinese Journal Of Computers, 2007, v. 30 n. 3, p. 368-379en_HK
dc.identifier.citation計算機學報, 2007, v. 30 n. 3, p. 368-379-
dc.identifier.issn0254-4164en_HK
dc.identifier.urihttp://hdl.handle.net/10722/89168-
dc.description.abstractThis paper proposes a general expression for the framework of content delivery network and a novel and interesting game particle-field (G-PF) approach to content distribution problem. The game particle-field approach maps publisher-surrogate cache resource allocation problem to the movement of particles in two dual particle-fields by corresponding mathematical model in which all particles move according to certain defined rules until reaching a stable state. By anti-mapping the stable state, the solution to publisher-surrogate cache resource allocation problem can be obtained. The authors give proofs of the proposed approach in the consistency between physical model and mathematical model, the feasibility and correctness of the approach, and the existing and convergence of the solution. A distributed and parallel game particle-field replacement algorithm for cache resource allocation is introduced. As this replacement is cooperation-based, it has advantages over other replacement algorithms such as MFU, LFU, LRU. The authors prove that the replacement algorithm can reach Pareto optimization can approach the optimal solution achievable by any replacement algorithm.en_HK
dc.languagechien_HK
dc.relation.ispartofChinese Journal of Computersen_HK
dc.relation.ispartof計算機學報-
dc.subjectCache resource allocation (緩存資源分配)en_HK
dc.subjectContent Delivery Networks (CDN) (內容分發網絡)en_HK
dc.subjectDistributed and parallel algorithm (分布并行算法)en_HK
dc.subjectGame particle-field (博弈粒子場)en_HK
dc.titleA novel game particle-field approach to parallel cache resource allocation of CDNen_HK
dc.title內容分布網絡緩存資源并行分配的博弈粒子場方法-
dc.typeArticleen_HK
dc.identifier.emailLau, FCM:fcmlau@cs.hku.hken_HK
dc.identifier.authorityLau, FCM=rp00221en_HK
dc.description.naturelink_to_subscribed_fulltext-
dc.identifier.scopuseid_2-s2.0-34248392325en_HK
dc.identifier.hkuros129572en_HK
dc.relation.referenceshttp://www.scopus.com/mlt/select.url?eid=2-s2.0-34248392325&selection=ref&src=s&origin=recordpageen_HK
dc.identifier.volume30en_HK
dc.identifier.issue3en_HK
dc.identifier.spage368en_HK
dc.identifier.epage379en_HK
dc.publisher.placeBeijing (北京)en_HK
dc.identifier.scopusauthoridFeng, X=55200149100en_HK
dc.identifier.scopusauthoridLau, FCM=7102749723en_HK
dc.identifier.scopusauthoridShuai, DX=7003359432en_HK
dc.customcontrol.immutablecsl 160104-
dcterms.publisherScience Press (科學出版社)-

Export via OAI-PMH Interface in XML Formats


OR


Export to Other Non-XML Formats