Throughput and Latency of Finite-Buffer Wireless Erasure Networks With Backpressure Routing
The authors consider the problem of estimating throughput and average latency in wireless erasure networks with nodes having finite buffers. In these networks, packets are either lost due to link erasures or dropped because of full buffers. Further, a finite-buffer adaptation of backpressure routing policy is used. The exact Markov chain modeling of such networks for the sake of performance analysis turns out to be an extremely difficult problem in general due to the large number of states and their complicated transitions. In this paper, they propose a novel iterative method that estimates the performance parameters of such networks with much less complexity comparing to the exact analysis.