dc.contributor.author |
Kastrinogiannis, T |
en |
dc.contributor.author |
Papavassiliou, S |
en |
dc.date.accessioned |
2014-03-01T02:45:45Z |
|
dc.date.available |
2014-03-01T02:45:45Z |
|
dc.date.issued |
2008 |
en |
dc.identifier.uri |
https://dspace.lib.ntua.gr/xmlui/handle/123456789/32369 |
|
dc.subject |
CDMA wireless networks |
en |
dc.subject |
Finite backloggs |
en |
dc.subject |
Opportunistic scheduling |
en |
dc.subject.other |
Ad hoc networks |
en |
dc.subject.other |
Information services |
en |
dc.subject.other |
Optimization |
en |
dc.subject.other |
Planning |
en |
dc.subject.other |
Real time systems |
en |
dc.subject.other |
Resource allocation |
en |
dc.subject.other |
Scheduling |
en |
dc.subject.other |
CDMA wireless networks |
en |
dc.subject.other |
Efficient resource allocation |
en |
dc.subject.other |
Finite backloggs |
en |
dc.subject.other |
International symposium |
en |
dc.subject.other |
Non-real-time services |
en |
dc.subject.other |
Opportunistic scheduling |
en |
dc.subject.other |
Paper addresses |
en |
dc.subject.other |
QOS provisioning |
en |
dc.subject.other |
QOS requirements |
en |
dc.subject.other |
System throughput |
en |
dc.subject.other |
Wireless data networks |
en |
dc.subject.other |
Wireless networks |
en |
dc.title |
QoS provisioning in wireless data networks under non-continuously backlogged users |
en |
heal.type |
conferenceItem |
en |
heal.identifier.primary |
10.1109/WIOPT.2008.4586041 |
en |
heal.identifier.secondary |
http://dx.doi.org/10.1109/WIOPT.2008.4586041 |
en |
heal.identifier.secondary |
4586041 |
en |
heal.publicationDate |
2008 |
en |
heal.abstract |
This paper addresses the problem of efficient resource allocation in CDMA wireless networks, supporting non-real-time services with various long-term QoS requirements, by exploiting the advantages of opportunistic scheduling. Most of the existing work covers the analysis of the system under the assumption of infinite backlogs. In this paper, we remove this assumption and analyze the behavior of the system with respect to its overall achievable performance and its ability to gratify users' individual QoS requirements under different fundamental opportunistic scheduling policies, for the more realistic case of non-continuously backlogged users. Motivated by the corresponding results that indicate the unsatisfactory performance of these schedulers when considering finite backlogs, and in order to overcome these inefficiencies, a new non-work-conserving opportunistic scheduling framework is proposed which is seamlessly integrated within the operation of the various schedulers. The corresponding results demonstrate that the proposed approach results in the fulfillment of users' QoS prerequisites while still maintaining the opportunistic nature of the schedulers and thus achieving high system throughput. |
en |
heal.journalName |
Proceedings of the 6th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks, WiOpt 2008 |
en |
dc.identifier.doi |
10.1109/WIOPT.2008.4586041 |
en |
dc.identifier.spage |
71 |
en |
dc.identifier.epage |
76 |
en |