检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
作 者:扈红超[1] 郭云飞[1] 庞琳[1] 卜佑军[1]
机构地区:[1]解放军信息工程大学国家数字交换系统工程技术研究中心,河南郑州450002
出 处:《通信学报》2011年第4期57-65,76,共10页Journal on Communications
基 金:国家高技术研究发展计划("863"计划)基金资助项目(2008AA01A323;2008AA01Z214;2007AA01Z218);国家重点基础研究发展计划("973"计划)基金资助项目(2007CB307102)~~
摘 要:针对LB-BvN交换结构的分组乱序问题,探讨了LB-BvN交换结构分组保序的约束条件。从网络流量的传输特性出发提出了解决LB-BvN交换结构分组乱序的DFA(dynamic flow assignment)算法和DFS(dynamic flowlet switching)算法。DFA算法以流为单元分派交换路径,能够严格确保流分组的保序交换;DFS算法是对DFA算法的优化,以流簇(flowlet)为单元进行交换以保证流簇的保序,进而确保属于同一条流的分组保序。DFA和DFS算法只需在线路接口卡上维护少量的流状态信息即可实现保序交换,仿真结果表明DFA算法和DFS算法具有良好的时延、时延抖动和吞吐量性能。Due to its outstanding extensibility performance,the LB-BvN switch had attracted much attention recently in the switching technology academia.However,the problem that it might disturb the sequences of packets made it not so applicable in practice.To overcome this,the principles for guaranteeing packets in order switching were first discussed.Then,based on these principles,it focused on research on the transmission characteristics in network traffic and came up with DFA and DFS algorithms.DFA assigned the switching paths to each flow based on their transport layer parameters to make sure that each packet in the flow were in order.DFS was more sophisticated than DFA in that it first divided flows into flowlets.In this way,the flowlets in the flows were in order.Both DFA and DFS could achieve in order packets switching with limited flow states maintained in the line-cards.Simulation results show that both DFA and DFS can achieve good performance.
分 类 号:TP393[自动化与计算机技术—计算机应用技术]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.180