Quality-of-Experience Driven Acceleration of Thin Client Connections

Thin-client based solutions allow users to connect to remote servers and access content that is running on these servers within a virtual PC. With the advent of cloud based solutions, thin-client deployments running on remote Data-centers are increasingly popular. Unfortunately, since the traffic has to traverse through the Internet, issues such as latency, packet drops, and potentially congestion are introduced, which in turn affect the Quality of Experience (QoE) for the user. Our objective is to provide preferential treatment to certain thin-client flows over the rest of the thin-client flows traversing the same intermediate node, based on the application that the user is using at a given point in time. This is not straightforward, as it is not easy to identify what actual application is running inside a given thin client session, given that thin client protocols essentially only send bitmaps of the desktop to the client and in addition are often encrypting traffic. Assuming that some statistical mechanisms for application identification for thin client connections exists, the challenge we address is how to exploit this information for QoE-driven scheduling. We present a scheme that allows the prioritization of thin client flows that are serving delay-sensitive applications, i.e., prioritizing flows based on the specific QoE requirements of the dynamically changing individual applications running within persistent thin client traffic flows. Our solution is essentially a hybrid scheduling scheme that takes into account the dynamically changing delay and bandwidth requirements of inner (i.e., tunneled in the thin client protocol) applications to prioritize flows that are close to an application-dependent QoE threshold. Our evaluation based on a prototype implementation reveals that our algorithm is indeed effective in dynamically prioritizing persistent thin-client flows based on the dynamically changing inner applications running within the flows.

[1]  Dinesh C. Verma,et al.  A Scheme for Real-Time Channel Establishment in Wide-Area Networks , 1990, IEEE J. Sel. Areas Commun..

[2]  Vijay Sivaraman,et al.  Providing end-to-end statistical delay guarantees with earliest deadline first scheduling and per-hop traffic shaping , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[3]  Abhay Parekh,et al.  Optimal multiplexing on a single link: delay and buffer requirements , 1997, IEEE Trans. Inf. Theory.

[4]  Hui Zhang,et al.  Hierarchical packet fair queueing algorithms , 1996, SIGCOMM 1996.

[5]  Ion Stoica,et al.  A hierarchical fair service curve algorithm for link-sharing, real-time, and priority services , 2000, TNET.

[6]  Saverio Niccolini,et al.  A closer look at thin-client connections: statistical application identification for QoE detection , 2012, IEEE Communications Magazine.

[7]  Brian Trammell,et al.  Toward composable network traffic measurement , 2013, 2013 Proceedings IEEE INFOCOM.

[8]  Domenico Ferrari,et al.  Exact admission control for networks with a bounded delay service , 1996, TNET.

[9]  S. Jamaloddin Golestani,et al.  A self-clocked fair queueing scheme for broadband applications , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.