This paper proposes a novel approach for the efficient commit processing of Web transactions. The approach is based on the priority active network scheduling mechanism. This approach takes into account the actual queuing delay of the network nodes involved in the commit processing of Web transactions. Using this approach, the queuing delays for the high priority messages (such as commit/abort) can significantly be reduced. Consequently, the performance of the commit processing is improved as response time of the nodes responsible for making decisions is reduced. This approach can be used to improve the performance of the existing commit protocols of Web transactions.