Snapshot algorithms are fundamental for many distributed applications. This paper shows the several schemes for computing states of channels under the assumption of global clock. Taking consistent cut for the virtual global instant, the authors show that these schemes are suitable for the existing snapshot algorithms. A new algorithm is also presented, which is applicable for the various communication models.