Please use this identifier to cite or link to this item:
|Title:||Long distance redundancy reduction in thin client computing||Authors:||Sun, Y.
|Issue Date:||2007||Citation:||Sun, Y., Tay, T.T. (2007). Long distance redundancy reduction in thin client computing. Proceedings - 6th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2007; 1st IEEE/ACIS International Workshop on e-Activity, IWEA 2007 : 961-966. ScholarBank@NUS Repository. https://doi.org/10.1109/ICIS.2007.128||Abstract:||An efficient way to improve the performance of a thin client system is to reduce the redundant screen update data sent across networks. While various optimization efforts have been made in this way, these optimization techniques cannot efficiently reduce long distance redundancies that may contain lots of network traffic. Long distance redundancies can be potentially reduced by a LZ compression algorithm with a large history buffer. However, a flat extension of the history buffer is not flexible and has scalability issue. In this paper, we present a different way to extend the history buffer and a history extension scheme based on it, aiming at minimizing long distance redundancies. We empirically studied the effectiveness of our scheme on some screen updates generated by one of the most bandwidth-efficient thin client system, Microsoft Terminal Service. The results show that this scheme can reduce up to 9.39-23.3% network traffic for the tested data with a history buffer of 512K bytes. This scheme costs only a little additional computation and memory resources. © 2007 IEEE.||Source Title:||Proceedings - 6th IEEE/ACIS International Conference on Computer and Information Science, ICIS 2007; 1st IEEE/ACIS International Workshop on e-Activity, IWEA 2007||URI:||http://scholarbank.nus.edu.sg/handle/10635/70829||ISBN:||0769528414||DOI:||10.1109/ICIS.2007.128|
|Appears in Collections:||Staff Publications|
Show full item record
Files in This Item:
There are no files associated with this item.
checked on May 25, 2019
WEB OF SCIENCETM
checked on May 8, 2019
checked on May 24, 2019
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.