Satisfying elastic short term fairness in high throughput wireless communication systems with multimedia services

DSpace/Manakin Repository

Show simple item record

dc.contributor.author Kastrinogiannis, T en
dc.contributor.author Papavassiliou, S en
dc.date.accessioned 2014-03-01T02:44:57Z
dc.date.available 2014-03-01T02:44:57Z
dc.date.issued 2007 en
dc.identifier.issn 05361486 en
dc.identifier.uri https://dspace.lib.ntua.gr/xmlui/handle/123456789/32039
dc.subject Multimedia Services en
dc.subject Opportunistic Scheduling en
dc.subject Satisfiability en
dc.subject Upper Bound en
dc.subject Wireless Communication Systems en
dc.subject High Throughput en
dc.subject.other Algorithms en
dc.subject.other Multimedia services en
dc.subject.other Quality of service en
dc.subject.other Scheduling en
dc.subject.other Throughput en
dc.subject.other Channel adaptive scheduling en
dc.subject.other Scheduling policy en
dc.subject.other Service deviation functions en
dc.subject.other Wireless telecommunication systems en
dc.title Satisfying elastic short term fairness in high throughput wireless communication systems with multimedia services en
heal.type conferenceItem en
heal.identifier.primary 10.1109/ICC.2007.836 en
heal.identifier.secondary http://dx.doi.org/10.1109/ICC.2007.836 en
heal.identifier.secondary 4289507 en
heal.publicationDate 2007 en
heal.abstract In this paper we study the problem of providing short-term access time fairness in wireless communication systems with multimedia services, while still maintaining high system throughput by exploiting the advantages of opportunistic scheduling. Our approach aims at providing elastic short-term fairness to the users by setting upper bounds on the probability of receiving an amount of service smaller than their QoS requirements. This is achieved by introducing the information of users' received service within short-term intervals into the scheduling policy. By using this information our proposed algorithm reduces the channel's condition control on the selection of the next user to receive service, especially for users that do not satisfy their short-term requirements. Moreover, by setting different values for the users' observation service intervals and by defining appropriate service deviation functions for different classes of users, we provide enhanced flexibility in the control of fairness, while still exploiting channel adaptive scheduling to achieve high throughput. © 2007 IEEE. en
heal.journalName IEEE International Conference on Communications en
dc.identifier.doi 10.1109/ICC.2007.836 en
dc.identifier.spage 5064 en
dc.identifier.epage 5069 en

Files in this item

Files Size Format View

There are no files associated with this item.

This item appears in the following Collection(s)

Show simple item record