检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]上海交通大学宽带光网技术研究开发中心,上海200030
出 处:《通信技术》2003年第12期58-60,共3页Communications Technology
摘 要:本文提出一种基于本地缓存的弹性分组环保护倒换机制(WrapProtectionBasedOnLocalBuffers,简称WP-LB)。其主要思想是当环路上任何位于源节点和故障区域之间的中间节点接收到含有故障信息的控制信令后,就不再向下游转发数据分组,而是在本地缓存这些数据。等到保护通路建立好之后,再把缓存的数据分组经过保护通路发送给目的节点。分析计算表明,与原有的保护倒换(WrapProtection,简称WP)机制相比,WP-LB机制不仅提高带宽利用率,减少平均时延,并且还能避免数据包的丢失和失序。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.
分 类 号:TN91[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:3.129.21.92