论文标题

用于战略融合网络迁移计划的基于理性代理的决策算法

Rational Agent-Based Decision Algorithm for Strategic Converged Network Migration Planning

论文作者

Patri, Sai Kireet, Grigoreva, Elena, Kellerer, Wolfgang, Machuca, Carmen Mas

论文摘要

为了跟上对具有更高质量和带宽要求的服务的不断增长的用户需求,电信运营商被迫升级其网络。这种升级或网络迁移到新技术是一个复杂的战略网络计划问题,涉及多个时期内技术经济评估。最先进的方法考虑迁移到具体体系结构,并且不考虑不确定性,例如用户流失。这导致迁移成本低估和盈利能力过高。在本文中,我们提出了一种源自基于搜索的理性代理决策过程的通用迁移算法,该算法可以处理不确定性,并使用最大化的效用函数提供迁移路径。该算法最大化迁移项目盈利能力,以累积的净现值(NPV)衡量。这种灵活而通用的方法已经以从现有的铜网络迁移到未来的无源光学网络(PON)体系结构进行了评估。我们提出的灵活迁移算法在完全可重现的案例研究中对纯住宅和融合情景进行了验证。结果使迁移灵活性是利润最大化的关键。

To keep up with constantly growing user demands for services with higher quality and bandwidth requirements, telecommunication operators are forced to upgrade their networks. This upgrade, or migration of the network to a new technology, is a complex strategic network planning problem that involves techno-economic evaluations over multiple periods of time. The state-of-the-art approaches consider migrations to a concrete architecture and do not take uncertainties, such as user churn, into account. This results in migration cost underestimations and profitability over-estimations. In this paper, we propose a generic migration algorithm derived from a search based rational agent decision process that can deal with uncertainties and provides the migration path using a maximized utility function. The algorithm maximizes the migration project profitability, measured as accumulated Net Present Value (NPV). This flexible and generic methodology has been evaluated on the example of migration from existing copper networks to the future-proof Passive Optical Network (PON) architectures. Our proposed flexible migration algorithm is validated over pure residential and converged scenarios in a fully reproducible case study. The results yield that the migration flexibility is a key to the profit maximization.

扫码加入交流群

加入微信交流群

微信交流群二维码

扫码加入学术交流群,获取更多资源