201101747 六、發明說明 【發明所屬之技術領域】 本發明關於資料傳輸技術領域’特別是關於一·種鍵式 資料傳輸方法、節點及系統。 【先前技術】 隨著網際網路技術的發展，網路中的任意兩台設備之 Ο 間都可以通過資料傳輸實現資源分享。在實際應用中，我 們經常會遇到需要將一台設備上的資料向多台設備進行複 製的情況，現有技術中，常用的方法是由資料源所在設備 向目標設備逐台複製資料。這種方法不但操作麻煩，而且 每次複製過程都需要佔用源設備與當前目標設備之間的帶 寬。特別是當目標設備與源設備處於不同網段、並且目標 設備均處於相同網段時，這種複製方法顯然不利於節約寶 貴的網間帶寬資源。 〇 P2P ( peer-to-peer，點對點）技術是一種目前比較流 行的資料傳輸方式，在P2P中，每個目標設備在接收資料 的同時，.還會將所接收到的資料提供給其他目標設備，這 就將原本閒置的目標設備之間的帶寬利用起來。如果將 P2P技術應用到上述場景，可以有效利用目標設備之間的 網內帶寬，從而減少網間帶寬上的資料傳輸量，達到節約 網間帶寬資源的目的。 在實現本發明的過程中，發明人發現現有技術中至少 存在如下問題：在目前的P2P應用中，每個設備都可以對 201101747 自身的發送及接收（包括速率、目標設備數量等）進行控 制，但是P 2 P的傳輸機制使得我們無法在某個設備上實現 對整個網路資料傳輸的統一控制。當資料傳輸量較大時， 很可能導致網路風暴，造成網路癱瘓。 而我們前面所描述的應用場景，其資料傳輸是由源設 備發起，根據傳輸資料量以及目標設備數量的變化，需要 在源設備（或某一個目標設備）上對整個網路資料傳輸進 行統一控制，而其他目標設備可以僅用於被動接收資料， 這種需求是P2P技術所無法實現的。 【發明內容】 有鑒於此’本發明提供了一種鏈式資料傳輸方法、節 點及系統，以實現在單一設備上對整個網路的資料傳輸進 行統一控制，技術方案如下： 本發明提供一種鏈式資料傳輸方法，包括：在節點建 立樹形連接關係之後， 節點進行待傳輸資料的接收； 如果接收到該傳輸資料的當前節點有子節點，則該當 則節點將該待傳輸資料發送至所有該子節點中的一個子節 點；及， 如果接收到該傳輸資料的當前節點有還未獲得過該待 傳輸資料的兄弟節點，則該當前節點將該待傳輸資料發送 至所有該兄弟節點中的一個兄弟節點。 本發明還提供一種鏈式資料傳輸節點，包括： -6- 201101747 接收單元，用於接收待傳輸資料； 發送單元，用於當該鏈式資料傳輸節點有子節點時， . 將該接收單元所接收的待傳輸資料發送至該鏈式資料傳輸 節點的所有該子節點中的一個子節點；及，當該鏈式資料 傳輸節點有還未獲得過該待傳輸資料的兄弟節點時，將該 接收單元所接收的待傳輸資料發送至所有該兄弟節點中的 一個兄弟節點。 Ο 本發明還提供一種鏈式資料傳輸系統，該系統包括一 個資料源節點及至少一個資料目標節點，資料源節點與資 料目標節點建立樹形連接關係，資料目標節點爲資料源節 點的後輩節點； 該資料源節點，用於將待傳輸資料發送至自身所有子 節點中的一個子節點； 該資料目標節點’用於接收待傳輸資料；當該資料目 標節點有子節點時，將所接收的待傳輸資料發送至自身所 〇 有子節點中的一個子節點；及’當該資料目標節點有還未 獲得過該待傳輸資料的兄弟節點時，將所接收的待傳輸資 料發送至所有該兄弟節點中的一個兄弟節點。 以上技術方案中’所有設備之間的資料均爲單向傳輸 ’如果將源設備作爲樹形結構的根節點，則源設備與目標 設備之間僅有一條資料通道，通過對這條資料通道傳輸的 控制’就可以實現對整個網路的資料傳輸進行統一控制。 此外’在一個父節點的多個子節點中，只有一個是從父節 點獲得資料’其他子節點依次從自己的上一個兄弟節點獲 201101747 得資料，适樣，只要將同一網段的設備相互設爲兄弟節點 ’就可以有效利用網內帶寬，節省網間帶寬。 【實施方式】 本發明所提供的技術方案’稱爲LCP ( Link Copy鏈 式複製）技術，下面首先對本發明所提供的鏈式資料傳輸 系統進行說明’本發明所提供的鏈式資料傳輸系統，包括 一個資料源節點及至少一個資料目標節點，資料源節點與 資料目標節點建立樹形連接關係’資料目標節點爲資料源 節點的後輩節點； 實施例一： 圖1所示爲本發明所提供的鏈式資料傳輸系統的一種 結構示意圖’其中，101爲資料源節點，iU_114爲資料 目標節點，圖中的節點間的細線代表節點之間所建立的連 接關係，可以看出：該系統爲兩層樹形結構，源節點1 〇 i 在樹形結構中處於父節點的位置，而目標節點ni〜114都 是101的子節點，由於111〜114具有相同的父節點101， 因此111〜114之間彼此互爲兄弟節點。 圖1中節點間的粗箭頭線示出了在該系統中的資料傳 輸情況，可以看出： 資料源節點1 0 1是將資料發送至自己的一個子節點（ 在圖1中所示爲111); 而資料目標節點1 1 1〜1 1 4，在接收資料之後，會將所 -8- 201101747 接收的資料發送至自己的一個兄弟節點，爲了避免資料重 複傳輸，該兄弟節點應該是還沒有獲得過待傳輸資料的。 圖中所示的資料傳輸路徑爲111 — 112 — 113 — 114，對於 1 1 4來說，接收到資料之後’此時自己所有的兄弟節點都 已經獲得過待傳輸資料，因此114不再執行發送動作，資 料傳輸中止。 〇 實施例二： 圖2所示爲本發明所提供的鏈式資料傳輸系統的另一 種結構示意圖，與圖1不同之處在於，該系統爲三層樹形 結構，源節點201在樹形結構中處於父節點的位置， 211〜115爲201的子節點，215〜115之間彼此互爲兄弟節 點：212a、212b爲212的子節點，212a及212b彼此互爲 兄弟節點；2 1 4a爲2 1 4的子節點。 由圖2中的粗箭頭線可以看出，擁有子節點的目標節 〇 點，在接收資料之後，除了會將所接收的資料發送至自己 的一個兄弟節點之外，還會將資料發送至自己的一個子節 點。例如，2 1 2會將資料發送至自己的一個兄弟節點2 1 3 及自己的一個子節點212a;而214會將資料發送至自己的 —個兄弟節點215及自己的一個子節點214a。 綜合實施例一及實施例二可以看出，在鏈式資料傳輸 系統中，每個節點所執行的資料傳輸機制可以總結爲圖3 所示的流程，具體包括： S301，當前節點獲得待傳輸資料； 201101747 其中’如果當前節點是資料源節點，那麼所獲得的是 初始的待傳輸資料；如果當前節點是目標節點，那麼該獲 得待傳輸資料’具體表現爲接收其他節點所發送的待傳輸 資料。 S302’當目u節點將該待傳輸資料發送至—個子節點； 及’將該待傳輸資料發送至一個兄弟節點，該兄弟節點未 獲得過該待傳輸資料。 可見’當前節點獲得資料以後，會將資料繼續向兩個 節點發送’如果沒有符合上述條件的節點，則不會執行相 應的發送動作。在這樣的傳輸機制下，資料從源節點發出 之後’就會自動遍曆到所有的目標節點上，並且目標節點 之間不會出現資料的重複傳輸。 需要說明的是’實施例一及實施例二分別介紹了兩層 及三層的樹形結構，本領域技術人員易於想到的是，對於 採用本發明所提供資料傳輸機制的其他形式的樹形結構系 統，也均應包含在本發明的保護範圍之內 對於樹形連接關係的建立，一般我們會令處於同一網 段的目標節點’與一個父節點建立連接關係，例如在圖2 中’節點211〜115處於同一網段A、節點212a、212b處 於同一網段B、節點2 14a處於網段C，這樣，資料在網間 傳輸時’僅會佔用一條資料通道，而大部分的資料是在兄 弟節點之間單向傳輸，有效地利用了網內的資料傳輸帶寬 〇 由於父節點及子節點之間只有一條資料通道，因此， -10- 201101747 只要對這條資料通道進行控制，就可以實現對 •資料傳輸的統一控制。例如，對於源節點20 1 211之間的資料通道，我們可以在201或211 傳輸速率。 由於父節點需要管理子節點的相關資訊， 較大，因此我們一般選擇在子節點上控制傳輸 來說，可以在211上控制從201接收資料的 〇 211是第一個、並且唯一的由源節點獲得資料 ，因此，之後的兄弟節點之間、或父子節點之 輸速率，明顯不會超過這個所限制的速率，從 整個網路的資料傳輸的統一控制。 本領域技術人員易於想到的是，也可以在 向212發送資料的速率，（如果211有子節點 211上控制向子節點發送資料的速率）。進一 一個目標節點上都可以對資料接收速率、向後 〇 的資料發送速率、向子節點的資料發送速率進 而實現對網路的更細緻的管理。 實施例三： 在本發明的較佳方案中，爲了保證某一目 資料發送至自己的某個還沒有獲得過資料的兄 以將上述資料傳輸機制優化如下： 在源節點側，將待傳輸資料發送至第〜個 連接關係的子節點； 整個網路@ 及目標節％ 上控制資料 工作量相對 速率。具體 速率，由於 的目標節點 間的資料傳 而實現了對 211上控制 ，還可以在 步的，在每 繼兄弟節點 行控制，從 標節點是將 弟節點，可 與自己建立 -11 - 201101747 在目標節點側’接收待傳輸資料；將所接收的待傳輸 資料發送至第一個與自己建立連接關係的子節點；及，將 所接收的待傳輸資料發送至在自己之後，第一個與自己的 父節點建立連接關係的節點，爲了方便後面描述，我們將 這種節點稱爲後繼兄弟節點。 具體來說’在建立樹形連接關係的過程中，節點x可 以通過向節點y註冊’與節點y建立連接關係，成爲節點 y的子節點。之後’節點X每隔一定時間（例如1秒）會 向節點y發送註冊資訊，以保持與節點y的連接關係。父 節點通過週期性檢查子節點的註冊資訊，可以隨時瞭解子 節點的連接情況。一方面，當父節點有資料要發送或轉發 時’知道哪些子節點將會接收它們；另一方面，一旦檢查 到子節點未連續註冊的次數達到一定的數量時，父節點就 會從子節點列表中將其移除，並進一步調整傳輸策略。 以圖2所提供的系統爲例，假設節點2丨丨〜2〗5是按其 數位編號的順序向節點201註冊的，節點212a〜212b是按 其字母編號的順序向節點2 1 2註冊的，則根據上述優化過 的傳輸機制，可以確定： 源節點201’將待傳輸資料發送至第一個向自己註冊 的子節點2 1 1 ; 目標節點2 1 1 ’接收20 1所發送的待傳輸資料；將所 接收的待傳輸資料發送至自己的後繼兄弟節點212 ( 211 沒有子節點，因此不執行向子節點的發送動作）； 目標節點2 1 2 ’接收2 1 1所發送的待傳輸資料；將所 -12- 201101747 接收的待傳輸資料發送至自己的後繼兄弟節點213。並且 •’將待傳輸資料發送至第一個向自己註冊的子節點212a; -同理可以確定其他目標節點的發送規則，這裏不再贅 述。 如果某個節點失效，那麼它的父節點通過週期性檢查 子節點的註冊資訊，可以得知這一情況’並進行相應的調 整： Ο 如果節點2 1 1失效，節點20 1會在自己的子節點列表 中刪除211的資訊’此時，第一個向201註冊的子節點就 變成了 212 : 如果節點2 1 2失效，節點2 0 1會在自己的子節點列表 中刪除212的資訊’並且將這一情況通知在212之前註冊 的節點2 1 1 ’此時對於2〗i來說，後繼兄弟節點就變成了 213 ； 同理可以得知其他節點失效時的情況，總之，從網路 Ο 整體角度看’節點失效’實質上相當於建立了新的樹形連 接關係（如果有新的節點加入網路，也是類似的情況）， 各節點依然按照原有的傳輸機制進行資料接收及發送，發 生變化的只是“第一個與自己建立連接關係的子節點，，及“ 後繼兄弟節點”所指代的對象。 在優化的傳輸機制中，同一層的資料都是由前一個註 冊的兄弟節點傳遞過來，這就具體實現了“某一目標節點 將資料發送至自己的某個還沒有獲得過資料的兄弟節點，， 的原則。並且’根據節點的註冊順序來確定資料的傳輸方 -13- 201101747 向，也更加有利於對資料傳輸的管理。 實施例四： 在兩個節點之間的一次資料的傳輸 短暫的網路問題引起本次資料傳輸失敗 端節點將待傳輸的資料劃分爲若干個資 收端節點在接收資料以後，檢查是否接 分塊，如果否，則只需向發送端節點請 的資料塊即可。 例如，在電腦之間，資料都是以檔 們將每個檔案的傳輸由一個單獨的線程 FileTask，一個 FileTask 分爲 4 個階異i 開始傳輸）、Blocks (傳送檔案內容） 輸結束）、RecovFile (錯誤塊恢復）。 案分塊的形式，接收端節點在接收到檔 驗，如果資料錯誤，在RecovFile階段 錯誤的資料塊，不用重新傳輸整個檔案 FileTask首先在發送端節點創建， 端節點任務子節點列表（FileClients) 點歹!J表 （FileNexts)。 一旦建立 FileNexts在這個任務內都不會變化， 證在網路結構有更新時不會影響到當前 接收端節點在接收到OpenFile訊 個新的FileTask任務，其中同樣包衣 過程中，爲了避免 ，我們可以在發送 料塊進行傳輸。接 收到了所有的資料 求重新發送所缺失 案的形式傳輸，我 處理，我們稱其爲 i '· OpenFile (檔案 、EndFile (檔案傳 檔案傳輸時採取檔 案分塊時會進行校 可以單獨要求恢復 〇 其中還包括該發送 及任務後繼兄弟節 ，FileClients 及 這樣做的目的是保 檔案發送。 息後，也會創建一 S該接收端節點的 -14- 201101747BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to the field of data transmission technology, and more particularly to a key data transmission method, node and system. [Prior Art] With the development of Internet technology, resources can be shared by any data transmission between any two devices in the network. In practical applications, we often encounter the need to copy data from one device to multiple devices. In the prior art, the commonly used method is to copy data from the device where the data source is located to the target device. This method is not only troublesome to operate, but also requires a bandwidth between the source device and the current target device for each copy process. Especially when the target device and the source device are on different network segments, and the target devices are all on the same network segment, this replication method is obviously not conducive to saving valuable inter-network bandwidth resources. peerP2P (peer-to-peer) technology is a popular data transmission method. In P2P, each target device receives the data and provides the received data to other target devices. This will make use of the bandwidth between the originally idle target devices. If the P2P technology is applied to the above scenario, the intra-network bandwidth between the target devices can be effectively utilized, thereby reducing the amount of data transmission on the inter-network bandwidth and saving the bandwidth resources of the network. In the process of implementing the present invention, the inventors have found that at least the following problems exist in the prior art: in the current P2P application, each device can control the transmission and reception of the 201101747 itself (including the rate, the number of target devices, etc.). However, the P 2 P transmission mechanism makes it impossible to achieve unified control of the entire network data transmission on a certain device. When the amount of data transmission is large, it is likely to cause a network storm, causing network congestion. In the application scenario described above, the data transmission is initiated by the source device. According to the amount of data transmitted and the number of target devices, the entire network data transmission needs to be controlled on the source device (or a target device). While other target devices can only be used to passively receive data, this requirement is not possible with P2P technology. SUMMARY OF THE INVENTION In view of the above, the present invention provides a chain data transmission method, node and system for realizing unified control of data transmission of an entire network on a single device. The technical solution is as follows: The present invention provides a chain type The data transmission method includes: after the node establishes a tree connection relationship, the node receives the data to be transmitted; if the current node that receives the transmission data has a child node, the current node sends the to-be-transmitted data to all the children. a child node in the node; and, if the current node receiving the transmission data has a sibling node that has not obtained the data to be transmitted, the current node sends the data to be transmitted to one of the sibling nodes . The present invention also provides a chain data transmission node, comprising: -6- 201101747 receiving unit, configured to receive data to be transmitted; and sending unit, when the chain data transmission node has child nodes, the receiving unit The received data to be transmitted is sent to one of the child nodes of the chain data transmission node; and when the chain data transmission node has a sibling node that has not obtained the data to be transmitted, the receiving The data to be transmitted received by the unit is sent to one of all the sibling nodes. The present invention also provides a chain data transmission system, the system comprising a data source node and at least one data target node, the data source node and the data target node establish a tree-shaped connection relationship, and the data target node is a descendant node of the data source node; The data source node is configured to send the data to be transmitted to one of all its own child nodes; the data target node is configured to receive data to be transmitted; and when the data target node has child nodes, the received data is to be received Transmitting data is sent to one of the child nodes in the own child node; and 'when the data target node has a sibling node that has not obtained the data to be transmitted, the received data to be transmitted is sent to all the sibling nodes A brother node in the middle. In the above technical solution, 'the data between all devices is one-way transmission'. If the source device is the root node of the tree structure, there is only one data channel between the source device and the target device, and the data channel is transmitted through this data channel. The control 'can achieve unified control of the data transmission of the entire network. In addition, 'in one of the multiple nodes of a parent node, only one is to obtain data from the parent node. 'Other child nodes get the data from 201101747 in turn from their last sibling node, as appropriate, as long as the devices on the same network segment are set to each other. The sibling node can effectively utilize the bandwidth in the network and save the bandwidth between the networks. [Embodiment] The technical solution provided by the present invention is called LCP (Link Copy Chain Copy) technology. First, the chain data transmission system provided by the present invention will be described. 'The chain data transmission system provided by the present invention, The method includes a data source node and at least one data target node, and the data source node establishes a tree connection relationship with the data target node. The data target node is a descendant node of the data source node. Embodiment 1: FIG. 1 is provided by the present invention. A schematic diagram of a chain data transmission system 'where 101 is the data source node, iU_114 is the data destination node, and the thin line between the nodes in the figure represents the connection relationship established between the nodes. It can be seen that the system is two layers. In the tree structure, the source node 1 〇i is in the position of the parent node in the tree structure, and the target nodes ni to 114 are all child nodes of 101, since 111 to 114 have the same parent node 101, thus between 111 and 114 They are brothers of each other. The thick arrow line between the nodes in Figure 1 shows the data transmission in the system. It can be seen that the data source node 1 0 1 is sending a data to its own child node (shown as 111 in Figure 1). ); and the data target node 1 1 1~1 1 4, after receiving the data, will send the data received by the -8-201101747 to one of its own sibling nodes, in order to avoid repeated transmission of data, the sibling node should not yet Obtained information to be transmitted. The data transmission path shown in the figure is 111 - 112 - 113 - 114. For the 1 1 4, after receiving the data, 'all the sibling nodes have obtained the data to be transmitted at this time, so 114 no longer performs the transmission. Action, data transmission is aborted. 〇 Embodiment 2: FIG. 2 is a schematic diagram showing another structure of the chain data transmission system provided by the present invention. The difference from FIG. 1 is that the system is a three-layer tree structure, and the source node 201 is in a tree structure. In the position of the parent node, 211~115 are the child nodes of 201, and 215~115 are mutually sibling nodes: 212a, 212b are child nodes of 212, 212a and 212b are mutually sibling nodes; 2 1 4a is 2 1 4 child nodes. As can be seen from the thick arrow line in Figure 2, the target node point with the child node, after receiving the data, in addition to sending the received data to one of its own sibling nodes, will also send the data to itself. a child node. For example, 2 1 2 will send the data to one of its own sibling nodes 2 1 3 and its own one of the child nodes 212a; and 214 will send the data to its own sibling node 215 and its own one of the child nodes 214a. In the first embodiment and the second embodiment, it can be seen that in the chain data transmission system, the data transmission mechanism performed by each node can be summarized as the flow shown in FIG. 3, which specifically includes: S301, the current node obtains the data to be transmitted. 201101747 where 'if the current node is the data source node, then the obtained data to be transmitted is obtained; if the current node is the target node, then the obtained data to be transmitted' is specifically represented by receiving the data to be transmitted sent by other nodes. S302', when the destination node sends the data to be transmitted to the one child node; and 'transmits the data to be transmitted to a sibling node, the sibling node has not obtained the data to be transmitted. It can be seen that after the current node obtains the data, the data will continue to be sent to the two nodes. If there is no node that meets the above conditions, the corresponding sending action will not be performed. Under such a transmission mechanism, after the data is sent from the source node, it will automatically traverse to all the target nodes, and there will be no repeated transmission of data between the target nodes. It should be noted that 'the first embodiment and the second embodiment respectively introduce two-layer and three-layer tree structures, and those skilled in the art will readily think of other forms of tree structure using the data transmission mechanism provided by the present invention. The system should also be included in the protection scope of the present invention for the establishment of a tree connection relationship. Generally, we will make the target node in the same network segment establish a connection relationship with a parent node, for example, in Figure 2, node 211 ~115 is in the same network segment A, nodes 212a, 212b are in the same network segment B, and node 2 14a is in network segment C. Thus, when data is transmitted between networks, 'only one data channel is occupied, and most of the data is in the brother. One-way transmission between nodes effectively utilizes the data transmission bandwidth within the network. Since there is only one data channel between the parent node and the child node, -10- 201101747 can control the data channel as long as it is controlled. • Unified control of data transmission. For example, for a data channel between source nodes 20 1 211, we can transfer rates at 201 or 211. Since the parent node needs to manage the related information of the child node, it is large, so we generally choose to control the transmission on the child node, and the 211 that can control the data received from 201 on 211 is the first and only source node. Obtaining data, therefore, the subsequent transmission rate between sibling nodes, or parent-child nodes, obviously does not exceed this limited rate, from the unified control of data transmission throughout the network. Those skilled in the art will readily appreciate the rate at which data can also be sent to 212 (if 211 has child nodes 211 controlling the rate at which data is sent to the child nodes). Further data management rate, backward data transmission rate, and data transmission rate to the child nodes can be implemented on a target node to achieve more detailed management of the network. Embodiment 3: In a preferred solution of the present invention, in order to ensure that a certain data is sent to one of its own brothers who have not obtained the data, the above data transmission mechanism is optimized as follows: On the source node side, the data to be transmitted is sent. To the child nodes of the first connection relationship; control the relative rate of data workload on the entire network @ and target section %. The specific rate, due to the data transmission between the target nodes, realizes the control on the 211, and can also be controlled in the step, in the step of each sibling node, the slave node is the younger node, and can be established with itself -11 - 201101747 The target node side receives the data to be transmitted; sends the received data to be transmitted to the first child node that establishes a connection relationship with itself; and sends the received data to be transmitted to itself after the first one The parent node establishes the connection relationship node. For the convenience of the following description, we refer to this node as the successor sibling node. Specifically, in the process of establishing a tree-shaped connection relationship, the node x can establish a connection relationship with the node y by registering with the node y to become a child node of the node y. Then, node X sends registration information to node y every certain time (for example, 1 second) to maintain the connection relationship with node y. By periodically checking the registration information of the child nodes, the parent node can know the connection status of the child nodes at any time. On the one hand, when the parent node has data to send or forward, it knows which child nodes will receive them; on the other hand, once it is checked that the number of times the child nodes are not continuously registered reaches a certain number, the parent node will follow the child node. Remove it from the list and further adjust the transmission strategy. Taking the system provided in FIG. 2 as an example, it is assumed that the nodes 2丨丨~2′5 are registered to the node 201 in the order of their digit numbers, and the nodes 212a to 212b are registered to the node 2 1 2 in the order of their letter numbers. According to the above optimized transmission mechanism, it can be determined that: the source node 201' sends the data to be transmitted to the first child node 2 1 1 registered to itself; the target node 2 1 1 'receives 20 1 to be transmitted. Data; the received data to be transmitted is sent to its successor sibling node 212 (211 has no child nodes, so the sending action to the child node is not performed); the target node 2 1 2 'receives the data to be transmitted sent by 2 1 1 Send the data to be transmitted received by -12-201101747 to its successor sibling node 213. And • 'transmit the data to be transmitted to the first child node 212a registered with itself; - the same can determine the sending rules of other target nodes, which will not be described here. If a node fails, its parent node can know the situation by periodically checking the registration information of the child node and adjust accordingly: Ο If node 2 1 1 fails, node 20 1 will be in its own child. The information of 211 is deleted from the node list. At this time, the first child node registered with 201 becomes 212: If node 2 1 2 fails, node 2 0 1 deletes the information of 212 in its own child node list and This is notified to the node 2 1 1 ' registered before 212. At this time, for the 2 〗 i, the successor sibling node becomes 213; similarly, it can be known that other nodes are invalid, in short, from the network Ο The overall view of 'node failure' is essentially equivalent to establishing a new tree connection relationship (if a new node joins the network, it is similar), each node still receives and transmits data according to the original transmission mechanism. What happens is only the first child node that establishes a connection with itself, and the object referred to by the "successive sibling node". In the optimized transport mechanism, the same layer Materials are delivered by a sibling before registration of the over, which embodied the principle of "a certain target node will send data to one of your own has not won ,, the information siblings. And the determination of the transmission side of the data according to the registration order of the nodes is also more conducive to the management of data transmission. Embodiment 4: Transmission of a data between two nodes A short network problem causes the data transmission failure. The end node divides the data to be transmitted into a plurality of receiving end nodes, and checks whether the points are received after receiving the data. Block, if no, just ask the data block requested by the sender node. For example, between computers, the data is transmitted by a file from a separate thread FileTask, a FileTask is divided into 4 stages i to start transmission, Blocks (transfer file content) end, and RecovFile (Error block recovery). In the form of a block, the receiving end node receives the file check. If the data is incorrect, the error data block in the RecovFile stage does not need to retransmit the entire file. The FileTask is first created at the sending end node, and the end node task child node list (FileClients) point. Hey! J table (FileNexts). Once FileNexts is created, it will not change in this task. If the network structure is updated, it will not affect the current receiving node. It receives OpenFile and receives a new FileTask task. In the same coating process, in order to avoid, we It can be transmitted in the send block. I received all the information to resend the lost form of the transmission, I handle it, we call it i '· OpenFile (file, EndFile (file transfer file transfer when the file is blocked, the school can be separately requested to restore it) Also included is the Send and Task Subsequent Brothers Festival, FileClients and the purpose of doing this is to ensure that the file is sent. After the interest, it will also create a S-receiver node -14- 201101747
FileClients 及 FileNexts 〇FileClients and FileNexts 〇
FileTask中，所有的控制訊息，包括 〇penFiie及 EndFile訊息會被發往FileClients中記錄的所有節點，而 資料訊息 Block則會分別發往記錄在 FileClients及 FileNexts的第一個節點上。 最理想的情況是，控制訊息及資料訊息按照 OpenFile —Block — EndFile的順序到達，但是各節點也可 〇 以處理順序錯誤或某些資料包錯誤、丟失的情況·· 如果在OpenFile之前接收到檔案資料包Block，我們 仍然建立FileTask，但打開暫存檔案寫入檔案資料。如果 OpenFile丟失，還可以從EndFile中獲得必要的檔案資訊 。從OpenFile或EndFile中得到檔案資訊後（比如檔案路 徑），再更改暫存檔案的名稱。 接收到EndFile後將更新檔案路徑（如果已經到 OpenFile，接收將校驗檔案路徑）、更新FileTask中的 〇 Block個數資訊，檢查Block的接收情況，發出恢復Block 的訊息RecovBlock。隨後，FileTask仍可能接收到任意的 資料包：對於OpenFile，校驗檔案路徑；對於Block，正 常發送的Block及RevoeBlock沒有區別，如果Block已 經接收成功則直接忽略，否則寫檔案。EndFile訊息中包 含Block的個數，如果成功接收到全部的Block，則退出 處理資料包的迴圏。In FileTask, all control messages, including 〇penFiie and EndFile messages, are sent to all nodes recorded in FileClients, and the Data Message Block is sent to the first node recorded in FileClients and FileNexts. Ideally, control messages and data messages arrive in the order of OpenFile - Block - EndFile, but each node can also handle sequence errors or certain packet errors, missing cases. · If you receive the file before OpenFile The packet Block, we still create a FileTask, but open the temporary file to write the file. If OpenFile is missing, you can also get the necessary file information from EndFile. After getting the file information from OpenFile or EndFile (such as the file path), change the name of the temporary file. After receiving the EndFile, the file path will be updated (if it has reached OpenFile, the receiving will verify the file path), update the Block number information in the FileTask, check the reception of the Block, and issue the message RecovBlock to recover the Block. Subsequently, the FileTask may still receive any data packets: for OpenFile, verify the file path; for Block, there is no difference between the Block and RevoeBlock that are normally sent. If the Block has been successfully received, it will be ignored. Otherwise, the file will be written. The EndFile message contains the number of Blocks. If all the Blocks are successfully received, the processing packet is returned.
FileTask結束前，如果校驗失敗或檔案資訊不全（ OpenFile及EndFile都丟失、某些Block缺失），則直接 -15- 201101747 刪除檔案。Before the end of FileTask, if the verification fails or the file information is incomplete (OpenFile and EndFile are lost, some blocks are missing), delete the file directly -15- 201101747.
FileTask啓動之後，如果超過一定的時間沒有接收到 任何資料包’即可認爲該FileTask可以結束。這種機制可 以保證檔案資訊資源的釋放。 在本實施例中，進一步介紹了本發明資料傳輸方案的 錯誤處理機制，資料在節點間以資料分塊的方式進行傳輸 ，當傳輸出現錯誤時，只需重新傳輸錯誤的資料塊即可， 從而也有效地節約了傳輸時間及網路帶寬。 本領域普通技術人員可以理解：實現上述方法實施例 的全部或部分步驟可以通過程式指令相關的硬體來完成， 前述的程式可以儲存於一電腦可讀取儲存介質中，該程式 在執行時，執行包括上述方法實施例的步驟；而前述的儲 存介質包括：ROM、RAM、磁碟或者光碟等各種可以儲存 程式碼的介質。 實施例五： 相應於上面的方法實施例，本發明實施例還提供一種 鏈式資料傳輸節點，參見圖4所示，包括： 接收單元410，用於獲得待傳輸資料； 對於資料源節點來說，接收單元4 1 0是用於獲得初始 的待傳輸資料，而對於目標節點來說，接收單元4 1 0是用 於接收其他節點所發送的待傳輸資料。 發送單元420 ’用於當該鏈式資料傳輸節點有子節點 時’將該接收單元410所接收的待傳輸資料發送至該鏈式 -16- 201101747 資料傳輸節點的所有該子節點中的一個子節點；及，當該 -鏈式資料傳輸節點有還未獲得過該待傳輸資料的兄弟節點 時，將該所接收的待傳輸資料發送至所有該兄弟節點中的 « 一個兄弟節點。 其中’參見圖5所示，該發送單元420，可以包括： 第一發送子單元421，用於將該接收單元所接收的待 傳輸資料發送至第一個與該鏈式資料傳輸節點建立連接關 〇 係的子節點； 第二發送子單元42 2，用於將該接收單元所接收的待 傳輸資料發送至在該鏈式資料傳輸節點之後，第一個與該 鏈式資料傳輸節點的父節點建立連接關係的節點。 上述兩個發送子單元，實質上是對發送單元420所執 行的傳輸機制做了進一步優化，在優化的傳輸機制中，同 一層的資料都是由前一個註冊的兄弟節點傳遞過來，這就 具體實現了“某一目標節點將資料發送至自己的某個還沒 〇 有獲得過資料的兄弟節點”的原則。並且，根據節點的註 冊順序來確定資料的傳輸方向，也更加有利於對資料傳輸 的管理。 參見圖6所示，該的鏈式資料傳輸節點，還可以進一 步包括： 速率控制單元430，用於對該接收單元410的資料接 收速率’及/或對該發送單元420的資料發送速率進行控 制。 如果該接收單元，是接收其他節點所發送的待傳輸資 -17- 201101747 料，則該鏈式資料傳輸節點可以進一步包括： 資料校驗單元440，用於檢查該接收單元410所接收 的待傳輸資料是否完整，如果否，則請求資料發送節點重 新發送所缺失的資料部分。 對於裝置實施例而言，由於其基本相應於方法實施例 ，所以描述得比較簡單，相關之處參見方法實施例的部分 說明即可。以上所描述的裝置實施例僅僅是示意性的，其 中該作爲分離部件說明的單元可以是或者也可以不是物理 上分開的，作爲單兀顯示的部件可以是或者也可以不是物 理單元，即可以位於一個地方，或者也可以分佈到多個網 路單元上。可以根據實際的需要選擇其中的部分或者全部 模組來實現本實施例方案的目的。本領域普通技術人員在 不付出創造性的勞動的情況下，即可以理解並實施。 以上所述僅是本發明的具體實施方式，應當指出，業寸 於本技術領域的普通技術人員來說，在不脫離本發明原玉里 的前提下，還可以做出若干改進及潤飾，這些改進及 '潤飾 也應視爲本發明的保護範圍。 【圖式簡單說明】 圖1爲本發明所提供的鏈式資料傳輸系統的—種結_ 不意圖； 圖2爲本發明所提供的鏈式資料傳輸系統的另—種，結 構示意圖； 圖3爲實現本發明方法的流程圖； -18- 201101747 圖4爲本發明實施例鏈式資料傳輸節點的結構示意圖 > 圖5爲本發明實施例鏈式資料傳輸節點的另一種結構 Λ 示意圖； 圖6爲本發明實施例鏈式資料傳輸節點的第三種結構 示意圖。 〇 【主要元件符號說明】 4 1 0 :接收單元 420 :發送單元 421 :第一發送子單元 422 :第二發送子單元 43 0 :速率控制單元 440 :資料校驗單元After the FileTask is started, if no packet is received for more than a certain period of time, the FileTask can be considered to be over. This mechanism can guarantee the release of archive information resources. In this embodiment, the error handling mechanism of the data transmission scheme of the present invention is further introduced. The data is transmitted by means of data partitioning between nodes. When an error occurs in the transmission, only the wrong data block needs to be retransmitted. It also effectively saves transmission time and network bandwidth. A person skilled in the art can understand that all or part of the steps of implementing the above method embodiments can be completed by using a program instruction related hardware, and the foregoing program can be stored in a computer readable storage medium. The foregoing steps include the steps of the foregoing method embodiments; and the foregoing storage medium includes: a medium that can store code, such as a ROM, a RAM, a magnetic disk, or an optical disk. Embodiment 5: Corresponding to the above method embodiment, the embodiment of the present invention further provides a chain data transmission node. As shown in FIG. 4, the method includes: a receiving unit 410, configured to obtain data to be transmitted; The receiving unit 410 is used to obtain the initial data to be transmitted, and for the target node, the receiving unit 410 is used to receive the data to be transmitted sent by other nodes. The sending unit 420' is configured to: when the chain data transmission node has a child node, 'send the data to be transmitted received by the receiving unit 410 to one of all the child nodes of the chain-16-201101747 data transmission node a node; and, when the chain-type data transmission node has a sibling node that has not obtained the data to be transmitted, transmitting the received data to be transmitted to all of the sibling nodes. As shown in FIG. 5, the sending unit 420 may include: a first sending subunit 421, configured to send the to-be-transmitted data received by the receiving unit to the first connection with the chain data transmission node. a child node of the tethering system; the second sending subunit 42 2 is configured to send the to-be-transmitted data received by the receiving unit to the parent node of the chain data transmission node after the chain data transmission node The node that establishes the connection relationship. The above two transmitting subunits substantially further optimize the transmission mechanism performed by the transmitting unit 420. In the optimized transmission mechanism, the data of the same layer is transmitted by the former registered sibling node, which is specific Achieved the principle that "a certain target node sends data to one of its own brother nodes that have not obtained the data yet". Moreover, determining the data transmission direction according to the registration order of the nodes is also more conducive to the management of data transmission. As shown in FIG. 6, the chain data transmission node may further include: a rate control unit 430, configured to control a data receiving rate of the receiving unit 410 and/or a data sending rate of the sending unit 420. . If the receiving unit is to receive the to-be-transmitted resource -17-201101747 sent by the other node, the chain data transmission node may further include: a data verification unit 440, configured to check the to-be-transmitted received by the receiving unit 410 Whether the data is complete, if not, the data sending node is requested to resend the missing data portion. For the device embodiment, since it basically corresponds to the method embodiment, the description is relatively simple, and the relevant parts can be referred to the description of the method embodiment. The device embodiments described above are merely illustrative, wherein the units described as separate components may or may not be physically separated, and the components displayed as a single frame may or may not be physical units, ie may be located A place, or it can be distributed to multiple network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the embodiment. Those of ordinary skill in the art can understand and implement without undue creative work. The above description is only a specific embodiment of the present invention, and it should be noted that those skilled in the art can make some improvements and refinements without departing from the original jade of the present invention. And 'retouching should also be regarded as the scope of protection of the present invention. BRIEF DESCRIPTION OF THE DRAWINGS FIG. 1 is a schematic diagram of a chained data transmission system provided by the present invention. FIG. 2 is a schematic diagram showing another structure of a chained data transmission system according to the present invention; FIG. FIG. 4 is a schematic structural diagram of a chain data transmission node according to an embodiment of the present invention. FIG. 5 is a schematic diagram of another structure of a chain data transmission node according to an embodiment of the present invention; 6 is a third structural schematic diagram of a chain data transmission node according to an embodiment of the present invention. 〇 [Main component symbol description] 4 1 0 : receiving unit 420: transmitting unit 421: first transmitting subunit 422: second transmitting subunit 43 0 : rate control unit 440 : data check unit
-19--19-