Loading…

Modeling and Analysis of Frame Aggregation in Unsaturated WLANs with Finite Buffer Stations

Frame aggregation is one of the several enhancements proposed by IEEE 802.11 Task Group n to improve channel utilization. In frame aggregation, more than one data frame is encapsulated to form an aggregate, and once an aggregate is formed, a station contends to access the medium to transmit the enti...

Full description

Saved in:
Bibliographic Details
Main Authors: Kuppa, Srikant, Dattatreya, G.R.
Format: Conference Proceeding
Language:English
Subjects:
Online Access:Request full text
Tags: Add Tag
No Tags, Be the first to tag this record!
cited_by
cites
container_end_page 972
container_issue
container_start_page 967
container_title
container_volume 3
creator Kuppa, Srikant
Dattatreya, G.R.
description Frame aggregation is one of the several enhancements proposed by IEEE 802.11 Task Group n to improve channel utilization. In frame aggregation, more than one data frame is encapsulated to form an aggregate, and once an aggregate is formed, a station contends to access the medium to transmit the entire aggregate. We refer to the number of data frames encapsulated within an aggregated frame as aggregate size. We claim that a static assignment of aggregate size leads to the following performance trade-off: a small value might be insufficient to mitigate the transmission overheads, thereby nullifying the whole purpose of frame aggregation; whereas, a large value might affect the quality of service experienced by higher layers due to the extra wait time to build an aggregate. In this paper, we characterize this trade-off by studying the impact of aggregate size on metrics like frame latency and channel utilization. To estimate these metrics, we model the transmission queue of an 802.11n station as a bulk service queuing system. We study the impact of aggregate size over a wide range of operating conditions covering several traffic arrival rates from higher layers, service distribution and data frame sizes. Apart from validating the existence of above-mentioned performance trade-off, our results indicate that the choice of aggregate size not only depends on the traffic arrival rate, but also (more interestingly) on data frame sizes. This calls for a dynamic assignment of aggregate size.
doi_str_mv 10.1109/ICC.2006.254873
format conference_proceeding
fullrecord <record><control><sourceid>ieee_CHZPO</sourceid><recordid>TN_cdi_ieee_primary_4024265</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>4024265</ieee_id><sourcerecordid>4024265</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-a02ed357df6f6bc375743e11a2e7da02d988eda3638850b787d22891443bf8203</originalsourceid><addsrcrecordid>eNotjLFOwzAURQ0CibYwM7D4B1JsPzt2xhARqBRggIqBoXLwczBqXRS7Qv17KmC6RzpHl5BLzuacs-p60TRzwVg5F0oaDUdkyqWQkoFScEwmvAJTcGPg5MBKsQJKps_INKVPxpSogE_I28PW4TrEgdroaB3tep9ColtP29FukNbDMOJgc9hGGiJdxmTzbrQZHX3t6sdEv0P-oG2IISO92XmPI33Ov306J6ferhNe_O-MLNvbl-a-6J7uFk3dFYFrlQvLBDpQ2vnSl_07aKUlIOdWoHYH6Spj0FkowRjFem20E8JUXErovREMZuTq7zcg4uprDBs77leSCSlKBT-5aVK_</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Modeling and Analysis of Frame Aggregation in Unsaturated WLANs with Finite Buffer Stations</title><source>IEEE Xplore All Conference Series</source><creator>Kuppa, Srikant ; Dattatreya, G.R.</creator><creatorcontrib>Kuppa, Srikant ; Dattatreya, G.R.</creatorcontrib><description>Frame aggregation is one of the several enhancements proposed by IEEE 802.11 Task Group n to improve channel utilization. In frame aggregation, more than one data frame is encapsulated to form an aggregate, and once an aggregate is formed, a station contends to access the medium to transmit the entire aggregate. We refer to the number of data frames encapsulated within an aggregated frame as aggregate size. We claim that a static assignment of aggregate size leads to the following performance trade-off: a small value might be insufficient to mitigate the transmission overheads, thereby nullifying the whole purpose of frame aggregation; whereas, a large value might affect the quality of service experienced by higher layers due to the extra wait time to build an aggregate. In this paper, we characterize this trade-off by studying the impact of aggregate size on metrics like frame latency and channel utilization. To estimate these metrics, we model the transmission queue of an 802.11n station as a bulk service queuing system. We study the impact of aggregate size over a wide range of operating conditions covering several traffic arrival rates from higher layers, service distribution and data frame sizes. Apart from validating the existence of above-mentioned performance trade-off, our results indicate that the choice of aggregate size not only depends on the traffic arrival rate, but also (more interestingly) on data frame sizes. This calls for a dynamic assignment of aggregate size.</description><identifier>ISSN: 1550-3607</identifier><identifier>EISSN: 1938-1883</identifier><identifier>EISBN: 1424403553</identifier><identifier>EISBN: 9781424403554</identifier><identifier>DOI: 10.1109/ICC.2006.254873</identifier><language>eng</language><publisher>IEEE</publisher><subject>Aggregates ; Analytical models ; Bulk service ; Computer networks ; Computer science ; Delay ; Encapsulation ; Frame aggregation ; IEEE 802.11n ; Media Access Protocol ; Minimum batch size rule ; Physical layer ; Quality of service ; Traffic control</subject><ispartof>2006 IEEE International Conference on Communications, 2006, Vol.3, p.967-972</ispartof><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><linktohtml>$$Uhttps://ieeexplore.ieee.org/document/4024265$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,23930,23931,25140,27925,54555,54932</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/4024265$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Kuppa, Srikant</creatorcontrib><creatorcontrib>Dattatreya, G.R.</creatorcontrib><title>Modeling and Analysis of Frame Aggregation in Unsaturated WLANs with Finite Buffer Stations</title><title>2006 IEEE International Conference on Communications</title><addtitle>ICC</addtitle><description>Frame aggregation is one of the several enhancements proposed by IEEE 802.11 Task Group n to improve channel utilization. In frame aggregation, more than one data frame is encapsulated to form an aggregate, and once an aggregate is formed, a station contends to access the medium to transmit the entire aggregate. We refer to the number of data frames encapsulated within an aggregated frame as aggregate size. We claim that a static assignment of aggregate size leads to the following performance trade-off: a small value might be insufficient to mitigate the transmission overheads, thereby nullifying the whole purpose of frame aggregation; whereas, a large value might affect the quality of service experienced by higher layers due to the extra wait time to build an aggregate. In this paper, we characterize this trade-off by studying the impact of aggregate size on metrics like frame latency and channel utilization. To estimate these metrics, we model the transmission queue of an 802.11n station as a bulk service queuing system. We study the impact of aggregate size over a wide range of operating conditions covering several traffic arrival rates from higher layers, service distribution and data frame sizes. Apart from validating the existence of above-mentioned performance trade-off, our results indicate that the choice of aggregate size not only depends on the traffic arrival rate, but also (more interestingly) on data frame sizes. This calls for a dynamic assignment of aggregate size.</description><subject>Aggregates</subject><subject>Analytical models</subject><subject>Bulk service</subject><subject>Computer networks</subject><subject>Computer science</subject><subject>Delay</subject><subject>Encapsulation</subject><subject>Frame aggregation</subject><subject>IEEE 802.11n</subject><subject>Media Access Protocol</subject><subject>Minimum batch size rule</subject><subject>Physical layer</subject><subject>Quality of service</subject><subject>Traffic control</subject><issn>1550-3607</issn><issn>1938-1883</issn><isbn>1424403553</isbn><isbn>9781424403554</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2006</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><recordid>eNotjLFOwzAURQ0CibYwM7D4B1JsPzt2xhARqBRggIqBoXLwczBqXRS7Qv17KmC6RzpHl5BLzuacs-p60TRzwVg5F0oaDUdkyqWQkoFScEwmvAJTcGPg5MBKsQJKps_INKVPxpSogE_I28PW4TrEgdroaB3tep9ColtP29FukNbDMOJgc9hGGiJdxmTzbrQZHX3t6sdEv0P-oG2IISO92XmPI33Ov306J6ferhNe_O-MLNvbl-a-6J7uFk3dFYFrlQvLBDpQ2vnSl_07aKUlIOdWoHYH6Spj0FkowRjFem20E8JUXErovREMZuTq7zcg4uprDBs77leSCSlKBT-5aVK_</recordid><startdate>200606</startdate><enddate>200606</enddate><creator>Kuppa, Srikant</creator><creator>Dattatreya, G.R.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>200606</creationdate><title>Modeling and Analysis of Frame Aggregation in Unsaturated WLANs with Finite Buffer Stations</title><author>Kuppa, Srikant ; Dattatreya, G.R.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-a02ed357df6f6bc375743e11a2e7da02d988eda3638850b787d22891443bf8203</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2006</creationdate><topic>Aggregates</topic><topic>Analytical models</topic><topic>Bulk service</topic><topic>Computer networks</topic><topic>Computer science</topic><topic>Delay</topic><topic>Encapsulation</topic><topic>Frame aggregation</topic><topic>IEEE 802.11n</topic><topic>Media Access Protocol</topic><topic>Minimum batch size rule</topic><topic>Physical layer</topic><topic>Quality of service</topic><topic>Traffic control</topic><toplevel>online_resources</toplevel><creatorcontrib>Kuppa, Srikant</creatorcontrib><creatorcontrib>Dattatreya, G.R.</creatorcontrib><collection>IEEE Electronic Library (IEL) Conference Proceedings</collection><collection>IEEE Proceedings Order Plan (POP) 1998-present by volume</collection><collection>IEEE Xplore All Conference Proceedings</collection><collection>IEEE Xplore</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Kuppa, Srikant</au><au>Dattatreya, G.R.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Modeling and Analysis of Frame Aggregation in Unsaturated WLANs with Finite Buffer Stations</atitle><btitle>2006 IEEE International Conference on Communications</btitle><stitle>ICC</stitle><date>2006-06</date><risdate>2006</risdate><volume>3</volume><spage>967</spage><epage>972</epage><pages>967-972</pages><issn>1550-3607</issn><eissn>1938-1883</eissn><eisbn>1424403553</eisbn><eisbn>9781424403554</eisbn><abstract>Frame aggregation is one of the several enhancements proposed by IEEE 802.11 Task Group n to improve channel utilization. In frame aggregation, more than one data frame is encapsulated to form an aggregate, and once an aggregate is formed, a station contends to access the medium to transmit the entire aggregate. We refer to the number of data frames encapsulated within an aggregated frame as aggregate size. We claim that a static assignment of aggregate size leads to the following performance trade-off: a small value might be insufficient to mitigate the transmission overheads, thereby nullifying the whole purpose of frame aggregation; whereas, a large value might affect the quality of service experienced by higher layers due to the extra wait time to build an aggregate. In this paper, we characterize this trade-off by studying the impact of aggregate size on metrics like frame latency and channel utilization. To estimate these metrics, we model the transmission queue of an 802.11n station as a bulk service queuing system. We study the impact of aggregate size over a wide range of operating conditions covering several traffic arrival rates from higher layers, service distribution and data frame sizes. Apart from validating the existence of above-mentioned performance trade-off, our results indicate that the choice of aggregate size not only depends on the traffic arrival rate, but also (more interestingly) on data frame sizes. This calls for a dynamic assignment of aggregate size.</abstract><pub>IEEE</pub><doi>10.1109/ICC.2006.254873</doi><tpages>6</tpages></addata></record>
fulltext fulltext_linktorsrc
identifier ISSN: 1550-3607
ispartof 2006 IEEE International Conference on Communications, 2006, Vol.3, p.967-972
issn 1550-3607
1938-1883
language eng
recordid cdi_ieee_primary_4024265
source IEEE Xplore All Conference Series
subjects Aggregates
Analytical models
Bulk service
Computer networks
Computer science
Delay
Encapsulation
Frame aggregation
IEEE 802.11n
Media Access Protocol
Minimum batch size rule
Physical layer
Quality of service
Traffic control
title Modeling and Analysis of Frame Aggregation in Unsaturated WLANs with Finite Buffer Stations
url http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-28T06%3A18%3A35IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_CHZPO&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Modeling%20and%20Analysis%20of%20Frame%20Aggregation%20in%20Unsaturated%20WLANs%20with%20Finite%20Buffer%20Stations&rft.btitle=2006%20IEEE%20International%20Conference%20on%20Communications&rft.au=Kuppa,%20Srikant&rft.date=2006-06&rft.volume=3&rft.spage=967&rft.epage=972&rft.pages=967-972&rft.issn=1550-3607&rft.eissn=1938-1883&rft_id=info:doi/10.1109/ICC.2006.254873&rft.eisbn=1424403553&rft.eisbn_list=9781424403554&rft_dat=%3Cieee_CHZPO%3E4024265%3C/ieee_CHZPO%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-i175t-a02ed357df6f6bc375743e11a2e7da02d988eda3638850b787d22891443bf8203%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=4024265&rfr_iscdi=true