The　time-and　space-varying　nature　of　residual　bandwidth　in　inter-datacenter　networks　(inter-DCNs)　makes　conventional　end-To-end　connections　difficult　to　fully　utilize　the　residual　bandwidth.　A　promising　solution　is　to　introduce　datacenter　storage　into　data-plane　paths.　Delay-Tolerant　bulk　data　can　be　temporarily　stored　at　intermediate　sites　and　forwarded　(SnF)　at　a　later　time　when　inter-DCN　is　less　congested.　However,　the　conventional　methods　attempt　to　involve　multi-dimensional　state　information　of　the　entire　network　in　scheduling,　which　results　in　high　computational　complexity.　In　this　paper,　our　studies　reveal　that　there　exist　redundant　states　in　scheduling,　which　cannot　provide　any　performance　benefit　while　imposing　extra　computational　burden.　Inspired　by　this　finding,　we　propose　a　state-merging　scheduling　(SMS)　method.　By　merging　the　state　information　of　the　pre-selected　links,　the　SMS　method　naturally　reduces　the　redundant　states　involved,　which　greatly　improves　the　efficiency　of　SnF　scheduling.　Simulations　demonstrate　that　the　SMS　method　can　outperform　the　conventional　scheduling　method,　given　a　limit　of　the　computational　cost.　©　2020　IEEE.