Consideration on a nonlinear multicommodity flow problem in a packet switching network

Abstract

AbstractIn a packet switching network it is important to route traffic flow so as to minimize message delay. This problem is formulated as a multicommodity flow problem with a nonlinear objective function and it is solved by the steepest descent method. It is also necessary to control the traffic demand at each node so that the total message delay is below a certain level. This paper presents an algorithm to obtain the region vectors consisting of traffic demand at each node which can be transmitted simultaneously under the given delay time. Despite its importance this region has not been adequately considered. A nonlinear T‐cut condition is introduced by which the region is obtained. This paper is a nonlinear extension of the authors' recent work.