Abstract
A new on-line routing algorithm based on the notion of minimum-interference is presented. The algorithm maximises the sum of residual flows of ingress–egress pairs, using a simple heuristic method. It achieves good results in terms of total bandwidth routed.
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.
