Abstract

Quality-of-Service (QoS) provisioning plays a pivotal role in widespread deployment of new emerging services over the current Internet and is expected to be an indispensable attribute of future Internet. Though relevant progress has been made towards ensuring QoS, modeling and developing efficient algorithms for end-to-end QoS provisioning remain challenging problems in the current and future Internet infrastructure. In this paper, we address these challenging problems from a generic routing perspective, emphasizing modeling and algorithms as well as evaluation on end-to-end QoS provisioning. Specifically, we first model the common features of major technologies for end-to-end QoS provisioning in a "bottom-up" manner. Through the model, a set of end-to-end performance bounds that indicate the serving capability of substrates are obtained. Then we propose two routing algorithms based upon the model and performance bounds. The analysis on computational property of proposed algorithms proves that they are light-weighted and cost-effective. We also conduct thorough performance comparison between the proposed algorithms and previous best-known results in both theoretical and experimental ways. Our results show that the model and the algorithms developed in this paper are efficient and superior to other competitors, thus are applicable to the various networking systems for end-to-end QoS provisioning in current and future Internet.

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.