CALB: a new cell-to-switch assignment algorithm with load balancing in the design of a personal communication services network (PCSN)

P. Bhattacharjee, Debashis Saha, A. Mukherjee
{"title":"CALB: a new cell-to-switch assignment algorithm with load balancing in the design of a personal communication services network (PCSN)","authors":"P. Bhattacharjee, Debashis Saha, A. Mukherjee","doi":"10.1109/ICPWC.2000.905816","DOIUrl":null,"url":null,"abstract":"The work deals with the problem of balancing traffic (load) amongst mobile switching centers (MSC) when the cluster of cells to be connected to an MSC is decided during the design of a personal communication services network (PCSN). Our aim is to assign cells to MSC in such a manner that the traffic handling capacity of each of the MSC is utilized uniformly, thereby precluding the possibility of unfairness in loading of MSC. This, in turn, makes all the MSC equally scalable against the increase in either the mobile user density or per user traffic. A conventional cell to switch assignment (CSA) algorithm attempts to optimize only the total cost, comprising cable cost and handoff cost, without taking into account the utilization of the traffic handling capacity of MSC. To obviate this limitation, we propose a new CSA algorithm with load balancing (CALB) which emphasizes equally on the load balancing as well as on cost optimization. CALB performs extremely well in balancing the traffic amongst the MSC present in the network thereby helping in increasing the overall scalability. although it outperforms CSA in terms of load balancing, it does so obviously at increased total cost (i.e., the solution obtained is a sub-optimal one in terms of cost only). But the increase in cost is never overwhelming (5%-14%) vis-a-vis the improvement in the system scalability (0.5%-19%).","PeriodicalId":260472,"journal":{"name":"2000 IEEE International Conference on Personal Wireless Communications. Conference Proceedings (Cat. No.00TH8488)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2000-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2000 IEEE International Conference on Personal Wireless Communications. Conference Proceedings (Cat. No.00TH8488)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICPWC.2000.905816","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

Abstract

The work deals with the problem of balancing traffic (load) amongst mobile switching centers (MSC) when the cluster of cells to be connected to an MSC is decided during the design of a personal communication services network (PCSN). Our aim is to assign cells to MSC in such a manner that the traffic handling capacity of each of the MSC is utilized uniformly, thereby precluding the possibility of unfairness in loading of MSC. This, in turn, makes all the MSC equally scalable against the increase in either the mobile user density or per user traffic. A conventional cell to switch assignment (CSA) algorithm attempts to optimize only the total cost, comprising cable cost and handoff cost, without taking into account the utilization of the traffic handling capacity of MSC. To obviate this limitation, we propose a new CSA algorithm with load balancing (CALB) which emphasizes equally on the load balancing as well as on cost optimization. CALB performs extremely well in balancing the traffic amongst the MSC present in the network thereby helping in increasing the overall scalability. although it outperforms CSA in terms of load balancing, it does so obviously at increased total cost (i.e., the solution obtained is a sub-optimal one in terms of cost only). But the increase in cost is never overwhelming (5%-14%) vis-a-vis the improvement in the system scalability (0.5%-19%).
个人通信服务网络(PCSN)设计中一种新的具有负载平衡的小区到交换机分配算法
研究了在设计个人通信业务网络(PCSN)过程中,当移动交换中心(MSC)连接的蜂窝群确定时,在移动交换中心(MSC)之间平衡流量(负载)的问题。我们的目标是以这样一种方式将单元分配给MSC,即每个MSC的流量处理能力被统一利用,从而排除了MSC加载不公平的可能性。反过来,这使得所有的MSC都可以针对移动用户密度或每个用户流量的增加进行同等的扩展。传统的cell to switch allocation (CSA)算法试图只优化总成本,包括电缆成本和切换成本,而不考虑MSC的流量处理能力的利用率。为了克服这一限制,我们提出了一种新的负载平衡(CALB) CSA算法,该算法同时强调负载平衡和成本优化。CALB在平衡网络中存在的MSC之间的流量方面表现得非常好,从而有助于提高整体可扩展性。虽然它在负载平衡方面优于CSA,但它显然是以增加的总成本为代价的(即,仅就成本而言,获得的解决方案是次优的)。但是,相对于系统可伸缩性的提高(0.5%-19%),成本的增加从来都不是压倒性的(5%-14%)。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信