This paper considers the routing problem in session-based communication network, particularly where the pattern of message transmission is characterized by non-bifurcated traffic flows. Due to the discreteness property of its solution space, the problem is formulated as normalized mlticommodity network flows with integer restrictions and an effective penalty system is suggested to solve it. To show its effectiveness, a simple example and a preliminary computational experience are provided. Finally, numerous application areas of the algorithm are suggested.