201015906 九、發明說明： 【發明所屬之技術領域】 包之的傳送方法，特別有關於-種群播時的資料封 【先前技術】 傳輸)也加，路 ❹算機裝朗㈣，，2機衣1的生錢商為了·速的安裝計 機裝置的系統安广在用:路映像備份來進行生產虹 (高__:^輪峨份謝係多以群播 中，=㈣資崎_咖—細成員們。其 二成貝可能分佈在不同的區域網路上， (路地址。群播會比-次只對-個網路節點作傳輸的單二: ❿（職㈣，更節省網路頻寬和網路地址的使用。 傳插 影響再Μ網路狀—戶端等諸多因素的 的目的必須保持資=的過程中常會發生丢失。但映嶋 端進行重發。^ 、凡整性’因此吾失的資料封包必須由飼服 丁重發的群播重發機制係包括以下步驟，請參考「第工 勺'隹> D '、係為白知技術之運作流程示意圖：伺服端將資料封 ⑽餘财發送(步驟S11Q)，並將麟記錄在颜封包中。 而在收到資料封包後並讀取其編號(步驟⑽）。如果與上— 201015906 次收到的細制編號不_，㈣定輸情包錢。隨後， ^^.X^^^it^CTransm^on control protocoI , TCp) 請求的方式要細晴新發送丟失的㈣封包(步驟㈣）。201015906 IX. Description of the invention: [Technical field to which the invention pertains] The transmission method of the package, in particular, the data package when the population is broadcasted [previously] transmission is also added, the road computer is equipped with a lang (four), 2 machine clothes The producer of the 1st money for the speed of the installation of the system of the computer is widely used: road image backup to produce production rainbow (high __: ^ 峨 峨 谢 谢 谢 谢 以 以 群 群 群 群 = = = 咖 咖- Fine members. The second 20% of them may be distributed on different regional networks. (The road address. The multicast will be transmitted only one time - only one network node: ❿ ((4), more network-saving The use of bandwidth and network address. The purpose of interpolating and affecting the network--the terminal and other factors must be lost in the process of keeping the money. However, the image is retransmitted. ^, the integrity 'Therefore, the data packet that I lost must be re-issued by the feeding service. The following steps are included. Please refer to the "Working spoon" 隹> D ', which is the schematic diagram of the operation process of Baizhi technology: the server will The data seal (10) is sent (step S11Q), and the record is recorded in the Yan package. After the data packet is read and its number is read (step (10)). If the fine number received with the above - 201015906 is not _, (4) the money is lost. Then ^^.X^^^it^CTransm^on Control protocoI, TCp) The method of requesting is to send the missing (four) packet (step (4)).
夕這種機制的缺陷在於：由於Tcp傳輸她於群播速度要慢得 ^所以當網路狀況不佳且射概錢比較頻繁時，傳輸效率 大幅降低。若是資料封包的丢失多發生在交換機或其他 ，路閘這設備時，這樣會使得此-網域中的客戶端都無法接收到 这漏的貝料封包。因而造成触端在同—時間中收到大量取請 求’使得伺服端壓力嚴重增加。 . σ月 【發明内容】 馨於以上關題，本發明的主要目的在於提供—種網路封包 之發运方法，於伺服端在網路群播的不_合時，對於 端未接收的資料封包之補發處理。 、 /為達上述目的’本發明所揭露之—種網路封包之發送方法， 其係包括以下步驟：伺服端發送複數個f料封包，並對資料 ^派相應峨心離㈣職；縣⑽進行檢^ 序，據資料封包的編號肋確認所接收到的資料封包 j =收到的㈣封包記錄在檢查報告中；客戶端將檢查報告專 匕妾收門&值，右檢查報告符合封包接收門禮值日夺，飼服端 201015906 回合時利用群播方式重新發送客戶端奸收至ί 封包，若檢查報告夫您 文收到的資料 合的群播結束後，再利=包接收陳料，伺服鱗在所有回 接收到的:嶋包㈣傳麵細蝴新發送客戶端未 :是針===服端重新發送資料封包的發送方法，特別 未被接收的資料伺™ ❿方式進行補發的_ 方式或傳輸控制協議的 的資料：;Γ使峨^ 亦可以降低客戶端佔用網路頻寬的使用率。 ^關本發明的特徵與實作，兹配合圖示作最佳實施例詳細說 【實施方式】 言青「糾 φ $ 2 ®」所不’其係為網路架構示意®。在本發明 ❿明务個飼服端跡第一客戶端220與第二客戶端230作為說 亚非數量你限於此。鑛端21Q透 第二客戶端2,並且一 —_、而飼服全而210在傳送資料封包前會指派唯-的編號給每 滩、^ =封包。在伺服端21 〇中儲存有雜湊集合表(hash set iabIe)。 二 σ表係用以記錄客戶端未接收到的資料封包之編號。 厂土夕 弟3圖」所示，其係為本發明之一種實施態樣流程 不思圖。飼服端發送複數個資料封包，並指派資料封包相應的編 201015906 號(步驟S310)。客戶端接收資料封包(步驟S32⑺。在客戶端中進 行檢查程序，根據資料封包的編號用以確認所接收到的資而料封 包，並將未被接收到的資料封包記錄在檢查報告中(步騍S33〇)。 根據當前收到的資料封包(編號為N)與前一個收到的資料封 包(編號為M)進行比對(步驟S340)。其中，比對資料封包n與資 料封包Μ的比對方式包括有以下情況。第一種狀況：若編號Ν'的 資料封包小於編號Μ的資料封包，則捨棄編號為ν的資料封包。 ❹第二歡況：若編號Ν的資顯包等於編號Μ的㈣封包，則繼 ，，接收次料封包。第三種狀況：若編號Ν的資料封包大於編 號Μ的資料封包，則將編號雕Μ)區間的資料封包記錄至檢查 報告中。 將檢查報告回傳至祠服端(步驟S35〇)。由飼服端執行重發顏 序，飼服端根據網路傳輸速度決定封包接收門檀值(步驟s X;The shortcoming of this mechanism is that the transmission efficiency is greatly reduced when the network is in a bad condition and the cost is relatively high because of the slow transmission of the Tcp transmission. If the loss of the data packet occurs mostly in the switch or other device, this will prevent the client in this domain from receiving the leaked packet. As a result, the contact end receives a large number of requests in the same time - causing a severe increase in servo pressure. σ月[Abstract] The main purpose of the present invention is to provide a method for shipping a network packet, which is not received by the server when the network is not in the network. Reissue processing of the packet. And / for the above purpose, the invention discloses a method for transmitting a network packet, which comprises the following steps: the server sends a plurality of f-packets, and sends a corresponding message to the data (four); county (10) Check the sequence, confirm the received data packet according to the numbering rib of the data packet j = the received (four) packet is recorded in the inspection report; the client will check the report to collect the door & value, the right inspection report meets the packet Receiving the door ceremony value, the feeding service end will use the group broadcast method to resend the client's profit to the ί packet during the 201015906 round. If the report receives the information received by the reporter, the group will receive the message. Material, servo scale received at all back: 嶋 ( (4) 传 细 新 新 新 新 新 新 新 新 新 新 新 新 新 新 新 = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = = The information of the re-issued _ mode or transmission control protocol: Γ ^ can also reduce the usage of the network bandwidth occupied by the client. The features and implementations of the present invention will be described in detail with reference to the preferred embodiments. [Embodiment] The phrase "correction φ $ 2 ®" is not indicated by the network architecture. In the present invention, the first client 220 and the second client 230 are limited to the number of Asian and African clients. The mine end 21Q penetrates the second client 2, and one-_, while the feeding service is full and 210 will assign a unique number to each beach, ^ = packet before transmitting the data packet. A hash set iabIe is stored in the server 21 〇. The two σ table is used to record the number of the data packet that the client has not received. As shown in Figure 3 of the factory, it is an embodiment of the present invention. The feeding end sends a plurality of data packets, and assigns a data packet to the corresponding number 201015906 (step S310). The client receives the data packet (step S32 (7). The checking process is performed in the client, and the received data packet is confirmed according to the number of the data packet, and the unreceived data packet is recorded in the inspection report (step骒S33〇). According to the currently received data packet (numbered as N) and the previous received data packet (numbered as M) (step S340), wherein the comparison data packet n and the data packet Μ The comparison method includes the following cases: The first situation: if the data packet of the number Ν' is smaller than the data packet of the number Μ, the data packet numbered ν is discarded. ❹Second situation: if the numbered package is equal to The (4) packet of the number Μ, then, receives the packet of the secondary material. The third condition: if the data packet of the number Ν is larger than the data packet of the number Μ, the data packet of the numbered Μ) is recorded in the inspection report. The inspection report is transmitted back to the server (step S35〇). The re-issuing sequence is performed by the feeding end, and the feeding end determines the receiving value of the receiving door according to the network transmission speed (step s X;
P - SpeedP - Speed
Datagram 一 —* Intei^val 式1 p 係為封包Η檻值，.Speed係為網路傳輸速度；加鹏 為貝’斗封^大小’ Interval係為柯服端檢查報告的間隔時間。 若檢查報告符合封包魏聰值時，贿端係在次-回合時 用群播方式重新發送客戶端未接收到的資料封包(步驟咖 若檢查報告未符合封包概聰辦、在於次-回合時 利用傳輸控制協定的方式重新發送客戶端未接收到的資料封包(步 10 201015906 ❺ =「第4A圖」與「第4B圖」所示，其係為本發明的實 心a ^意圖。域清楚說明本發明之運作過程，在此以下 作她，讎梅此_細<。軸⑽發送 ㈣個貧料封包(其被指派的編號由〇〜999)。飼服端別盘客戶 路傳輸速度假設為8()趣卿咖，資料封㈣大 2黯，飼服端210檢查報告的間隔時間係為^。並且為清楚 Γ明客戶端所接收的資料封包之時間點，以下將以第-時間點、 弟一時間點、第三時間點與第四時間點依序作說明。 首先，由飼服端2K)開始依序地發送資料封包。第一客戶端 士開始接收伺服端別所發送的資料封包。第—客戶端22〇在第 一_點時接收到編號22的資料封包；第—客戶端22q於第二時 間，時到編號為25的資料封包，在第—時間點至第二時間點 之期間中第—客戶端22〇並未接收到其他資料封包。第—客戶端 參 會向伺服端21G發送-檢查報告，要求飼服端21()重新發送編 號23與編號24的資料封包。 主^艮端210在接收到檢查報告後，錬端會根據檢查報 j否符合封包接收服值用以決定餘補發㈣封包。再將上 述％境參數代帶入(式U可以得賴*2/(8*2)=10。第一客戶端22〇 、、、失封包被里小於封包接收門檻值。所以飼服端別會重新透 過群播的方讀_發資料封包。 方面第一客戶端23〇在第三時間點時接收到編號3〇〇 11 201015906 次轉封勺。_弟―各户端230在第四時間點時接收到編號35〇的 产查報主B司服"而210在接收到檢查報告後，伺服端2!〇會根據 ^第=否符合封包触nM值肋決定_補發資料封包。 伺服端210 Γ端230的遺失封包數量大於封包接收門禮值。所以 包。曰在群播結錢，利訂❹齡進行重新補發資料封 特别=峨供—翻服端加重新發輯科封包的發送方法， 客戶她路咖顿a。健端加係依據 各戶编所未被接收的資料封 制協議的蝴簡物。餅或傳輸控 補齊遺漏㈣，心、 ％相在有限的時間中 ★ Ί…崎低客戶端佔用網路頻寬的使用率。 雖4發_祕讀辟補_如上，鮮並 疋本發明，任何熟習相像技蓺 、 ❹ 内，當可作些許之更_二:::::=_圍 f明細增梅機糊須視 【圖式簡單說明】 第1圖係為f知技術之運作流程示意圖。 第2圖係為本發明之架構示意圖。 f3圖係為本發明之1實施態樣流程示意圖 弟4A圖係為本發明的實施態樣運作示意圖。 第4B圖係為本發明的實施態樣運作示意圖。 12 201015906 【主要元件符號說明】 210 伺服端 220 第一客戶端 230 第二客戶端Datagram - * Intei^val Equation 1 p is the packet Η槛 value, .Speed is the network transmission speed; Jia Peng is the shell 斗 封 封 ^ size ' Interval is the interval between the Ke service end inspection report. If the inspection report meets the value of the package Wei Cong, the bribe end resends the data packet that the client has not received in the multicast mode during the second-round (the step of the coffee inspection report does not meet the package, the second-round) The data packet not received by the client is retransmitted by means of the transmission control protocol (step 10 201015906 ❺ = "4A" and "4B"), which is the solid a ^ intent of the present invention. In the operation process of the present invention, the following is made for her, and the shaft (10) sends (four) poor material packets (the assigned number is from 〇 to 999). The feeding speed of the customer's road transmission speed is assumed. For the 8 () interesting coffee, the data seal (four) big 2 黯, the interval between the inspection report of the feeding end 210 is ^. And in order to clearly indicate the time point of the data packet received by the client, the following will be the first time Point, brother one time point, third time point and fourth time point are explained in order. Firstly, the data packet is sent sequentially from the feeding end 2K). The first client starts to receive the data sent by the server. Packet. The first client 22 is in the first At the time of _, the data packet of number 22 is received; the first client 22q arrives at the data packet numbered 25 at the second time, and the client-client 22 is in the period from the first time point to the second time point. The other data packet is not received. The first client sends a check report to the server 21G, requesting the feeding end 21 () to resend the data packet of number 23 and number 24. The main terminal 210 receives the inspection report. After that, the terminal will determine whether the packet is received according to the inspection report, and then the above-mentioned % parameter is substituted (the formula U can be relied on *2/(8*2)=10. The first client 22〇,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,,, Received the number 3〇〇11 201015906 sub-sealing spoons._Different--the terminal 230 received the number 35〇 of the inspection report at the fourth time point, and the 210 received the inspection report. Servo terminal 2! 决定 will be based on ^ = no to meet the packet touch nM value rib decision _ replacement data packet. The number of lost packets of the terminal 210 terminal 230 is greater than the value of the packet receiving door. Therefore, the package is saved in the group broadcast, and the data is re-issued for the age of the package. The method of sending, the customer she Lu Jiadun a. Jianduan Jia is based on the data of the unsealed data sealed agreement of each household editor. The cake or transmission control is missing (four), heart, % phase in a limited time In the middle of the Ί... 崎 low client usage network bandwidth usage. Although the four hair _ secret reading _ _ above, fresh and 疋 疋 发明 , 任何 任何 任何 任何 任何 任何 任何 任何 任何 任何 任何 任何 任何 任何 任何2:::::=_ 围 围 细 细 增 增 机 机 机 机 机 机 机 机 机 机 机 机 机 机 机 机 机 机 机 机 机 机 机 机 机 机 机Figure 2 is a schematic diagram of the architecture of the present invention. The f3 diagram is a schematic diagram of the embodiment of the present invention. The diagram of the 4A diagram is a schematic diagram of the operation of the embodiment of the present invention. Figure 4B is a schematic view of the operation of the embodiment of the present invention. 12 201015906 [Key component symbol description] 210 Servo terminal 220 First client 230 Second client
1313