Abstract
The emerging environment of ATM networks with unpredictable traffic patterns and ever-changing network configurations create the need for using dynamic routing methods. Dynamic routing basically means that path selection continuously adapts to the state of the network. The routing framework of the Private Network-to-Network Interface (PNNI) specification achieves this by using link-state information gathered from the network. One possible approach for selecting paths is to use a shortest path algorithm (e.g., Dijkstra's) with link costs generated from the link load information. This mapping is realised by the so-called link cost function. We investigated a number of such link cost functions with simulation. We developed two novel link cost functions and compared them with those found in the literature. The primary basis of comparison was the total throughput of the networks. Besides this, we also investigated such issues as imposed signalling load and robustness.
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.
