Research On FallBack Algorithm Based On The Model Of Multi-QoS Routing

Quality-of-service mains the ability of the service , which decides how level the networks satisfy the request of the user , at the same time , To guarantee of the quality-of-service for multi-type application is the key of the next generation networks.There are many aspect which networks provide the guarantee of the quality of service . But the one of the key technology for providing the guarantee of the quality of service is the QoS routing .The main goal of QoS routing is that for the user of network finds the passing way which satisfy the QoS constraints. It must guarantee the most utilization of the resource of network. The course of selection routing includes two parts. One is the exchange the information of routing, and creating the tablet of routing. The other is finding way.In the course of the working , Men create a lot of QoS routing algorithms. Because some of the problem of the QoS routing is the NP-complete, Those algorithms have drawback in technology. In this paper , at first , It is introduction the framework of the FallBack and the way to do with the QoS constraints, next, We told the FallBack algorithm and its character, the author want to overcome some of the FallBack algorithm' s drawbacks . and giving FallBack algorithm with the model of multi-QoS routing, and we take a experiment at the networks simulation which develops form the VC++6. 0 under Windows 2000. The data of experiment signal that the improvement of the Fallback algorithm gets the target.