无线网络中支持分组数据业务的连接状态方案的负载阈值

C. Choi, W. C. Shin, J. Park, Dong Joon Kim, Jea Hwan Ju
{"title":"无线网络中支持分组数据业务的连接状态方案的负载阈值","authors":"C. Choi, W. C. Shin, J. Park, Dong Joon Kim, Jea Hwan Ju","doi":"10.1109/VETECS.2003.1207086","DOIUrl":null,"url":null,"abstract":"In provisioning packet data service on wireless cellular networks, a scheme of altering connection status between mobile and base stations appeared intending to efficiently utilize resource during idle periods. In such a scheme, connection components are sequentially released as an idle period persists, while a transmission activity is resumed as a prescribed amount of traffic load is accumulated at the transmitting station. Before a transmission resume, however, latency depending on previous idle period is unavoidable to retrieve the lost connection components, which also produces a chain reaction in forthcoming idle period and connection retrieval time. An issue arising in design of the scheme is to determine a threshold value for load accumulation in conjunction with packet delay properties. A high threshold apparently incurs along stand-by to gather the prescribed traffic load before resuming transmission. On the other hand, such high threshold may shorten the length of upcoming idle period and reduce the consequent connection retrieval time by suppressing the release of connection components. In this paper, we thus investigate the antithetical effects of load threshold on packet delay performance. First, we generalize the connection retrieval time in consideration of the number of states and maximum sojourn times. Secondly, for general packet arrivals, we estimate average length of idle period and mean packet delay. In addition, we present an approximation method to calculate the moments of packet delay time for Poisson arrivals. Finally, we construct and solve a problem to find an optimal value for load threshold minimizing mean packet delay. From numerical examples, we find non-trivial optimal thresholds in the environments characterized by relatively long connection retrieval time and heavy traffic load.","PeriodicalId":272763,"journal":{"name":"The 57th IEEE Semiannual Vehicular Technology Conference, 2003. VTC 2003-Spring.","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-04-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Load threshold for connection state scheme supporting packet data service in wireless networks\",\"authors\":\"C. Choi, W. C. Shin, J. Park, Dong Joon Kim, Jea Hwan Ju\",\"doi\":\"10.1109/VETECS.2003.1207086\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In provisioning packet data service on wireless cellular networks, a scheme of altering connection status between mobile and base stations appeared intending to efficiently utilize resource during idle periods. In such a scheme, connection components are sequentially released as an idle period persists, while a transmission activity is resumed as a prescribed amount of traffic load is accumulated at the transmitting station. Before a transmission resume, however, latency depending on previous idle period is unavoidable to retrieve the lost connection components, which also produces a chain reaction in forthcoming idle period and connection retrieval time. An issue arising in design of the scheme is to determine a threshold value for load accumulation in conjunction with packet delay properties. A high threshold apparently incurs along stand-by to gather the prescribed traffic load before resuming transmission. On the other hand, such high threshold may shorten the length of upcoming idle period and reduce the consequent connection retrieval time by suppressing the release of connection components. In this paper, we thus investigate the antithetical effects of load threshold on packet delay performance. First, we generalize the connection retrieval time in consideration of the number of states and maximum sojourn times. Secondly, for general packet arrivals, we estimate average length of idle period and mean packet delay. In addition, we present an approximation method to calculate the moments of packet delay time for Poisson arrivals. Finally, we construct and solve a problem to find an optimal value for load threshold minimizing mean packet delay. From numerical examples, we find non-trivial optimal thresholds in the environments characterized by relatively long connection retrieval time and heavy traffic load.\",\"PeriodicalId\":272763,\"journal\":{\"name\":\"The 57th IEEE Semiannual Vehicular Technology Conference, 2003. VTC 2003-Spring.\",\"volume\":\"27 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-04-22\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"The 57th IEEE Semiannual Vehicular Technology Conference, 2003. VTC 2003-Spring.\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/VETECS.2003.1207086\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"The 57th IEEE Semiannual Vehicular Technology Conference, 2003. VTC 2003-Spring.","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/VETECS.2003.1207086","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

在无线蜂窝网络的分组数据业务提供中,为了有效地利用空闲期间的资源,出现了一种改变移动与基站之间连接状态的方案。在该方案中,当空闲时间持续存在时,依次释放连接组件,而当发送站积累了规定数量的流量负载时,恢复传输活动。然而,在恢复传输之前,不可避免地会有依赖于先前空闲时间的延迟来恢复丢失的连接组件,这也会在即将到来的空闲时间和连接恢复时间产生连锁反应。在方案设计中出现的一个问题是确定与包延迟属性相结合的负载积累的阈值。在恢复传输之前,高阈值显然会引起长时间的等待,以收集规定的流量负载。另一方面,如此高的阈值可以通过抑制连接组件的释放来缩短即将到来的空闲时间的长度,并减少随后的连接检索时间。因此,在本文中,我们研究了负载阈值对分组延迟性能的相反影响。首先,根据状态数和最大逗留时间对连接检索时间进行了一般化。其次,对于一般数据包到达,我们估计了平均空闲时间长度和平均数据包延迟。此外,我们还提出了一种计算泊松到达的包延迟时间矩的近似方法。最后,我们构造并解决了一个最小化平均数据包延迟的负载阈值问题。通过数值算例,我们找到了在连接检索时间较长和流量负载较大的环境下的非平凡最优阈值。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Load threshold for connection state scheme supporting packet data service in wireless networks
In provisioning packet data service on wireless cellular networks, a scheme of altering connection status between mobile and base stations appeared intending to efficiently utilize resource during idle periods. In such a scheme, connection components are sequentially released as an idle period persists, while a transmission activity is resumed as a prescribed amount of traffic load is accumulated at the transmitting station. Before a transmission resume, however, latency depending on previous idle period is unavoidable to retrieve the lost connection components, which also produces a chain reaction in forthcoming idle period and connection retrieval time. An issue arising in design of the scheme is to determine a threshold value for load accumulation in conjunction with packet delay properties. A high threshold apparently incurs along stand-by to gather the prescribed traffic load before resuming transmission. On the other hand, such high threshold may shorten the length of upcoming idle period and reduce the consequent connection retrieval time by suppressing the release of connection components. In this paper, we thus investigate the antithetical effects of load threshold on packet delay performance. First, we generalize the connection retrieval time in consideration of the number of states and maximum sojourn times. Secondly, for general packet arrivals, we estimate average length of idle period and mean packet delay. In addition, we present an approximation method to calculate the moments of packet delay time for Poisson arrivals. Finally, we construct and solve a problem to find an optimal value for load threshold minimizing mean packet delay. From numerical examples, we find non-trivial optimal thresholds in the environments characterized by relatively long connection retrieval time and heavy traffic load.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
User satisfaction models and scheduling algorithms for packet-switched services in UMTS A study of 2.3 GHz bands propagation characteristic measured in Korea Performance evaluation of Bluetooth using interference-detection-based frequency hopping On channel estimation for OFDM systems in multipath environments with relatively large delay spread Optimised MLSE equaliser for fast channel tracking and reliable decoding when using space time DPSK block codes for future WPAN
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1