In this paper, we describe a graph dynamic threshold model called resource network, and briefly present the main results obtained during several years of research. Resource Network is represented by a connected oriented with weighted graph with an arbitrary topology. Weights of edges denote their throughput capacities for an abstract resource. The resource is stored in vertices, which can contain its unlimited amount. Network operates in discrete time. The total amount of resource is constant, while pieces of resource are reallocating among vertices every time step, according to certain rules with threshold switching. The main objective of our research is to define for a network with an arbitrary topology all its basic characteristics: the vectors of limit state and flow for every total amount of resource W; the threshold value of total recourse T, which switches laws of operating of the network; description of these laws. It turned out that there exists several classes of networks depending on their topologies and capacities. Each class demonstrates fundamentally different behavior. All these classes and their characteristics will be reviewed below.