TW462167B - Communications network and method of routing messages within the network - Google Patents
Communications network and method of routing messages within the network Download PDFInfo
- Publication number
- TW462167B TW462167B TW088120779A TW88120779A TW462167B TW 462167 B TW462167 B TW 462167B TW 088120779 A TW088120779 A TW 088120779A TW 88120779 A TW88120779 A TW 88120779A TW 462167 B TW462167 B TW 462167B
- Authority
- TW
- Taiwan
- Prior art keywords
- node
- nodes
- queue
- identification code
- network
- Prior art date
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
Description
4 6 2 16 7 五、發明說明(1) 技術領域 本發明係關於一種包含伺服器單元之通訊網路,用以傳 送訊息於眾多具有獨特識別碼之節點間β本發明亦和通訊 網路内對訊息排定路由之方法相關。 技術背景 舉例而言,於一封包交換的網路内,訊息封包的傳送是 由傳出節點經過眾多中介節點才到達目的節點。此種作業 的基本問題為如何縮短傳輸及接收節點間之傳輸路徑長度 ,亦即為最短路徑問題。理論上對此問題之最佳解為迪斯 特拉(D j 1 kstra )之演算法。然而’此種理想化之數學解決 方法並不能以其理論形式被實際應用。 ,期,術之解決方案包含了使用分散式路由樹資訊,其 每節點皆有一代表連接到所有相連節點的最短路徑之 =由樹,請參閱美國專利第4. 987. 536號。其它解決方案 =含中央路徑決定節點,請參閱美國專利第5.608.721 號。平先技術所提供的解決方案並不是十分具有成本效益 發明概要 早向或雙向網路内之任一節點到 路徑’而且每一節點所儲存之資 本發明主要目的係從一 另—*饪意節點間找出最短 訊是最少的。 解決方案4 6 2 16 7 V. Description of the Invention (1) Technical Field The present invention relates to a communication network including a server unit for transmitting messages between a plurality of nodes having unique identification codes. The present invention also relates to messages in the communication network. The method of routing is related. Technical Background For example, in a packet-switched network, message packets are transmitted by the outgoing node through a number of intermediary nodes before reaching the destination node. The basic problem of this operation is how to shorten the transmission path length between the transmitting and receiving nodes, that is, the shortest path problem. The theoretically best solution to this problem is the algorithm of Dj 1 kstra. However, such an idealized mathematical solution cannot be practically applied in its theoretical form. In the future, the technical solution includes the use of distributed routing tree information, each node of which has a = routing tree representing the shortest path connected to all connected nodes, see US Patent No. 4.987. 536. Other solutions = with central path decision node, see US Patent No. 5.608.721. The solutions provided by Pingxian technology are not very cost-effective. Summary of the invention Early or bidirectional network to any node to the path ', and the main purpose of the invention of the capital stored in each node is to change from one to the other-a cooking node Finding the shortest message is the least. solution
4 6 2 16 7 五、發明說明(2) - ----- 儲i於一列表中;第二儲存襄置則包含-資料攔以 η:節點之識別碼;第三错存裝置則位於中央單元中 用以形成一暫存彳宁列, 在本通訊網路的呈器音地办,& Μ _ 扪,、雔實施例來說’第二儲存裝置的資料 列’此陣列可對網路内節點進行索引,該 陣網路内之節點數目是成比例的而且其十每 一格位疋故計成可儲存單一節點之識別碼。 群在點間之距離可用- 述之距離是成比例的。些虛擬節點的數目和上4 6 2 16 7 V. Description of the invention (2)------ Store i in a list; the second store contains-data block η: node identification code; the third misstore device is located at The central unit is used to form a temporary storage queue, which is presented in the renderer of this communication network. &Amp; Μ 扪 雔, 雔 In the embodiment, the data row of the second storage device. This array can be connected to the network. The nodes in the road are indexed. The number of nodes in the array network is proportional and each of its ten bits is counted as an identification code that can store a single node. The distance between groups of points is available-the stated distances are proportional. And the number of virtual nodes
另外,兩節點間之傳輪負蕃可‘ M &主得钶貞由一群假設的虛擬節點所 代表,其卡虛擬卽點數目和傳輪負載是成比例的。 本方法於通訊網路内對訊息排定路由以將訊息傳輸於具 有獨特識別碼之眾多節點間’並計算第一節點及第二節點 之最短路徑,其特徵為下列步輝,包括形成一個所有盘 第-節點有關之相鄰節點識別碼之列表,冑第二節點之墦 別碼置入-佇列中,將一終止指令寫入一資料欄以 第 二節點之身份’選取Η前端之節點,並將該節點之識= 碑寫入和其相鄰所有節點之資料攔内,除非該資料 錄過該識別瑪,每當有一肇記錄將寫入一節點之資 ,則將該節點之識別竭置入仔列内,將佇列前端之Ζ時 識別瑪移出’在造訪過由該節點之所有相鄰節點所'的 列表的所有節點後’重覆以下步驟,包括選取佇列中=j 端節點之識別碼並將其識別碼寫入其所有相鄰節點=别 • 貝料 五、發明說明(3) ~~" - — 欄内,直到所造訪的節點為第一節點為止。 上述做法的好處是可檢查網路中和某一節點不相連的節 點。 、值得一提的是,該檢查方法步驟包含了將該節點(η)之 識別碼置入一佇列0,並且標註該節點,選取佇列前端節 點並標註其未曾標註之相鄰節點,每一次當一個新節點之 ,別=受,註之後,該節點將置人於仔列内,在完成造訪 佇列前,節點之所有相鄰節點的識別碼列表中所有節點之 後,該節點即自佇列移出並置入一集合内,重覆自佇列前 端選取節點及標示其未曾註記之相鄰節點之步驟,直到件 列已空,並將所產生之集合自與該節點有關之所有節點所 成集合中減去,其結果即為和前述節點不相連通之節點集 合。 一種於通訊網路内對訊息排定路由的方法,用以於眾多 具有獨特識別碼之節點間傳送訊息,並計算網路内任何兩 節點間之最短路徑,其特徵步驟包括,形成一個由和任— 直接傳送到該節點相鄰之所有節點的識別碼所組成之列表 ,將該節點之識別瑀置入一佇列’對此節點寫入一停止指 令於一可對網路内所有節點識別碼之註記進行索引之陣列 資料襴,將件列前端之節點取出並將其識別碼寫入其所有 相鄰節點之資料欄内,除非此資料欄已經記錄過,每當有 一筆記錄寫入一節點之資料欄時,則將所造訪之節點的識 別碼置入佇列中,將佇列前端之節點識別碼移出’在完成 造訪該節點之所有相鄰節點之列表内所有節點後’重覆下In addition, the negative transference between the two nodes can be represented by a group of hypothetical virtual nodes. The number of virtual transfer points in the card is proportional to the transfer load. The method routes messages in a communication network to transmit messages between nodes with unique identification codes and calculates the shortest path between the first node and the second node. It is characterized by the following steps, including forming an all-disk A list of the adjacent node identification codes related to the first node, the second node ’s unique code is placed in the-queue, a termination instruction is written into a data column to identify the second node as the second node, And write the node's identity = the inscription and the data block of all its adjacent nodes, unless the data is recorded in the identification, whenever there is a record will be written in the node's capital, the identification of the node is exhausted Place it in the queue and move the Z in front of the queue out of the 'After visiting all nodes in the list by all adjacent nodes of that node' repeat the following steps, including selecting the queue = j end Node identification code and write its identification code to all its adjacent nodes = Be • Material 5. Inventory (3) ~~ "--column, until the node visited is the first node. The advantage of the above method is to check the nodes in the network that are not connected to a certain node. It is worth mentioning that the step of the inspection method includes placing the identification code of the node (η) in a queue of 0 and labeling the node, selecting the front-end node of the queue and labeling its adjacent nodes that have not been labeled. Once when a new node, do n’t = accept, after the note, the node will be placed in the queue. After completing the visit to the queue, after all the nodes in the identifier list of all adjacent nodes of the node, the node will The queue is removed and placed into a collection, repeating the steps of selecting nodes from the front of the queue and marking adjacent nodes that have not been annotated until the list is empty, and the generated collection is from all nodes related to the node Subtracting the resulting set, the result is a set of nodes that are not connected to the aforementioned nodes. A method for routing messages in a communication network. It is used to send messages between many nodes with unique identification codes and calculate the shortest path between any two nodes in the network. Its characteristic steps include forming a routing and routing task. — A list of identification codes that are directly transmitted to all nodes adjacent to the node, and put the identification of the node into a queue. 'Write a stop command to this node to an identification code for all nodes in the network. Note the array data for indexing. Take the node at the front of the list and write its identification code in the column of all its adjacent nodes, unless this column has been recorded, whenever a record is written to a node In the data column, the ID of the visited node is placed in the queue, and the node ID at the front of the queue is moved out of 'After all nodes in the list of all adjacent nodes of the node are visited,' it is repeated.
第7頁 4 6 2 1 67 五、發明說明(4) 列步驟,包括將佇列前端節點識別碼取出並將其識別碼寫 入所有相鄰節點之資料攔内,直到佇列已空,再對網路内 所有節點重覆上述步驟。 上述做法的好處是,可檢查網路内某一節點是否和其它 節點相連通。 值得一提的是,該檢查方法步驟包含:將該節點之識別 碼置入一佇列並且標註該節點,將佇列前端節點取出並標 註其未曾標註之相鄰節點1每一次當標註一新節點之識別 碼時,該新節點將置入佇列中,於完成造訪佇列前端之該 節點的所有相鄰節點識別碼之列表内之所有節點後,該節 點將自佇列中取出並置入一集合内,選取重覆上述取出佇 列前端節點並且標註其未曾標註之相鄰節點,直到佇列已 空,並且將所產生之集合自與該節點相關之所有節點所成 之集合中減去,其結果為和該節點不連通之節點集合。 圖式概述 本發明將於下文中參考所附圖式以非限定方式行更深入 說明,其中: 圖1係依據本發明所計算出任一節點至另一節點之最短 路徑示意圖; 圖2顯示依據圖1於計算路徑時所使用之佇列。 圖3以圖式說明所計算出任二節點間之最短路徑;以及 圖4為流程圖,說明用以計算從網路内所有節點至一節 點η之最短徑。 本發明之詳述Page 7 4 6 2 1 67 V. Description of the invention (4) The steps include the steps of taking out the front-end node identification code and writing its identification code into the data bar of all adjacent nodes until the queue is empty, and then Repeat for all nodes in the network. The advantage of the above method is that you can check whether a node in the network is connected to other nodes. It is worth mentioning that the steps of the inspection method include: placing the node's identification code in a queue and labeling the node, taking out the front-end node of the queue and labeling its unlabeled neighboring node 1 each time a new label is marked. When the node's identification code is reached, the new node will be placed in the queue. After all nodes in the list of all adjacent node identification codes of the node at the front of the queue have been visited, the node will be taken out of the queue and placed. Into a set, select and repeat the above-mentioned take-out front-end nodes and mark the adjacent nodes that have not been marked until the queue is empty, and subtract the generated set from the set made by all nodes related to the node. The result is a set of nodes that are not connected to the node. BRIEF DESCRIPTION OF THE DRAWINGS The present invention will be explained in more detail in a non-limiting manner with reference to the attached drawings, in which: FIG. 1 is a schematic diagram of the shortest path calculated from any node to another node according to the present invention; 1The queue used when calculating the path. Figure 3 illustrates the calculated shortest path between any two nodes graphically; and Figure 4 is a flowchart illustrating the calculation of the shortest path from all nodes in the network to a node η. Detailed description of the invention
462167 五、發明說明(5) 本發明之目的在於雙向網路内找出從任一節點nl到另一 任意節點η 2之最短路徑。 每一節點必須保有下列資訊: •一個由一節點1其所有相鄰節點所組成之"鄰居列表" ,此列表會被輸入至演算法中,每一節點必須有自己的列 表。 •一個用以註記節點識別碼”向目標前進"攔位之資料攔 2,此資料欄將為演算法所填寫,並且將包含路由所需之 資訊。每一節點必須有屬於自己的資料攔内容。 一伺服器單元維持一 π佇列"3,該佇列為一暫存佇列, 並在演算法執行完成後,予以刪除。 本演算法用以計算從點η 1到節點η 2之最短路徑包含下列 步驟: •步驟1 :將η2(非nl )置入佇列3。寫入一停止指令,即 符號”,於節點n2之π向目標前進''欄位内。 •步驟2 :選取佇列前端之節點,並且將該節點之識別 碼寫入和其相鄰所有節點(即其鄰居列表内之節點)之”向 目標前進”欄位列表内,其寫入條件為該節點必須未曾被 寫入過。如果該節點已被寫入過,則不可重覆寫入。如果 所造訪之節點為η 1,則演算法結束。如果佇列已空,而節 點η 1未被造訪,則代表節點η 1和η 2是不相連通的。 •步驟3 :每一次吾人寫入(也只有吾人能寫入)節點之” 向目標前進'’攔位内時,將該節點置入佇列3 ^ •步驟4 :在完成造訪該節點之”鄰居列表"内所有節點462167 V. Description of the invention (5) The purpose of the present invention is to find the shortest path from any node n1 to another arbitrary node η 2 in a two-way network. Each node must keep the following information: • A "neighbor list" consisting of a node 1 and all its neighbors. This list will be entered into the algorithm. Each node must have its own list. • A data block 2 used to annotate the node identifier "forward to the target" block. This column will be filled in by the algorithm and will contain the information required for routing. Each node must have its own data block Contents. A server unit maintains a π queue " 3, this queue is a temporary storage queue, and will be deleted after the execution of the algorithm is completed. This algorithm is used to calculate from point η 1 to node η 2 The shortest path includes the following steps: • Step 1: Put η2 (not nl) into queue 3. Write a stop instruction, that is, the symbol ", advance to the target at π of node n2" field. • Step 2: Select the node at the front of the queue, and write the identification code of the node and all its adjacent nodes (that is, the nodes in its neighbor list) into the "Go To Target" field list, and write the conditions For this node must have never been written. If the node has already been written, it cannot be written repeatedly. If the visited node is η 1, the algorithm ends. If the queue is empty and node η 1 is not visited, it means that nodes η 1 and η 2 are not connected. • Step 3: Every time we write (and only we can write) to the node's "forward to target" stop, put the node in queue 3 ^ • Step 4: After completing the visit to the node " Neighbor List " All Nodes
第9頁 462167 五、發明說明(6) ------ 後’將該節點自佇列中取出。 •步驟5 :進行步驟2。 •結束 當演算法已執行結束,從節點“行進到節點n2之最短路 徑為: •前進至由節點〇1之',向目標前進11欄位2所指示之節點1 □ •持讀相同方式直到吾人到達節點n2。 上述所描述之演算法實際上將該網路之圖形表示法轉換 成以目的地節點為根部之樹狀模組,此由圖形所轉換而來 之樹是最矮的(最短的)。m顯示了在計#從節點i到節點 8之最·短路授後,演算法所產生之結果。圖2顯示了用以求 出該最短路徑之處理過程中所使用之佇列。 本廣算法亦可用於檢視所有和節點n不相連通之節點。 每一次當自佇列取出一節點後’該節點必須置入一"已 訪節點"集合: .步驟丨:將節點η置於佇列3並且標記該節點。 •步,2 ,選取該佇列前端節點,並且標註其未曾標註 之相鄰節點。 .步驟3 .每一次當標註新節點時,即將其置入佇列中 〇 •步驟4 .在完成造訪該節點(於佇列前端)之"鄰居列表 "内所有節點後,將該節點取出至,,已造訪節 .步驟5 :進行步驟2直到仔列3已空點集°Page 9 462167 V. Description of the invention (6) ------ After ’the node is taken out of the queue. • Step 5: Go to step 2. • End When the algorithm has been executed, the shortest path from node “to node n2 is: • Go to node 01 ′, and go to node 1 indicated by column 2 in the target □ • Keep reading the same way until I reach node n2. The algorithm described above actually transforms the graphical representation of the network into a tree-like module with the destination node as the root. The tree transformed from the graph is the shortest (shortest (M) shows the results produced by the algorithm after the shortest pass from node i to node 8. Figure 2 shows the queue used in the process to find the shortest path. This algorithm can also be used to view all nodes that are not connected to node n. Each time when a node is taken out of the queue, 'the node must be placed in a " visited node " set: Step 丨: Node η Place it in queue 3 and mark the node. • Step 2. Select the front-end node of the queue and mark the adjacent nodes that it has not yet marked. Step 3. Each time you mark a new node, put it in the queue. 〇 • Step 4. After completing the manufacturing The node (on the front end of queue) of " neighbor list " after all the nodes, the node to remove the section ,, have visited Step 5: Step 2 Aberdeen column 3 until point set is empty °.
4 62 16 7 五、發明說明(7) •結束。 當本演算法執行完成時,將節 立” 口 :生兮銘朴雀人"甘认郎點n所知之所有節點減去 其已造汸知點集合"’其結果即爲釦餡机 ^ 點集合。 丨马和知點η不相連通之節 當一節點欲傳送一訊息至目標銪 椹古s ^ , L , 孫知點(圖1節點8 ),此根節 點僅有早一路徑往上溯,此路穫真 呀让马取短路徑,如圖1 : 第一節點n8被置於根部(將該節 铋胧铲科j班从a狄 x郎點置放於件列前端)’然 後將即點n4置放於節點n8下方,n4i?LaA , ,„ . 々n4為唯一可能的選擇(將 宁Γ節點n8之後),然後依次將節點“乂 = 下方(依序置於仵列内),最後,將節點 nj放5於郎點η6下方’並將節福放置於節點心下方(將 ::”置於佇列内)。#此一來,從節點以到節點⑽之最 短路徑為:η 1到η 5到η 3到η 4到η 8。 本發明亦可以最少資訊於一雙向網路中求得從任一個 點111到另一任意節點η2間之最短路徑。 每一節點應包含下列資訊: ★ •一個節點其所有相鄰節點所組成之"鄰居列表”,所 節點之"鄰居列表”描繪了該網路之拓撲。此列表輸入至演 算法,每一節點必須有一屬於自己的列表内容。 •一個"向目標前進"陣列資料攔4用以對網路内所有節 點註記進行索引。該陣列之大小應為Ν。於該陣列中每一 格位5必須有足夠空間以儲存一節點1之識別碼(例如一数 目字),例:整數之陣列[1 ...Ν ]。此資料攔將為演算法所 填寫並且將只包含為路由所需之資訊。每一節點必須有屬4 62 16 7 V. Description of Invention (7) • End. When the implementation of this algorithm is completed, it will be "Mouth: All the nodes known by Gan Minglang Queren" minus its set of known knowledge points ", and the result is the stuffing Machine ^ point set. 丨 Horse and knowing point η are not connected. When a node wants to send a message to the target 铕 椹 ^, L, Sun knowing point (node 8 in Figure 1), this root node is only one earlier. The path goes back up. This path is true. Let the horse take a short path, as shown in Figure 1: The first node n8 is placed at the root (the section of the bismuth shovel branch J is placed from the point A to the point X). 'Then point n4 is placed under node n8, n4i? LaA ,, .... 々n4 is the only possible choice (after Ning Γ node n8), and then the node "乂 = below (in order 仵In the column), finally, place the node nj 5 below the Lang point η6 'and place the knot blessing below the node center (place :: "in the queue). #Then, the shortest path from node to node ⑽ is: η 1 to η 5 to η 3 to η 4 to η 8. The present invention can also find the shortest path from any point 111 to another arbitrary node η2 in a two-way network with minimum information. Each node should contain the following information: • A node's "neighbor list" consisting of all its neighboring nodes, and the "neighbor list" of all nodes depicts the topology of the network. This list is entered into the algorithm, and each node must have its own list content. • A "forward to the target" array data block 4 is used to index all node notes in the network. The size of the array should be N. There must be enough space for each grid 5 in the array to store the identification code of a node 1 (such as a number), for example: an array of integers [1 ... N]. This data block will be filled by the algorithm and will only contain the information needed for routing. Each node must have a property
第U頁 4 6 2 1 6 7 五、發明說明(8) 於自己的資料攔。 一個伺服器單元維持一 ”佇列"3,該佇列為暫存佇列, 將於演算法執行完成後被刪除。 圖4說明了本演算法用於計算一網路内所有節點對之最 短路徑,而且對每一節點η(η=1 *··Ν)包含了下列步驟: •步驟1 :放置η於佇列中,寫入一停止指令,即符號 Μ - ”於該節點之”向目標前進[η ]"欄位内。 •步驟2 :選取佇列前端之節點並將其識別碼寫入其所 有相鄰節點(於其鄰居列表内之節點)之"向目標前進[η ]π 列表内,其寫入條件必須為該格位未曾寫入。若該格位已 有寫入資料,則不可重覆寫入。 •步驟3 :每一次當吾人造訪一節點並寫入(也只有寫入 )該節點之”向目標前進[η]"欄位時,將該已造訪之節點識 別瑪置於彳宁列内。 •步驟4 :在完成造訪該節點”鄰居列表π之所有節點後 ,將其自佇列中移除。 .步驟5 :如果佇列已空,節點η已完成,否則進行步驟 2。 .結束。 *)於圖4中,”未曾造訪”該詞表示一節點其”向目標前進 [η Γ未曾寫入過,其中η代表置入佇列之第一個節點。 所產生之内迴圈為從所有節點到節點η之最短路徑。所 產生之外迴圈為所有節點到所有其它節點之最短路徑。當 演算法執行完成,並且網路資訊已進行更新,以取得從節Page U 4 6 2 1 6 7 V. Description of the invention (8) In his own data block. A server unit maintains a "queue" 3, which is a temporary queue and will be deleted after the algorithm is executed. Figure 4 illustrates that the algorithm is used to calculate all nodes in a network. The shortest path, and each node η (η = 1 * ·· N) contains the following steps: • Step 1: Place η in the queue and write a stop instruction, that is, the symbol M-"in the node" Go to the target [η] in the field. • Step 2: Select the node at the front of the queue and write its identification code to all of its neighboring nodes (nodes in its neighbor list). η] π In the list, the write condition must be that the grid has not been written. If the grid has written data, it cannot be written repeatedly. • Step 3: Every time I visit a node and write (Only write) When the "Go Forward to Target" field of the node, place the visited node identifier in the Suining column. • Step 4: After all nodes of the node's neighbor list π have been visited, remove them from the queue. Step 5: If the queue is empty, node η is completed, otherwise go to step 2. End. *) In Figure 4, the word "unvisited" means a node which "goes forward to the target [η Γ has not been written, where η represents the first node placed in the queue. The resulting inner loop is the shortest path from all nodes to node n. The resulting outer loop is the shortest path from all nodes to all other nodes. When the algorithm is completed and the network information has been updated to obtain
第12頁 462167Page 12 462167
點n 1到節點η 2之最短路徑時: •讀取節點nl之"向目標前進”攔位[η2],並稱其為ρ。 ,前進至ρ,然後造訪其”向目標前進”襴位[η2]並持 相同步驟直到節點η2已到達。節點[η2]之"向目標前’ 位[η2]之内容為符號”。 爛 當在内迴圈時,將計算到一節點丨之最短路徑,吾人 可檢視是否該節點和所有其它節點(這些節點必須是詼 點所知悉的)相連通。為達此目的,每一次當一節點^ 列中移出時,該節點必須移入至一集合内。當演算法' 點η的部份已執行完成,將節所知悉的所有節點隼厶節 前述集合相減,其產出將為一和節+相連通之節點0和 合。 ·,乘 圖3顯示了演算法在完成更新所有節點’,向目標 位列表後所產生之結果, 姻 資訊被傳遞的同時,每一節點僅需保存最少之 向目標前進”欄位區或列表)^上述演算法所使用成於” 佳化的,和迪斯特拉以計算圖中兩=最 路徑之演算法相同。演算法總能夠結束執行。 Μ 皆:i述演算法中,其假設條件為所有相鄰節點間之趣離 鏈結上之負載可被解釋為兩相鄰節點(位於鏈結之 間之長度。低負載可解釋為節點間之距離較短,則 長。 & <則与 j Q人可 藉由假設一群虛擬節點於每一對實體節點When the shortest path from the point n 1 to the node η 2 is: • Read the node nl's "forward to the target" block [η2] and call it ρ., Advance to ρ, and then visit its "forward to the target" 襕Bit [η2] holds the same steps until node η2 has been reached. "The content of bit [η2] before the target of node [η2] is a sign". When the inner loop, the shortest path to a node will be calculated. We can check whether this node is connected to all other nodes (these nodes must be known by 诙). To achieve this, each time a node is removed from the column, the node must be moved into a collection. When the part of the algorithm 'point η has been executed, all the nodes known by the node will be subtracted from the previous set, and the output will be a sum node + connected node 0 union. · Figure 3 shows the results of the algorithm after updating all nodes' to the target bit list. While the marriage information is being transmitted, each node only needs to save a minimum of moving forward to the target "field area or list. ) ^ The above algorithm is used in "optimization", and is the same as Distra's algorithm in the calculation of the two = most path. Algorithms always end execution. Μ are: i. In the performance algorithm, the assumption is that the load on the interesting link between all adjacent nodes can be interpreted as two adjacent nodes (the length between the links. Low load can be interpreted as between nodes The shorter the distance is, the longer it is. &Amp; < The person with j Q can assume a group of virtual nodes at each pair of physical nodes.
第13頁 462167 五、發明說明(ίο) 因此於演算法内考量兩節點間不同距離的情況,虛擬節點 則取决於兩節點間之距離。舉例而言,如果節點1和節點5 之距離為3公尺,吾人則可假設有兩個虛擬節點(稱為節點 1 5 1及節點1 52 )位於其間。一旦這些虛擬節點(代表任兩相 鄰節點間之距離)已置入圖中’演算法即能以—般情況執 行。唯一不同的是每一節點之”向目標前進”欄位必須依據 和所指定虛擬節點最鄰近之實體節點的識別碼進行更新。 當資料結構完成時,為計算目的而產生之虛擬節點資料將 不會為人所知。 即使一般而言網路為雙向,本演算法在經過一些修改後 亦能適用於單向圈形。不同點在於一單向圖内之節點可能 不知道那些節點直接傳向它,該節點可能僅知它直 那些節點(如上述之"相鄰列表',)。 馬了克服此問題,一個稱為"直接傳送到我列表"之 將附於每-節點内。此陣列包含了所有直接傳 之所有相鄰節點之識別妈。於演算法執行完成[如:: 有任何其它保留的理由,此陣列可被移除。該陣列 :從附於網路節點之”鄰居列表"計算而來,如下列演算= •開始 •步驟1 :將任一節點置入佇列。 •步驟2 :選取端節點(節點n)並且 (〇置入其所直接傳送(在其1居列表" 節點”直接傳送到列表"内。每一次去一 r上士)之所有 人田 卽點之丨,直接傳送Page 13 462167 V. Description of the Invention (ίο) Therefore, considering the different distances between two nodes in the algorithm, the virtual node depends on the distance between the two nodes. For example, if the distance between node 1 and node 5 is 3 meters, we can assume that there are two virtual nodes (called nodes 1 51 and 1 52) in between. Once these virtual nodes (representing the distance between any two adjacent nodes) have been placed in the graph, the 'algorithm can be executed in the normal situation. The only difference is that the "Forward" field of each node must be updated according to the identifier of the physical node closest to the specified virtual node. When the data structure is completed, the virtual node data generated for calculation purposes will not be known. Even though the network is bidirectional in general, the algorithm can be applied to unidirectional circles with some modifications. The difference is that the nodes in a unidirectional graph may not know which nodes are directly passed to it, and the node may only know which nodes it is straight (as in the " adjacent list ', above). To overcome this problem, one called " direct to my list " will be attached to each node. This array contains the identification moms of all neighboring nodes that are directly passed. This array can be removed after the algorithm execution is completed [eg: for any other reason for retention. The array: calculated from the "neighbor list" attached to the network nodes, such as the following calculation = • Start • Step 1: Place any node in the queue. • Step 2: Select the end node (node n) and (〇 Put it in the direct transmission (in its 1-home list " node " directly into the list ". Every time you go to a sergeant) Tian Tiandian, direct transmission
4 6 2 1 6 7 案號 88120779 年仝月i曰 修正 五'發明說明(11) 我列表"進行更新時,檢查該節點是否未曾標註。如果 曾標註,則標註該節點並將其置入佇列後端(如果該節 先前曾標註過,則不可將其置入佇列内)。 •步驟3 :將節點η從佇列中移除,如果佇列未空,則執 步驟2。 •結束。 在此演算法執行完成後,圖内每一節點將擁有那些節點 接傳送到該節點之資訊("直接傳送到我列表")。一旦圖 該等節點的''直接傳送到我列表"已計算完成,則於一單 圖内所有節點之最短路徑可以引用同於雙向網路情況之 算法予以求出,而唯一不同點在於單向網路使用"直接 送到我列表"而不是雙向網路内之"鄰居列表”。 可以確定的是,本發明當然不僅限於上述特別具體實施 ^例,因本發明可在所附申請專利範圍内進行各項改變。 元件符號說明 1 節點 2 資料攔 3 暫存佇列 4 陣列 5 格位 到 未 點 行 直 内 向 增煩演 正請值 |委得 % A 否 准 子 修 正. f >1 3 所 提 之4 6 2 1 6 7 Case No. 88120779 Same month i. Amendment Five 'invention description (11) My list " When updating, check whether the node has not been marked. If it was annotated, label the node and place it in the back end of the queue (if the section was previously annotated, it cannot be placed in the queue). • Step 3: Remove node η from the queue. If the queue is not empty, go to step 2. •End. After the execution of this algorithm is completed, each node in the graph will have the information that those nodes send to that node (" directly sent to my list "). Once the `` direct transmission to my list '' of these nodes in the graph has been calculated, the shortest path of all nodes in a single graph can be obtained by referring to the same algorithm as the two-way network case. The only difference is that the Use "quote directly to my list" instead of "neighbor list in a two-way network" to the network. It is certain that the present invention is not limited to the above specific embodiments, as the present invention can be Various changes are made within the scope of the patent application. Component symbol description 1 Node 2 Data block 3 Temporary queue 4 Array 5 cells to the un-pointed row inward increase the annoyance | | > 1 3 mentioned
O:\61\61547.ptc 第15頁 2001,05.02.015O: \ 61 \ 61547.ptc Page 15 2001,05.02.015
Claims (1)
Applications Claiming Priority (3)
Application Number | Priority Date | Filing Date | Title |
---|---|---|---|
SE9803869A SE514727C2 (en) | 1998-11-12 | 1998-11-12 | Communication networks and procedure for routing messages within the network |
PCT/SE1999/002035 WO2000030305A2 (en) | 1998-11-12 | 1999-11-10 | Communications network and method of routing messages within the network |
AR9905766 | 1999-11-12 |
Publications (1)
Publication Number | Publication Date |
---|---|
TW462167B true TW462167B (en) | 2001-11-01 |
Family
ID=25590840
Family Applications (1)
Application Number | Title | Priority Date | Filing Date |
---|---|---|---|
TW088120779A TW462167B (en) | 1998-11-12 | 1999-11-29 | Communications network and method of routing messages within the network |
Country Status (1)
Country | Link |
---|---|
TW (1) | TW462167B (en) |
-
1999
- 1999-11-29 TW TW088120779A patent/TW462167B/en not_active IP Right Cessation
Similar Documents
Publication | Publication Date | Title |
---|---|---|
Dijkstra | A note on two problems in connexion with graphs | |
US7499413B2 (en) | Method for designating communication paths in a network | |
US20130282578A1 (en) | Computer-based collective intelligence recommendations for transaction review | |
CN101507191A (en) | Recursively partioned static ip router tables | |
WO2020062842A1 (en) | Blockchain transaction data processing method and apparatus, and terminal device | |
CN113220685B (en) | Traversal method and device for intelligent contract storage content and electronic equipment | |
CN103986661B (en) | A kind of multicast route method for supporting network code | |
US20140328212A1 (en) | Method for Efficiently Retrieving Topology-Specific Data for Point-to-Point Networks | |
CN108614837A (en) | File stores and the method and device of retrieval | |
CN101453428B (en) | Method and equipment for mail history customization | |
JP5108956B2 (en) | Route calculation order determination method, program, and calculation apparatus | |
TW462167B (en) | Communications network and method of routing messages within the network | |
CN104915148A (en) | System and method for efficient content caching in a streaming storage | |
JP2001165681A (en) | Traffic network route searing method | |
US7152113B2 (en) | Efficient system and method of node and link insertion for deadlock-free routing on arbitrary topologies | |
CN114706848A (en) | Block chain data storage, updating and reading method and device and electronic equipment | |
CN104869044B (en) | A kind of virtual net mapping method and device | |
RU2010104017A (en) | FITNESS-BASED ROUTING | |
CN107291746A (en) | A kind of method and apparatus for storing and reading data | |
US6674757B1 (en) | Communications network and method of routing messages within the network | |
JP2007189337A (en) | Spare transfer path reservation method | |
CN108596389A (en) | Power concentrator intelligent meter reading method based on ant group algorithm | |
CN114144775A (en) | General ledger verifiable pruning system | |
JPH01272248A (en) | Network constitution data holding system | |
AU694526B2 (en) | Method for storing analysis data in a telephone exchange |
Legal Events
Date | Code | Title | Description |
---|---|---|---|
GD4A | Issue of patent certificate for granted invention patent | ||
MM4A | Annulment or lapse of patent due to non-payment of fees |