A parallel algorithm for nonlinear multi-commodity network flow problem

Authors:
Shieh-Shing Lin;Huay Chang;Cheng-Chien Kuo
Affiliations:
Dept. of Electrical Engineering, St. John's University, Tamsui, Taiwan;Dept. of Information Management, Chihlee Institute of Technology;Dept. of Electrical Engineering, St. John's University, Tamsui, Taiwan
Venue:
ICS'06 Proceedings of the 10th WSEAS international conference on Systems
Year:
2006

Citing 3
Cited 0

Parallel and distributed computation: numerical methods

Parallel and distributed computation: numerical methods
Algorithms for Network Programming

Algorithms for Network Programming
Optimal Routing in a Packet-Switched Computer Network

IEEE Transactions on Computers

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper, we propose a method to solve the Nonlinear Multicommodity Network Flow (NMNF) Problem. We have combined this method with a projected-Jacobi (PJ) method and a duality based method possessing decomposition effects. With the decomposition, our method can be parallel processed and is computationally efficient. We have tested our method on several examples of NMNF problem and obtained some successful results.