Abstract

We present a distributed algorithm for determining optimal concurrent communication flow in arbitrary computer networks. Our scheme is applicable to a wide range of network flow applications in computer science and operations research. As an example, it can be used for determining optimal task migration paths in metacomputing environments, or for work-load balancing in arbitrary heterogeneous computer networks.

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

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.