On Buffer Allocation in Transport Protocols

Abstract We present, in this paper, a buffer allocation algorithm for use in a transport level protocol. The algorithm allocates buffers as a function of the estimated queue length for (user-defined) categories of traffic, thereby ensuring fair behaviour on its part. Different categories of traffic might correspond to interactive and file transfer traffic. A deadlock avoidance mechanism is incorporated in the algorithm as well in order to avoid reassembly deadlock. The algorithm may also be employed at a gateway as part of an inter-networking protocol.