Please use this identifier to cite or link to this item: https://repository.cihe.edu.hk/jspui/handle/cihe/1341
DC FieldValueLanguage
dc.contributor.authorChan, Anthony Hing-Hungen_US
dc.contributor.otherSuleiman, K. H.-
dc.contributor.otherDlodlo, M. E.-
dc.date.accessioned2021-08-18T08:01:52Z-
dc.date.available2021-08-18T08:01:52Z-
dc.date.issued2011-
dc.identifier.urihttps://repository.cihe.edu.hk/jspui/handle/cihe/1341-
dc.description.abstractAs user requests arrive randomly in a wireless network, a good serving discipline scheme optimizes the trade-off between resource utilization and quality of service by effectively predicting future demands. In this paper, we analyze research outputs on serving discipline algorithms for cellular networks. The contribution of this paper is two-fold: first we review different serving discipline schemes and we choose the one which we believe is a good scheme. Then we propose an improvement on it and we validate our argument through simulation using the Network Simulator (NS-2).en_US
dc.language.isoenen_US
dc.publisherIEEEen_US
dc.titleAnalysis of serving discipline algorithms for cellular networksen_US
dc.typeconference proceedingsen_US
dc.relation.publicationProceedings of the 2011 2nd International Conference on Wireless Communication, Vehicular Technology, Information Theory and Aerospace & Electronic Systems Technology (Wireless VITAE)en_US
dc.identifier.doi10.1109/WIRELESSVITAE.2011.5940933-
dc.contributor.affiliationSchool of Computing and Information Sciencesen_US
dc.relation.isbn9781457707865en_US
dc.cihe.affiliatedNo-
item.openairecristypehttp://purl.org/coar/resource_type/c_5794-
item.grantfulltextnone-
item.cerifentitytypePublications-
item.languageiso639-1en-
item.fulltextNo Fulltext-
item.openairetypeconference proceedings-
crisitem.author.deptSchool of Computing and Information Sciences-
crisitem.author.orcid0000-0001-7479-0787-
Appears in Collections:CIS Publication
SFX Query Show simple item record

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.