基于统计移位排序结构的高速路由器公平队列调度算法实现

高速化和多媒体化是未来网络的主要发展方向,为了给用户提供可靠的端到端服务质量保证,通常需要在网络的中继节点上引入基于流的队列调度机制。WF^2Q＋队列调度算法即是一种性能优异同时又易于实现的公平队列调度算法。文中提出了一种基于统计移位排序结构的WF^2Q＋算法高速硬件实现方法,该方法充分利用队列的统计信息,以相对较少的硬件资源实现了统计意义上的快速完全排序。FPGA实现的结果表明,该结构可以应用于端口速率为OC－48的高速IP路由器上。     

基于三级存储阵列缓存高速数据包及性能分析

高速网络设备一般需要大容量高速数据包存储器来缓存收到的数据包.但以目前的存储器工艺水平很难实现这样的存储器,从而限制了整个网络的发展.提出一种新型的三级存储阵列结构可以成功解决数据包存储器的容量和带宽问题,理论上可以实现任意高速数据包的缓存.使用"最关键队列优先"算法完成对三级存储阵列的管理,证明了使用该算法能够保证数据包的无时延调度输出,并且其所需的系统规模最小,同时推导出系统规模的上、下限.最后给出三级存储阵列的一种可实现方案,从而使该结构易于硬件实现.     

Slotted Optical Burst Switching (SOBS) networks

In the paper, we study Optical Burst Switching (OBS) networks. Since OBS still suffers high loss ratio due to the lack of buffer at the OBS core routers, we study methods to reduce the loss without using optical buffers. We consider time-slotted OBS called Slotted OBS (SOBS), where routers are synchronized and only send fixed length bursts at the beginning of time slots. Our simulation results show that SOBS reduces the packet loss probability significantly. Moreover, we show that SOBS can be implemented with little or no additional cost and has other advantages such as providing better support for Quality of Service (QoS).     

Hardware design and implementation of packet fair queuing algorithms for the quality of service support in the high-speed internet

The increasing amount of real-time traffic carried over the Internet requires end-to-end quality of service (QoS) support. To this end, the QoS Schedulers, that are implemented in routers, assign the available bandwidth resources to packet flows according to their respective allocated rates. Packet Fair Queuing (PFQ) schedulers can provide fair service and low end-to-end delay bound to the traffic flows. However, they have higher implementation complexity compared to other algorithms, because of the requirements of tracking the system state, and searching for the packet to get service among all flows, that are queued at the outgoing interface. QoS scheduling is a data plane functionality, which requires hardware implementation for high speed router interfaces. The previous works on hardware implementation of PFQ schedulers are specific to certain algorithms, and they do not provide any results on real hardware platforms. In this paper, we present a general hardware design framework for PFQ schedulers, and apply this framework to the WF²Q+ PFQ algorithm to demonstrate its properties. We carry out the entire implementation of the WF²Q+ algorithm on an FPGA, and evaluate its performance with real traffic flows. In addition, we implement WFQ as a second PFQ algorithm to demonstrate the generality of the framework.     

On the design of a high-performance adaptive router for CC-NUMA multiprocessors

This work presents the design and evaluation of an adaptive packet router aimed at supporting CC-NUMA traffic. We exploit a simple and efficient packet injection mechanism to avoid deadlock, which leads to a fully, adaptive routing by employing only three virtual channels. In addition, we selectively use output buffers for implementing the most utilized virtual paths in order to reduce head-of-line blocking. The careful implementation of these features has resulted in a good trade-off between the network performance and hardware cost. The outcome of this research is a high-performance adaptive router (HPAR), which adequately balances the needs of parallel applications: minimal network latency at low loads and high throughput at heavy loads. The paper includes an evaluation process in which HPAR is compared with other adaptive routers using FIFO input bufferring, with or without additional virtual channels to reduce head-of-line blocking. This evaluation contemplates both the VLSI costs of each router and their performance under synthetic and real application workloads. To make the comparison fair, all the routers use the same efficient deadlock avoidance mechanism. In all the experiments, HPAR exhibited the best response among all the routers tested. Moreover, the observed packet latencies were comparable to those exhibited by simpler routers. Therefore, HPAR can be considered as a suitable candidate to implement packet interchange in next generations of CC-NUMA multiprocessors.     

Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness

In current networks, packet losses can occur if routers do not provide sufficiently large buffers. This paper studies how many buffers should be provided in a router to eliminate packet losses. We assume a network router has m incoming queues, each corresponding to a single traffic stream, and must schedule at any time on-line from which queue to take the next packet to send out. To exclude packet losses with a small amount of buffers, the maximum queue length must be kept low over the entire scheduling period. We call this new on-line problem the balanced scheduling problem (BSP). By competitive analysis, we measure the power of on-line scheduling algorithms to prevent packet losses. We show that a simple greedy algorithm is Θ(log m)-competitive which is asymptotically optimal, while Round-Robin scheduling is not better than m-competitive, as actually is any deterministic on-line algorithm for BSP. We also give a polynomial time algorithm for solving off-line BSP optimally. We also study another on-line balancing problem that tries to balance the delay among the m traffic streams.     

