Font Size: a A A

Many Restrictions On The Internet Under The Conditions Of The Qos Routing Algorithm

Posted on:2003-11-15Degree:MasterType:Thesis
Country:ChinaCandidate:G G PengFull Text:PDF
GTID:2208360062990351Subject:Computer application technology
Abstract/Summary:PDF Full Text Request
Current Internet can only provide "best-effort" service, which means it will try its best to forward user' s data packets, but can provide no guarantees regarding bandwidth and delay. While this kind of service is suitable for some traditional applications, it' s intolerable for newly emerged real-time, multimedia applications. How to provide high quality of service in the next generation Internet is a key project in computer network research.The research in these years shows that the algorithm of network routing plays an important part in providing quality-of-service guarantees. The study of QoS routing has become a very important study direction in research field of QoS. Considering that network model based multiple constraints can reflect QoS routing problem in practice more accurately, with the increase of quality-of-service demand and the enlargement of network scale, the research of QoS routing algorithm with multiple constraints is of very important research significance to achieve good network quality of service and high efficiency in resource utilization. In this paper, we mainly study QoS routing algorithms basedmultiple constraints and relative technologies.First, this paper deeply analyzes QoS research architecture, routing policy and algorithm based on IP, and introduces the research status of routing algorithms with multiple constraints. Current algorithms with multiple constraints are classified and the routing problem and model with multiple constraints are discussed in the paper.QoS routing problem with multiple constraints is an important project in QoS routing research. It mainly includes multi-constrained path (MCP) problem and multi-constrained optimal path (MCOP) problem. For MCP problem, the paper presents an efficient QoS routing algorithm with multiple constraints桬RAMC. Making use of precomputation, algorithm ERAMC simplifies network topology and uses a breadth-first search algorithm with priority to find a transmission path that satisfies multiple constraints. For MCOP problem, the paper discusses the QoS routing optimal algorithm with general multiple constraints, and constructs the model of the QoS routing optimal problem with multipleconstraints, and proposes a new QoS routing optimal algorithm with multiple constraints桬AMCOP. Making the best of an efficient pruning policy, the algorithm reduces greatly the size of search space and improves the performance of algorithm.In conclusion, the paper focuses in the research of QoS routing algorithms based multiple constraints. It will provide some theory reference for the study about the problem in the future.
Keywords/Search Tags:Routing algorithm, Quality of Services, Multiple constraints
PDF Full Text Request
Related items