提出一个分布式服务质量路由算法 ,以求在不影响已存在连接的服务质量的前提下 ,寻找满足服务质量要求的可行路 .该算法根据网络运营状况不同 ,改变寻路范围 .当网络资源很充裕 ,寻路花费可忽略 ,可行路的存在性是首要问题时 ,寻路范围可以是整个网络 ,使得只要存在可行路 ,就一定能找到 ;当网络资源匮乏 ,寻路信息应尽可能少时 ,寻路范围将减少 ,直至每点只向一个邻点发送寻路信息 ,但其接通率不少于最短路算法 This paper proposes a distributed QoS routing algorithm to find feasible ways to meet QoS requirements without affecting the quality of service of existing connections.The algorithm changes the routing path according to different network operating conditions.When the network resources are very poor Adequate, pathfinding costs can be ignored, the existence of viable road is the primary problem, the pathfinding range can be the entire network, so long as there is a viable road, we will be able to find; when the lack of network resources, routing information should be as little as possible, The wayfinding range will be reduced until each point only sends path finding information to one neighbor, but its rate of completion is not less than the shortest path algorithm