构建网络的新方法：基于环路的混合交换光网络*

为了能够更好地支持突发性数据业务,提出了一种新型网络交换结构——基于环路的混合交换光网络（cyclebased hybrid switching optical networks,CHSON）。该网络结合了光电路交换（OCS）和光突发交换（OBS）两种交换技术,不仅可以有效地降低网络节点的分组转发压力,而且能够较好地承载突发性数据业务。首先介绍了CHSON的网络结构和虚拓扑设计,然后阐述了节点设计及其执行流程。仿真表明,CHSON具有比OCS网络更低的丢包率,而且在丢包率和平均分组延时方面,CHSON较     

A router architecture for flexible routing and switching inmultihop point-to-point networks

Modern parallel and distributed applications have a wide range of communication characteristics and performance requirements. These diverse characteristics affect the performance and suitability of particular routing and switching policies in multihop point-to-point networks. In this paper, we identify a core set of architectural features necessary for flexible selection and implementation of multiple routing and switching schemes. Using this, we present a flexible router whose routing and switching policies can be tailored to the application, allowing the network to meet these diverse needs. By dedicating a small programmable processor to each incoming link, we can implement wormhole, virtual cut-through, and packet switching, as well as hybrid switching schemes, each under a variety of unicast and multicast routing algorithms. In addition, a flexible router can support several applications or traffic types simultaneously, enabling better support of applications with multiple traffic classes. We have designed, implemented, and fabricated the Programmable Routing Controller (PRG). Cycle-level simulations of mesh-connected PRCs also demonstrate that flexible routing and switching can significantly enhance application performance     

Revisiting flow-based load balancing: Stateless path selection in data center networks

Hash-based load-balancing techniques are widely used to distribute the load over multiple forwarding paths and preserve the packet sequence of transport-level flows. Forcing a long-lived, i.e., elephant, flow to follow a specific path in the network is a desired mechanism in data center networks to avoid crossing hot spots. This limits the formation of bottlenecks and so improves the network use. Unfortunately, current per-flow load-balancing methods do not allow sources to deterministically force a specific path for a flow.In this paper, we propose a deterministic approach enabling end hosts to steer their flows over any desired load-balanced path without relying on any packet header extension. By using an invertible mechanism instead of solely relying on a hash function in routers, our method allows to easily select the packet’s header field values in order to force the selection of a given load-balanced path without storing any state in routers.We perform various simulations and experiments to evaluate the performance and prove the feasibility of our method using a Linux kernel implementation. Furthermore, we demonstrate with simulations and lab experiments how MultiPath TCP can benefit from the combination of our solution with a flow scheduling system that efficiently distributes elephant flows in large data center networks.     

A power consumption sensitivity analysis of circuit-switched versus packet-switched backbone networks

While telecommunication networks have historically been dominated by a circuit-switched paradigm, the last decades have seen a clear trend towards packet-switched networks. In this paper we evaluate how both paradigms (which have also been referred to as optical bypass and non-bypass, respectively) perform in optical backbone networks from a power consumption point of view, and whether the general agreement of circuit switching being more power-efficient holds. We consider artificially generated topologies of various sizes, mesh degrees and – not yet previously explored in this context – transport linerates. We cross-validate our findings with a number of realistic topologies.Our results show that circuit switching is preferable when the average node-to-node demands are higher than half the transport linerates. However, packet switching can become preferable when the traffic demands are lower than half the transport linerate. We find that an increase in the network node count does not consistently increase the energy savings of circuit switching over packet switching, but the savings are heavily influenced by the mesh degree and (to a minor extent) by the average link length. Our results are consistent for uniform traffic demands and realistic traffic demands.A key take-away message for other research on power saving solutions in backbone networks is that the ratio between the average demand and the demand bitrate has considerable effect on the overall efficiency, and should be taken into account.     

Dimensioning shared-per-node recirculating fiber delay line buffers in an optical packet switch

Optical buffering based on fiber delay lines (FDLs) has been proposed as a means for contention resolution in an optical packet switch. In this article, we propose a queuing model for feedback-type shared-per-node recirculating FDL optical buffers in asynchronous optical switching nodes. In this model, optical packets are allowed to recirculate over FDLs as long as the total number of recirculations is less than a pre-determined limit to meet signal loss requirements. Markov Modulated Poisson Process (MMPP)-based overflow traffic models and fixed-point iterations are employed to provide an approximate analysis procedure to obtain blocking probabilities as a function of various buffer parameters in the system when the packet arrival process at the optical switch is Poisson. The proposed algorithm is numerically efficient and accurate especially in a certain regime identified with relatively long and variably-sized FDLs, making it possible to dimension optical buffers in next-generation optical packet switching systems.     

Balanced Scheduling toward Loss-Free Packet Queuing and Delay Fairness

