Packet prediction for speculative cut-through switching

The amount of intelligent packet processing in an Ethernet switch continues to grow, in order to support of embedded applications such as network security, load balancing and quality of service assurance. This increased packet processing is contributing to greater per-packet latency through the switch. In addition, there is a growing interest in using Ethernet switches in low latency environments such as high-performance clusters, storage area networks and real-time media distribution. In this paper we propose Packet Prediction for Speculative Cut-through Switching (PPSCS), a novel approach to reducing the latency of modern Ethernet switches without sacrificing feature rich policy-based forwarding enabled by deep packet inspection. PPSCS exploits the temporal nature of network communications to predict the flow classification of incoming packets and begin the speculative forwarding of packets before complex lookup operations are complete. Simulation studies using actual network traces indicate that correct prediction rates of up to 97% are achievable using only a small amount of prediction circuitry per port. These studies also indicate that PPSCS can reduce the latency in traditional store-and-forward switches by nearly a factor of 8, and reduce the latency of cut-through switches by a factor of 3.

[1]  Jason Lee,et al.  A first look at modern enterprise traffic , 2005, IMC '05.

[2]  Walter Willinger,et al.  Self-similarity and heavy tails: structural modeling of network traffic , 1998 .

[3]  Rami G. Melhem,et al.  Switch design to enable predictive multiplexed switching in multiprocessor networks , 2005, 19th IEEE International Parallel and Distributed Processing Symposium.

[4]  Raj Jain,et al.  Packet Trains-Measurements and a New Model for Computer Network Traffic , 1986, IEEE J. Sel. Areas Commun..

[5]  Daniel Grosu,et al.  Performance considerations for network switch fabrics on linux clusters , 2004 .

[6]  Nick McKeown,et al.  Algorithms for packet classification , 2001, IEEE Netw..

[7]  Jeffrey C. Mogul Network Locality at the Scale of Processes , 1992, ACM Trans. Comput. Syst..

[8]  Andrei Broder,et al.  Network Applications of Bloom Filters: A Survey , 2004, Internet Math..

[9]  D. C. Feldmeier,et al.  Improving gateway performance with a routing-table cache , 1988, IEEE INFOCOM '88,Seventh Annual Joint Conference of the IEEE Computer and Communcations Societies. Networks: Evolution or Revolution?.

[10]  Yue-Sun Kuo Generating Essential Primes for a Boolean Function with Multiple-Valued Inputs , 1987, IEEE Transactions on Computers.

[11]  David E. Taylor,et al.  Longest prefix matching using bloom filters , 2006, TNET.

[12]  M. Koibuchi,et al.  Predictive Switching in 2-D Torus Routers , 2006, International Workshop on Innovative Architecture for Future Generation High Performance Processors and Systems (IWIA'06).

[13]  Nor Asilah Wati Abdul Hamid,et al.  Averages, distributions and scalability of MPI communication times for ethernet and myrinet networks , 2007, Parallel and Distributed Computing and Networks.

[14]  H. T. Mouftah,et al.  Delay Analysis Under a General Cut-Through Switching Technique in Computer Networks , 1987, IEEE Trans. Commun..

[15]  Walter Willinger,et al.  On the self-similar nature of Ethernet traffic , 1993, SIGCOMM '93.

[16]  Peter Newman,et al.  IP switching and gigabit routers , 1997, IEEE Commun. Mag..

[17]  Dhabaleswar K. Panda,et al.  Performance Comparison of MPI Implementations over InfiniBand, Myrinet and Quadrics , 2003, ACM/IEEE SC 2003 Conference (SC'03).

[18]  William J. Dally,et al.  A delay model and speculative architecture for pipelined routers , 2001, Proceedings HPCA Seventh International Symposium on High-Performance Computer Architecture.

[19]  Subhasis Banerjee,et al.  On the Effectiveness of Flow Aggregation in Improving Instruction Reuse in Network Processing Applications , 2004, International Journal of Parallel Programming.

[20]  Thomas Stricker,et al.  Speculative defragmentation - a technique to improve the communication software efficiency for Gigabit Ethernet , 2000, Proceedings the Ninth International Symposium on High-Performance Distributed Computing.

[21]  Leonard Kleinrock,et al.  Virtual Cut-Through: A New Computer Communication Switching Technique , 1979, Comput. Networks.

[22]  David E. Taylor Survey and taxonomy of packet classification techniques , 2005, CSUR.

[23]  Simulation Forum,et al.  Proceedings of the 16th IASTED International Conference on Parallel and Distributed Computing and Systems, November 9-11, 2004, MIT, Cambridge, USA , 2004 .