提高无线接入网络的可恢复性

Wee-Seng Soh, Z. Antoniou, Hyong S. Kim
{"title":"提高无线接入网络的可恢复性","authors":"Wee-Seng Soh, Z. Antoniou, Hyong S. Kim","doi":"10.1109/GLOCOM.2003.1258884","DOIUrl":null,"url":null,"abstract":"In the past, wireless network reliability issues have received limited attention. Previously proposed solutions have focused on protection against base station failures, which may require significantly more base stations than necessary. Actual data from wireless carriers suggest that problems in the backhaul are the uttermost reliability problems faced, and is therefore the main focus of this work. Current radio access networks are based on tree and star-like topologies, which have no inherent restorability properties. We propose a heuristic topology enhancement method that adds redundant spans and upgrades existing infrastructure cost-effectively, in order to create partially meshed architectures that could provide the desired level of restorability against single span failure scenarios. Both span and path restoration techniques are explored. The algorithm was tested using several different variants of restoration mechanisms. Results show that the proposed heuristic algorithm is able to achieve reasonably good solutions in a time scale that is several orders of magnitude faster than an optimization approach based on binary integer programming formulation.","PeriodicalId":301154,"journal":{"name":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2003-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"9","resultStr":"{\"title\":\"Improving restorability in radio access network\",\"authors\":\"Wee-Seng Soh, Z. Antoniou, Hyong S. Kim\",\"doi\":\"10.1109/GLOCOM.2003.1258884\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"In the past, wireless network reliability issues have received limited attention. Previously proposed solutions have focused on protection against base station failures, which may require significantly more base stations than necessary. Actual data from wireless carriers suggest that problems in the backhaul are the uttermost reliability problems faced, and is therefore the main focus of this work. Current radio access networks are based on tree and star-like topologies, which have no inherent restorability properties. We propose a heuristic topology enhancement method that adds redundant spans and upgrades existing infrastructure cost-effectively, in order to create partially meshed architectures that could provide the desired level of restorability against single span failure scenarios. Both span and path restoration techniques are explored. The algorithm was tested using several different variants of restoration mechanisms. Results show that the proposed heuristic algorithm is able to achieve reasonably good solutions in a time scale that is several orders of magnitude faster than an optimization approach based on binary integer programming formulation.\",\"PeriodicalId\":301154,\"journal\":{\"name\":\"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)\",\"volume\":\"21 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2003-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"9\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/GLOCOM.2003.1258884\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"GLOBECOM '03. IEEE Global Telecommunications Conference (IEEE Cat. No.03CH37489)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/GLOCOM.2003.1258884","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 9

摘要

过去,无线网络可靠性问题受到的关注有限。以前提出的解决方案侧重于防止基站故障,这可能需要比必要的更多的基站。来自无线运营商的实际数据表明,回程中的问题是面临的最大可靠性问题,因此是本工作的主要焦点。当前的无线接入网络是基于树状和星形拓扑结构,没有固有的可恢复性。我们提出了一种启发式拓扑增强方法,该方法可以增加冗余跨度并经济有效地升级现有基础设施,以创建部分网格化的架构,从而在单跨度故障场景下提供所需的可恢复性水平。研究了跨度和路径恢复技术。使用几种不同的恢复机制对该算法进行了测试。结果表明,所提出的启发式算法能够在较好的时间尺度上获得较好的解,比基于二进制整数规划公式的优化方法快几个数量级。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Improving restorability in radio access network
In the past, wireless network reliability issues have received limited attention. Previously proposed solutions have focused on protection against base station failures, which may require significantly more base stations than necessary. Actual data from wireless carriers suggest that problems in the backhaul are the uttermost reliability problems faced, and is therefore the main focus of this work. Current radio access networks are based on tree and star-like topologies, which have no inherent restorability properties. We propose a heuristic topology enhancement method that adds redundant spans and upgrades existing infrastructure cost-effectively, in order to create partially meshed architectures that could provide the desired level of restorability against single span failure scenarios. Both span and path restoration techniques are explored. The algorithm was tested using several different variants of restoration mechanisms. Results show that the proposed heuristic algorithm is able to achieve reasonably good solutions in a time scale that is several orders of magnitude faster than an optimization approach based on binary integer programming formulation.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信