In the SDN scheme, management of the data transmission has been done via central data controller. By means of transmission, each node in the network(routers) get the routing information from the central controller. The rules received by the controller, has been saved in a data flow table on the data conducted nodes. The limit capacity has been considered regarding the table‘s hardware technology. A new constraint in virtual circuits routing process has been created due to limitation size of the flow table. By increasing this new constraint, the novel routing problem by considering constraints on the vertices and links capacity simultaneously has been created. therefore, new methods should be recommended for VCs routing in SDN‘s data plane. In this thesis, an online routing method for VCs in the data plane of SDN has been proposed. This routing maximizes the throughput and decreases the congestion as far as possible. In this thesis, the problem has been solved through two deterministic algorithm base on the online primal dual method. The factor has been used for algorithm performance assessment is a competitive ratio between throughput and sources congestion. The calculated competitive ratio for network throughput in the first algorithm is O(1). Also, the competitive ratio for sources congestion has resulted O(log n). However, in the second algorithm attempted for solving the congestion challenges. In this algorithm, the calculated competitive ratio is O(log n). Key Words : Software Defined Networks, Online Algorithms, Linear Programming, network man- agment