TY - GEN
T1 - Scheduling data broadcast to "impatient" users
AU - Jiang, Shu
AU - Vaidya, Nitin H.
N1 - Funding Information:
We would like to thank Professor Amotz Bar-Noy for helpful discussions which led us to consider users who may leave before their requests are satisfied. We thank the referees for helpful comments. This research is supported in part by Texas Advanced Technology Grant 010115-248.
PY - 1999/8/1
Y1 - 1999/8/1
N2 - Broadcasting is an effective way of delivering data to a large population.' In the broadcast environment under consideration, a server broadcasts data items to all clients simultaneously, according to a certain transmission schedule. Users with pending data requests need to listen to the broadcast channel until their requests are satisfied by the transmitted data. Past research on broadcast scheduling assumes that once a user starts to wait for some data item, the user waits until the desired data item is transmitted by the server. This is often not true in practice. For various reasons, users may lose patience after waiting "too long" and leave with their requests unserved. In this paper, we study the broadcast scheduling problem taking user impatience into account. Based on our analytical results, we propose a scheduling algorithm that can produce a broadcast schedule with high service ratio (i.e., percentage of requests served) as well as low mean waiting time for the requests. Performance evaluation results based on simulations are provided.
AB - Broadcasting is an effective way of delivering data to a large population.' In the broadcast environment under consideration, a server broadcasts data items to all clients simultaneously, according to a certain transmission schedule. Users with pending data requests need to listen to the broadcast channel until their requests are satisfied by the transmitted data. Past research on broadcast scheduling assumes that once a user starts to wait for some data item, the user waits until the desired data item is transmitted by the server. This is often not true in practice. For various reasons, users may lose patience after waiting "too long" and leave with their requests unserved. In this paper, we study the broadcast scheduling problem taking user impatience into account. Based on our analytical results, we propose a scheduling algorithm that can produce a broadcast schedule with high service ratio (i.e., percentage of requests served) as well as low mean waiting time for the requests. Performance evaluation results based on simulations are provided.
UR - http://www.scopus.com/inward/record.url?scp=84978060046&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84978060046&partnerID=8YFLogxK
U2 - 10.1145/313300.313385
DO - 10.1145/313300.313385
M3 - Conference contribution
AN - SCOPUS:84978060046
T3 - Proceedings of the 1st ACM International Workshop on Data Engineering for Wireless and Mobile Access, MobiDe 1999
SP - 52
EP - 59
BT - Proceedings of the 1st ACM International Workshop on Data Engineering for Wireless and Mobile Access, MobiDe 1999
A2 - Banerjee, Sujata
A2 - Pitoura, Evaggelia
A2 - Chrysanthis, Panos K.
PB - Association for Computing Machinery
T2 - 1st ACM International Workshop on Data Engineering for Wireless and Mobile Access, MobiDe 1999
Y2 - 20 August 1999
ER -