arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1706.07747cs.NI
收藏

弹性光网络阻塞概率的精确和近似计算

Computing Exact and Approximate Blocking Probabilities in Elastic Optical Networks

Sandeep Kumar Singh, Admela Jukan

摘要:

在本文中,我们提出了第一个精确的马尔可夫模型在弹性光网络中的连接阻塞分析,基于频谱切片的占用状态,由于到达和离开的各种类型的连接在网络中的所有链路。由于精确马尔可夫模型的复杂性随着链路容量、链路数、路由和需求类别呈指数增长,我们进一步推进了弹性光网络中计算近似阻塞概率的最新技术,并提出了两个新的近似,即,负载无关和负载相关。这些近似值被用来计算状态相关的每类连接建立率在多类弹性光网络,或没有频谱转换器,考虑到在每个状态下的频谱碎片因子。我们通过精确和/或仿真结果验证近似分析,并表明负载无关和负载相关的近似可以更准确地使用比以前提出的近似,随机拟合(RF)和首次拟合(FF)频谱分配政策。对于较小的网络,近似结果与精确模型密切匹配,并且与各种网络场景下的模拟结果密切匹配。

英文摘要:

In this paper, we propose the first exact Markov model for connection blocking analysis in elastic optical networks, based on the occupancy status of spectrum slices on all links due to arrivals and departures of various classes of connections in a network. Since the complexity of the exact Markov model grows exponentially with the link capacity, number of links, routes, and classes of demands, we further advance the state-of-the-art in computing approximate blocking probability in elastic optical networks and propose two novel approximations, i.e., load-independent and load-dependent. These approximations are used to compute state-dependent per-class connection setup rates in multi-class elastic optical networks with or without spectrum converters by taking into account the spectrum fragmentation factor in each state. We validate approximation analysis by exact and/or simulation results, and show that load-independent and load-dependent approximations can be more accurately used than previously proposed approximations, under a random-fit (RF) and a first-fit (FF) spectrum allocation policies. The approximate results match closely with the exact model, for smaller networks, and with the simulations under a variety of network scenarios.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