Abstract
The routing problem is one of the studied transportation problems. In the paper the communication networks routing problem is presented, in which the goal is to find a route from the start stop to the final stop minimizing the time of travel, where the time of starting travel at the start stop is given. If there are more routes with minimal the time of travel, among them the route with minimal the cost of travel should be determined. In the paper the algorithm for solving the communication networks routing problem is presented. Apart from that a sample results of experimental tests using the real communication network are presented.
Sign-in/Register to access full text options 
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 callDisclaimer: 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.
