Weighted Priority Queuing: A New Scheduling Strategy for Web Services

Web services are considered as one of the best and most widespread solution for handling the interoperability problem and the challenge of integration. The proliferation of Web services over the Internet becomes more and more significant. They are henceforth playing an important role in several fields such as ehealth, e-commerce and e-learning. Thus, one important question arises: how to manage Web services more efficiently? It is a key problem to the Web services basedapplications at present especially that the need to enhance the Quality of Services (QoS) is constantly growing: the better the QoS are, the more the users are satisfied. This has spurred the study of scheduling algorithms for providing QoS guarantees. In this paper we put the light on the Web services requests scheduling strategies on the server side. In fact, we present a brief overview and a comparative evaluation of three queuing scheduling disciplines for Web services, which are: First in First out (FIFO), Priority Queuing (PQ) and Weighted Fair Queuing (WFQ). Then, we put forward a new scheduling strategy based on two wellknown strategies namely: Priority Queuing and Weighted Fair Queuing. The experimental results highlight the merits and shortcomings of each scheduling discipline in addition to its performance in terms of: execution time, communication time and response time.