routing group 中文意思是什麼
routing group
解釋
路由選擇組-
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 ） ，都取得了顯著的效果，是目前同類問題中比較好的解決方案，達到了預期的目的。 -
Because of the large scale of the p / g routing network in the memory chip layout, general linear equation group resolving algorithms for calculating the equivalent resistance between the nodes cannot satisfy the restrict of both memory space and running time simultaneously
摘要由於存儲晶元版圖p / g網規模的巨大，對于計算電阻網路中節點間等效電阻問題，直接利用常規線性方程組求解演算法無法同時滿足內存空間與運行時間上的限制。 -
Although the group communication uses ip multicast in network layer, it does not depend on multicast routing
雖然採用ipmulticast ，但是整個組通信層並不依賴于具體的路由協議。 -
So flexibility could be achieved, because when the routing algorithm changes, there is no need to redesign the group communication layer
這樣可以使系統有很好的適用性，使得網路層的路由策略改變時組通信層可以不做任何修改。 -
Provides keyboard routing for child controls and enables child controls to work as a group
為子控制項提供了鍵盤路由並使子控制項可以作為一個組進行工作。 -
Base class provides keyboard routing for child controls and enables child controls to work as a group
為子控制項提供了鍵盤路由並使子控制項可以作為一個組進行工作。 -
In the paper, an automatic macro - cell routing system, which bases on the architecture of three levels : chip, macro - cell and transistor group, is discussed
本文基於晶元、宏單元、晶體管群三級的層次化架構，實現了一個宏單元自動布線系統。 -
Based on the mfc ( multicast forwarding cache ) formed by multicast protocol such as dvmrp ( distance vector multicast routing protocol ), pim ( protocol independent multicast ), we can build special lsp ( lable switch path ) for certain source group couple to transport multicast data flow using ldp ( lable distribute protocol ) or cr - ldp. based on the zxb10 switching router of zte co. we can now support dvmrp within the context of mpls networks
本文主要研究mpls網路對ip組播業務的支持，根據現有的ip組播協議如dvmrp 、 pim等所生成的組播轉發表（轉發樹） ，利用mpls網路的ldp （標記分發協議） cr - ldp （顯式路由標記分發協議）為特定的源組對確立lsp （標記交換路徑） 。 -
First, the paper gives an overview on the basic theory of multicast, including multicast routing algorithms, multicast routing protocols and internet group management protocols. on the basis of this, a new algorithm of selecting multicast route was brought up, which applies in the case that there are only one multicast sender and many receivers. the algorithm is independent of the unicast routing protocol
首先，本文對組播技術的基礎理論，包括組播路由選擇演算法、組播路由協議和網際網路組管理協議等進行了綜述，在此基礎上，提出了一種新的組播路由選擇演算法，它適用於只有一個組播源的組播網路。 -
Tree construction is a commonly used approach in solving the multicast and group multicast routing problem
本文主要研究多播和群播路由演算法，即建立滿足各種業務服務質量需求的多播樹。 -
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
此外，本論文還研究了有帶寬預留機制的群播路由問題，給出了兩種有帶寬約束的群播路由演算法和一種帶有多個約束的群播路由演算法。 -
When the receiver wants to join in a multicast group, it sends a request message to the sender with a tcp connection. the request message gets to the sender and the sender answers for it with a confirmed message. during the confirmed message returning to the receiver, the router along the pass forms the multicast routing information according to the confirmed message
此組播路由選擇演算法與單播路由協議無關，它要求接收方在加入組播組時使用tcp連接直接向組播源發送加入組播組請求消息，組播源收到請求消息後向接收方發送請求確認消息，沿途的路由器則根據確認消息建立組播路由信息。 -
The ospf protocol was developed by the ospf working group of the internet engineering task force. it is a dynamic routing protocol based on link - state. ospf is classified as an interior gateway protocol ( igp ), it only processes the routing information in an autonomous system
Ospf是ietf （ internetengineeringtaskforce ）於1988年提出的一種基於鏈路狀態演算法的動態路由協議，它是用於自治系統內部的內部網關路由協議。 -
The thesis studies store and forward mechanism and redundant routing of message in first phase, and reliability algorithm based on object group in second phase, which includes active duplication algorithm and primary backup algorithm
論文研究了第一階段中消息的存儲-轉發機制以及消息的冗餘路徑方法，以及第二階段的基於對象組的可靠性演算法，包括主動復制演算法和主副本演算法。 -
One group of the non - franchised bus service, the residents bus services, operate in accordance with the approved routing, timetable and stopping places under passenger service licences issued by the transport department
巴士屬其中一類非專利巴士，須獲運輸署簽發客運牌照及按照獲批的行車路線、時間表和上落客地點經營。 -
In order to verify the validity of our algorithms, we proposed a network simulation model for any - cast routing algorithms with incomplete network state information. we structure the topology of network, the capability of every link, produce the source / destination group nodes concerned in services
為驗證演算法的有效性，我們設計了網路模擬平臺，構造網路的拓撲結構及各條鏈路的容量，生成相關的服務源目的組節點。 -
One group of the non - franchised bus service, the residents ' bus services, operate in accordance with the approved routing, timetable and stopping places under passenger service licences issued by the transport department
屋巴士屬其中一類非專利巴士，須獲運輸署簽發客運牌照及按照獲批的行車路線、時間表和上落客地點經營。 -
Grouping nodes into groups dynamically, a group - based routing scheme for the partially connected network was introduced
摘要通過對網路節點進行組劃分，提出了一種適用於部分連接網路的路由機制。
分享友人