An algebraic model for computing the maximum throughput of pipelined protocol processors
Mario Cardona, T. Satake, Shigeo Tsujii · 2002
Presents an algebraic model for computing the maximum throughput of pipelined protocol processors. The model supports concurrent processing at pipeline stages, packet segmentation/assembling, and packet processing time dependent on packet length. Two examples are given. In the first example. The throughput of a single pipeline stage is computed. In the second example, the maximum throughput achievable by an idealized pipelined processor for FDDI, class I LLC, IF, and TCP is computed. Also, the authors show that the formula given in Hirata et al. (1992) is a special case of a formula derived in the present paper.>