Abstract
The concept of topology of distributed communication networks constitutes a most complex problem of which the solution depends largely on the routing algorithm utilised. The latter has to be robust enough for avoiding network congestion and minimising the delay of messages. This article proposes a routing algorithm called MINDEL and determines the destination of flows in conjunction with distributed networks. The implementation results of this algorithm of complex polynomials confirm its effectiveness by agreement with existing heuristics.
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.
