The case for a dynamic proxy framework with voluntary/incentive-based client hosting scheme

  • Authors:
  • Khong Neng Choong;B. M. Ali;V. Prakash;Yoke Chek Yee

  • Affiliations:
  • BT (British Telecom) Multimedia, Hibiscus Block, Cyberview Lodge Resort, Cyberjaya, Selangor, Malaysia;Department of Computer and Communication Systems Engineering, Faculty of Engineering, Universiti Putra Malaysia, Serdang, Malaysia;Department of Computer Science and Computer Engineering, La Trobe University, VIC, Australia;Global Software Group - Malaysia, Motorola Multimedia Sdn Bhd, Cyberjaya, Selangor Darul Ehsan, Malaysia

  • Venue:
  • Journal of Network and Computer Applications - Special issue: Network and information security: A computational intelligence approach
  • Year:
  • 2007

Quantified Score

Hi-index 0.01

Visualization

Abstract

In this paper, we present and evaluate a dynamic proxy framework called the chek proxy framework (CPF). CPF is an application-level approach that provokes the use of client machines to host at runtime a server-initiated intermediate object called dynamic application proxy server (DAPS) based on the designed clustering policy. Unlike conventional and current dynamic proxy systems, CPF adopts an incentive scheme where the selected client machines will be rewarded for sharing the central server workloads by servicing local/regional client requests. The results showed that the CPF approach reduces both the processor utilization and memory consumption of the central server by 15.1% and 16.5 MB, respectively, than the conventional client/server approach in our prototype implementation. With our simulation, it is further quantified that allocating DAPS to work cooperatively in a hierarchical fashion further increases the average client-receiving rate and the network throughput by at least 100% and 35%, respectively, with a server workload reduction of 11.38%, than DAPS serving end-clients directly.