201206130 六、發明說明： 【發明所屬之技術領域】 本發明大體上係關於資料傳輸管理方法及系統，詳言 之，係關於管理P2P檔案傳輸之方法及系統。 。 * 【先前技術】 .同、級間（P—peer)技術（簡稱Ρ2Ρ)被稱為特用（ad_h〇c) 網路技術，其依賴電腦能力及網路中參與者之頻寬而非依 賴少數飼服器。在P2P結構中，每一節點（同級者）同時具有 諸如資訊用戶、資訊提供者及資訊通信等之三個方面之功 能。在1>糊路巾，每―節點具有之權似任務全部相同。 圖1展不典型P2P檔案傳輸之示意圖。區域網路含有 節點A及節點B，且節點a及節點_由邊緣路由器ι〇2與其 他外部節點聯絡。區域網路1〇3含有節點〇及節點D。節點 C及節點D經由邊緣路由器1〇4與其他外部節點聯絡。假設 節點A中之使用者想要獲取p2p檔案，則節點八首先需要自 種子伺服器105獲取與P2P檔案對應之種子檔案（例如， 以〇rrent卜根據BitT〇rrem協定，檔案發行者將根據所發 ^檔案產生及提供.torrent檔案（亦即，種子檔案，亦稱為 「種子」）。.torrent檔案實質上為文字檔案，其含有兩個 部分：追蹤器伺服器資訊及擋案資訊。追蹤器資訊主要為 BT下載期間需要使用之追蹤器祠服器之位址及追縱器飼服 器之設定，且檔案資訊係根據對目標檔案之計算而產生， 根據BltT〇rrent協定中之B編碼規則（Benc〇de編碼）對計算結 果進行編碣。其主要原理係將供下載之擋案實質上劃分為 149920.doc 201206130 大小相等之區塊，且將每一區塊之索引資訊及雜湊（Hash) 驗證程式碼寫入.torrent稽案；因此，.torrent樓案為所下 載檔案之「索引」。若使用者節點八想要下載檔案内容’則 其首先需要獲取相應·torrent棺案’且接著使用BT用戶端 軟體執行下載° 圖4A展示a.torrent之示意圖。表1提供a.torrent中所含内 容之詳細解釋。 a.torrent棺案中之内容 含義 d 褲子檔案之結構為「辭典」型 8:announce37:http：//tracker.exam.com: 8077/announce 指定相應原始追蹤器伺服器106之資訊 13:announce-list 備用原始追蹤器伺服器資訊之開始符號 1137:http://tracke2.exam.com:8077/announcee 第一備用原始追蹤器伺服器 136:http://track3.exam.org:8000/announcee 13 6: http ://track4. exam. org:6969/announcee 136:http://track5.exam.org:8080/announcee 13 4: http ://tr6 · exa. nl .n2:2710/announcee 14 0: http ://tr ackO 7. examp. com: 2710/announceee 其他備用追蹤器伺服器 10:created byl3:Creatorl/0.70 建立者軟體 13:creation dateil226980360e 建立曰期 8:encoding3:GBK 編碼格式 4:infod5:filesld6:lengthil83e4:path 110:3FFile.urlel0:path.utf-8112:3EF ile.urleed6:Iengthi2707e4:pathl46:3 E... 檔案資訊之開始部分 〈其他内容> 檔案資訊之内容部分 表1 如以下表2所示，與種子檔案對應之可下載節點清單儲 存於原始追蹤器伺服器106中。實際上，種子飼服器1〇5及 原始追縱器伺服器106可代管於同一實體飼服器中。在表2 149920.doc 201206130 中假°又P2P棺案被分為4個部分，節點B、c、D分別具有 P2P檔案之若干區塊。#由獲取節點清單，使用者節點a 知曉其將連接至哪些節點以獲取相應㈣區塊。因為節點 清單可能在操作期間連續變化’例如，將連續添加新節點 且原始節點將連續退出，使用者節點A可能需要在下載期 間與原始追蹤器伺服器1〇6週期性地通信以查詢最新節點 清單。201206130 VI. Description of the Invention: TECHNICAL FIELD OF THE INVENTION The present invention generally relates to a data transmission management method and system, and more particularly to a method and system for managing P2P file transmission. . * [Prior Art] The same-stage (P-peer) technology (referred to as Ρ2Ρ) is called special (ad_h〇c) network technology, which relies on computer capabilities and the bandwidth of participants in the network rather than relying on A few feeding machines. In the P2P structure, each node (same level) has the functions of three aspects such as information users, information providers, and information communication. In 1> paste road towel, each node has the same weight-like tasks. Figure 1 shows a schematic diagram of an atypical P2P file transfer. The regional network contains Node A and Node B, and Node a and Node_ are connected by the edge router ι〇2 to other external nodes. The local area network 1〇3 contains a node 〇 and a node D. Node C and node D communicate with other external nodes via edge router 1〇4. Assuming that the user in node A wants to obtain the p2p file, node eight first needs to obtain the seed file corresponding to the P2P file from the seed server 105 (for example, according to the BitT〇rrem agreement, the file issuer will be based on The file is generated and provided with a .torrent file (ie, a seed file, also known as a "seed"). The torrent file is essentially a text file with two parts: the tracker server information and the file information. The device information is mainly used to set the address of the tracker server and the tracker feeder during the BT download, and the file information is generated according to the calculation of the target file, according to the B code in the BltT〇rrent agreement. The rules (Benc〇de code) compile the calculation results. The main principle is to divide the file for download into 149920.doc 201206130 equal size blocks, and index information and hash of each block ( Hash) The verification code is written to the .torrent file; therefore, the .torrent file is the "index" of the downloaded file. If the user node eight wants to download the file content, then its First need to get the corresponding · torrent file ' and then use BT client software to perform the download ° Figure 4A shows a. torrent diagram. Table 1 provides a detailed explanation of the contents of a. torrent. a. torrent file content Meaning d The structure of the pants file is "Dictionary" type 8: announce37: http://tracker.exam.com: 8077/announce Specifies the information of the corresponding original tracker server 106 13: announce-list alternate original tracker server information Start symbol 1137: http://tracke2.exam.com:8077/announcee First alternate original tracker server 136: http://track3.exam.org:8000/announcee 13 6: http ://track4. Exam.org:6969/announcee 136:http://track5.exam.org:8080/announcee 13 4: http ://tr6 · exa. nl .n2:2710/announcee 14 0: http ://tr ackO 7 Ex examp. com: 2710/announceee Other alternate tracker server 10: created byl3: Creatorl/0.70 Builder software 13: creation dateil226980360e Create period 8: encoding3: GBK encoding format 4: infod5: filesld6: lengthil83e4: path 110: 3FFile.urlel0:path.utf-8112:3EF ile.urleed6:Iengthi2707e4:path L46:3 E... The beginning of the file information <Other Contents> Contents of the file information Table 1 As shown in Table 2 below, the list of downloadable nodes corresponding to the seed file is stored in the original tracker server 106. In effect, the seed feeder 1〇5 and the original tracker server 106 can be hosted in the same physical feeder. In Table 2 149920.doc 201206130, the P2P file is divided into four parts, and nodes B, c, and D respectively have several blocks of the P2P file. # By obtaining a list of nodes, the user node a knows which nodes it will connect to to obtain the corresponding (four) block. Since the list of nodes may change continuously during operation 'eg, new nodes will be added consecutively and the original nodes will continually exit, the consumer node A may need to periodically communicate with the original tracker server 1-6 during the download to query the latest node. List.
田刖，P2P檔案傳輸在網路傳輸頻寬之全體訊務中佔據 .,、、頁著P刀P2P通化可導致異常訊務，引起對網路資源之 思外知壞’且由P2P通信引起之諸如網路壅塞、效能降級 及使用者不滿之問題可影響正常網路應用（諸如而界、電 子郵件等），且正常使用者進—步對網頁劇覽以及接收/發 送電子郵件之低速率不滿。#前，對於p2p通信，不存在 有效的速率限制及引導方案。 【發明内容】 為解決此項技術中之問題，本發明提供高效、靈活的 P2P檔案傳輸管理技術。本發明主要藉由用設定可控追蹤 器伺服器替換原始追蹤器伺服器及基於可控追蹤器飼服器 中之預定規則修改節點清單來實現p2p檔㈣輸之速率限 149920.doc 201206130 制及引導。藉由本發明，網路操作員可藉由逐漸削弱p2p 通信中之原始追縱器飼服器來逐漸增強p2p通信中之可控 追蹤器飼服器，且利用預先建立之各種規則或原則來管理 P2P節點之檔案傳送。 具體言之，本發明提供用於修改同級間p2p檔案之節點 清單之可控追蹤器飼服器，其包括：用於獲取與p2p槽案 對應之原始追蹤器飼服器中之節點清單的獲取構件；用於 根據預定規則判斷節點清單是否需要修改之判斷構件；用 於在節點清單需要修改的情況下修改節點清單之節點清單 修改構件；及用於將經修改節點清單傳回至使用者之傳回 構件。 本發明亦提供用於管理同級間P2P檔案之傳輸的系統， 該系統包括伺服器處理構件，該伺服器處理構件進一步包 括.用於接收由使用者請求之P2P種子檔案的接收構件； 用於剖析P2P種子檔案以獲取其中的原始追蹤器伺服器資 訊之剖析構件；及用於修改P2P種子檔案以用可控追蹤器 词服器替換其中的原始追蹤器伺服器之種子檔案修改構 件。 本發明亦提供用於修改同級間P2P檔案之節點清單之方 法’其包括：獲取與P2P檔案對應之原始追蹤器伺服器中 之Ip點清單；根據預定規則判斷節點清單是否需要修改； 在節點清單需要修改的情況下修改節點清單；及將經修改 節點清單傳回至使用者。 本發明亦提供管理同級間P2P檔案之傳輸的方法，其包 149920.doc 201206130 括·獲取由使用者請求之P2P種子檔案；剖析p2p種子檔案 以獲取其中的原始追蹤器伺服器資訊；及修改p2p種子檔 案以用可控追蹤器伺服器替換其中的原始追蹤器伺服器。 以上描述總體上說明本發明之一些優點，且藉由組合圖 式及本發明之較佳實施例之詳細描述，此等及其他優點將 變得更加顯而易見。 【實施方式】 把述中/步及之圖式僅用於說明本發明之典型實施例，且 不應5忍為限制本發明之範嗜：。 以下論述中，提供大量特定細節以促進澈底理解本發 明二然而’熟習此項技術者將顯見，即使不存在此等特定 細即亦不會影響理解本發明。應認制，僅為了便於描述 而使用以下特定術語中之任一者’因此本發明不應限於由 該等術語識別及/或暗示之任何特定應用。 除非另有說明’否則本發明中描述之功能可由軟體或硬 體或其組合實施。然而’在實施例中，除非另有說明，否 則此等功能由處理器（諸如電腦或電子資料處理器）基於編 碼積體電路(諸如由電腦程式編碼)執行。通常，經執行以 用於實施本發明之實施例的方法可為作業系統或特定應用 '式、程式、模組、物件或指令序列之部分。本發明之軟 體通*包括將呈現為可由區^ 竦電細5賣取之機器可讀格式的 各種拓令，因此為可執行指令。 ,., 此外私式包括相對於程 式駐留於本地或可男於^空陪躺 从 見於。己隐體中之變數及資料結構。此 外，以下描述之各種程式可由在 你个知月之特定實施例t實 149920.doc 201206130 施其之應用方法識別。該種信號承載媒體，當其上載運針 對本發明之功能的電腦可讀指令時，表示本發明之實施 例0 圖2A為根據本發明之實施例之限制P2P檔案傳輸之示意 圖。小區201包括節點a、B、E，小區203包括C、D。節點 A、B、E經由邊緣路由器2〇2與外部聯絡。節點c、〇經由 邊緣路由器204與外部聯絡。若節點a請求獲取種子词服器 108上之種子檔案a t〇rrent，則當請求經由邊緣路由器2〇2 傳遞時’邊緣路由器202經由節點A發送之請求（諸如HTTP δ月求、FTP請求及類似請求）偵測該請求為獲取p2p種子檔 案之請求，邊緣路由器發送該請求至伺服器處理構件（追 縱器處理器）205 »伺服器處理構件205將請求轉發至種子 祠服器208，且自種子伺服器2〇8獲取相應a t〇rrent檔案。 圖4A為典型P2P種子檔案之示意圖。 接著’伺服器處理構件2〇5剖析a.torrent檀案，债測其中 的追蹤器伺服器資訊，且當其發現種子檔案中之追蹤器伺 服器為非可控追蹤器伺服器（亦即，原始追蹤器伺服器2〇9) 時’其修改a.torrent檔案且用可控追蹤器伺服器2〇6替換其 中的原始追蹤器伺服器2〇9〇可控追蹤器伺服器206用於移 除節點A對原始追蹤器伺服器2〇9之依賴性，使得節點八在 後繼P2P種子檔案之下載期間無需與原始追蹤器伺服器2〇9 通信’而僅與可控追蹤器伺服器2〇6通信。 可控追蹤器伺服器之IP位址可儲存於伺服器處理構件 205中，或可儲存於預定規則庫2〇7中。當可控追蹤器伺服 149920.doc 201206130 器之IP位址儲存於預定規則庫207中時，伺服器處理構件 205需要與預定規則庫207通信以獲取可控追蹤器伺服器之 IP位址。 圖4B為根據本發明之實施例修改之P2P種子檔案之示意 圖。以下表3逐項列舉經修改a.torrent檔案之詳細解釋。 經修改a.torrent檔案中之内容 d 種子檔案之結構為「辭典」型 ~ 8 :announce47 :http://managedtracker. example .com: 8066/announce 追蹤器伺服器已由原始追蹤器伺服器替換 控追蹤器伺服器 刪除備用原始追蹤器伺服器資訊。伺服器處理 構件205亦可設定備用可控追蹤器伺服器（圖中 未展示） 10:created by 13:Creatorl/0.70 建立者軟體。儘管在本發明之實施例中 改建立者軟體，但伺服器處理構件2〇5可修改片 始建立者軟體 ~ 13:creation dateil226980360e 建立日期。儘管在本發明之實施例中，未修改 建立日期，但伺服器處理構件2〇5可修改原始建 立曰期資訊 8:encoding3:GBK 樓案資訊之編碼格式。儘管在本發明之實施例 中，未修改檔案資訊之編碼格式，但伺服器處 理構件205可修改原始編碼格式，且需要在修改 編蝎格式後重新編碼後繼檔案資訊 4:infod5:filesld6:lengthil83e4:path 110:3FFile.urlel0:path.utf-8112:3EF ile.urleed6:lengthi2707e4:pathl46:3 E... 檔案資訊之開始部分 〈其他内容> 檔案資訊之内容部分 表3 應尤其注意，儘管關於一個可控追蹤器伺服器2〇6描述 本發明，但在實務中本發明可使用複數個可控追蹤器伺服 器。當使用複數個可控追縱器祠服器時，可在at〇rre_ 案中設定一個可控追縱器飼服器及若干個備用可控追 149920.doc 201206130 * 蹤器伺服器。 1G改種子槽案將傳回至節點A，且節點A將根據種子 標案之索引進一步與可控追蹤器伺服器206通信以獲取節 點清單。 可控追蹤器祠服器206將自原始追蹤器祠服器2〇9獲取與 種子標案對應之節點清單，且根據自預定規則庫2〇7獲取 之預定規則判斷是否需要修改節點清單。 預疋規則可為自卽點清單篩除不與使用者位於同一區域 中之節點。根據本發明之實施例，節點A不與節點匚、D在 同一小區中，因此可控追蹤器伺服器2〇6將自節點清單刪 除節點C、D。以下表4展示所刪除節點清單。 節點 IP位址 檔案區塊識別符 B 10.1.1.1 1,2,3,4 表4 下文詳細描述經由子網遮罩判斷節點A是否與其他節點 位於同一區域中之方法。 假<»又子網遮罩為24位元，亦即，子網遮罩為 2 5 5 ·2 5 5 ·25 5 · 0 ’則關於該子網遮罩可獲取2 5 5個ip位址， 因此可藉由子網遮罩與IP位址之間的AND運算容易地判斷 兩個IP位址是否位於同一區域中。舉例而言，Ip位址 10.1.1.1及IP位址10.1 _ 1.2為位於同一區域中之節點。對於 具有16個位元之子網遮罩，亦即子網遮罩為255 255 〇 〇， IP位址10.1.1.1及IP位址1〇·1·2· 13屬於同一區域。熟習此項 技術者可瞭解，儘管本發明以具有16個位元及24個位元之 I49920.doc 201206130 子網遮罩作為實例進行描述’但亦可使用具有其他位元數 目（諸如22個位元、25個位.元及類似者）之子網遮罩來判斷 兩個IP位址是否位於同一區域中。 根據本發明之實施例，僅允許區域網路内之節點傳輸 P2P標案，如熟習此項技術者可瞭解’區域網路之範圍可 擴展至多級存取網路，亦即，允許存取網路内具有相同等 級之所有節點傳輸P2P檔案。圖5為根據本發明之實施例之 劃刀區域之示意圖。在圖5之實施例中’節點a可與節點c 及〇通信，因為節點C及D與節點A屬於同一存取網路5〇5。 根據本發明之另一實施例，在當前網路傳輸負載超過預 定臨限值的情況下，例如，其高於一百分比值，則自節點 清單篩除不與使用者位於同一區域中之節點。 根據本發明之又一實施例，在網路傳輸峰值時間期間， 例如，9a.m.至5p.m·’自節點清單篩除不與使用者位於同 一區域中之節點。 —根據本發明之又-實施例，若使用者之訂用狀態滿足預 定條件，例如，對於按月支付之使用纟’自節點清單筛除 不與使用者位利一區域中之節點，❹士於非赞使用 者，自節點清單篩除不與使用者位於同—區域中之節點。 #根據本發明之又一實施例，自節點清單筛除至少一特定 節點，例如，篩除已知專門傳播非法作品之節點。 熟習此項技術者可瞭解，可根據網路操作員之需求建立 其他預定規則以達成對P2P通信節點之限制。 可控追縱器伺服器雇可進-步判；^經娜除節點是否含 149920.doc 201206130 有未刪除節點中不含有的P2P檔案之檔案區塊。舉例而 言，假設節點Β不儲存P2P檔案之所有檔案區塊，且節點Β 僅儲存槽案區塊1、2、3而不儲存4’則節點林能根據以 上經修改節點清單（表4)自節點Β獲取檔案區塊4，且因此 可控追蹤器伺服器206可取消對節點清單之修改。未修改 節點清單可仍然傳回至使用者。 在可修改節點清單之情況下’經修改節點清單發送至邊 緣路由器302，且又傳回至節點Α。在節點錢取經修改節 點清單後，其與節點清單巾之節點（例如，節點B)通信以 獲取所需P2P檔案區塊。此不僅可增加節點a之下載效 率，且亦可降低整個網路之通信負載。 因為可在預定規則庫207或伺服器處理構件2〇5處快取經 修改種子檔案’所以需要快取經修改種子檔案及修改前之 ，子樓案。快取修改前之種子檔案可促進判斷後繼使用者 是否請求㈣種子㈣。可以種子檔㈣式料修改前之 種子檔案’或可料其驗證碼。絲種句f之驗證碼可 進-步節約儲存空間，需要消耗更多計算資源以計算所 請求種子檔案之驗證碼。當節點_經由邊緣路由器2〇2發 出對於相同種子棺案at〇rrent之請求時飼服器處理構件 2〇5可發送經修改種子檔案至節點£，使得節點E與可控追 蹤器伺服器206通信。可控追蹤器飼服器2〇6根據預定規則 修改節點清單，且將其傳回至節點E。 圖2 B為根據本發明之實施例之可控追縱器飼服器之結構 方塊圖。可控追蹤器伺服器包括：用於獲取與p2p檔案對 149920.doc 12 201206130 應之原始追蹤器伺服器中之節點清單的獲取構件；用於根 據預定規則判斷是否需要修改節點清單之判斷構件；用於 在需要修改節點清單的情況下修改節點清單之節點清單修 改構件；及用於將經修改節點清單傳回至使用者之傳回構 . 件。 - 圖2C為根據本發明之實施例之伺服器處理構件之結構方 塊圖。伺服器處理構件包括：用於接收由使用者請求之 P2P種子擋案的接收構件；用於剖析p2p種子檔案以獲取其 中的原始追蹤器伺服器資訊的剖析構件；及用於修改p2p 種子檔案以用可控追蹤器伺服器替換其中的原始追蹤器伺 服器的種子檔案修改構件。 圖3為根據本發明之實施例之引導p2p檔案傳輸之示音 圖。圖3中元件之功能與圖2A中具有相同名稱之元件的功 月實質上相同。伺服器處理構件3〇5用於修改p2p種子檔 案，使得節點A可與可控追蹤器伺服器3〇6通信，且可控追 蹤器伺服器306根據預定規則庫中之規則修改節點清單。 根據圖3中之實施例，當可控追蹤器伺服器3〇6判定經修改 節點清單不具有供節點A獲取p2p檔案所需的足夠節點 • 時’例如，節點B中僅儲存檔案區塊丨、2、3，可控追縱器 伺服器306起始區域301中之節點D，作為區域303中節點！)之 映射節點。與節點D相同之P2P檔案區塊，亦即區塊3及 4，儲存於節點〇'中。可控追蹤器伺服器3〇6進一步將節點 D添加至節點清單中以形成以下表5所示之節點清單，且 將:節點清單傳回至使用者。 H9920.doc -13· 201206130Tian Hao, P2P file transmission occupies in the overall traffic of the network transmission bandwidth.,, page P-P2P communication can lead to abnormal traffic, causing misunderstanding of network resources' and caused by P2P communication Problems such as network congestion, performance degradation, and user dissatisfaction can affect normal web applications (such as bounds, email, etc.), and normal users step in to the web page and receive/send emails at low rates. dissatisfied. #前, For p2p communication, there is no effective rate limiting and booting scheme. SUMMARY OF THE INVENTION To solve the problems in the prior art, the present invention provides an efficient and flexible P2P file transfer management technology. The present invention mainly implements the p2p file (four) transmission rate limit by replacing the original tracker server with the set controllable tracker server and modifying the node list based on predetermined rules in the controllable tracker feeder. 149920.doc 201206130 guide. With the present invention, the network operator can gradually enhance the controllable tracker feeder in p2p communication by gradually weakening the original tracker feeder in p2p communication, and manage it using pre-established rules or principles. File transfer of P2P nodes. Specifically, the present invention provides a controllable tracker feeder for modifying a node list of inter-level p2p files, comprising: obtaining acquisition of a list of nodes in a raw tracker feeder corresponding to a p2p slot case a component; a determining component for determining whether the node list needs to be modified according to a predetermined rule; a node list modifying component for modifying the node list if the node list needs to be modified; and for transmitting the modified node list back to the user Return the component. The present invention also provides a system for managing transmission of a peer-to-peer P2P file, the system comprising a server processing component, the server processing component further comprising: a receiving component for receiving a P2P seed file requested by a user; The P2P seed file is used to obtain the profiling component of the original tracker server information; and the seed file modifying component for modifying the P2P seed file to replace the original tracker server therein with the controllable tracker word server. The present invention also provides a method for modifying a node list of a P2P file between peers, which includes: obtaining a list of Ip points in the original tracker server corresponding to the P2P file; determining whether the node list needs to be modified according to a predetermined rule; The node list is modified if it needs to be modified; and the modified node list is passed back to the user. The present invention also provides a method for managing transmission of P2P files between peers, which includes 149920.doc 201206130 to obtain a P2P seed file requested by a user; parse the p2p seed file to obtain original tracker server information therein; and modify p2p The seed file replaces the original tracker server with a controllable tracker server. The above description of the present invention will be more apparent from the detailed description of the preferred embodiments of the invention. [Embodiment] The drawings and the drawings are only used to illustrate the exemplary embodiments of the present invention, and should not be construed as limiting the invention. In the following discussion, numerous specific details are set forth in order to provide an understanding of the present invention. However, it will be apparent to those skilled in the <RTIgt; It is to be understood that any of the following specific terms are used for ease of description only and thus the invention should not be limited to any particular application identified and/or implied by such terms. The functions described in the present invention may be implemented by software or hardware or a combination thereof unless otherwise stated. However, in the embodiments, unless otherwise stated, such functions are performed by a processor (such as a computer or electronic data processor) based on a coded integrated circuit (such as encoded by a computer program). In general, the methods executed to implement the embodiments of the present invention can be part of an operating system or a particular application, program, module, article, or sequence of instructions. The soft pass* of the present invention includes various extensions that will be presented in a machine readable format that can be sold by the area, and thus are executable instructions. In addition, the private type includes a relative residency with the program or may be accompanied by a man. The variables and data structures in the hidden body. In addition, the various programs described below can be identified by the application method of the specific embodiment of the present invention, 149920.doc 201206130. Such a signal bearing medium, when it carries a computer readable instruction for the function of the present invention, represents an embodiment of the present invention. FIG. 2A is a schematic diagram of a P2P file transfer restriction according to an embodiment of the present invention. The cell 201 includes nodes a, B, and E, and the cell 203 includes C and D. Nodes A, B, and E communicate with the outside via edge router 2〇2. Nodes c, 联络 communicate with the outside via edge router 204. If node a requests to obtain the seed file at〇rrent on seed server 108, then the request sent by edge router 202 via node A (such as HTTP delta request, FTP request, and the like) when the request is passed via edge router 2〇2 Requesting) the request to detect the request to obtain the p2p seed file, the edge router sends the request to the server processing component (chaser processor) 205 » the server processing component 205 forwards the request to the seed server 208, and The seed server 2〇8 obtains the corresponding at〇rrent file. Figure 4A is a schematic diagram of a typical P2P seed file. Then the 'server processing component 2〇5 parses the a.torrent Tan case, the token server information is measured, and when it finds that the tracker server in the seed file is a non-controllable tracker server (ie, When the original tracker server 2〇9) 'modifies the a.torrent file and replaces the original tracker server 2〇9 with the controllable tracker server 2〇6, the controllable tracker server 206 is used for shifting In addition to the dependency of node A on the original tracker server 2〇9, node eight does not need to communicate with the original tracker server 2〇9 during the download of the subsequent P2P seed file' and only with the controllable tracker server 2〇 6 communication. The IP address of the controllable tracker server can be stored in the server processing component 205 or can be stored in a predetermined rule base 2〇7. When the IP address of the controllable tracker servo 149920.doc 201206130 is stored in the predetermined rule base 207, the server processing component 205 needs to communicate with the predetermined rule base 207 to obtain the IP address of the controllable tracker server. Figure 4B is a schematic illustration of a P2P seed file modified in accordance with an embodiment of the present invention. Table 3 below lists the detailed explanation of the modified a.torrent file item by item. The content of the modified a.torrent file d The structure of the seed file is "Dictionary" type ~ 8 :announce47 :http://managedtracker. example .com: 8066/announce The tracker server has been replaced by the original tracker server The tracker server deletes the alternate raw tracker server information. The server processing component 205 can also set a standby controllable tracker server (not shown) 10: created by 13: Creatorl/0.70 Builder software. Although the builder software is modified in an embodiment of the present invention, the server processing component 2〇5 can modify the tile builder software ~ 13:creation dateil226980360e creation date. Although in the embodiment of the present invention, the creation date is not modified, the server processing component 2〇5 may modify the encoding format of the original creation date information 8: encoding3: GBK building information. Although in the embodiment of the present invention, the encoding format of the file information is not modified, the server processing component 205 may modify the original encoding format and re-encode the subsequent file information after modifying the editing format 4: infod5: filesld6: lengthil83e4: Path 110:3FFile.urlel0:path.utf-8112:3EF ile.urleed6:lengthi2707e4:pathl46:3 E... The beginning of the file information <other content> The content part of the file information Table 3 should pay special attention, although A controllable tracker server 2〇6 describes the invention, but in practice the invention may use a plurality of controllable tracker servers. When using a plurality of controllable tracker servers, a controllable tracker feeder and a number of standby controllable 149920.doc 201206130 * tracer servers can be set in the at〇rre_ case. The 1G modified seed slot case will be passed back to node A, and node A will further communicate with the controllable tracker server 206 to obtain a list of nodes based on the index of the seed standard. The controllable tracker server 206 will obtain a list of nodes corresponding to the seed standard from the original tracker server 2, and determine whether the node list needs to be modified based on a predetermined rule obtained from the predetermined rule base 2〇7. Pre-rule rules can filter out nodes that are not in the same region as the user. According to an embodiment of the invention, node A is not in the same cell as nodes 匚, D, so controllable tracker server 〇6 will delete nodes C, D from the list of nodes. Table 4 below shows a list of deleted nodes. Node IP Address Archive Block Identifier B 10.1.1.1 1, 2, 3, 4 Table 4 The following describes in detail how to determine whether Node A is in the same area as other nodes via a subnet mask. False <» subnet mask is 24 bits, that is, the subnet mask is 2 5 5 · 2 5 5 · 25 5 · 0 ', then 2 5 5 ip bits can be obtained for the subnet mask Address, so it is easy to determine whether two IP addresses are in the same area by an AND operation between the subnet mask and the IP address. For example, the IP address 10.1.1.1 and the IP address 10.1_1.2 are nodes located in the same area. For a sub-mask with 16 bits, that is, the subnet mask is 255 255 〇 〇, the IP address 10.1.1.1 and the IP address 1〇·1·2·13 belong to the same area. Those skilled in the art will appreciate that although the present invention is described as an example of an I49920.doc 201206130 sub-mask having 16 bits and 24 bits, 'but other bits can be used (such as 22 bits). The subnet mask of the element, 25 bits, and the like is used to determine whether the two IP addresses are in the same area. According to an embodiment of the present invention, only nodes in the local area network are allowed to transmit P2P standards. As those skilled in the art can understand that the range of the regional network can be extended to a multi-level access network, that is, the access network is allowed. All nodes with the same level in the road transmit P2P files. Figure 5 is a schematic illustration of a knifeing area in accordance with an embodiment of the present invention. In the embodiment of Fig. 5, node a can communicate with nodes c and , because nodes C and D and node A belong to the same access network 5〇5. In accordance with another embodiment of the present invention, where the current network transmission load exceeds a predetermined threshold, e.g., above a percentage value, the node list is excluded from nodes that are not in the same area as the user. In accordance with yet another embodiment of the present invention, during the peak time of network transmission, for example, 9a.m. to 5p.m·' from the list of nodes screens out nodes that are not in the same area as the user. - according to a further embodiment of the invention, if the subscription status of the user satisfies a predetermined condition, for example, for the use of monthly payment, the 'self-node list screens out the nodes in the area that are not in the user's position, the gentleman For non-praise users, the node list is filtered out of nodes that are not in the same region as the user. # According to yet another embodiment of the present invention, at least one particular node is screened from the list of nodes, e.g., screened out nodes that are known to specifically propagate illegal works. Those skilled in the art will appreciate that other predetermined rules can be established to meet the constraints of the network operator to achieve a P2P communication node. The controllable tracker server can be used for step-by-step judgment; ^ is not included in the node. 149920.doc 201206130 There are file blocks of P2P files that are not included in the node. For example, suppose the node does not store all the file blocks of the P2P file, and the node Β only stores the slot blocks 1, 2, 3 without storing 4', then the node forest can according to the above modified node list (Table 4) The file block 4 is obtained from the node, and thus the controllable tracker server 206 can cancel the modification of the node list. The unmodified node list can still be passed back to the consumer. In the case where the list of nodes can be modified, the modified list of nodes is sent to the edge router 302 and back to the node Α. After the node money has taken the modified node list, it communicates with the node of the node list (e.g., Node B) to obtain the desired P2P file block. This not only increases the download efficiency of node a, but also reduces the communication load of the entire network. Since the modified seed file can be cached at the predetermined rule base 207 or the server processing unit 2〇5, it is necessary to cache the modified seed file and the sub-structure before the modification. Cache the pre-modified seed file to facilitate the determination of whether the subsequent user requests (4) the seed (4). The seed file before the modification can be modified by the seed file (4) or the verification code can be used. The verification code of the silk sentence f can further save storage space and consume more computing resources to calculate the verification code of the requested seed file. The feeder processing component 2〇5 may send the modified seed file to the node £ when the node _ sends a request for the same seed file at〇rrent via the edge router 2〇2, such that the node E and the controllable tracker server 206 Communication. The controllable tracker feeder 2〇6 modifies the list of nodes according to predetermined rules and returns them to node E. Fig. 2B is a block diagram showing the structure of a controllable tracer feeder according to an embodiment of the present invention. The controllable tracker server includes: an acquisition component for obtaining a list of nodes in the original tracker server corresponding to the p2p file pair 149920.doc 12 201206130; a determination component for determining whether the node list needs to be modified according to a predetermined rule; A node list modification component for modifying a node list if the node list needs to be modified; and a return component for transmitting the modified node list back to the user. - Figure 2C is a block diagram showing the structure of a server processing component in accordance with an embodiment of the present invention. The server processing component includes: a receiving component for receiving a P2P seed file requested by the user; a profiling component for parsing the p2p seed file to obtain the original tracker server information therein; and modifying the p2p seed file to The seed file modification component of the original tracker server is replaced with a controllable tracker server. 3 is a pictorial diagram of a guided p2p file transfer in accordance with an embodiment of the present invention. The function of the elements in Fig. 3 is substantially the same as the function of the elements having the same names in Fig. 2A. The server processing component 3〇5 is used to modify the p2p seed file so that node A can communicate with the controllable tracker server 3〇6, and the controllable tracker server 306 modifies the node list according to the rules in the predetermined rule base. According to the embodiment in FIG. 3, when the controllable tracker server 3〇6 determines that the modified node list does not have enough nodes for node A to acquire the p2p file, eg, only the file block is stored in the node B. 2, 3, the node D in the start region 301 of the controllable tracker server 306 is used as the node in the area 303! Map node. The same P2P file block as node D, that is, blocks 3 and 4, is stored in node 〇'. The controllable tracker server 〇6 further adds node D to the list of nodes to form a list of nodes as shown in Table 5 below, and returns the list of nodes back to the user. H9920.doc -13· 201206130
節點 根據表5中之資訊，節點A可與其擁有的區域中之節點b 及節點D·通信。 熟習此項技術者可瞭解’節點D，亦可視情況儲存節點d 中之-部分檔案區4，例如，其僅儲存播案區塊4而不儲 存擋案區塊3。此可進-步節約映射節點中之儲存空間， 且不會阻止節點A獲取P2P槽案。 在上述實施例中，起始節點D，，且將節點D中之p2p檔案 4又複製至節點D’，此可能消耗一些網路資源，然而，一旦 在區域3〇1中起始節點D，，則當此後區域3〇1中其他節點請 求相同P2P檔案時，可自本地節點快速地獲取相應資源。 為增強儲存效率，可將P2P檔案儲存於節點D，中達預定時 間段，例如，一週或一個月等。 熟習此項技術者可瞭解，除預定規則外，節點D，可進一 步滿足其他規則。舉例而言，節點D，不僅與節點A位於同 一區域網路中，而且僅在不為網路傳輸峰值時間的週期期 間起始節點D’。 根據本發明之實施例，儘管可控追蹤器伺服器修改節點 清單’但可控追蹤器伺服器仍然可與原始追蹤器伺服器週 期性地通信以獲取與P2P種子檔案對應之經更新之節點清 單’且再次根據預定規則修改經更新之節點清單。此係因 149920.doc 201206130 為若向可控追蹤器伺服器通知添加及刪除與原始追蹤器伺 服器通信之節點，則可控追蹤器伺服器中可維護經更新之 知點π單，可控追縱器伺服器可修改經更新之節點清單， 且發送經修改之更新節點清單至使用者節點Α。 圖6Α為根據本發明之實施例之管理ρ2ρ檔案傳輸之流程 圖。在步驟6〇1中，獲取由使用者請求之ρ2ρ種子檔案 步驟602中’剖析該Ρ2Ρ種子樓案以獲取其中的原始追縱器 伺服器資訊，且經剖析Ρ2Ρ種子檔案展示於以上表。在 步驟603中，修改該P2P種子播案以用可控追蹤器伺服器替 換其中的原始追蹤器伺服器，且經修改之p2p種子檔案展 示於圖4B中。 ' 圖6B為根據本發明之實施例之修改p2p檔案之節點清單 之流程圖。在步驟611中，獲取與p2p檔案對應之原始追縱 _器中之節點清單。在步驟612中，根據預定規則判 斷是否需要修改節點清^㈣本發明之實_，預定規 則可為自節點清單篩除不與使用者位於同-區域中之節 點。因此，若節點清單中所有節點均與使用者位於同一區 =中’則無需修改節點清單（圖中未展示）。若節點清單中 存在不與使用者位於同一々 £域中之即點，則在步驟ό 13中 修改節點清單。 經修改之節點清單展示於以上表4中。在步驟614中，將 經修改之節點清單傳回至使用者。Node According to the information in Table 5, node A can communicate with node b and node D· in the area it owns. Those skilled in the art will be able to understand the 'node D' and also store the partial file area 4 in the node d, for example, which only stores the broadcast block 4 without storing the block 3. This can further save the storage space in the mapping node and does not prevent node A from acquiring the P2P slot. In the above embodiment, the node D is started, and the p2p file 4 in the node D is copied to the node D' again, which may consume some network resources. However, once the node D is started in the area 3〇1, Then, when other nodes in the area 3〇1 request the same P2P file, the corresponding resources can be quickly obtained from the local node. To enhance storage efficiency, the P2P file can be stored in node D for a predetermined period of time, for example, one week or one month. Those skilled in the art will appreciate that node D, in addition to the predetermined rules, can further satisfy other rules. For example, node D, not only in the same local area network as node A, but only starts node D' during the period in which the network transmission peak time is not. In accordance with an embodiment of the present invention, although the controllable tracker server modifies the node list', the controllable tracker server can still periodically communicate with the original tracker server to obtain an updated list of nodes corresponding to the P2P seed file. 'And again modify the updated list of nodes according to the predetermined rules. This is because 149920.doc 201206130 is a node that can communicate with the original tracker server if it is notified to the controllable tracker server. The updated tracker server can maintain the updated knowledge point π, controllable. The tracker server may modify the updated list of nodes and send a modified list of updated nodes to the user node. Figure 6 is a flow diagram of managing ρ2ρ file transfers in accordance with an embodiment of the present invention. In step 6.1, the ρ2ρ seed file requested by the user is obtained in step 602 to parse the Ρ2Ρ seed building to obtain the original tracker server information therein, and the parsed Ρ2 Ρ seed file is shown in the above table. In step 603, the P2P seed broadcast is modified to replace the original tracker server therein with a controllable tracker server, and the modified p2p seed file is shown in Figure 4B. Figure 6B is a flow diagram of a list of nodes for modifying a p2p file in accordance with an embodiment of the present invention. In step 611, a list of nodes in the original tracer corresponding to the p2p file is obtained. In step 612, a determination is made as to whether or not the node needs to be modified according to a predetermined rule. The predetermined rule may be a node from the node list that is not in the same region as the user. Therefore, if all the nodes in the node list are in the same area as the user = there is no need to modify the node list (not shown). If there is a point in the node list that is not in the same 々 domain as the user, then in step ό 13, the node list is modified. A list of modified nodes is shown in Table 4 above. In step 614, the modified list of nodes is passed back to the user.
热習此項技術者可瞭解，預定相目,丨x μ t I 頂疋規則不限於上述實施例， 實情為，其可具有讀變化，包括在當前網路傳輸負載超 149920.doc 201206130 過=臨限值的情況下自節點清單篩除不與使用者位於同 二區域中之節點、在網路傳輸峰值時間期間自節點清單筛 除不與使用者位於同一區域中 之卽點、在使用者之訂用狀 預定條件的情況下自節點清單篩除不與使用者位於 同一區域中之節點或自節駄、，主 飞目卽點，月早篩除至少一特定節點。 圖6A及圖6B經由虛線連接之節點I、π、本發明 中一些額外步驟。其將於下文中加以解釋。 圖7為根據本發明之實施例之監視p2p種子檔案之流程 圖在步驟701中，接收由使用者發送之請求，例如町以 請求。HTTP請求訊息中載運種子槽案之特徵值。在步驟 702中’錯由監視此等特徵值，判斷由使用者發出之請求 是否為對P2P種子稽案之請求。若請求為對p2p種子棺案之 請求，則過程返回至節點！，且在步驟7〇3中進行至圖从中 之步驟。若請求不為對P2P種子檔案之請求，則過程在步 驟704退出且不返回至節點I。 圖8及圖9描述進—步處理經修改節點清單之兩項實施 例。圖8為根據本發明之實施例之取消對節點清單之修改 的抓程圖。在圖8中，在步驟8〇1中首先判定自節點清單刪 除之節點是否含有未刪除節點中不含有之p2p稽案之槽案 區塊S判疋結果為「否」，亦即，可在未刪除節點中發 現經刪除節點中含有之全部槽案區塊，則過程返回至節點 II ’且在步驟802中進行至圖6B中之相應步驟。若判定結 果為「是」，亦即，不能在未刪除節點中發現經刪除節點 中含有之至少一檔案區塊，則在步驟8〇3中取消對節點清 149920.doc •16· 201206130 單之修改，且在步驟804中將未經修改之節點清單傳回至 使用者，在步驟805中過程退出且不返回至節點π。 圖9為根據本發明之實施例之引導ρ2ρ檔案傳輸之流程 圖。在步驟9〇1中，判定自節點清單刪除之節點是否^有 • 未刪除之節點中不含有之P2P檔案區塊。若判定結果為 • 「是」’亦即’在未刪除之節點中不能發現經刪除節點中 含有之至少-稽案區塊，則在步驟9〇2中，起始足夠的令 合預定規則之映射節點，該等映射節點中儲存盘自節以 單刪除之節‘點中之Ρ2Ρ檔案區塊相同的ρ2ρ槽案區塊。在: 驟903中，將映射節點添加至節點清單中，且在步驟— 中’將添加有映射節點之節點清單傳回至使用者。接著 在步驟906中，過程退出節點m，且不進行至圖㈣ 應步驟。 祁 右判定結果為「否丨，亦gP 士 公」方即，可在未刪除節點中發現經 删除節點中含有之全部檔荦區揄 堉莱W ’則過程返回至節點ΙΠ， 且在步驟905中進行至圖印中之相應步驟。 熟習此項技術者可瞭解，^ ± 解可由儲存於電腦程式產品中之 可執仃程式實施以上操作過程中 办仏占 可有程式產品定ϋ 各種實施例之功能且載運各種作號，/j妊以 、 观包括（但不限於1、 • 水久儲存於不可抹除儲存媒體上之資訊.射 儲存媒體上之資訊;或3)經由通二)儲存於可抹除 如經由電腦網路$ °媒體（包括無線通信）(諸 丄由=，料或U網路）傳送至電腦之 之’包括自網際網路及其他網路下載之資訊。 本發明之各種實施例可提供許多優點 149920.doc 201206130 述中說明之優點及可自技術解決方案本身導出之優點。然 而，無論一實施例是否可獲得所有優點且無論該等優點是 否被看作顯著改良，其均不限制本發明。同時，上述各種 實施例僅係出於說明目的，熟習此項技術者可在不偏離本 發明之實質的情況下對上述實施進行各種修改及變化。本 發明之範疇完全由附加申請專利範圍界定。 【圖式簡單說明】 圓1為典型P2P檔案傳輸之示意圖。 圊2 A為根據本發明之實施例之限制p2p樓案傳輸之示意 圖。 圖2B為根據本發明之實施例之可控追蹤器伺服器之纟士構 方塊圖。 圖2 C為根據本發明之實施例之伺服器處理構件之纟士構方 塊圖。 圖3為根據本發明之實施例之引導p2p檔案傳輪之示音 圖。 圖4A為典型P2P種子檔案之示意圖。 圖4B為根據本發明之實施例修改之p2p種子檔案之示竟 圖。 圖5為根據本發明之實施例之劃分區域之示意圖。 圖6A為根據本發明之實施例之管理P2P檔案傳輪之流程 圖。 圖6B為根據本發明之實施例之修改P2P檔案之節點清單 之流程圖。 149920.doc -18 · 201206130 圖7為根據本發明之實施例之監視p2p種子樓案之流程 圖。 圖8為根據本發明之實施例之取消對節點清單之修改的 流程圖。 圖9為根據本發明之實施例之引導P2P檔案傳輸之潘^ 【主要元件符號說明】 101 區域網路 102 邊緣路由器 103 區域網路 104 邊緣路由器 105 種子伺服器 106 原始追蹤器伺服器 201 小區 202 邊緣路由器 203 小區 204 邊緣路由器 205 伺服器處理構件 206 可控追縱器伺服器 207 預疋規則庫 208 種子伺服器 209 原始追蹤器伺服器 301 區域 302 邊緣路由器 149920.doc 201206130 303 區域 304 邊緣路由Is 305 伺服器處理構件 306 可控追蹤器伺服器 307 預定規則庫 308 種子伺服器 309 原始追蹤器伺服器 501 區域 502 邊緣路由器 503 區域 504 邊緣路由器 505 存取網路 506 邊緣路由器 A 節點 B 節點 C 節點 D 節點 D' 節點 E 節點 I 節點 II 節點 III 節點 149920.doc -20-Those skilled in the art can understand that the predetermined order, 丨x μ t I top rule is not limited to the above embodiment, the fact is that it can have read changes, including the current network transmission load exceeding 149920.doc 201206130 over = In the case of a threshold, the node from the node list is not in the same area as the user, and the user is in the same area from the node list during the peak time of the network transmission, and the user is in the same area. In the case of the predetermined condition of the subscription, the node list is not filtered out from the node list or the self-throttle, the main fly target, and the at least one specific node is screened early in the month. Figures 6A and 6B are connected to nodes I, π via dashed lines, and some additional steps in the present invention. It will be explained below. Figure 7 is a flow chart for monitoring a p2p seed file in accordance with an embodiment of the present invention. In step 701, a request sent by a user, such as a request, is received. The feature value of the seed slot is carried in the HTTP request message. In step 702, the error is monitored by monitoring the feature values to determine whether the request issued by the user is a request for a P2P seed audit. If the request is a request for a p2p seed file, the process returns to the node! And in step 7〇3, the steps from the figure are carried out. If the request is not a request for a P2P seed archive, then the process exits at step 704 and does not return to node 1. Figures 8 and 9 depict two embodiments of the process of processing a modified list of nodes. Figure 8 is a schematic diagram of canceling a modification of a list of nodes in accordance with an embodiment of the present invention. In FIG. 8, in step 8〇1, it is first determined whether the node deleted from the node list contains the slot block S of the p2p audit file that is not included in the undeleted node, and the result is “No”, that is, If all of the slot blocks contained in the deleted node are found in the undeleted node, the process returns to node II' and proceeds to the corresponding step in FIG. 6B in step 802. If the determination result is "Yes", that is, the at least one file block included in the deleted node cannot be found in the undeleted node, then the node 149920.doc •16·201206130 is cancelled in step 8〇3. Modify, and in step 804, the unmodified node list is passed back to the user, and in step 805 the process exits without returning to node π. Figure 9 is a flow diagram of a guided ρ2ρ file transfer in accordance with an embodiment of the present invention. In step 9〇1, it is determined whether the node deleted from the node list has a P2P file block that is not included in the node that is not deleted. If the result of the determination is • "Yes", that is, 'at least the - audited block contained in the deleted node cannot be found in the node that has not been deleted, then in step 9〇2, sufficient order for the predetermined order is started. Mapping nodes in which the storage disk is stored in the same ρ2ρ slot block as the Ρ2Ρ file block in the section of the single deletion section. In step 903, the mapping node is added to the node list, and in step - the 'node list with the mapping node added is passed back to the user. Next, in step 906, the process exits node m and does not proceed to the step (4). If the result of the right judgment is "No, it is also gP", that is, the all the files contained in the deleted node can be found in the undeleted node, and the process returns to the node ΙΠ, and in step 905 Go to the corresponding step in the print. Those skilled in the art will appreciate that the executable can be implemented by the executable program stored in the computer program product, and the functions of the various embodiments are carried out and the various numbers are carried. Pregnancy and observation include (but are not limited to, 1. • information stored on non-erasable storage media for a long time. Information on the storage media; or 3) stored via e-mail. ° The media (including wireless communication) (the data is transmitted to the computer by the =, material or U network) includes information downloaded from the Internet and other networks. Various embodiments of the present invention can provide a number of advantages 149920.doc 201206130 The advantages described herein and the advantages that can be derived from the technical solution itself. However, no matter whether an advantage is obtained by an embodiment or whether such advantages are regarded as a significant improvement, it does not limit the invention. In the meantime, the various embodiments described above are for illustrative purposes only, and various modifications and changes can be made to the above described embodiments without departing from the spirit of the invention. The scope of the invention is fully defined by the scope of the appended claims. [Simple description of the diagram] Circle 1 is a schematic diagram of typical P2P file transmission.圊 2 A is a schematic diagram of the restriction of p2p building transmission according to an embodiment of the present invention. 2B is a block diagram of a gentleman's structure of a controllable tracker server in accordance with an embodiment of the present invention. Figure 2C is a diagram of a gentleman block diagram of a server processing component in accordance with an embodiment of the present invention. Figure 3 is a diagram showing the guidance of a p2p file transfer wheel in accordance with an embodiment of the present invention. Figure 4A is a schematic diagram of a typical P2P seed file. Figure 4B is a diagram of a modified p2p seed file in accordance with an embodiment of the present invention. Figure 5 is a schematic illustration of a divided area in accordance with an embodiment of the present invention. Figure 6A is a flow diagram of managing a P2P file transfer wheel in accordance with an embodiment of the present invention. Figure 6B is a flow diagram of a list of nodes for modifying a P2P file in accordance with an embodiment of the present invention. 149920.doc -18 · 201206130 Figure 7 is a flow diagram of monitoring a p2p seed building in accordance with an embodiment of the present invention. Figure 8 is a flow diagram of canceling a modification to a list of nodes in accordance with an embodiment of the present invention. 9 is a schematic diagram of a P2P file transfer according to an embodiment of the present invention. [Main Element Symbol Description] 101 Area Network 102 Edge Router 103 Area Network 104 Edge Router 105 Seed Server 106 Original Tracker Server 201 Cell 202 Edge Router 203 Cell 204 Edge Router 205 Server Processing Component 206 Controllable Chasing Server 207 Predict Rule Base 208 Seed Server 209 Original Tracker Server 301 Area 302 Edge Router 149920.doc 201206130 303 Area 304 Edge Routing Is 305 server processing component 306 controllable tracker server 307 predetermined rule base 308 seed server 309 original tracker server 501 area 502 edge router 503 area 504 edge router 505 access network 506 edge router A node B node C node D Node D' Node E Node I Node II Node III Node 149920.doc -20-