Performance analysis of preemptive resume scheduling in mobile transactions

We present an active network-based approach in order to improve the performance of mobile transactions. This approach employs preemptive resume scheduling mechanism which reduces queuing delays involved in the processing of mobile transactions at each network node. Such reduction of queuing delay significantly improves performance of mobile transactions given the heavy network traffic and the lower network bandwidth. We have conducted several experiments using analytical modelling approach in order to determine the impact of priority scheduling mechanism on the performance of mobile transactions. Experiments show significant performance improvements of the proposed approach over existing approaches of mobile transactions. It has also been shown that the proposed approach is robust in that it can be applied to improve the performance of current mobile transaction approaches.