In current networks, packet losses can occur if routers do not provide sufficiently large buffers. This paper studies how many buffers should be provided in a router to eliminate packet losses. We assume a network router has m incoming queues, each corresponding to a single traffic stream, and must schedule at any time on-line from which queue to take the next packet to send out. To exclude packet losses with a small amount of buffers, the maximum queue length must be kept low over the entire scheduling period. We call this new on-line problem the balanced scheduling problem (BSP). By competitive analysis, we measure the power of on-line scheduling algorithms to prevent packet losses. We show that a simple greedy algorithm is (log m)-competitive which is asymptotically optimal, while Round-Robin scheduling is not better than m-competitive, as actually is any deterministic on-line algorithm for BSP. We also give a polynomial time algorithm for solving off-line BSP optimally. We also study another on-line balancing problem that tries to balance the delay among the m traffic streams.     

基于GMPLS的T比特路由器结构研究

GMPLS是一种将电层包交换技术与光层大颗粒度交换技术有机融合在一起的新技术,其统一的控制管理层面简化了网络的结构;在研究了多种T比特路由器结构的基础上,该文提出了一种将电处理技术优势和光技术优势有机结合的光电混合、多种交换颗粒度的大容量交换路由结构。     

Designing and implementing a fast crossbar scheduler

Crossbar switches frequently function as the internal switching fabric of high performance network switches and routers. However, for fairness and high utilization, a crossbar needs an intelligent, centralized scheduler. We describe the design and implementation of a scheduling algorithm for configuring crossbars in input queued switches that support virtual output queues and multiple priority levels of unicast and multicast traffic. We carried out this design for Stanford University's Tiny Tera prototype, a fast, label-swapping packet switch. Its scheduler, designed to configure a crossbar once every 51 ns, implements the ESLIP scheduling algorithm, which consists of multiple round-robin arbiters     

一种基于维序的多路径交换网络路由算法

交换网络是高性能路由器的核心。由于可扩展性好,性能价格比高,3D-Torus等多级交换网络已经在T比特路由器中得到应用。交换网络路由算法是T比特交换网络中的关键技术之一。本文面向3D-Torus,提出了一种基于维序的多路径路由算法。该算法针对交换网络的要求,在多条等代价最短路径上平衡负载,简单高效,易于硬件实现。     

Performance Analysis and Route Optimization: Redistribution between EIGRP,OSPF & BGP Routing Protocols

Routing is the process of data path selection of IP networks. Routers perform path selection on the basis of routing tables stored in their memory. Routing table contains IP routes for route transformation via the best path in the networks. Service providers use different routing protocols in their enterprise networks. These routing-protocols have the limitation of non-convergence in the networks. Route redistribution is the technique which overcomes this limitation. Due to this technique, service providers can get optimized communication with IP networks where multiple routing protocols are being used. This research article focuses on the performance and redistribution of different routing protocols in medium or enterprise IP networks. A simulated network model is established in GNS3 simulator. Five Cisco-7200 series routers and a switch is used in this simulated topology. All these routers are directly connected with each other via serial links. Routing protocols EIGRP, OSPF and BGP are used in this topology and then configured route redistribution on these routers. Different types of data traffic are generated and passed through the network in order to analyze network convergence, throughput and packet delay by the use of software wire shark network analyzer and debug command. EIGRP is better in convergence and through put whereas OSPF is better in packet delay.     

A Comparison of Router Architectures for Virtual Cut-Through and Wormhole Switching in a NOW Environment

Most multicomputer interconnection networks use wormhole switching, leading to fast and compact routers. Current routers incorporate virtual channels and even fully adaptive routing. Networks of workstations (NOWs) inherited multicomputer technology. Most commercial routers designed for NOWs implement wormhole switching. However, wormhole switching is not well suited for NOWs. The long wires required in this environment lead to large buffers to prevent buffer overflow during flow control signaling. Moreover, wire length is limited by buffer size. Virtual cut-through (VCT) achieves a higher throughput than wormhole switching. However, buffer requirements and packetizing overhead prevented its widespread use in multicomputers. Nevertheless, wormhole and VCT switching require similar buffer capacity in NOWs. Moreover, some messaging layers such as Illinois Fast Messages (FM) and BIP split messages into packets for increased performance. Therefore, the traditional disadvantages of VCT switching disappear in NOWs. In this paper, we show that VCT routers can be simpler than wormhole routers, while still achieving the advantages of using virtual channels and adaptive routing. We also propose a fully adaptive routing algorithm for VCT switching in a NOW environment. Moreover, we show that VCT routers outperform wormhole routers in a NOW environment at a lower cost. Also, VCT routers require buffer capacity independent of wire length, making them suitable for networks of workstations.     

ESLIP调度算法及其实现

随着网络的迅速发展，越来越多的数据寻径功能在硬件中实现，以满足对路由器交换速度的要求，易于在硬件中实现的，高效的调度算法成为一项关键技术，介绍了ESLIP算法的基本原理、调度过程和它在硬件中的实现，经过设计和测试，证明它具有非常好的特性。