Abstract

In this paper, we propose two efficient topology aggregation (TA) methods to deal with the scalability problem of hierarchical quality of services (QoS) routing. Our methods first use line fitting staircase or quadratic curve fitting staircase to approximate the original service staircase in the full mesh compaction. Then we respectively transform the restrictive parameters and the additive parameters of each full mesh topology into tree structure and star structure respectively for further compaction. Experimental results with randomly generated networks show that our methods perform far better than other methods in terms of achieving balance between the level of compaction and accuracy consideration.

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.