Optimal P2P cache sizing: a monetary cost perspective on capacity design of caches to reduce P2P traffic

Haibin Zhai; Albert K. Wong; Hai Jiang; Yi Sun; Jun Li

doi:10.1109/ICPADS.2011.90

Optimal P2P cache sizing

a monetary cost perspective on capacity design of caches to reduce P2P traffic

Haibin Zhai^*, Albert K. Wong, Hai Jiang, Yi Sun, Jun Li

^*Corresponding author for this work

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution

5 Citations (Scopus)

Abstract

Peer-to-Peer (P2P) systems are generating a large portion of the total Internet traffic and imposing a heavy burden on Internet Services Providers (ISPs). Proxy caching for P2P traffic is an effective means of reducing network usage, thereby reducing operation costs for ISPs. Proxy cache storage design has a significant impact on ISPs. While there are several works on how to optimally design cache locations and capacity allocation to each location given a total capacity, few works tell ISPs what is the optimal total P2P cache storage capacity. In this paper, we propose an analysis method to the problem of optimally determining P2P cache size. An analysis methodology is proposed to determine the optimal cache size by considering the monetary costs of cache storage and bandwidth. Guided by our model, a close-form expression is developed to guide an ISP in the cache capacity design. Numerical evaluation results show that ISPs can achieve significant cost saving by deploying P2P cache and by allocating the cache capacity optimally.

Original language	English
Title of host publication	2011 17th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2011
Subtitle of host publication	Proceedings
Place of Publication	Piscataway, NJ
Publisher	Institute of Electrical and Electronics Engineers (IEEE)
Pages	565-572
Number of pages	8
ISBN (Electronic)	9780769545769
ISBN (Print)	9781457718755
DOIs	https://doi.org/10.1109/ICPADS.2011.90
Publication status	Published - 2011
Externally published	Yes
Event	2011 17th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2011 - Tainan, Taiwan, Province of China Duration: 7 Dec 2011 → 9 Dec 2011

Other

Other	2011 17th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2011
Country	Taiwan, Province of China
City	Tainan
Period	7/12/11 → 9/12/11

Keywords

Cache capacity design
Monetary cost
Peer-to-peer network
Proxy cache

Access to Document

10.1109/ICPADS.2011.90

Link to publication in Scopus

Fingerprint Dive into the research topics of 'Optimal P2P cache sizing: a monetary cost perspective on capacity design of caches to reduce P2P traffic'. Together they form a unique fingerprint.

Cite this

Zhai, H., Wong, A. K., Jiang, H., Sun, Y., & Li, J. (2011). Optimal P2P cache sizing: a monetary cost perspective on capacity design of caches to reduce P2P traffic. In 2011 17th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2011: Proceedings (pp. 565-572). [6121325] Piscataway, NJ: Institute of Electrical and Electronics Engineers (IEEE). https://doi.org/10.1109/ICPADS.2011.90

@inproceedings{832ca25f5a3442048bbe7500e4e58114,

title = "Optimal P2P cache sizing: a monetary cost perspective on capacity design of caches to reduce P2P traffic",

abstract = "Peer-to-Peer (P2P) systems are generating a large portion of the total Internet traffic and imposing a heavy burden on Internet Services Providers (ISPs). Proxy caching for P2P traffic is an effective means of reducing network usage, thereby reducing operation costs for ISPs. Proxy cache storage design has a significant impact on ISPs. While there are several works on how to optimally design cache locations and capacity allocation to each location given a total capacity, few works tell ISPs what is the optimal total P2P cache storage capacity. In this paper, we propose an analysis method to the problem of optimally determining P2P cache size. An analysis methodology is proposed to determine the optimal cache size by considering the monetary costs of cache storage and bandwidth. Guided by our model, a close-form expression is developed to guide an ISP in the cache capacity design. Numerical evaluation results show that ISPs can achieve significant cost saving by deploying P2P cache and by allocating the cache capacity optimally.",

keywords = "Cache capacity design, Monetary cost, Peer-to-peer network, Proxy cache",

author = "Haibin Zhai and Wong, {Albert K.} and Hai Jiang and Yi Sun and Jun Li",

year = "2011",

doi = "10.1109/ICPADS.2011.90",

language = "English",

isbn = "9781457718755",

pages = "565--572",

booktitle = "2011 17th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2011",

publisher = "Institute of Electrical and Electronics Engineers (IEEE)",

address = "United States",

}

