PROXY SELECTION AND PERFORMANCE ANALYSIS OF A DYNAMIC PROXY FRAMEWORK
Keywords:
Dynamic proxy, application level active network, chek proxy framework, contents deliveryAbstract
The benchmark of a proxy-based service creation and content delivery framework called the Chek Proxy Framework (CPF) was described. Unlike conventional proxy-based systems, CPF was an application level approach that provoked the use of client machines to host at runtime an intermediate object called the Dynamic Application Proxy Server (DAPS) based on the designed clustering policy. We conduced performance analysis of CPF in a video broadcasting environment based on two clustering policies, namely the Neighbor and Regional clustering policy, under the context of two proxy selection algorithms, i.e. the conservative and greedy algorithms. The results showed that the conservative algorithm works well at low request loads while the greedy algorithm performed better at higher request loads. Compared to the Neighbor policy, applying the combined policy (Neighbor and Regional) with the greedy algorithm further decreased the server workload by 11.38%, and enhanced the average client receiving rate and network throughput by at least 100% and 35%, respectively.
References
Bestavros, A., and Cunha, C. (1996). Serverinitiated document dissemination for the WWW. IEEE Data Engineering Bulletin, 19(3):8.
Choong, K.N., Mohd, A.B., Prakash, V., Tee, E.R., and Yee, Y.C. (2003). The framework of a dynamic proxy system. Suranaree Journal of Science and Technology, 10(1):7-18.
Chu, Y., Rao, S., and Zhang, H. (2000). A case for endsystem multicast. Proceedings of ACM Sigmetrics; June, 2000; Santa Clara, CA, USA, 12 p.
CiteSeer. (2004). Versatile primitives for application-level multicasting. CiteSeer. Available from: www. citeseer.ist.psu.edu/ 526529.html. Accessed Feb 14, 2004.
Coulouris, G., Dollimore, J., and Kindberg, T. (2001). Distributed systems: concepts and design. 3rd edition, Addison-Wesley, USA, 772 p.
CS Department. (2003). Web Server Traces. University of Wisconsin, Madison: CS Department. Available from: www.cs. wisc.edu/~cao/icache/trace.html. Accessed Oct 14, 2003.
Erilsson, H. (1994). MBone: The multicast backbone. Communications of ACM, 37(8):6.
IPAM. (2004). Active measurements on the AT&T IP Backbone. University of California, LA: IPAM. Available from: www.ipam.ucla.edu/publications/ cntop2002/cntop2002_gramachandran. ppt. Accessed Aug 10, 2004.
Knutsson, B., and Peterson, L. (2001). Transparent proxy signaling. Journal of Communications and Networks, Korean Institute of Communication Sciences, 3(2):10.
Krishnamurthy, B., and Wang, J. (2000). On network-aware clustering of web clients. Proceedings of ACM SIGCOMM; Aug, 2000; Stockholm, Sweden, 14 p.
Krishnan, P., Raz, D., and Shavitt, Y. (2000). The cache location problem. IEEE/ACM Transactions on Networking, 8(5):14.
Liu, E., Cuthbert, L.G., Schormans, J.A., and Stoneley, G. (2000). Neural networkin fast simulation modeling. IEEE_ INNS_ENNS Proceedings of International Joint Conference on Neural Networks (IJCNN); July 24-27, 2000; Como, Italy, 5 p.
Moore, A.W. (2002). Measurement-based management of network resources. Computer Laboratory (UCAM-CL-TR- 528), University of Cambridge. Technical Report No. 528. 273 p.
NTT PF Labs. (2003). Yallcast Architecture Overview. Japan: NTT PF Labs. Available from www.yallcast.com. Accessed Oct 27, 2003.
Pendarakis, D., Shi, S., Verma, D., and Waldvogel, M. (2001). ALMI: An application level multicast infrastructure. Proceedings of the 3rd Usenix Symposium on Internet Technologies & Systems (USITS); March 26-28, 2001 San Francisco, CA, USA, 17 p.
Sarmenta, L.F.G., and Hirano, S. (1999). Bayanihan: Building and studying webbased volunteer computing systems using Java. Future Generation Computer Systems Special Issues on Metacomputing, Elsevier Publication, 15(5/6):11.
Technology College Software. (2003). Real Audio/Video - Test Page. Technology University of North Carolina, Wilmington: Technology College Software. Available from: www.uncwil.edu/tc/real. Accessed Sept 20, 2003.
