基于拉格朗日启发式优化的GPON/FTTH网络自动规划

Ling Cen, K. Poon, Z. Yu, A. Ouali
{"title":"基于拉格朗日启发式优化的GPON/FTTH网络自动规划","authors":"Ling Cen, K. Poon, Z. Yu, A. Ouali","doi":"10.1109/IEEM.2013.6962429","DOIUrl":null,"url":null,"abstract":"Gigabit Passive Optical Network / Fiber To The Home (GPON/FTTH) has been of increasing interest for the broadband access network due to its inherent advantages, such as high bandwidth, immunity against electromagnetic interference, no active components required, and low cost. The planning of GPON, however, is a very difficult and time-consuming task. Many design factors such as the number, types, positions of network elements and routing information, have to be considered. In this paper, an automatic GPON design method is proposed, which models the network planning design as a problem of the form of Binary Integer Programming (BIP). The BIP optimization problem that is in nature a NP-hard problem is solved using a Lagrangian Heuristic algorithm. Experiment results have been given to show the effectiveness of the proposed method to identify the optimal placement of distribution points with lower computational cost in network planning.","PeriodicalId":6454,"journal":{"name":"2013 IEEE International Conference on Industrial Engineering and Engineering Management","volume":"129 1","pages":"335-339"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Automatic planning of GPON/FTTH networks based on Lagrangian Heuristic optimization\",\"authors\":\"Ling Cen, K. Poon, Z. Yu, A. Ouali\",\"doi\":\"10.1109/IEEM.2013.6962429\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Gigabit Passive Optical Network / Fiber To The Home (GPON/FTTH) has been of increasing interest for the broadband access network due to its inherent advantages, such as high bandwidth, immunity against electromagnetic interference, no active components required, and low cost. The planning of GPON, however, is a very difficult and time-consuming task. Many design factors such as the number, types, positions of network elements and routing information, have to be considered. In this paper, an automatic GPON design method is proposed, which models the network planning design as a problem of the form of Binary Integer Programming (BIP). The BIP optimization problem that is in nature a NP-hard problem is solved using a Lagrangian Heuristic algorithm. Experiment results have been given to show the effectiveness of the proposed method to identify the optimal placement of distribution points with lower computational cost in network planning.\",\"PeriodicalId\":6454,\"journal\":{\"name\":\"2013 IEEE International Conference on Industrial Engineering and Engineering Management\",\"volume\":\"129 1\",\"pages\":\"335-339\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 IEEE International Conference on Industrial Engineering and Engineering Management\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IEEM.2013.6962429\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE International Conference on Industrial Engineering and Engineering Management","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IEEM.2013.6962429","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

千兆无源光网络/光纤到户(GPON/FTTH)由于其固有的优点,如高带宽、抗电磁干扰、不需要有源元件和低成本,已经越来越受到宽带接入网的关注。然而,GPON的规划是一项非常困难和耗时的任务。必须考虑许多设计因素,如网元的数量、类型、位置和路由信息。本文提出了一种自动GPON设计方法,将网络规划设计建模为二进制整数规划(BIP)形式的问题。利用拉格朗日启发式算法求解本质上属于np困难问题的BIP优化问题。实验结果表明,该方法能够有效地在网络规划中以较低的计算成本确定配点的最优位置。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
Automatic planning of GPON/FTTH networks based on Lagrangian Heuristic optimization
Gigabit Passive Optical Network / Fiber To The Home (GPON/FTTH) has been of increasing interest for the broadband access network due to its inherent advantages, such as high bandwidth, immunity against electromagnetic interference, no active components required, and low cost. The planning of GPON, however, is a very difficult and time-consuming task. Many design factors such as the number, types, positions of network elements and routing information, have to be considered. In this paper, an automatic GPON design method is proposed, which models the network planning design as a problem of the form of Binary Integer Programming (BIP). The BIP optimization problem that is in nature a NP-hard problem is solved using a Lagrangian Heuristic algorithm. Experiment results have been given to show the effectiveness of the proposed method to identify the optimal placement of distribution points with lower computational cost in network planning.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Extension of the PROMETHEE Method to the Multicriteria Dual Clustering Problem On the Necessity for Improving Effectiveness of Qualification Process for Spare Parts Additive Manufacturing in a Circular Economy Supply Chain Selecting Temporary Flood Shelter Locations by P-Center Model A Feasible Schema Design Strategy for Amazon DynamoDB: A Nested Normal Form Approach Flood Shelters Location Using P-median Model
×
引用
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