首页> 外文期刊>Computer Communications >LSP protection for delay-differentiated dynamic traffic in IP-over-WDM networks with port constraints
【24h】

LSP protection for delay-differentiated dynamic traffic in IP-over-WDM networks with port constraints

机译:带有端口限制的WDM IP网络中的延迟区分动态流量的LSP保护

获取原文
获取原文并翻译 | 示例
           

摘要

We consider the problem of label switched path (LSP) protection for dynamic traffic with differentiated delay requirements in IP-over-WDM networks with limited port resources. A pair of link-disjoint primary LSP and backup LSP is provided for each connection to enable guaranteed and timely recovery in the event of a single link failure. To support delay sensitive traffic such as voice, the primary and backup LSPs must traverse a limited number of optical-electrical-optical (OEO) conversions (equivalently, to traverse limited number of electronic routers and hence reduced electrical processing), besides the bandwidth requirement. This OEO constraint can be specified by users in service level agreement (SLA) or determined by service providers based on the end-to-end delay requirement. We propose two integrated routing algorithms to route traffic with or with no OEO conversion requirements, respectively. These two algorithms can compute primary LSPs and backup LSPs in polynomial time. We consider the case where limited ports are provided at each node in the network and develop two routing approaches called port-independent routing and port-dependent routing. In the port-independent routing, paths are selected first and then port availabilities are checked to setup the path. While this approach is simple to implement, it leads to connection blocking if ports required on the chosen path are not available. In the port-dependent routing, port information is incorporated in the path selection process. It guarantees that a path can be setup once it is found. We evaluate the effectiveness of LSP protection using the proposed algorithms on the NSFNET network.
机译:在端口资源有限的IP-over-WDM网络中,我们考虑了具有不同延迟要求的动态流量的标签交换路径(LSP)保护问题。为每个连接提供一对链路不相交的主LSP和备用LSP,以在出现单个链路故障的情况下保证有保证的及时恢复。为了支持对延迟等敏感的流量(例如语音),除带宽要求外,主LSP和备用LSP必须遍历有限数量的光电(OEO)转换(等效地,遍历有限数量的电子路由器,从而减少电气处理) 。此OEO约束可以由用户在服务级别协议(SLA)中指定,也可以由服务提供商根据端到端延迟要求来确定。我们提出两种集成的路由算法分别路由具有或没有OEO转换要求的流量。这两种算法可以在多项式时间内计算主LSP和备用LSP。我们考虑在网络中的每个节点上提供有限端口的情况,并开发两种路由方法,分别称为端口无关路由和端口依赖路由。在与端口无关的路由中,首先选择路径,然后检查端口可用性以设置路径。尽管此方法易于实现,但如果所选路径上所需的端口不可用,则会导致连接阻塞。在与端口有关的路由中,端口信息包含在路径选择过程中。它保证找到路径后就可以对其进行设置。我们使用NSFNET网络上提出的算法评估LSP保护的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号