Database query scheduling in common channel signalling network

The authors study the database query scheduling problem at STPs (signal transfer points) in a CCS (common channel signaling) network. For each arriving query, the STP can send the query to either one of the mated SCPs (service control points) to which it is connected. The authors consider a class of query scheduling policies ranging from policies that do not require any instantaneous workload information from SCPs to a policy that requires such information. Queuing models that describe the behavior of SCPs under each scheduling policy are developed and solved to yield the mean response-time performance of query processing. The authors carry out simulation experiments to obtain the second moment statistics of the response time performance. The results show that when SCPs provide enough concurrent processing capability, a simple round-robin policy yields a good performance as that of a more sophisticated policy requiring instantaneous workload information from SCPs.<>