• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Optical fiber technology >Resource-partitioned spectrum assignment to realize efficient multicasting for flexible grid optical networks
【24h】

Resource-partitioned spectrum assignment to realize efficient multicasting for flexible grid optical networks

机译：资源分配的频谱分配可实现灵活的网格光网络的高效多播

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

With the increasing demand of some novel point-to-multi-point services, such as live video delivering and interactive distance learning, efficient multicasting is highly desirable in flexible grid optical networks (FGONs). Thus, many sophisticated multicast-enabled routing and resource allocation algorithms have been proposed to realize efficient multicasting in FGONs. These algorithms, known as multicast routing and spectrum assignment (MRSA) algorithms, optimized the light-trees and the allocated spectrum resources for multicast services in FGONs. But, most of them ignored some small-sized, isolated, and un-occupied spectrum bands, which are remained after multicast services being accommodated. Due to the continuity and the contiguity constraints in service accommodation, these remained spectrum bands can hardly be allocated to subsequent multicast services and are thus known as spectrum fragments. Their existence and accumulation may exhaust available spectral resources and affect the networking performance (e.g. service blocking performance) for the multicast traffic in FGONs. In this way, the efficiency of FGONs in supporting multicast traffic may be greatly deteriorated. Therefore, the spectrum fragments generated in accommodating multicast services has become an important issue in FGONs. In this paper, we propose a resource-partitioned interval-maximized (RPIM) MRSA algorithm to restrain the generation of spectrum fragments for the multicast traffic in FGONs. The proposed RPIM MRSA algorithm does not utilize the metric, "cut", to reduce spectrum fragments via avoiding splitting the whole spectrum band into too many band pieces as in fragmentation-aware MRSA algorithms. Instead, the proposed RPIM MRSA algorithm partitions the spectrum resources on each sought light-tree into several elastic groups according to the types of multicast services, and maximizes the group interval between two adjacent groups on the sought light-trees. Since the spectrum resources in each group can always be utilized by the multicast services of the same type, the proposed algorithm restricts the generation of spectrum fragments in group intervals. In this way, the proposed RPIM MRSA algorithm can remarkably reduce spectrum fragments generated in accommodating multicast services. Note that, different from previous group-based algorithms, the proposed RPIM algorithm allows one elastic group for the multicast services of a certain type to contain different amount of spectrum resources on different light-trees. This helps guarantee the flexibility in constructing elastic groups on diverse light-trees. Additionally, the proposed RPIM MRSA algorithm maximizes the group intervals on the sought light-trees, which helps reserve more vacant spectrum resources between two adjacent groups on the light-trees. Since these vacant spectrum resources can be merged into their adjacent groups if needed, the proposed algorithm can reduce not only the spectrum fragments generated in group intervals but also the blocked multicast services in groups by maximizing group intervals on the light-trees. Simulation results verify that the proposed RPIM algorithm can realize efficient multicasting with significantly reduced spectrum fragments and low service blocking probability in FGONs.
机译：随着一些新颖的点对多点服务（例如实时视频传递和交互式远程学习）的需求不断增长，在灵活的网格光网络（FGON）中非常需要有效的多播。因此，已经提出了许多复杂的启用多播的路由和资源分配算法，以在FGON中实现有效的多播。这些称为多播路由和频谱分配（MRSA）算法的算法为FGON中的多播服务优化了光树和分配的频谱资源。但是，它们中的大多数都忽略了一些小型的，隔离的，未占用的频带，这些频带在容纳多播服务后仍然保留。由于服务适应性的连续性和连续性限制，这些剩余的频谱带很难分配给后续的多播服务，因此被称为频谱碎片。它们的存在和积累可能会耗尽可用的频谱资源，并影响FGON中多播流量的网络性能（例如，服务阻止性能）。这样，FGON支持多播流量的效率可能会大大降低。因此，在容纳多播服务时产生的频谱碎片已成为FGON中的重要问题。在本文中，我们提出了一种资源分割的最大间隔（RPIM）MRSA算法，以限制FGON中组播流量的频谱碎片的产生。所提出的RPIM MRSA算法没有像避免碎片感知的MRSA算法那样，通过避免将整个频谱分成多个频段来利用频谱的“削减”来减少频谱碎片。取而代之的是，提出的RPIM MRSA算法根据多播服务的类型将每个寻找的光树上的频谱资源划分为几个弹性组，并使寻找的光树上两个相邻组之间的组间隔最大化。由于每个组中的频谱资源始终可以由相同类型的多播服务利用，因此所提出的算法限制了组间隔中频谱片段的生成。这样，提出的RPIM MRSA算法可以显着减少在容纳多播服务时产生的频谱碎片。注意，与先前的基于组的算法不同，所提出的RPIM算法允许用于某种类型的多播服务的一个弹性组在不同的光树上包含不同数量的频谱资源。这有助于确保在不同的光树上构造弹性组的灵活性。另外，提出的RPIM MRSA算法可最大化所寻找光树上的组间隔，从而有助于在光树上的两个相邻组之间保留更多的空闲频谱资源。由于可以根据需要将这些空闲的频谱资源合并到其相邻的组中，因此通过最大化光树上的组间隔，该算法不仅可以减少在组间隔中生成的频谱碎片，而且可以减少在组中阻塞的多播服务。仿真结果表明，所提出的RPIM算法可以有效地实现多播，并且在FGON中可以显着减少频谱碎片，降低业务阻塞概率。

著录项

  • 来源
    《Optical fiber technology》 |2019年第12期|102067.1-102067.8|共8页
  • 作者

  • 作者单位

    Southwest Univ Nationalities Coll Elect & Informat Engn Chengdu Sichuan Peoples R China;

  • 收录信息 美国《科学引文索引》(SCI);美国《工程索引》(EI);
  • 原文格式 PDF
  • 正文语种 eng
  • 中图分类
  • 关键词

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱：kefu@zhangqiaokeyan.com

京公网安备：11010802029741号 ICP备案号：京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有

  • 客服微信

  • 服务号