Abstract
In this paper a method for solving the optimal routing problem in packet-switched communication networks is proposed. This problem can be formulated as a nonlinear multicommodity flow problem is proposed. This algorithm solves simple flow subproblems and permits the implementation of the solving procedure in parallel computers.
Full Text 
Sign-in/Register to access full text options
Sign-in/Register to access full text options 
Published version (
Free)
Free) 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a call
