首页> 外文会议>IEEE International Conference on Communications >A Distributed Algorithm for Least Constraining Slot Allocation in MPLS Optical TDM Networks
【24h】

A Distributed Algorithm for Least Constraining Slot Allocation in MPLS Optical TDM Networks

机译:一种分布式算法,用于最低限制MPLS光学TDM网络中的插槽分配

获取原文

摘要

In this paper, we propose a distributed approach for the least constraining slot allocation scheme in all-optical TDM networks (LC) that was introduced in a previous work. The driving force behind our proposal is the employment of the LC scheme in a GMPLS context. After describing the basic data model and messaging parameters, we focus on defining an efficient LC resource status update scheme, which is essential to achieve compatibility with GMPLS' periodic link state update standards. Basically, we reduce the rate of resource status updates from once per call to once per few calls, and measure the impact on network performance.
机译:在本文中,我们提出了一种在先前工作中引入的全光学TDM网络(LC)中最小约束时隙分配方案的分布式方法。我们提案背后的驱动力是在GMPLS上下文中雇用LC方案。在描述基本数据模型和消息传递参数后,我们专注于定义高效的LC资源状态更新方案,这对于实现与GMPLS的定期链路状态更新标准的兼容性至关重要。基本上,我们从每次呼叫每次呼叫都会降低资源状态更新速率,并测量对网络性能的影响。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号