Broadcast scheduling for information distribution

Su, C-J; Tassiulas, L; Tsotras, VJ

dc.contributor.author	Su, C-J	en
dc.contributor.author	Tassiulas, L	en
dc.contributor.author	Tsotras, VJ	en
dc.date.accessioned	2014-03-01T01:48:31Z
dc.date.available	2014-03-01T01:48:31Z
dc.date.issued	1999	en
dc.identifier.issn	10220038	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/25504
dc.relation.uri	http://www.scopus.com/inward/record.url?eid=2-s2.0-0032667623&partnerID=40&md5=31c6292a850d228c4b3d6381d32dbe8f	en
dc.subject.other	Communication channels (information theory)	en
dc.subject.other	Optimization	en
dc.subject.other	Telecommunication traffic	en
dc.subject.other	Broadcast scheduling	en
dc.subject.other	Radio broadcasting	en
dc.title	Broadcast scheduling for information distribution	en
heal.type	journalArticle	en
heal.publicationDate	1999	en
heal.abstract	Broadcast data delivery is encountered in many applications where there is a need to disseminate information to a large user community in a wireless asymmetric communication environment. In this paper, we consider the problem of scheduling the data broadcast such that average response time experienced by the users is low. In a push-based system, where the users cannot place requests directly to the server and the broadcast schedule should be determined based solely on the access probabilities, we formulate a deterministic dynamic optimization problem, the solution of which provides the optimal broadcast schedule. Properties of the optimal solution are obtained and then we propose a suboptimal dynamic policy which achieves average response time close to the lower bound. The policy has low complexity, it is adaptive to changing access statistics, and is easily generalizable to multiple broadcast channels. In a pull-based system where the users may place requests about information items directly to the server, the scheduling can be based on the number of pending requests for each item. Suboptimal policies with good performance are obtained in this case as well. Finally, it is demonstrated by a numerical study that as the request generation rate increases, the achievable performance of the pull- and push-based systems becomes almost identical.	en
heal.publisher	Baltzer Sci Publ, Bussum, Netherlands	en
heal.journalName	Wireless Networks	en
dc.identifier.volume	5	en
dc.identifier.issue	2	en
dc.identifier.spage	137	en
dc.identifier.epage	147	en