Goodput analysis using terminating map for a class of discrete-time queueing models

Abstract

We develop an approach for computing the goodput using the idea of terminating Markovian Arrival Process (tMAP) for a finite queueing system in discrete-time with Platoon Arrival Process (PAP). A platoon is said to have been successfully transmitted if all of its packets have been admitted into the queue without any loss. Otherwise, the transmitted packets from the unsuccessful platoon would constitute wasted work. The throughput rate of the nonwasted work is called "goodput." We apply the idea to modeling a queueing system with packet discarding policies in high speed networks-a system of considerable interest in networking. © Taylor & Francis Group, LLC.