Abstract

A new hierarchical routing model for broadband networks is proposed and one of the problems facing the design of the hierarchical routing model is addressed. A brief description of the PNNI hierarchical routing model is given and a new hierarchical model that proves to be simpler and requires less storage than the PNNI model is proposed. The problem addressed is the choice of the number of levels in the hierarchy and the group size at each level. The optimization criterion for this problem is the minimization of storage required at each node to store the topology status information necessary for routing decision.

Full Text
Paper version not known

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 call

Disclaimer: 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.