Secure cache provision: Provable DDOS prevention for randomly partitioned services with replication
Refereed conference paper presented and published in conference proceedings

替代計量分析
.

其它資訊
摘要In this paper we show a small but fast popularitybased front-end cache can provide provable DDOS prevention for randomly partitioned cluster services with replication. To achieve this, we first give the best strategy for an adversary to overload the system, and then prove that the cache size is lower bounded by O(n log log n/ log d), where n is the number of back-end nodes and d is the replication factor. Since log log n/ logd < 2 holds for almost all the current clusters (i.e., the number of back-end nodes n < 105 and the replication factor d ≥ 3), this result implies an O(n) lower bound on the required cache size. Our analysis and results are well validated through extensive simulations. © 2013 IEEE.
著者Chu W., Guan X., Lui J.C.S., Cai Z., Shi X.
會議名稱33rd IEEE International Conference on Distributed Computing Systems Workshops, ICDCSW 2013
會議開始日08.07.2013
會議完結日11.07.2013
會議地點Philadelphia, PA
會議國家/地區美國
詳細描述IEEE
出版年份2013
月份12
日期1
頁次58 - 63
國際標準書號978-0-7695-5023-7
國際標準期刊號1545-0678
語言英式英語

上次更新時間 2020-25-10 於 02:37