We propose an admission control method at edge nodes. This method aims at maximizing network throughput and calculates an input traffic limitation ratio at each edge node, which is used for admission control. Since the proposed method only uses input traffic volume information, it does not need to take into account the traffic matrix among edge nodes. Therefore, this method can be easily applied to actual networks in a practical way. We formulate a linear programming (LP) to solve the optimization problem of the input, traffic limitation ratio of each node for any traffic matrix. This problem cannot be solved as it is, so we modify the LP problem by applying a duality theorem in the field of LP problems.