Packet Reordering in Network Processors
Data(s) |
11/06/2007
|
---|---|
Resumo |
Network processors today consist of multiple parallel processors (micro engines) with support for multiple threads to exploit packet level parallelism inherent in network workloads. With such concurrency, packet ordering at the output of the network processor cannot be guaranteed. This paper studies the effect of concurrency in network processors on packet ordering. We use a validated Petri net model of a commercial network processor, Intel IXP 2400, to determine the extent of packet reordering for IPv4 forwarding application. Our study indicates that in addition to the parallel processing in the network processor, the allocation scheme for the transmit buffer also adversely impacts packet ordering. In particular, our results reveal that these packet reordering results in a packet retransmission rate of up to 61%. We explore different transmit buffer allocation schemes namely, contiguous, strided, local, and global which reduces the packet retransmission to 24%. We propose an alternative scheme, packet sort, which guarantees complete packet ordering while achieving a throughput of 2.5 Gbps. Further, packet sort outperforms the in-built packet ordering schemes in the IXP processor by up to 35%. |
Formato |
application/pdf |
Identificador |
http://eprints.iisc.ernet.in/41367/1/Packet_Reordering.pdf Govind, S and Govindarajan, R and Kuri, Joy (2007) Packet Reordering in Network Processors. In: IEEE International Parallel and Distributed Processing Symposium, 2007. IPDPS 2007., 26-30 March 2007 , Long Beach, CA. |
Publicador |
IEEE |
Relação |
http://ieeexplore.ieee.org/xpls/abs_all.jsp?arnumber=4228015 http://eprints.iisc.ernet.in/41367/ |
Palavras-Chave | #Electronic Systems Engineering (Formerly, (CEDT) Centre for Electronic Design & Technology) #Computer Science & Automation (Formerly, School of Automation) #Supercomputer Education & Research Centre |
Tipo |
Conference Paper PeerReviewed |