DocumentCode :
2501927
Title :
Transfer Scheduling Schemes for Data-Intensive, Interactive Applications
Author :
Takizawa, Makoto ; Shimizu, Takashi ; Ishida, Osamu
fYear :
2007
fDate :
26-30 Nov. 2007
Firstpage :
2488
Lastpage :
2491
Abstract :
This paper proposes a transfer scheduling scheme for data-intensive interactive applications, and new performance metrics that can quantify the usability of these applications. The scheme, called allowable data first (ADF), prioritizes those data whose transfer time will be within a certain period; it is evaluated using the performance metrics that are derived from observations of psychology: the allowable probability and the mean estimated time. The evaluation results show that ADF can achieve high allowable probability and small mean estimated time, and thus is an appropriate scheme for those applications.
Keywords :
data communication; probability; allowable data first; allowable probability; data-intensive interactive applications; mean estimated time; transfer scheduling schemes; Application software; Delay; Humans; Laboratories; Measurement; Psychology; Rhythm; Scheduling; Technological innovation; Usability;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Global Telecommunications Conference, 2007. GLOBECOM '07. IEEE
Conference_Location :
Washington, DC
Print_ISBN :
978-1-4244-1042-2
Electronic_ISBN :
978-1-4244-1043-9
Type :
conf
DOI :
10.1109/GLOCOM.2007.473
Filename :
4411383
Link To Document :
بازگشت