Loading…
Dynamic resource assignment strategies for PCS data services
For high speed mobile communication applications, the data rate can be increased by using multiple channels (or time slots) instead of a single channel (or time slot). To reduce the high blocking rate of multiple channels assignment, flexible resource allocation strategies are exercised. This paper...
Saved in:
Published in: | Information sciences 1998-08, Vol.109 (1), p.211-225 |
---|---|
Main Authors: | , , |
Format: | Article |
Language: | English |
Subjects: | |
Citations: | Items that cite this one |
Online Access: | Get full text |
Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
cited_by | cdi_FETCH-LOGICAL-c338t-3529295a4fdca1da9ce449845f419fdfb15ef5bcc0e4641b1a16980920acbf183 |
---|---|
cites | |
container_end_page | 225 |
container_issue | 1 |
container_start_page | 211 |
container_title | Information sciences |
container_volume | 109 |
creator | Jeng, Jeu-Yih Lin, Yi-Bing Chen, Wai |
description | For high speed mobile communication applications, the data rate can be increased by using multiple channels (or time slots) instead of a single channel (or time slot). To reduce the high blocking rate of multiple channels assignment, flexible resource allocation strategies are exercised. This paper proposes a generic Mobile Switching Center (MSC) resource allocation algorithm called MRA algorithm for Personal Communications Services (PCS) data services. The algorithm may combine with any base station resource allocation algorithms proposed in our previous study. A simulation model is proposed to investigate the performance of these algorithms. We define satisfaction indication SI to measure the performance of the resource allocation. SI indicates the customer's satisfaction about the call connection, it can also be used by the service provider as a charge indication. |
doi_str_mv | 10.1016/S0020-0255(98)10020-8 |
format | article |
fullrecord | <record><control><sourceid>proquest_cross</sourceid><recordid>TN_cdi_proquest_miscellaneous_27499491</recordid><sourceformat>XML</sourceformat><sourcesystem>PC</sourcesystem><els_id>S0020025598100208</els_id><sourcerecordid>27499491</sourcerecordid><originalsourceid>FETCH-LOGICAL-c338t-3529295a4fdca1da9ce449845f419fdfb15ef5bcc0e4641b1a16980920acbf183</originalsourceid><addsrcrecordid>eNqFkE1LAzEQhoMoWKs_QdiT6GE1k022CQgi9RMKCtVzyGYnJdLdrZltof_efohXT8PA877DPIydA78GDuXNlHPBcy6UujT6CnabPmAD0CORl8LAIRv8IcfshOiLcy5HZTlgtw_r1jXRZwmpWyaPmSOKs7bBts-oT67HWUTKQpey9_E0q13vMsK0ih7plB0FNyc8-51D9vn0-DF-ySdvz6_j-0nui0L3eaGEEUY5GWrvoHbGo5RGSxUkmFCHChQGVXnPUZYSKnBQGs2N4M5XAXQxZBf73kXqvpdIvW0ieZzPXYvdkqwYSWOkgQ2o9qBPHVHCYBcpNi6tLXC7dWV3ruxWhDXa7lzZ7YG7fQ43X6wiJks-Yuuxjgl9b-su_tPwA946cKs</addsrcrecordid><sourcetype>Aggregation Database</sourcetype><iscdi>true</iscdi><recordtype>article</recordtype><pqid>27499491</pqid></control><display><type>article</type><title>Dynamic resource assignment strategies for PCS data services</title><source>ScienceDirect Journals</source><creator>Jeng, Jeu-Yih ; Lin, Yi-Bing ; Chen, Wai</creator><creatorcontrib>Jeng, Jeu-Yih ; Lin, Yi-Bing ; Chen, Wai</creatorcontrib><description>For high speed mobile communication applications, the data rate can be increased by using multiple channels (or time slots) instead of a single channel (or time slot). To reduce the high blocking rate of multiple channels assignment, flexible resource allocation strategies are exercised. This paper proposes a generic Mobile Switching Center (MSC) resource allocation algorithm called MRA algorithm for Personal Communications Services (PCS) data services. The algorithm may combine with any base station resource allocation algorithms proposed in our previous study. A simulation model is proposed to investigate the performance of these algorithms. We define satisfaction indication SI to measure the performance of the resource allocation. SI indicates the customer's satisfaction about the call connection, it can also be used by the service provider as a charge indication.</description><identifier>ISSN: 0020-0255</identifier><identifier>EISSN: 1872-6291</identifier><identifier>DOI: 10.1016/S0020-0255(98)10020-8</identifier><language>eng</language><publisher>Elsevier Inc</publisher><subject>Dynamic resource assignment ; Personal communication services ; Satisfaction indication</subject><ispartof>Information sciences, 1998-08, Vol.109 (1), p.211-225</ispartof><rights>1998 Elsevier Science Inc., All rights reserved</rights><lds50>peer_reviewed</lds50><woscitedreferencessubscribed>false</woscitedreferencessubscribed><citedby>FETCH-LOGICAL-c338t-3529295a4fdca1da9ce449845f419fdfb15ef5bcc0e4641b1a16980920acbf183</citedby></display><links><openurl>$$Topenurl_article</openurl><openurlfulltext>$$Topenurlfull_article</openurlfulltext><thumbnail>$$Tsyndetics_thumb_exl</thumbnail><link.rule.ids>314,776,780,27903,27904</link.rule.ids></links><search><creatorcontrib>Jeng, Jeu-Yih</creatorcontrib><creatorcontrib>Lin, Yi-Bing</creatorcontrib><creatorcontrib>Chen, Wai</creatorcontrib><title>Dynamic resource assignment strategies for PCS data services</title><title>Information sciences</title><description>For high speed mobile communication applications, the data rate can be increased by using multiple channels (or time slots) instead of a single channel (or time slot). To reduce the high blocking rate of multiple channels assignment, flexible resource allocation strategies are exercised. This paper proposes a generic Mobile Switching Center (MSC) resource allocation algorithm called MRA algorithm for Personal Communications Services (PCS) data services. The algorithm may combine with any base station resource allocation algorithms proposed in our previous study. A simulation model is proposed to investigate the performance of these algorithms. We define satisfaction indication SI to measure the performance of the resource allocation. SI indicates the customer's satisfaction about the call connection, it can also be used by the service provider as a charge indication.</description><subject>Dynamic resource assignment</subject><subject>Personal communication services</subject><subject>Satisfaction indication</subject><issn>0020-0255</issn><issn>1872-6291</issn><fulltext>true</fulltext><rsrctype>article</rsrctype><creationdate>1998</creationdate><recordtype>article</recordtype><recordid>eNqFkE1LAzEQhoMoWKs_QdiT6GE1k022CQgi9RMKCtVzyGYnJdLdrZltof_efohXT8PA877DPIydA78GDuXNlHPBcy6UujT6CnabPmAD0CORl8LAIRv8IcfshOiLcy5HZTlgtw_r1jXRZwmpWyaPmSOKs7bBts-oT67HWUTKQpey9_E0q13vMsK0ih7plB0FNyc8-51D9vn0-DF-ySdvz6_j-0nui0L3eaGEEUY5GWrvoHbGo5RGSxUkmFCHChQGVXnPUZYSKnBQGs2N4M5XAXQxZBf73kXqvpdIvW0ieZzPXYvdkqwYSWOkgQ2o9qBPHVHCYBcpNi6tLXC7dWV3ruxWhDXa7lzZ7YG7fQ43X6wiJks-Yuuxjgl9b-su_tPwA946cKs</recordid><startdate>19980801</startdate><enddate>19980801</enddate><creator>Jeng, Jeu-Yih</creator><creator>Lin, Yi-Bing</creator><creator>Chen, Wai</creator><general>Elsevier Inc</general><scope>AAYXX</scope><scope>CITATION</scope><scope>7SC</scope><scope>8FD</scope><scope>JQ2</scope><scope>L7M</scope><scope>L~C</scope><scope>L~D</scope></search><sort><creationdate>19980801</creationdate><title>Dynamic resource assignment strategies for PCS data services</title><author>Jeng, Jeu-Yih ; Lin, Yi-Bing ; Chen, Wai</author></sort><facets><frbrtype>5</frbrtype><frbrgroupid>cdi_FETCH-LOGICAL-c338t-3529295a4fdca1da9ce449845f419fdfb15ef5bcc0e4641b1a16980920acbf183</frbrgroupid><rsrctype>articles</rsrctype><prefilter>articles</prefilter><language>eng</language><creationdate>1998</creationdate><topic>Dynamic resource assignment</topic><topic>Personal communication services</topic><topic>Satisfaction indication</topic><toplevel>peer_reviewed</toplevel><toplevel>online_resources</toplevel><creatorcontrib>Jeng, Jeu-Yih</creatorcontrib><creatorcontrib>Lin, Yi-Bing</creatorcontrib><creatorcontrib>Chen, Wai</creatorcontrib><collection>CrossRef</collection><collection>Computer and Information Systems Abstracts</collection><collection>Technology Research Database</collection><collection>ProQuest Computer Science Collection</collection><collection>Advanced Technologies Database with Aerospace</collection><collection>Computer and Information Systems Abstracts – Academic</collection><collection>Computer and Information Systems Abstracts Professional</collection><jtitle>Information sciences</jtitle></facets><delivery><delcategory>Remote Search Resource</delcategory><fulltext>fulltext</fulltext></delivery><addata><au>Jeng, Jeu-Yih</au><au>Lin, Yi-Bing</au><au>Chen, Wai</au><format>journal</format><genre>article</genre><ristype>JOUR</ristype><atitle>Dynamic resource assignment strategies for PCS data services</atitle><jtitle>Information sciences</jtitle><date>1998-08-01</date><risdate>1998</risdate><volume>109</volume><issue>1</issue><spage>211</spage><epage>225</epage><pages>211-225</pages><issn>0020-0255</issn><eissn>1872-6291</eissn><abstract>For high speed mobile communication applications, the data rate can be increased by using multiple channels (or time slots) instead of a single channel (or time slot). To reduce the high blocking rate of multiple channels assignment, flexible resource allocation strategies are exercised. This paper proposes a generic Mobile Switching Center (MSC) resource allocation algorithm called MRA algorithm for Personal Communications Services (PCS) data services. The algorithm may combine with any base station resource allocation algorithms proposed in our previous study. A simulation model is proposed to investigate the performance of these algorithms. We define satisfaction indication SI to measure the performance of the resource allocation. SI indicates the customer's satisfaction about the call connection, it can also be used by the service provider as a charge indication.</abstract><pub>Elsevier Inc</pub><doi>10.1016/S0020-0255(98)10020-8</doi><tpages>15</tpages></addata></record> |
fulltext | fulltext |
identifier | ISSN: 0020-0255 |
ispartof | Information sciences, 1998-08, Vol.109 (1), p.211-225 |
issn | 0020-0255 1872-6291 |
language | eng |
recordid | cdi_proquest_miscellaneous_27499491 |
source | ScienceDirect Journals |
subjects | Dynamic resource assignment Personal communication services Satisfaction indication |
title | Dynamic resource assignment strategies for PCS data services |
url | http://sfxeu10.hosted.exlibrisgroup.com/loughborough?ctx_ver=Z39.88-2004&ctx_enc=info:ofi/enc:UTF-8&ctx_tim=2025-01-27T18%3A15%3A04IST&url_ver=Z39.88-2004&url_ctx_fmt=infofi/fmt:kev:mtx:ctx&rfr_id=info:sid/primo.exlibrisgroup.com:primo3-Article-proquest_cross&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.genre=article&rft.atitle=Dynamic%20resource%20assignment%20strategies%20for%20PCS%20data%20services&rft.jtitle=Information%20sciences&rft.au=Jeng,%20Jeu-Yih&rft.date=1998-08-01&rft.volume=109&rft.issue=1&rft.spage=211&rft.epage=225&rft.pages=211-225&rft.issn=0020-0255&rft.eissn=1872-6291&rft_id=info:doi/10.1016/S0020-0255(98)10020-8&rft_dat=%3Cproquest_cross%3E27499491%3C/proquest_cross%3E%3Cgrp_id%3Ecdi_FETCH-LOGICAL-c338t-3529295a4fdca1da9ce449845f419fdfb15ef5bcc0e4641b1a16980920acbf183%3C/grp_id%3E%3Coa%3E%3C/oa%3E%3Curl%3E%3C/url%3E&rft_id=info:oai/&rft_pqid=27499491&rft_id=info:pmid/&rfr_iscdi=true |