Please use this identifier to cite or link to this item: https://hdl.handle.net/20.500.11851/7226
Full metadata record
DC FieldValueLanguage
dc.contributor.authorÖzel, Ömür-
dc.contributor.authorBıyıkoğlu, Elif Uysal-
dc.contributor.authorGirici, Tolga-
dc.date.accessioned2021-09-11T15:56:02Z-
dc.date.available2021-09-11T15:56:02Z-
dc.date.issued2011en_US
dc.identifier.citationInformation Theory and Applications Workshop -- FEB 01, 2010 -- Univ California, San Diego, CAen_US
dc.identifier.issn0916-8516-
dc.identifier.issn1745-1345-
dc.identifier.urihttps://doi.org/10.1587/transcom.E94.B.3399-
dc.identifier.urihttps://hdl.handle.net/20.500.11851/7226-
dc.description.abstractA finite buffer shared by multiple packet queues is considered. Partitioning the buffer to maximize total throughput is formulated as a resource allocation problem, the solution is shown to be achieved by a greedy incremental algorithm in polynomial time. The optimal buffer allocation strategy is applied to different models for a wireless downlink. First, a set of parallel M/M/ 1/m(i) queues, corresponding to a downlink with orthogonal channels is considered. It is verified that at high load, optimal buffer partitioning can boost the throughput significantly with respect to complete sharing of the buffer. Next, the problem of optimal combined buffer allocation and channel assignment problems are shown to be separable in an outage scenario. Motivated by this observation, buffer allocation is considered in a system where users need to be multiplexed and scheduled based on channel state. It is observed that under finite buffers in the high load regime, scheduling simply with respect to channel state with a simply partitioned buffer achieves comparable throughput to combined channel and queue-aware scheduling.en_US
dc.language.isoenen_US
dc.publisherIeice-Inst Electronics Information Communications Engen_US
dc.relation.ispartofIeice Transactions On Communicationsen_US
dc.rightsinfo:eu-repo/semantics/closedAccessen_US
dc.subjectbuffer partitioningen_US
dc.subjectmultiuser wireless communicationen_US
dc.subjectthroughput optimalen_US
dc.subjectfinite bufferen_US
dc.subjectcomplete sharingen_US
dc.subjectcomplete partitioningen_US
dc.subjectgreedy allocationen_US
dc.subjectschedulingen_US
dc.subjectMaxWeighten_US
dc.titleOptimal Buffer Partitioning on a Multiuser Wireless Link [2011]en_US
dc.typeConference Objecten_US
dc.departmentFaculties, Faculty of Engineering, Department of Electrical and Electronics Engineeringen_US
dc.departmentFakülteler, Mühendislik Fakültesi, Elektrik ve Elektronik Mühendisliği Bölümütr_TR
dc.identifier.volumeE94Ben_US
dc.identifier.issue12en_US
dc.identifier.startpage3399en_US
dc.identifier.endpage3411en_US
dc.authorid0000-0002-7258-4872-
dc.identifier.wosWOS:000298304700027en_US
dc.identifier.scopus2-s2.0-82455167054en_US
dc.institutionauthorGirici, Tolga-
dc.identifier.doi10.1587/transcom.E94.B.3399-
dc.relation.publicationcategoryKonferans Öğesi - Uluslararası - Kurum Öğretim Elemanıen_US
dc.relation.conferenceInformation Theory and Applications Workshopen_US
dc.identifier.scopusqualityQ3-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
item.grantfulltextnone-
item.fulltextNo Fulltext-
item.openairetypeConference Object-
item.cerifentitytypePublications-
item.languageiso639-1en-
crisitem.author.dept02.5. Department of Electrical and Electronics Engineering-
Appears in Collections:Elektrik ve Elektronik Mühendisliği Bölümü / Department of Electrical & Electronics Engineering
Scopus İndeksli Yayınlar Koleksiyonu / Scopus Indexed Publications Collection
WoS İndeksli Yayınlar Koleksiyonu / WoS Indexed Publications Collection
Show simple item record



CORE Recommender

Page view(s)

26
checked on Mar 25, 2024

Google ScholarTM

Check




Altmetric


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