Probabilistic resource allocation under opportunistic scheduling in wireless networks with multimedia services

Kastrinogiannis, T; Papavassiliou, S

dc.contributor.author	Kastrinogiannis, T	en
dc.contributor.author	Papavassiliou, S	en
dc.date.accessioned	2014-03-01T02:44:55Z
dc.date.available	2014-03-01T02:44:55Z
dc.date.issued	2007	en
dc.identifier.issn	15301346	en
dc.identifier.uri	https://dspace.lib.ntua.gr/xmlui/handle/123456789/32024
dc.subject	Multimedia Services	en
dc.subject	Opportunistic Scheduling	en
dc.subject	Rayleigh Channel	en
dc.subject	Resource Allocation	en
dc.subject	Satisfiability	en
dc.subject	Wireless Network	en
dc.subject	High Throughput	en
dc.subject.other	Computer resource management	en
dc.subject.other	Electron beam lithography	en
dc.subject.other	Multimedia systems	en
dc.subject.other	Planning	en
dc.subject.other	Probability	en
dc.subject.other	Random processes	en
dc.subject.other	Resource allocation	en
dc.subject.other	Scheduling	en
dc.subject.other	Technical presentations	en
dc.subject.other	Throughput	en
dc.subject.other	High throughputs	en
dc.subject.other	International symposium	en
dc.subject.other	Opportunistic scheduling	en
dc.subject.other	QoS constraints	en
dc.subject.other	QOS requirements	en
dc.subject.other	Rayleigh channels	en
dc.subject.other	Scheduling policies	en
dc.subject.other	Wireless networks	en
dc.subject.other	Multimedia services	en
dc.title	Probabilistic resource allocation under opportunistic scheduling in wireless networks with multimedia services	en
heal.type	conferenceItem	en
heal.identifier.primary	10.1109/ISCC.2007.4381517	en
heal.identifier.secondary	http://dx.doi.org/10.1109/ISCC.2007.4381517	en
heal.identifier.secondary	4381517	en
heal.publicationDate	2007	en
heal.abstract	In this paper opportunistic scheduling to achieve high throughput, while at the same time satisfy both long-term and short-term users' QoS constraints in wireless networks supporting multimedia services is adopted. This is achieved via the transformation of the corresponding QoS constraints into appropriate probabilities of accessing the systems' recourses. The users' scheduling procedure considering their corresponding access probabilities is obtained through a new proposed scheduling policy which allocates them fixed weights, initially computed, under the assumption of Rayleigh channels. The derived users' weights ratios force the opportunistic scheduling policy to meet the users' desired access probabilities and thus satisfy their respective QoS requirements. © 2007 IEEE.	en
heal.journalName	Proceedings - IEEE Symposium on Computers and Communications	en
dc.identifier.doi	10.1109/ISCC.2007.4381517	en
dc.identifier.spage	699	en
dc.identifier.epage	705	en