In this paper, joint routing scheme is proposed and studied in network coding aware circumstances. The idea of joint routing is enlightened by observation that mutual influence exists between flows. The defining aspect of joint routing is to treat all flows in the network as a whole and to make use of interactions between flows to optimize system performance. Formal description of joint routing problem is presented and an iterative algorithm is proposed. Simulation results show that JR offers 22.3% and 10% improvement over traditional separated and semi joint routing scheme.