System architecture and hardware implementations for a reconfigurable MPLS router

With extremely wide bandwidth and good channel properties, optical fibers have brought fast and reliable data transmission to today’s data communications. However, to handle heavy traffic flowing through optical physical links, much faster processing speed is required or else congestion can take place at network nodes. Also, to provide people with voice, data and all categories of multimedia services, distinguishing between different data flows is a requirement. To address these router performance, Quality of Service /Class of Service and traffic engineering issues, Multi-Protocol Label Switching (MPLS) was proposed for IP-based Internetworks. In addition, routers flexible in hardware architecture in order to support ever-evolving protocols and services without causing big infrastructure modification or replacement are also desirable. Therefore, reconfigurable hardware implementation of MPLS was proposed in this project to obtain the overall fast processing speed at network nodes. The long-term goal of this project is to develop a reconfigurable MPLS router, which uniquely integrates the best features of operations being conducted in software and in run-time-reconfigurable hardware. The scope of this thesis includes system architecture and service algorithm considerations, Verilog coding and testing for an actual device. The hardware and software co-design technique was used to partition and schedule the protocol code for execution on both a general-purpose processor and stream-based hardware. A novel RPS scheme that is practically easy to build and can realize pipelined packet-by-packet data transfer at each output was proposed to take the place of the traditional crossbar switching. In RPS, packets with variable lengths can be switched intelligently without performing packet segmentation and reassembly. Primary theoretical analysis of queuing issues was discussed and an improved multiple queue service scheduling policy UD-WRR was proposed, which can reduce packet-waiting time without sacrificing the performance. In order to have the tests carried out appropriately, dedicated circuitry for the MPLS functional block to interface a specific

[1]  Albert G. Greenberg,et al.  Hardware-efficient fair queueing architectures for high-speed networks , 1996, Proceedings of IEEE INFOCOM '96. Conference on Computer Communications.

[2]  Jörg Liebeherr,et al.  Priority queue schedulers with approximate sorting in output-buffered switches , 1999, IEEE J. Sel. Areas Commun..

[3]  Bill Lin,et al.  Fast and scalable priority queue architecture for high-speed network switches , 2000, Proceedings IEEE INFOCOM 2000. Conference on Computer Communications. Nineteenth Annual Joint Conference of the IEEE Computer and Communications Societies (Cat. No.00CH37064).

[4]  James Aweya,et al.  IP router architectures: an overview , 2001, Int. J. Commun. Syst..

[5]  Tilman Wolf,et al.  Design issues for high performance active routers , 2000, 2000 International Zurich Seminar on Broadband Communications. Accessing, Transmission, Networking. Proceedings (Cat. No.00TH8475).

[6]  Scott Shenker,et al.  Analysis and simulation of a fair queueing algorithm , 1989, SIGCOMM 1989.

[7]  Eiji Oki,et al.  User-programmable flexible ATM network architecture. Active-ATM-experimental results , 1998, Proceedings Third IEEE Symposium on Computers and Communications. ISCC'98. (Cat. No.98EX166).

[8]  Larry L. Peterson,et al.  VERA: an extensible router architecture , 2002, Comput. Networks.

[9]  Scott F. Midkiff,et al.  A stream-based reconfigurable router prototype , 1999, 1999 IEEE International Conference on Communications (Cat. No. 99CH36311).

[10]  Bill Lin,et al.  Design of a high-speed packet switch with fine-grained quality-of-service guarantees , 2000, 2000 IEEE International Conference on Communications. ICC 2000. Global Convergence Through Communications. Conference Record.

[11]  Christoforos E. Kozyrakis,et al.  Pipelined multi-queue management in a VLSI ATM switch chip with credit-based flow-control , 1997, Proceedings Seventeenth Conference on Advanced Research in VLSI.

[12]  Nick McKeown,et al.  A simulation study of IP switching , 1997, SIGCOMM '97.

[13]  Ying Jiang,et al.  A fully desynchronized round-robin matching scheduler for a VOQ packet switch architecture , 2001, 2001 IEEE Workshop on High Performance Switching and Routing (IEEE Cat. No.01TH8552).

[14]  Kang G. Shin,et al.  Scalable Hardware Priority Queue Architectures for High-Speed Packet Switches , 2000, IEEE Trans. Computers.

[15]  Jun Gao,et al.  A programmable router architecture supporting control plane extensibility , 2000, IEEE Commun. Mag..

[16]  Costas Courcoubetis,et al.  Weighted Round-Robin Cell Multiplexing in a General-Purpose ATM Switch Chip , 1991, IEEE J. Sel. Areas Commun..

[17]  Y. Yamaguchi,et al.  Implementation of a priority forwarding router chip for real-time interconnection networks , 1994, Second Workshop on Parallel and Distributed Real-Time Systems.

[18]  Naehyuck Chang,et al.  A new queue discipline for various delay and jitter requirements in real-time packet-switched networks , 2000, Proceedings Seventh International Conference on Real-Time Computing Systems and Applications.

[19]  Abhay Parekh,et al.  A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.

[20]  Vijay Sivaraman,et al.  Achieving high utilization in guaranteed services networks using early-deadline-first scheduling , 1998, 1998 Sixth International Workshop on Quality of Service (IWQoS'98) (Cat. No.98EX136).

[21]  Srinivasan Keshav,et al.  Issues and trends in router design , 1998, IEEE Commun. Mag..