Please use this identifier to cite or link to this item:
|Title:||A hash-based collaborative transcoding proxy system||Authors:||Wu, X.
|Issue Date:||2004||Citation:||Wu, X., Tan, K.-L. (2004). A hash-based collaborative transcoding proxy system. Data and Knowledge Engineering 51 (2) : 161-188. ScholarBank@NUS Repository. https://doi.org/10.1016/j.datak.2004.03.002||Abstract:||With the ever increasing wireless client population, the Internet client devices have become highly heterogeneous. Transcoding is used to adapt web objects to suit diverse devices. In this paper, a hash-based collaborative transcoding proxy system is proposed, which aims to improve the system performance in two aspects, caching efficiency and workload balancing. This system employs a hashed-based object caching strategy, which optimizes the cache storage utilization by removing redundant objects scattering in different locations of the overall system cache. In addition, a cache replacement algorithm deployed at the transcoding proxy is examined. A simple hash-based workload distribution strategy is also proposed to share the expensive transcoding load among the various proxies. This strategy performs well with balanced hash function. With unbalanced hash function, satisfactory load sharing is achieved by an optimized strategy, which allows the overloaded proxy to alleviate its load by outsourcing some excessive transcoding tasks to its less overloaded neighbors. An event-driven simulation is conducted to evaluate the system performance, and our results show that the proposed system outperforms existing methods in terms of throughput and response time. © 2004 Elsevier B.V. All rights reserved.||Source Title:||Data and Knowledge Engineering||URI:||http://scholarbank.nus.edu.sg/handle/10635/39786||ISSN:||0169023X||DOI:||10.1016/j.datak.2004.03.002|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on Sep 9, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.