Abstract
Abstract Owing to the increase in the internet traffic, any calculation that requires more than linear time would be considered unreasonably moderate for constant applications. One cure is to utilize numerous processors to build up associations in parallel and the other is to construct low cost, high speed, large capacity non-blocking switching architecture. In this paper, our focus is on developing parallel algorithms for routing which will ensure high-speed internet connectivity and at the same time making the system to be cost effective.
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.
