The price of anarchy(POA)quantifies the efficiency losses of dynamic networks due to selfish behaviors.We consider a repeated noncooperative congestion game in which players make their decisions simultaneously.We provide an upper bound of the POA via smoothness argument and prove that the sequence of strategy profiles generated through best response principle with inertia possesses no-regret property.We also give an upper bound of the price of total anarchy.