Queuing algorithm for speculative Network Processors

Authors:
Jurgen Foag;Thomas Wild
Affiliations:
Institute of Computer Engineering, University of Lubeck, Lubeck, Germany.;Institute for Integrated Systems, Technical University of Munich, Munich, Bavaria, Germany
Venue:
International Journal of High Performance Computing and Networking
Year:
2006

Citing 5
Cited 0

Architectural considerations for a new generation of protocols

SIGCOMM '90 Proceedings of the ACM symposium on Communications architectures & protocols
A generalized processor sharing approach to flow control in integrated services networks: the single-node case

IEEE/ACM Transactions on Networking (TON)
An engineering approach to computer networking: ATM networks, the Internet, and the telephone network

An engineering approach to computer networking: ATM networks, the Internet, and the telephone network
Differentiated Services for the Internet

Differentiated Services for the Internet
Self-Adaptive Parallel Processing Architecture For High-speed Networking

HPCS '02 Proceedings of the 16th Annual International Symposium on High Performance Computing Systems and Applications

Quantified Score

Hi-index	0.00

Visualization

Abstract

This paper presents a queuing algorithm which is tailored for usage in speculative Network Processors (NPs). The queuing system uses Weighted-Fair Queuing queues (WFQ) which are extended by Priority Queues (PQ). While WFQ represents a common implementation in current routers supporting differentiated services, PQs allow to compensate extended protocol processing times due to mispredictions in a speculative system. When applying this concept, the generation of delay-jitter which would limit applicability of speculative packet processing for Real-Time (RT) traffic can be avoided. Utilising the presented queuing system in conjunction with speculative protocol processing in an NP, a latency reduction of up to 14.9% can be achieved compared to systems which support traditional packet processing methodologies.