Zhai, H, Wong, AK, Jiang, H, Sun, Y & Li, J 2011, Optimal P2P cache sizing: a monetary cost perspective on capacity design of caches to reduce P2P traffic. in 2011 17th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2011: Proceedings., 6121325, Institute of Electrical and Electronics Engineers (IEEE), Piscataway, NJ, pp. 565-572, 2011 17th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2011, Tainan, Taiwan, Province of China, 7/12/11. https://doi.org/10.1109/ICPADS.2011.90

Optimal P2P cache sizing : a monetary cost perspective on capacity design of caches to reduce P2P traffic. / Zhai, Haibin; Wong, Albert K.; Jiang, Hai; Sun, Yi; Li, Jun.

2011 17th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2011: Proceedings. Piscataway, NJ : Institute of Electrical and Electronics Engineers (IEEE), 2011. p. 565-572 6121325.

Research output: Chapter in Book/Report/Conference proceeding › Conference proceeding contribution

TY - GEN

T1 - Optimal P2P cache sizing

T2 - a monetary cost perspective on capacity design of caches to reduce P2P traffic

AU - Zhai, Haibin

AU - Wong, Albert K.

AU - Jiang, Hai

AU - Sun, Yi

AU - Li, Jun

PY - 2011

Y1 - 2011

N2 - Peer-to-Peer (P2P) systems are generating a large portion of the total Internet traffic and imposing a heavy burden on Internet Services Providers (ISPs). Proxy caching for P2P traffic is an effective means of reducing network usage, thereby reducing operation costs for ISPs. Proxy cache storage design has a significant impact on ISPs. While there are several works on how to optimally design cache locations and capacity allocation to each location given a total capacity, few works tell ISPs what is the optimal total P2P cache storage capacity. In this paper, we propose an analysis method to the problem of optimally determining P2P cache size. An analysis methodology is proposed to determine the optimal cache size by considering the monetary costs of cache storage and bandwidth. Guided by our model, a close-form expression is developed to guide an ISP in the cache capacity design. Numerical evaluation results show that ISPs can achieve significant cost saving by deploying P2P cache and by allocating the cache capacity optimally.

AB - Peer-to-Peer (P2P) systems are generating a large portion of the total Internet traffic and imposing a heavy burden on Internet Services Providers (ISPs). Proxy caching for P2P traffic is an effective means of reducing network usage, thereby reducing operation costs for ISPs. Proxy cache storage design has a significant impact on ISPs. While there are several works on how to optimally design cache locations and capacity allocation to each location given a total capacity, few works tell ISPs what is the optimal total P2P cache storage capacity. In this paper, we propose an analysis method to the problem of optimally determining P2P cache size. An analysis methodology is proposed to determine the optimal cache size by considering the monetary costs of cache storage and bandwidth. Guided by our model, a close-form expression is developed to guide an ISP in the cache capacity design. Numerical evaluation results show that ISPs can achieve significant cost saving by deploying P2P cache and by allocating the cache capacity optimally.

KW - Cache capacity design

KW - Monetary cost

KW - Peer-to-peer network

KW - Proxy cache

UR - http://www.scopus.com/inward/record.url?scp=84863044707&partnerID=8YFLogxK

U2 - 10.1109/ICPADS.2011.90

DO - 10.1109/ICPADS.2011.90

M3 - Conference proceeding contribution

SN - 9781457718755

SP - 565

EP - 572

BT - 2011 17th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2011

PB - Institute of Electrical and Electronics Engineers (IEEE)

CY - Piscataway, NJ

ER -

Zhai H, Wong AK, Jiang H, Sun Y, Li J. Optimal P2P cache sizing: a monetary cost perspective on capacity design of caches to reduce P2P traffic. In 2011 17th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2011: Proceedings. Piscataway, NJ: Institute of Electrical and Electronics Engineers (IEEE). 2011. p. 565-572. 6121325 https://doi.org/10.1109/ICPADS.2011.90