Performance modeling of Delay Tolerant Network routing via Queueing Petri Nets

With the advent of wireless technologies such as Wi-Fi Direct and Near Field Communication (NFC), Peer-to-Peer (P2P) content sharing among mobile devices is set to become more ubiquitous. Delay-Tolerant Networks (DTNs)-with their rudimentary direct delivery routing protocol-can be leveraged to provide seamless connectivity in such scenarios. To the best of our knowledge, little has been done to understand the performance of DTNs under realistic settings involving the interplay of diverse factors such as bundle fragmentation, scheduling, and buffer spacing. In this paper, we present a Queueing Petri Net (QPN) abstraction of DTNs that enables us to evaluate the underlying network´s performance. Our model is novel in its ability to capture bundle fragmentation, scheduling, and buffer spacing put together. We proceed to evaluate the veracity of the model by involving QPN evaluation using the SimQPN tool and simulation of the underlying DTN using the ONE simulator. We find that the model successfully predicts the performance of the underlying network to a high degree of accuracy.