首页 | 本学科首页   官方微博 | 高级检索  
     

基于本地缓存的弹性分组环保护机制
引用本文:刘鑫,曾庆济,朱栩. 基于本地缓存的弹性分组环保护机制[J]. 通信技术, 2003, 0(12): 58-60
作者姓名:刘鑫  曾庆济  朱栩
作者单位:上海交通大学宽带光网技术研究开发中心,上海,200030
摘    要:本文提出一种基于本地缓存的弹性分组环保护倒换机制(WrapProtectionBasedOnLocalBuffers,简称WP-LB)。其主要思想是当环路上任何位于源节点和故障区域之间的中间节点接收到含有故障信息的控制信令后,就不再向下游转发数据分组,而是在本地缓存这些数据。等到保护通路建立好之后,再把缓存的数据分组经过保护通路发送给目的节点。分析计算表明,与原有的保护倒换(WrapProtection,简称WP)机制相比,WP-LB机制不仅提高带宽利用率,减少平均时延,并且还能避免数据包的丢失和失序。

关 键 词:弹性分组环  城域网  网络生存性  保护倒换机制
修稿时间:2003-05-13

A New Wrap Protection Mechanism Based on Local Buffers for the Resilient Packet Ring
Liu Xin Zeng Qingji Zhu Xu. A New Wrap Protection Mechanism Based on Local Buffers for the Resilient Packet Ring[J]. Communications Technology, 2003, 0(12): 58-60
Authors:Liu Xin Zeng Qingji Zhu Xu
Abstract:This paper presents a wrap protection mechanism based on local buffers (WP- LB) for the Resilient Packet Ring (RPR). In the proposed ap proach, once an intermediate node between the source node and the point of failu re detects control packets which contain information of failure, it will stop se nding incoming packets on the primary path towards the destination node. Instead , the intermediate node will store the received packets in a local buffer before a protection path is set up. The buffered data packets will be sent towards the destination node along the protection path when it is available. Computation re sults show that this approach is able to improve bandwidth efficiency, reduce av erage traffic delay, and avoid packet loss and disorder because of node or link failures compared to the original wrap protection mechanism.
Keywords:RPR   MAN   network survivability  wrap protection
本文献已被 CNKI 万方数据 等数据库收录!
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号