shortest-path routing 中文意思是什麼
shortest-path routing
解釋
最短路徑路由選擇-
Unfortunately, the problem of finding multicast routing with qos constrained is a np - complete problem. so we can not solve the problem with the classical shortest path first algorithms such as bellman - ford and dijstra
然而研究表明，由於qos組播路由帶有多個qos約束參數，因此qos組播路由問題是一個np完全問題，這使得它與傳統的路由過程不同，難以用經典的最短路徑優先演算法求解。 -
Main technic of giss webgiso thus function modules architecture and network topological structure are confirmed webgis system implements the basic function of electronical map, such as map zoonu pan, and the abundant query of geograph and database by using maplnfo mapxtreme for java as map server and jsp., java technico this system also can implement the routing of linesx analysing of buffer and so on0 this paper advances storage model of roads and pipelines topology data, efficiently solves the maintenace problem of network topology data of webgis and implements the shortest path algorathm based on webgis by improving it0 the system has better opening by suppling database interface of map ? the system has perfect on - line help and user forum and favorable interfaces and implementation of this system makes fundament for the further research of webgiso
本系統利用mapinfomapxtremeforjava作為地圖服務器，採用jsp和java技術，實現了基於webgis的電子地圖的縮放、漫遊等基本功能，並具有豐富的圖文定位查詢功能；實現線路路由、緩沖區分析等輔助決策功能；構建了道路管線網路拓撲數據的存儲模型，有效地解決了基於webgis的網路拓撲數據的維護問題；對dijkstra演算法進行了一些改進，實現了基於webgis的最短路徑演算法；本系統提供了電子地圖數據庫介面，使本系統具有很好的開放性和通用性； webgis系統軟體具有完善的在線幫助和用戶交流論壇，人機界面友好。 -
Another constrained problem is delay and delay variation constrained multicast routing problem. sp - dvma ( shortest path delay variation multicast algorithm ) algorithm based on minimum delay path is presented
第二類是時延和時延差約束的多播路由問題，提出了以最短時延路徑為基礎的一種演算法? ? sp - dvma演算法。 -
A source routing framework is proposed to route traffic flows proactively over multiple paths, which tries to optimize routes for long - lived flows based on dispersity routing ; based on mathematical analysis, our approach disperses incoming traffic flows onto multiple paths according to path qualities. long - lived flows are detected and migrated to the shortest path if their qos could be guaranteed there. suggesting non - disjoint path set, four types of dispersion policies are analyzed, and flow classification policy which relates flow trigger with link state update period is investigated
提出一種以業務量內在特性為基礎的前攝式多路路由演算法：以對業務量的內在特性分析為基礎，該方法在多路發送數據流的同時檢測非最短路徑上的長流，而後在保證服務質量的前提下將長流遷移到最短路徑上傳輸；前攝式多路路由使用以路徑質量評價為基礎的業務流分佈方法有效提高網路吞吐量，通過周期性的路徑質量評價適應時變網路狀況；模擬實驗表明，該方法可以有效提高「盡力而為」方式下的網路服務質量和資源利用率；浙江大學博士學位論文3 -
For optical - layering approach, we propose an ant - based algorithm, which uses the ants " capability of finding shortest or near - shortest paths between a food source and their nests, to solve the logical topology reconfiguration problem. we give the ants routing formula based on dynamic load balancing and short path on the assumption that some conditions hold
前者適合於業務矩陣變化不是太頻繁的網路，提出利用螞蟻演算法解決業務的再路由問題，即利用螞蟻具有找到最短徑及不同種類螞蟻具有互斥的天然特性來進行邏輯拓撲重配置，從而保證了鏈路負載分佈的平衡性。 -
Simulation results show that the developed scheme performs well in terms of qos performance metrics such as the lightpath hop length and the network maximal link load. for ip over wdm networks consist of oxcs and routers, which are inter - connected by optical fibers, chapter 3 presents a novel routing and wavelength assignment algorithm based on k - shortest path
對于由大量路由器和oxc通過光纖互連而組成的ipoverwdm網路，第三章創新性地提出了將ip層矛咣層綜合考慮進行：路由選擇，並利用k ? ?最短路由對有長度限制的請求進行資源分配的演算法。 -
Then the result of certain k - shortest path algorithm is introduced as a set to be chosen by both the simulated anneal algorithm and heuristic algorithm, concerning the end - to - end traffic requirement and restriction on link bandwidth. afterwards, the effect of the value k on the outcome of the simulated anneal algorithm is researched. the network resource is allocated, while the study of link protection problem on traffic routing is introduced and two types of protection, shared protection and dedicated
首先考察實際的網路模型，根據業務需求，引入k路由演算法的結果作為模擬退火演算法和啟發性演算法備選路由集合，在鏈路帶寬有限的約束下對網路資源進行分配，同時引入業務路由的通路保護問題的研究，實現了共享保護和專用保護兩種通路保護方式;針對全波長轉換網路和無波長轉換能力網路，根據為所有連接請求所分配的總資源最少和滿足請求的業務數目最多兩種優化目標對資源分配進行優化，研究了備選路由集大小對模擬退火演算法結果的影響;對模擬退火演算法與啟發性演算法的 -
Firstly, we introduce the aodv - qos routing algorithm, the aodv routing protocol only try to find the shortest path without concerning about the qos constrains. in aodv - qos, the network has the privilege to generate paths according to its quality, and then an application selects a path with sufficient resources to satisfy a certain delay and bandwidth requirements
本文首先分析研究了aodv - qos約束路由演算法，它將原始aodv路由選擇的最短路徑原則改為按照業務qos需求選擇路由，即在尋路過程中加入時延和帶寬約束條件，選擇滿足業務性能要求的路由。 -
Shortest path algorithm with real time traffic information in dynamic vehicle routing problem
動態車輛路徑問題中的實時最短路徑演算法研究 -
Open shortest path first ( ospf ) is one of the routing protocol of internet. originally, it was developed to be the substitute for routing information protocol ( rip )
Ospf （ openshortestpathfirst ，開放最短路徑優先）是internet路由選擇協議的一種，最初是為替代rip協議開發的，目前已成為構建大型網路最常用的路由選擇協議。 -
This paper introduced the development of routing protocol, isolation technology, and then introduced the research scope of isolation technology around the world. and then analyzed the ospf ( open shortest path first ) protocol, introduced the routing hierarchy feature of it, analyzed the diffuse process, and the theory of how it works
本文介紹了路由協議、隔離技術的發展，並介紹了國內外在隔離技術中的研究方向，接著分析了ospf路由協議，介紹了ospf分層路由的概念，詳細分析了ospf路由協議的擴散過程和工作原理。
分享友人