Quality of service for tactical data links: TDMA with dynamic scheduling
In this paper we focus on demand-assigned multiple-access (DAMA) MAC protocols utilizing time division multiple access (TDMA). In TDMA, the channel is broken down into time slots of equal duration, and nodes are allocated slots in which to transmit their data. Slots can be preassigned prior to a mis...
Gespeichert in:
Hauptverfasser: | , |
---|---|
Format: | Tagungsbericht |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext bestellen |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | 2359 Vol. 4 |
---|---|
container_issue | |
container_start_page | 2350 |
container_title | |
container_volume | |
creator | Lewis, A.M. Pizzi, S.V. |
description | In this paper we focus on demand-assigned multiple-access (DAMA) MAC protocols utilizing time division multiple access (TDMA). In TDMA, the channel is broken down into time slots of equal duration, and nodes are allocated slots in which to transmit their data. Slots can be preassigned prior to a mission or can be allocated dynamically as the need arises. Herein, we develop and simulate two dynamic allocation algorithms: the first provides fair scheduling of data, while the second provides strict priority scheduling of data. These protocols are simulated in a tactical targeting network technologies (TTNT) single-strike scenario which is a 78-node scenario with a varied traffic profile. We compare the performance of the fair scheduling and strict priority scheduling algorithms against a preassigned TDMA protocol. In addition to the scheduling algorithms two classification methods are used in these experiments, the first based on packet size and the second based on both message type and packet size. We find that adding dynamic allocation improves overall bandwidth utilization over the preassigned TDMA protocol for either type of classification. However classification based on packet size alone is not effective in providing service differentiation. Classification based on message type and packet size used with the strict priority scheduling offers the best priority treatment for this traffic profile. |
doi_str_mv | 10.1109/MILCOM.2005.1606020 |
format | Conference Proceeding |
fullrecord | <record><control><sourceid>ieee_6IE</sourceid><recordid>TN_cdi_ieee_primary_1606020</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><ieee_id>1606020</ieee_id><sourcerecordid>1606020</sourcerecordid><originalsourceid>FETCH-LOGICAL-i175t-cb400e9fbf4a33e0be10a074bc3e90589696d48e7a9ee67fb272dd6084c368d3</originalsourceid><addsrcrecordid>eNo9kMtqwzAUREUf0JD6C7LRD9i9kmw9ugvuIwGbUPA-yNJ1o9ZJiq205O9raChzYBYHZjGELBhkjIF5qNdVuakzDlBkTIIEDldkxllRpKrQ8pokRmmYEGaKvPl3St-RZBw_AIBxLblhM7J6O9k-xDM9dnTE4Ts4pN1xoNG6GJztqbfR0j4cPsdH2jzVS_oT4o7688Hug6Oj26E_Tfr9ntx2th8xufScNC_PTblKq83rulxWaWCqiKlrcwA0XdvlVgiEFhlYUHnrBBootJFG-lyjsgZRqq7linsvQedOSO3FnCz-ZgMibr-GsLfDeXu5QfwCguhO5w</addsrcrecordid><sourcetype>Publisher</sourcetype><iscdi>true</iscdi><recordtype>conference_proceeding</recordtype></control><display><type>conference_proceeding</type><title>Quality of service for tactical data links: TDMA with dynamic scheduling</title><source>IEEE Electronic Library (IEL) Conference Proceedings</source><creator>Lewis, A.M. ; Pizzi, S.V.</creator><creatorcontrib>Lewis, A.M. ; Pizzi, S.V.</creatorcontrib><description>In this paper we focus on demand-assigned multiple-access (DAMA) MAC protocols utilizing time division multiple access (TDMA). In TDMA, the channel is broken down into time slots of equal duration, and nodes are allocated slots in which to transmit their data. Slots can be preassigned prior to a mission or can be allocated dynamically as the need arises. Herein, we develop and simulate two dynamic allocation algorithms: the first provides fair scheduling of data, while the second provides strict priority scheduling of data. These protocols are simulated in a tactical targeting network technologies (TTNT) single-strike scenario which is a 78-node scenario with a varied traffic profile. We compare the performance of the fair scheduling and strict priority scheduling algorithms against a preassigned TDMA protocol. In addition to the scheduling algorithms two classification methods are used in these experiments, the first based on packet size and the second based on both message type and packet size. We find that adding dynamic allocation improves overall bandwidth utilization over the preassigned TDMA protocol for either type of classification. However classification based on packet size alone is not effective in providing service differentiation. Classification based on message type and packet size used with the strict priority scheduling offers the best priority treatment for this traffic profile.</description><identifier>ISSN: 2155-7578</identifier><identifier>ISBN: 9780780393936</identifier><identifier>ISBN: 0780393937</identifier><identifier>EISSN: 2155-7586</identifier><identifier>DOI: 10.1109/MILCOM.2005.1606020</identifier><language>eng</language><publisher>IEEE</publisher><subject>Access protocols ; Bandwidth ; Dynamic scheduling ; Heuristic algorithms ; Media Access Protocol ; Quality of service ; Scheduling algorithm ; Telecommunication traffic ; Time division multiple access ; Traffic control</subject><ispartof>MILCOM 2005 - 2005 IEEE Military Communications Conference, 2005, p.2350-2359 Vol. 4</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/1606020$$EHTML$$P50$$Gieee$$H</linktohtml><link.rule.ids>309,310,780,784,789,790,2058,4050,4051,27925,54920</link.rule.ids><linktorsrc>$$Uhttps://ieeexplore.ieee.org/document/1606020$$EView_record_in_IEEE$$FView_record_in_$$GIEEE</linktorsrc></links><search><creatorcontrib>Lewis, A.M.</creatorcontrib><creatorcontrib>Pizzi, S.V.</creatorcontrib><title>Quality of service for tactical data links: TDMA with dynamic scheduling</title><title>MILCOM 2005 - 2005 IEEE Military Communications Conference</title><addtitle>MILCOM</addtitle><description>In this paper we focus on demand-assigned multiple-access (DAMA) MAC protocols utilizing time division multiple access (TDMA). In TDMA, the channel is broken down into time slots of equal duration, and nodes are allocated slots in which to transmit their data. Slots can be preassigned prior to a mission or can be allocated dynamically as the need arises. Herein, we develop and simulate two dynamic allocation algorithms: the first provides fair scheduling of data, while the second provides strict priority scheduling of data. These protocols are simulated in a tactical targeting network technologies (TTNT) single-strike scenario which is a 78-node scenario with a varied traffic profile. We compare the performance of the fair scheduling and strict priority scheduling algorithms against a preassigned TDMA protocol. In addition to the scheduling algorithms two classification methods are used in these experiments, the first based on packet size and the second based on both message type and packet size. We find that adding dynamic allocation improves overall bandwidth utilization over the preassigned TDMA protocol for either type of classification. However classification based on packet size alone is not effective in providing service differentiation. Classification based on message type and packet size used with the strict priority scheduling offers the best priority treatment for this traffic profile.</description><subject>Access protocols</subject><subject>Bandwidth</subject><subject>Dynamic scheduling</subject><subject>Heuristic algorithms</subject><subject>Media Access Protocol</subject><subject>Quality of service</subject><subject>Scheduling algorithm</subject><subject>Telecommunication traffic</subject><subject>Time division multiple access</subject><subject>Traffic control</subject><issn>2155-7578</issn><issn>2155-7586</issn><isbn>9780780393936</isbn><isbn>0780393937</isbn><fulltext>true</fulltext><rsrctype>conference_proceeding</rsrctype><creationdate>2005</creationdate><recordtype>conference_proceeding</recordtype><sourceid>6IE</sourceid><sourceid>RIE</sourceid><recordid>eNo9kMtqwzAUREUf0JD6C7LRD9i9kmw9ugvuIwGbUPA-yNJ1o9ZJiq205O9raChzYBYHZjGELBhkjIF5qNdVuakzDlBkTIIEDldkxllRpKrQ8pokRmmYEGaKvPl3St-RZBw_AIBxLblhM7J6O9k-xDM9dnTE4Ts4pN1xoNG6GJztqbfR0j4cPsdH2jzVS_oT4o7688Hug6Oj26E_Tfr9ntx2th8xufScNC_PTblKq83rulxWaWCqiKlrcwA0XdvlVgiEFhlYUHnrBBootJFG-lyjsgZRqq7linsvQedOSO3FnCz-ZgMibr-GsLfDeXu5QfwCguhO5w</recordid><startdate>2005</startdate><enddate>2005</enddate><creator>Lewis, A.M.</creator><creator>Pizzi, S.V.</creator><general>IEEE</general><scope>6IE</scope><scope>6IH</scope><scope>CBEJK</scope><scope>RIE</scope><scope>RIO</scope></search><sort><creationdate>2005</creationdate><title>Quality of service for tactical data links: TDMA with dynamic scheduling</title><author>Lewis, A.M. ; Pizzi, S.V.</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-i175t-cb400e9fbf4a33e0be10a074bc3e90589696d48e7a9ee67fb272dd6084c368d3</frbrgroupid><rsrctype>conference_proceedings</rsrctype><prefilter>conference_proceedings</prefilter><language>eng</language><creationdate>2005</creationdate><topic>Access protocols</topic><topic>Bandwidth</topic><topic>Dynamic scheduling</topic><topic>Heuristic algorithms</topic><topic>Media Access Protocol</topic><topic>Quality of service</topic><topic>Scheduling algorithm</topic><topic>Telecommunication traffic</topic><topic>Time division multiple access</topic><topic>Traffic control</topic><toplevel>online_resources</toplevel><creatorcontrib>Lewis, A.M.</creatorcontrib><creatorcontrib>Pizzi, S.V.</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 Electronic Library (IEL)</collection><collection>IEEE Proceedings Order Plans (POP) 1998-present</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext_linktorsrc</fulltext></delivery><addata><au>Lewis, A.M.</au><au>Pizzi, S.V.</au><format>book</format><genre>proceeding</genre><ristype>CONF</ristype><atitle>Quality of service for tactical data links: TDMA with dynamic scheduling</atitle><btitle>MILCOM 2005 - 2005 IEEE Military Communications Conference</btitle><stitle>MILCOM</stitle><date>2005</date><risdate>2005</risdate><spage>2350</spage><epage>2359 Vol. 4</epage><pages>2350-2359 Vol. 4</pages><issn>2155-7578</issn><eissn>2155-7586</eissn><isbn>9780780393936</isbn><isbn>0780393937</isbn><abstract>In this paper we focus on demand-assigned multiple-access (DAMA) MAC protocols utilizing time division multiple access (TDMA). In TDMA, the channel is broken down into time slots of equal duration, and nodes are allocated slots in which to transmit their data. Slots can be preassigned prior to a mission or can be allocated dynamically as the need arises. Herein, we develop and simulate two dynamic allocation algorithms: the first provides fair scheduling of data, while the second provides strict priority scheduling of data. These protocols are simulated in a tactical targeting network technologies (TTNT) single-strike scenario which is a 78-node scenario with a varied traffic profile. We compare the performance of the fair scheduling and strict priority scheduling algorithms against a preassigned TDMA protocol. In addition to the scheduling algorithms two classification methods are used in these experiments, the first based on packet size and the second based on both message type and packet size. We find that adding dynamic allocation improves overall bandwidth utilization over the preassigned TDMA protocol for either type of classification. However classification based on packet size alone is not effective in providing service differentiation. Classification based on message type and packet size used with the strict priority scheduling offers the best priority treatment for this traffic profile.</abstract><pub>IEEE</pub><doi>10.1109/MILCOM.2005.1606020</doi></addata></record> |
fulltext | fulltext_linktorsrc |
identifier | ISSN: 2155-7578 |
ispartof | MILCOM 2005 - 2005 IEEE Military Communications Conference, 2005, p.2350-2359 Vol. 4 |
issn | 2155-7578 2155-7586 |
language | eng |
recordid | cdi_ieee_primary_1606020 |
source | IEEE Electronic Library (IEL) Conference Proceedings |
subjects | Access protocols Bandwidth Dynamic scheduling Heuristic algorithms Media Access Protocol Quality of service Scheduling algorithm Telecommunication traffic Time division multiple access Traffic control |
title | Quality of service for tactical data links: TDMA with dynamic scheduling |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-05T23%3A37%3A22IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-ieee_6IE&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=proceeding&rft.atitle=Quality%20of%20service%20for%20tactical%20data%20links:%20TDMA%20with%20dynamic%20scheduling&rft.btitle=MILCOM%202005%20-%202005%20IEEE%20Military%20Communications%20Conference&rft.au=Lewis,%20A.M.&rft.date=2005&rft.spage=2350&rft.epage=2359%20Vol.%204&rft.pages=2350-2359%20Vol.%204&rft.issn=2155-7578&rft.eissn=2155-7586&rft.isbn=9780780393936&rft.isbn_list=0780393937&rft_id=info:doi/10.1109/MILCOM.2005.1606020&rft_dat=%3Cieee_6IE%3E1606020%3C/ieee_6IE%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_id=info:pmid/&rft_ieee_id=1606020&rfr_iscdi=true |