Efficient routing is a challenging problem in multi-layered satellite networks where the time-varying topology leads to the absence of continuous and stable paths. Most previous researches either leverage IP architecture to achieve addressing and routing which usually leads to poor routing efficiency in such dynamic scenarios or design specialized architecture by using scheduling based control strategy which makes it hard to achieve efficient cooperative networking with other systems. In this paper

we propose SNDN (Satellite Named Data Networking)

a distributed routing method with high routing efficiency and multicast performance. Specifically

we construct two schemes to generate the time varying FIB (Forwarding Information Base) and PIT (Pending Interest Table)

and also design an efficient routing algorithm that can calculate the fastest time-related routes under both dense and sparse scenarios by using a time varying graph method. Nodes can generate FIB/PIT or update the entries concurrently with packet forwarding either by extracting the source routing information that attached in the selectors field of packet header or calculating by themselves if needed. Extensive simulation results verify the efficiency and performance of SNDN and demonstrate that it is a useful attempt on the routing problem of multi-layered satellite networks.