Analysis of threat based algorithm using different performance measures

[1]  Syed Adeel Ali Shah,et al.  Optimization‐based workload distribution in geographically distributed data centers: A survey , 2020, Int. J. Commun. Syst..

[2]  Kazuo Iwama,et al.  Average-case competitive analyses for one-way trading , 2011, J. Comb. Optim..

[3]  Neal E. Young,et al.  Thek-server dual and loose competitiveness for paging , 1994, Algorithmica.

[4]  Alejandro López-Ortiz,et al.  On the Separation and Equivalence of Paging Strategies and Other Online Algorithms , 2018, Algorithmica.

[5]  Javeria Iqbal,et al.  Optimal online $$k$$k-min search , 2015, EURO J. Comput. Optim..

[6]  Robert E. Tarjan,et al.  Amortized efficiency of list update and paging rules , 1985, CACM.

[7]  Pascal Schweitzer,et al.  Paging and list update under bijective analysis , 2009, JACM.

[8]  Ran El-Yaniv,et al.  Competitive analysis of financial games , 1992, Proceedings., 33rd Annual Symposium on Foundations of Computer Science.

[9]  Ran El-Yaniv,et al.  Optimal Search and One-Way Trading Online Algorithms , 2001, Algorithmica.

[10]  Alejandro López-Ortiz,et al.  On the relative dominance of paging algorithms , 2009, Theor. Comput. Sci..

[11]  Joan Boyar,et al.  A comparison of performance measures via online search , 2011, Theor. Comput. Sci..

[12]  Asadullah Shah,et al.  Disparity between Theory & Practice: Beyond the Worst-Case Competitive Analysis , 2018, 2018 IEEE 5th International Conference on Engineering Technologies and Applied Sciences (ICETAS).

[13]  Susanne Albers,et al.  Online algorithms: a survey , 2003, Math. Program..