Channel Fragmentation in Dynamic Spectrum Access Systems - a Theoretical Study
Dynamic Spectrum Access systems exploit temporarily available spectrum (`white spaces') and can spread transmissions over a number of non-contiguous sub-channels. Such methods are highly beneficial in terms of spectrum utilization. However, excessive fragmentation degrades performance and hence...
Gespeichert in:
Veröffentlicht in: | arXiv.org 2010-04 |
---|---|
Hauptverfasser: | , , , , |
Format: | Artikel |
Sprache: | eng |
Schlagworte: | |
Online-Zugang: | Volltext |
Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
container_end_page | |
---|---|
container_issue | |
container_start_page | |
container_title | arXiv.org |
container_volume | |
creator | Coffman, Ed Philippe, Robert Simatos, Florian Tarumi, Shuzo Zussman, Gil |
description | Dynamic Spectrum Access systems exploit temporarily available spectrum (`white spaces') and can spread transmissions over a number of non-contiguous sub-channels. Such methods are highly beneficial in terms of spectrum utilization. However, excessive fragmentation degrades performance and hence off-sets the benefits. Thus, there is a need to study these processes so as to determine how to ensure acceptable levels of fragmentation. Hence, we present experimental and analytical results derived from a mathematical model. We model a system operating at capacity serving requests for bandwidth by assigning a collection of gaps (sub-channels) with no limitations on the fragment size. Our main theoretical result shows that even if fragments can be arbitrarily small, the system does not degrade with time. Namely, the average total number of fragments remains bounded. Within the very difficult class of dynamic fragmentation models (including models of storage fragmentation), this result appears to be the first of its kind. Extensive experimental results describe behavior, at times unexpected, of fragmentation under different algorithms. Our model also applies to dynamic linked-list storage allocation, and provides a novel analysis in that domain. We prove that, interestingly, the 50% rule of the classical (non-fragmented) allocation model carries over to our model. Overall, the paper provides insights into the potential behavior of practical fragmentation algorithms. |
format | Article |
fullrecord | <record><control><sourceid>proquest</sourceid><recordid>TN_cdi_proquest_journals_2087610731</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><sourcerecordid>2087610731</sourcerecordid><originalsourceid>FETCH-proquest_journals_20876107313</originalsourceid><addsrcrecordid>eNqNyrsKwjAUgOEgCBbtOxxwLqSJvaxSLU4u7V5CPNqUJqm5DH17HXwAp3_4_g1JGOd5Vp8Y25HU-4lSysqKFQVPyL0ZhTE4Q-vES6MJIihrQBm4rEZoJaFbUAYXNZylRO-hW31A7SEDAf2I1mFQUszQhfhYD2T7FLPH9Nc9ObbXvrlli7PviD4Mk43OfGlgtK7KnFY85_9dH58oPbU</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>2087610731</pqid></control><display><type>article</type><title>Channel Fragmentation in Dynamic Spectrum Access Systems - a Theoretical Study</title><source>Free E- Journals</source><creator>Coffman, Ed ; Philippe, Robert ; Simatos, Florian ; Tarumi, Shuzo ; Zussman, Gil</creator><creatorcontrib>Coffman, Ed ; Philippe, Robert ; Simatos, Florian ; Tarumi, Shuzo ; Zussman, Gil</creatorcontrib><description>Dynamic Spectrum Access systems exploit temporarily available spectrum (`white spaces') and can spread transmissions over a number of non-contiguous sub-channels. Such methods are highly beneficial in terms of spectrum utilization. However, excessive fragmentation degrades performance and hence off-sets the benefits. Thus, there is a need to study these processes so as to determine how to ensure acceptable levels of fragmentation. Hence, we present experimental and analytical results derived from a mathematical model. We model a system operating at capacity serving requests for bandwidth by assigning a collection of gaps (sub-channels) with no limitations on the fragment size. Our main theoretical result shows that even if fragments can be arbitrarily small, the system does not degrade with time. Namely, the average total number of fragments remains bounded. Within the very difficult class of dynamic fragmentation models (including models of storage fragmentation), this result appears to be the first of its kind. Extensive experimental results describe behavior, at times unexpected, of fragmentation under different algorithms. Our model also applies to dynamic linked-list storage allocation, and provides a novel analysis in that domain. We prove that, interestingly, the 50% rule of the classical (non-fragmented) allocation model carries over to our model. Overall, the paper provides insights into the potential behavior of practical fragmentation algorithms.</description><identifier>EISSN: 2331-8422</identifier><language>eng</language><publisher>Ithaca: Cornell University Library, arXiv.org</publisher><subject>Algorithms ; Bandwidths ; Channels ; Fragmentation ; Fragments ; Performance degradation</subject><ispartof>arXiv.org, 2010-04</ispartof><rights>2010. This work is published under http://arxiv.org/licenses/nonexclusive-distrib/1.0/ (the “License”). Notwithstanding the ProQuest Terms and Conditions, you may use this content in accordance with the terms of the License.</rights><oa>free_for_read</oa><woscitedreferencessubscribed>false</woscitedreferencessubscribed></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>780,784</link.rule.ids></links><search><creatorcontrib>Coffman, Ed</creatorcontrib><creatorcontrib>Philippe, Robert</creatorcontrib><creatorcontrib>Simatos, Florian</creatorcontrib><creatorcontrib>Tarumi, Shuzo</creatorcontrib><creatorcontrib>Zussman, Gil</creatorcontrib><title>Channel Fragmentation in Dynamic Spectrum Access Systems - a Theoretical Study</title><title>arXiv.org</title><description>Dynamic Spectrum Access systems exploit temporarily available spectrum (`white spaces') and can spread transmissions over a number of non-contiguous sub-channels. Such methods are highly beneficial in terms of spectrum utilization. However, excessive fragmentation degrades performance and hence off-sets the benefits. Thus, there is a need to study these processes so as to determine how to ensure acceptable levels of fragmentation. Hence, we present experimental and analytical results derived from a mathematical model. We model a system operating at capacity serving requests for bandwidth by assigning a collection of gaps (sub-channels) with no limitations on the fragment size. Our main theoretical result shows that even if fragments can be arbitrarily small, the system does not degrade with time. Namely, the average total number of fragments remains bounded. Within the very difficult class of dynamic fragmentation models (including models of storage fragmentation), this result appears to be the first of its kind. Extensive experimental results describe behavior, at times unexpected, of fragmentation under different algorithms. Our model also applies to dynamic linked-list storage allocation, and provides a novel analysis in that domain. We prove that, interestingly, the 50% rule of the classical (non-fragmented) allocation model carries over to our model. Overall, the paper provides insights into the potential behavior of practical fragmentation algorithms.</description><subject>Algorithms</subject><subject>Bandwidths</subject><subject>Channels</subject><subject>Fragmentation</subject><subject>Fragments</subject><subject>Performance degradation</subject><issn>2331-8422</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>2010</creationdate><recordtype>article</recordtype><sourceid>ABUWG</sourceid><sourceid>AFKRA</sourceid><sourceid>AZQEC</sourceid><sourceid>BENPR</sourceid><sourceid>CCPQU</sourceid><sourceid>DWQXO</sourceid><recordid>eNqNyrsKwjAUgOEgCBbtOxxwLqSJvaxSLU4u7V5CPNqUJqm5DH17HXwAp3_4_g1JGOd5Vp8Y25HU-4lSysqKFQVPyL0ZhTE4Q-vES6MJIihrQBm4rEZoJaFbUAYXNZylRO-hW31A7SEDAf2I1mFQUszQhfhYD2T7FLPH9Nc9ObbXvrlli7PviD4Mk43OfGlgtK7KnFY85_9dH58oPbU</recordid><startdate>20100416</startdate><enddate>20100416</enddate><creator>Coffman, Ed</creator><creator>Philippe, Robert</creator><creator>Simatos, Florian</creator><creator>Tarumi, Shuzo</creator><creator>Zussman, Gil</creator><general>Cornell University Library, arXiv.org</general><scope>8FE</scope><scope>8FG</scope><scope>ABJCF</scope><scope>ABUWG</scope><scope>AFKRA</scope><scope>AZQEC</scope><scope>BENPR</scope><scope>BGLVJ</scope><scope>CCPQU</scope><scope>DWQXO</scope><scope>HCIFZ</scope><scope>L6V</scope><scope>M7S</scope><scope>PIMPY</scope><scope>PQEST</scope><scope>PQQKQ</scope><scope>PQUKI</scope><scope>PRINS</scope><scope>PTHSS</scope></search><sort><creationdate>20100416</creationdate><title>Channel Fragmentation in Dynamic Spectrum Access Systems - a Theoretical Study</title><author>Coffman, Ed ; Philippe, Robert ; Simatos, Florian ; Tarumi, Shuzo ; Zussman, Gil</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-proquest_journals_20876107313</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>2010</creationdate><topic>Algorithms</topic><topic>Bandwidths</topic><topic>Channels</topic><topic>Fragmentation</topic><topic>Fragments</topic><topic>Performance degradation</topic><toplevel>online_resources</toplevel><creatorcontrib>Coffman, Ed</creatorcontrib><creatorcontrib>Philippe, Robert</creatorcontrib><creatorcontrib>Simatos, Florian</creatorcontrib><creatorcontrib>Tarumi, Shuzo</creatorcontrib><creatorcontrib>Zussman, Gil</creatorcontrib><collection>ProQuest SciTech Collection</collection><collection>ProQuest Technology Collection</collection><collection>Materials Science & Engineering Collection</collection><collection>ProQuest Central (Alumni Edition)</collection><collection>ProQuest Central UK/Ireland</collection><collection>ProQuest Central Essentials</collection><collection>ProQuest Central</collection><collection>Technology Collection</collection><collection>ProQuest One Community College</collection><collection>ProQuest Central Korea</collection><collection>SciTech Premium Collection</collection><collection>ProQuest Engineering Collection</collection><collection>Engineering Database</collection><collection>Access via ProQuest (Open Access)</collection><collection>ProQuest One Academic Eastern Edition (DO NOT USE)</collection><collection>ProQuest One Academic</collection><collection>ProQuest One Academic UKI Edition</collection><collection>ProQuest Central China</collection><collection>Engineering Collection</collection></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Coffman, Ed</au><au>Philippe, Robert</au><au>Simatos, Florian</au><au>Tarumi, Shuzo</au><au>Zussman, Gil</au><format>book</format><genre>document</genre><ristype>GEN</ristype><atitle>Channel Fragmentation in Dynamic Spectrum Access Systems - a Theoretical Study</atitle><jtitle>arXiv.org</jtitle><date>2010-04-16</date><risdate>2010</risdate><eissn>2331-8422</eissn><abstract>Dynamic Spectrum Access systems exploit temporarily available spectrum (`white spaces') and can spread transmissions over a number of non-contiguous sub-channels. Such methods are highly beneficial in terms of spectrum utilization. However, excessive fragmentation degrades performance and hence off-sets the benefits. Thus, there is a need to study these processes so as to determine how to ensure acceptable levels of fragmentation. Hence, we present experimental and analytical results derived from a mathematical model. We model a system operating at capacity serving requests for bandwidth by assigning a collection of gaps (sub-channels) with no limitations on the fragment size. Our main theoretical result shows that even if fragments can be arbitrarily small, the system does not degrade with time. Namely, the average total number of fragments remains bounded. Within the very difficult class of dynamic fragmentation models (including models of storage fragmentation), this result appears to be the first of its kind. Extensive experimental results describe behavior, at times unexpected, of fragmentation under different algorithms. Our model also applies to dynamic linked-list storage allocation, and provides a novel analysis in that domain. We prove that, interestingly, the 50% rule of the classical (non-fragmented) allocation model carries over to our model. Overall, the paper provides insights into the potential behavior of practical fragmentation algorithms.</abstract><cop>Ithaca</cop><pub>Cornell University Library, arXiv.org</pub><oa>free_for_read</oa></addata></record> |
fulltext | fulltext |
identifier | EISSN: 2331-8422 |
ispartof | arXiv.org, 2010-04 |
issn | 2331-8422 |
language | eng |
recordid | cdi_proquest_journals_2087610731 |
source | Free E- Journals |
subjects | Algorithms Bandwidths Channels Fragmentation Fragments Performance degradation |
title | Channel Fragmentation in Dynamic Spectrum Access Systems - a Theoretical Study |
url | https://sfx.bib-bvb.de/sfx_tum?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2024-12-23T17%3A44%3A09IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest&rft_val_fmt=info:ofi/fmt:kev:mtx:book&rft.genre=document&rft.atitle=Channel%20Fragmentation%20in%20Dynamic%20Spectrum%20Access%20Systems%20-%20a%20Theoretical%20Study&rft.jtitle=arXiv.org&rft.au=Coffman,%20Ed&rft.date=2010-04-16&rft.eissn=2331-8422&rft_id=info:doi/&rft_dat=%3Cproquest%3E2087610731%3C/proquest%3E%3Curl%3E%3C/url%3E&disable_directlink=true&sfx.directlink=off&sfx.report_link=0&rft_id=info:oai/&rft_pqid=2087610731&rft_id=info:pmid/&rfr_iscdi=true |