Optimizing the cost of migration from wireless tdm networks to next generation packet networks

Huan Li, Haitao Lin, Hee Lee, P. Das
{"title":"Optimizing the cost of migration from wireless tdm networks to next generation packet networks","authors":"Huan Li, Haitao Lin, Hee Lee, P. Das","doi":"10.1109/WOWMOM.2008.4594833","DOIUrl":null,"url":null,"abstract":"The major wireless operators are actively migrating their networks from circuit switched networks to all packet (IP) based next generation networks. One of the key issues impeding the migration is the associated cost. Though managing the CAPEX (CAPital EXpenditures) and OPEX (OPerational EXpenditure) has been the focus of the operators, minimizing the cost from the perspective of system design has received relatively less attention. In this paper, we investigate a particular trunk allocation problem in a circuit/packet hybrid switch to show how system and algorithm design can significantly reduce the migration cost, so that the operators achieve cost effective migration. In such a problem, allocating different trunk types to the two legs of a call/session results in utilization of a special hardware - an interworking unit to bridge the two types of trunks (TDM and IP) so that the call can be completed. The interworking unit is costly to the operators since it is a pure migration cost with no value after the migration. The key to minimize such cost lies in algorithm design to minimize the traffic requirement of the interworking unit, which is a challenging task due to the complexity of the problem. We develop an analytic model to characterize the traffic over the interworking unit in a hybrid switch with both packet and circuit trunk resources. The system is decoupled into two subsystems, each of which is modeled as a two-dimensional Markov chain. Exact solution of the model is provided through a recursion, and an iterative algorithm is developed to eliminate the difficulty in finding the solution for a large scale system. The accuracy of the iterative algorithm is verified by the simulation results from a OPNET simulation model. The numerical results show the algorithm is very accurate. It can be used to optimize the system resource provisioning and traffic distribution for minimizing the bridged traffic in a hybrid switch. Our results demonstrate it can provide significant cost and performance benefit during migration from TDM networks to next generation packet networks.","PeriodicalId":346269,"journal":{"name":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","volume":"28 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2008-06-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2008 International Symposium on a World of Wireless, Mobile and Multimedia Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WOWMOM.2008.4594833","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

The major wireless operators are actively migrating their networks from circuit switched networks to all packet (IP) based next generation networks. One of the key issues impeding the migration is the associated cost. Though managing the CAPEX (CAPital EXpenditures) and OPEX (OPerational EXpenditure) has been the focus of the operators, minimizing the cost from the perspective of system design has received relatively less attention. In this paper, we investigate a particular trunk allocation problem in a circuit/packet hybrid switch to show how system and algorithm design can significantly reduce the migration cost, so that the operators achieve cost effective migration. In such a problem, allocating different trunk types to the two legs of a call/session results in utilization of a special hardware - an interworking unit to bridge the two types of trunks (TDM and IP) so that the call can be completed. The interworking unit is costly to the operators since it is a pure migration cost with no value after the migration. The key to minimize such cost lies in algorithm design to minimize the traffic requirement of the interworking unit, which is a challenging task due to the complexity of the problem. We develop an analytic model to characterize the traffic over the interworking unit in a hybrid switch with both packet and circuit trunk resources. The system is decoupled into two subsystems, each of which is modeled as a two-dimensional Markov chain. Exact solution of the model is provided through a recursion, and an iterative algorithm is developed to eliminate the difficulty in finding the solution for a large scale system. The accuracy of the iterative algorithm is verified by the simulation results from a OPNET simulation model. The numerical results show the algorithm is very accurate. It can be used to optimize the system resource provisioning and traffic distribution for minimizing the bridged traffic in a hybrid switch. Our results demonstrate it can provide significant cost and performance benefit during migration from TDM networks to next generation packet networks.
优化从无线时分复用网络迁移到下一代分组网络的成本
主要的无线运营商正在积极地将他们的网络从电路交换网络迁移到基于全分组(IP)的下一代网络。阻碍迁移的关键问题之一是相关的成本。虽然管理CAPEX(资本支出)和OPEX(运营支出)一直是作业者关注的焦点,但从系统设计的角度将成本最小化却相对较少受到关注。本文研究了电路/分组混合交换机中一个特殊的中继分配问题,展示了系统和算法设计如何显著降低迁移成本,从而使运营商实现具有成本效益的迁移。在这样的问题中,为呼叫/会话的两个分支分配不同的中继类型会导致使用特殊的硬件-一个互连单元来桥接两种类型的中继(TDM和IP),以便完成呼叫。对于运营商来说,互连单元是昂贵的,因为它是纯迁移成本,迁移后没有价值。使这种代价最小化的关键在于算法设计,使互联单元的流量需求最小化,由于问题的复杂性,这是一项具有挑战性的任务。我们建立了一个分析模型来描述具有分组和电路中继资源的混合交换机互连单元上的流量。该系统被解耦为两个子系统,每个子系统被建模为一个二维马尔可夫链。通过递归给出了模型的精确解,并提出了一种迭代算法,消除了求解大规模系统的困难。基于OPNET仿真模型的仿真结果验证了迭代算法的准确性。数值结果表明,该算法具有较高的精度。它可以用于优化系统资源分配和流量分配,以最大限度地减少混合交换机中的桥接流量。我们的研究结果表明,在从时分复用网络迁移到下一代分组网络的过程中,它可以提供显著的成本和性能优势。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信