<?xml version="1.0" encoding="UTF-8"?>
<collection>
<dc:dc xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:invenio="http://invenio-software.org/elements/1.0" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" xsi:schemaLocation="http://www.openarchives.org/OAI/2.0/oai_dc/ http://www.openarchives.org/OAI/2.0/oai_dc.xsd"><dc:identifier>doi:10.1109/LCOMM.2020.3044231</dc:identifier><dc:language>eng</dc:language><dc:creator>Saldaña J.</dc:creator><dc:creator>Topal O.</dc:creator><dc:creator>Ruiz-Mas J.</dc:creator><dc:creator>Fernandez-Navajas J.</dc:creator><dc:title>Finding the sweet spot for frame aggregation in 802.11 WLANs</dc:title><dc:identifier>ART-2021-126923</dc:identifier><dc:description>This letter proposes an algorithm for the dynamic tuning of the maximum size of aggregated frames in 802.11 WLANs. Traffic flows with opposed requirements may coexist in these networks: traditional services as web browsing or file download that need high throughput, and services with real-time requirements that need low latency. The proposed algorithm allows the network manager to find an optimal balance (i.e. the ''sweet spot'' between throughput and latency: a ''delay budget'' can be assigned to real-time flows, with the objective of keeping the latency as close as possible to that budget, while penalizing the throughput of traditional services as little as possible. © 1997-2012 IEEE.</dc:description><dc:date>2021</dc:date><dc:source>http://zaguan.unizar.es/record/119670</dc:source><dc:doi>10.1109/LCOMM.2020.3044231</dc:doi><dc:identifier>http://zaguan.unizar.es/record/119670</dc:identifier><dc:identifier>oai:zaguan.unizar.es:119670</dc:identifier><dc:relation>info:eu-repo/grantAgreement/ES/DGA/T31-20R</dc:relation><dc:relation>info:eu-repo/grantAgreement/ES/UZ/UZ2019-TEC-03</dc:relation><dc:identifier.citation>IEEE COMMUNICATIONS LETTERS 25, 4 (2021), 1368-1372</dc:identifier.citation><dc:rights>All rights reserved</dc:rights><dc:rights>http://www.europeana.eu/rights/rr-f/</dc:rights><dc:rights>info:eu-repo/semantics/openAccess</dc:rights></dc:dc>

</collection>