heuristic routing 中文意思是什麼
heuristic routing
解釋
啟發式路由選擇-
Solving qos multicast routing problem based on heuristic ant algorithm
組播路由問題求解 -
Combining the international newest research result of multicast tree, this paper get a series of high efficiency arithmetic of multicast tree problem with the method of increasing storage space, and this paper also takes into account the dynamic capability of arithmetic. in many research fields of multicast tree, many high - efficiency solutions were obtained in this paper. this paper has broadly discussed about multicast tree problem and obtained dmdt ( dynamic minimum distance tree ), fmph ( fast minimum path cost heuristic ), dmph ( dynamic minimum path cost heuristic ) and fgmra ( fast group multicast routing arithmetic )
本篇論文對多播生成樹問題進行了比較全面的討論，涉及內容包括單約束的單樹多播、單約束的成組多播等多個方面，所提出的動態最短路徑樹演算法dmdt （ dynamicminimumdistancetree ） ，最小代價多播生成樹演算法fmph （ fastminimumpathcostheuristic ）動態最小代價多播生成樹演算法dmph （ dynamicminimumpathcostheuristic ） ，成組多播快速路由演算法fgmra （ fastgroupmulticastroutingarithmetic ） ，都取得了顯著的效果，是目前同類問題中比較好的解決方案，達到了預期的目的。 -
A delay - constrained many - to - many multicast routing heuristic algorithm
一個快速的時延有界低代價多播路由演算法 -
This paper deals with the problem of crosstalk mitigation at both methodological and algorithmic levels. noting that intermediate operations between global routing and detailed routing are very effective in crosstalk estimation and reduction, the authors propose to incorporate several intermediate steps that are separated in traditional design flow into an integrated routing resource assignment stage, so that the operations could easily cooperate to fully exert their power on crosstalk reduction. an efficient priority - based heuristic algorithm is developed, which works slice by slice
在布線的各階段中，總體布線有較大的靈活性，但對各區域或信號線上的串擾難以估計詳細布線可以精確地計算串擾，但靈活性太小，往往出現反復拆線重布，難以達到設計收斂相比之下，總體布線和詳細布線中間的階段既有一定的靈活性，又可以相對準確地計算噪聲，是解決串擾問題的理想時機。 -
Thirdly, the group multicast routing problem with bandwidth constrained is studied, three heuristic algorithms for group multicast routing are presented. the former two group multicast algorithms are the improvement of gtm algorithm
此外，本論文還研究了有帶寬預留機制的群播路由問題，給出了兩種有帶寬約束的群播路由演算法和一種帶有多個約束的群播路由演算法。 -
Finally the program code executing a heuristic algorithm and the simulation results are showed to demonstrate the achievement of the lightest weights of routing
最後給出了以求得最輕鏈路權重總和為目的的啟發式演算法程序及圖形模擬結果。 -
In this paper, first, i present a new model of vrp and a heuristic algorithm of it. then, i have proofed that on the distance constrained vrp, any polynomial time heuristic h for mv, we have kh / kv > 2 ; and i give a dynamic programming recursion heuristic of md. furthermore, i study some stochastic vehicle routing problem also
並證明了在距離約束的vrp情形下對于目標函數mv （車輛數最小） ，其任一有多項式時間的啟發式演算法h得到的車輛數目k ~ h和最優車輛數目k ~ v滿足關系k ~ h k ~ v 2 ，我們還給出了md （總距離最小）的一個動態規劃演算法。 -
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路由演算法的結果作為模擬退火演算法和啟發性演算法備選路由集合，在鏈路帶寬有限的約束下對網路資源進行分配，同時引入業務路由的通路保護問題的研究，實現了共享保護和專用保護兩種通路保護方式;針對全波長轉換網路和無波長轉換能力網路，根據為所有連接請求所分配的總資源最少和滿足請求的業務數目最多兩種優化目標對資源分配進行優化，研究了備選路由集大小對模擬退火演算法結果的影響;對模擬退火演算法與啟發性演算法的 -
In this thesis, firstly, the existing heuristic algorithms for steiner tree problem are summarized ; secondly, a research and analysis is made on the multicast trees that satisfy qos requirement and a fast routing algorithm for delay - constrained low - cost multicast is presented. through simulation, we find that the proposed algorithm is simple and can get the low - cost tee in polynomial time. at last, the multicast routing and wavelength assignment in wdm optical networks is studied ; a routing and wavelength assignment in wdm all - optical networks is presented
本論文首先綜述了多播路由問題的理論基礎，接著對滿足qos約束的多播路由問題進行了研究，提出了一種快速的時延受限最小代價多播路由演算法，該演算法簡單、快捷，能在多項式時間內找到滿足時延約束的代價較小的多播樹，具有良好的性能；最後，研究了wdm光傳送網中的多播路由和波長分配問題，並提出了wdm全光網路中的多播路由與波長分配演算法，該演算法將路由和波長分配統一進行，構造了時延受限低代價多播樹，克服了將尋徑和波長分配分步進行的弊端，避免了同類演算法的較高復雜性。 -
For a given network physical topology and long - term traffic pattern, design of delay - based logical topology can be formulated as a linear problem, a np - hard problem, which is computationally intractable for large size of networks. so, we pr opose a heuristic algorithm to address the problems of routing and wavelength assignment
基於業務平均跳數來衡量的模擬結果表明，在網路中不同qos要求的業務需求大致相當的情況下，不管網路負載如何變化，對某qos要求的vpn業務，總是能夠取得qos較之要低的業務更低的平均跳數，即更小的平均時延。
分享友人