The existing network, which implements the packets forwarding based on the destination IP address, ignores the source IP address in the transmission process, hence its forwarding strategy is not flexible. Based on the destination IP address and the source IP address, the two-dimensional routing supports the network to provide a more flexible forwarding service. But the introduction of the source IP address dramatically increases the storage space of the Forward Information Base (FIB), in addition, it significantly increases the cost of the hardware. This paper presents a decomposition and storage model of two-dimensional FIB (DSTF). According to the destination IP prefixes, DSTF divides the two-dimensional FIB into blocks. And the collection of the two-dimensional routing entries (REs) that are included in the same Cluster-head IP Prefix (CP) is treated as a sub two-dimension block (STB). Then, depending on the different CPs that the STBs belong to, every STB is stored in the different line cards (LC). Meanwhile, in the process of the packets forwarding, according to the corresponding relationship between the CPs and the LCs, the forwarding mechanism can quickly locate the host LC (LC_host) of this packet, and implement the packets forwarding in the LC_host. Experimental results show that DSTF can decompose and store the two-dimensional FIB in different LCs averagely. Furthermore, it is effective to reduce the storage space of the two-dimensional FIB in the routing system.