To provide efficient rollback-recovery for fault-tolerance in distributed systems, it is significant to reduce the number of checkpoints under the existence of consistent global checkpoints in index-based distributed checkpointing algorithms. A new checkpointing scheme, IBQSC, is presented in this paper for index-based checkpointing. It reduces the number of forced-checkpoints when multiple processes transfer data almost equally frequently. It also keeps synchronous in case of some process with less opportunity to transfer data for them to avoid too much amount of overhead of rollback-recovery due to useful computation losing in case of failure. Simulation results show that the proposed IBQSC scheme can reduce the number of induced forced-checkpoints per message 25-30% on an average comparing to the traditional strategies.