共查询到19条相似文献,搜索用时 125 毫秒
1.
2.
3.
可编程路由器原型系统的设计与实现 总被引:2,自引:0,他引:2
基于网络的应用服务现在正飞速地发展,但传统的网络体系结构已经越来越难以满足当前灵活快速的、种类多样的、高服务质量的应用特点。根据多服务虚拟交换路由器结构(ProgrammableVirtualSwitchMultiserviceRouter,PVSMR)的技术思想,设计出一个可编程路由器原型系统,并就该系统平台的构建及其实现过程中有关要点进行了深入的讨论。 相似文献
4.
5.
6.
7.
本文提出了一种在交换网络中执行转发操作的路由器体系结构,采用多个低速且具有独立转发和交换功能的转发交换结点FSN,组成多级流水线结构,以流水的方式执行报文转发和交换。本文对FIS中实现IPv6转发的关键技术—IPv6转发表的分解、转发表到FSN结点的映射、IPv6转发引擎的设计及报文调度算法进行了深入的研究,并基于FIS体系结构提出了易于硬件实现的IPv6查找机制和基于Hash老化的报文调度算法,为下一步FIS原型系统的实现提供了切实可行的方案。 相似文献
8.
王茵 《计算机与数字工程》2011,39(7):27-30
IP路由查找和报文分类作为路由器转发能力和提供高性能区分服务能力的关键因素,是当前路由器转发性能乃至整个网络性能的主要瓶颈。文章以IP路由查找和报文分类问题为研究对象,从空间几何的角度探究其本质,建立了相应数学模型MDCM,并以此为基础,讨论了各类搜索算法在IP路由查找和报文分类问题求解的优缺点,为研究和设计高性能的IP路由查找和报文分类算法提供重要指导。 相似文献
9.
随着互联网的发展,现有路由器体系结构在性能、复杂性和节能等方面存在许多难以克服的问题,如何实现高效节能的转发机制是绿色高性能路由器设计面临的重大挑战.基于边交换边转发思想提出一种边转发边交换(forwarding in switching,FIS)机制,通过模糊转发流水交换减少了路由器转发和交换阶段的存储需求和访存次数.该机制复用多个低速节点构成多级流水线结构,通过低成本执行部件的规模化运行提高交换性能和IP查找速率,可降低报文查表交换的硬件实现复杂度.建立了先转发后交换(forwarding before switching,FBS)机制和FIS机制的能耗模型,使用不同模型模拟内部缓存、输入输出端口等具有不同结构的节点,仿真实验证明FIS机制比现有的FBS机制减少约12.5%的能耗.提出的分析模型适用于可扩展和绿色节能路由器的设计. 相似文献
10.
11.
A new generation architecture of IP routers called massive parallel forwarding and switching (MPFS) is proposed, which is totally different from modern routers. The basic idea of MPFS is mapping complicated forwarding process into multilevel scalable switch fabric so as to implement packet forwarding in a pipelining and distributed way. This processing mechanism is named forwarding in switching (FIS). By interconnecting multi-stage, lower speed components, called forwarding and switching nodes (FSN), MPFS achieves better scalability in forwarding and switching performance just like MPP. We put emphasis upon IPv6 lookup problem in MPFS and propose a method for partitioning IPv6 FIB and mapping them to switch fabric. Simulation and computation results suggest that MPFS routers can support line-speed forwarding with a million of IPv6 prefixes at 40 Gbps. We also propose an implementation of 160 Tbps core router based on MPFS architecture at last. 相似文献
12.
高速转发引擎是高性能IPv6路由器的关键技术,文章设计了一种IPv6高速转发引擎的硬件结构,编写了硬件结构的VerilogHDL模型,进行了仿真和逻辑综合,并成功用XILINX的FGPA对转发引擎进行了验证。测试结果表明,该文设计的转发引擎的结构正确,可以达到2.5G端口线速转发,满足了设计要求。 相似文献
13.
This paper presents a new refined assured forwarding (RAF) framework for improving the performance of DiffServ architecture where heterogeneous traffic flows share the same aggregate class. The new framework requires minimal modification to existing DiffServ routers by adding a second layer of classification of flows based on their average packet sizes and using Weighted Fair Queueing for flow scheduling. The efficiency of the new architecture in enhancing the performance of DiffServ is demonstrated by simulation results for delay, packet delivery, throughput, and packet loss, under different traffic scenarios. 相似文献
14.
Norbert Egi Gianluca Iannaccone Maziar Manesh Laurent Mathy Sylvia Ratnasamy 《The Journal of supercomputing》2013,63(1):294-322
Recent technological advances in commodity server architectures, with multiple multi-core CPUs, integrated memory controllers, high-speed interconnects, and enhanced network interface cards, provide substantial computational capacity, and thus an attractive platform for packet forwarding. However, to exploit this available capacity, we need a suitable software platform that allows effective parallel packet processing and resource management. In this paper, we at first introduce an improved forwarding architecture for software routers that enhances parallelism by exploiting hardware classification and multi-queue support, already available in recent commodity network interface cards. After evaluating the original scheduling algorithm of the widely-used Click modular router, we propose solutions for extending this scheduler for improved fairness, throughput, and more precise resource management. To illustrate the potential benefits of our proposal, we implement and evaluate a few key elements of our overall design. Finally, we discuss how our improved forwarding architecture and resource management might be applied in virtualized software routers. 相似文献
15.
A novel design for IP packet forwarding based on a new ternary content-addressable-memory configuration offers an efficient hardware solution for the longest-prefix matching problem in Internet routers. The architecture has lower update complexity, lower cost, and shorter search latency compared to the conventional TCAM structure. 相似文献
16.
17.
许多应用需要IP多目通信.在Internet大规模应用IP Multicast时,有效的路由是关键.这样的多目路由协议必须是有效的、可伸缩的和增量可配置的.但是传统的Internet路由对性能是不敏感的,不能平衡负载和处理拥塞.现有的大多数多目通信路由协议不仅负责数据转发,还负责路由树的构造,这给路由器带来了极大的复杂性,而且协议的配置是手动的、费时费钱的工作.该文提出一个主动层次式Multicast路由的体系结构,采用主动网络技术将多目通信路由协议的数据转发和控制机制分开,根据链路的状态信息用主动报文控 相似文献
18.
A core stateless bandwidth broker architecture for scalable support of guaranteed services 总被引:1,自引:0,他引:1
Zhenhai Duan Zhi-Li Zhang Hou Y.T. Lixin Gao 《Parallel and Distributed Systems, IEEE Transactions on》2004,15(2):167-182
We present a novel bandwidth broker architecture for scalable support of guaranteed services that decouples the QoS control plane from the packet forwarding plane. More specifically, under this architecture, core routers do not maintain any QoS reservation states, whether per-flow or aggregate. Instead, the QoS reservation states are stored at and managed by a bandwidth broker. There are several advantages of such a bandwidth broker architecture. Among others, it avoids the problem of inconsistent QoS states faced by the conventional hop-by-hop, distributed admission control approach. Furthermore, it allows us to design efficient admission control algorithms without incurring any overhead at core routers. The proposed bandwidth broker architecture is designed based on a core stateless virtual time reference system developed recently. This virtual time reference system provides a unifying framework to characterize, in terms of their abilities to support delay guarantees, both the per-hop behaviors of core routers and the end-to-end properties of their concatenation. We focus on the design of efficient admission control algorithms under the proposed bandwidth broker architecture. We consider both per-flow end-to-end guaranteed delay services and class-based guaranteed delay services with flow aggregation. Using our bandwidth broker architecture, we demonstrate how admission control can be done on a per domain basis instead of on a "hop-by-hop" basis. Such an approach may significantly reduce the complexity of the admission control algorithms. In designing class-based admission control algorithms, we investigate the problem of dynamic flow aggregation in providing guaranteed delay services and devise a new apparatus to effectively circumvent this problem. We conduct detailed analyses to provide theoretical underpinning for our schemes as well as to establish their correctness. Simulations are also performed to demonstrate the efficacy of our schemes. 相似文献
19.
In modern IP routers, Internet protocol (IP) lookup forms a bottleneck in packet forwarding because the lookup speed cannot catch up with the increase in link bandwidth. Ternary content-addressable memories (TCAMs) have emerged as viable devices for designing high-throughput forwarding engines on routers. Called ternary because they store don't-care states in addition to 0s and 1s, TCAMs search the data (IP address) in a single clock cycle. Because of this property, TCAMs are particularly attractive for packet forwarding and classifications. Despite these advantages, large TCAM arrays have high power consumption and lack scalable design schemes, which limit their use. We propose a two-level pipelined architecture that reduces power consumption through memory compaction and the selective enablement of only a portion of the TCAM array. We also introduce the idea of prefix aggregation and prefix expansion to reduce the number of routing-table entries in TCAMs for IP lookup. We also discuss an efficient incremental update scheme for the routing of prefixes and provide empirical equations for estimating memory requirements and proportional power consumption for the proposed architecture. 相似文献