TWI224915B - System and method for managing flow bandwidth utilization in a packet communication environment - Google Patents

System and method for managing flow bandwidth utilization in a packet communication environment Download PDF

Info

Publication number
TWI224915B
TWI224915B TW90129433A TW90129433A TWI224915B TW I224915 B TWI224915 B TW I224915B TW 90129433 A TW90129433 A TW 90129433A TW 90129433 A TW90129433 A TW 90129433A TW I224915 B TWI224915 B TW I224915B
Authority
TW
Taiwan
Prior art keywords
time
time slot
input packet
rate
packet
Prior art date
Application number
TW90129433A
Other languages
Chinese (zh)
Inventor
Neng-Fu Huang
Shr-Ming Jau
Original Assignee
Broadweb Corp
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Broadweb Corp filed Critical Broadweb Corp
Priority to TW90129433A priority Critical patent/TWI224915B/en
Application granted granted Critical
Publication of TWI224915B publication Critical patent/TWI224915B/en

Links

Landscapes

  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

To manage the bandwidth of a network, a novel rate control scheme, time-division-queue rate control scheme (TDQ-RCS), is provided. The TDQ-RCS according to the present invention can rapidly determine departure time of an arrival packet, add the arrival packet into the time division queue to which it belongs according to the departure time, and then output the packet on schedule. All algorithms employed by the TDQ-RCS can be completed in a constant time since these algorithms are simple for the arrival packets of different sizes. Especially, the TDQ-RCS neither generates any dummy packet nor wastes any bandwidth but still can accomplish the bandwidth management. Therefore, the present invention significantly accomplishes the bandwidth management of a network without generating any dummy packet and wasting the bandwidth.

Description

A7發明説明(1 發明範疇 本發明係有關於數位封包電信,更明確而言,係有關用 以在-封包通訊環境中管理流程頻寬利用之系統及方法。 發明背景 在-網路環境中,當在網路上的資料流流動增加時,網 路的喪、寬m纟要課題。在網路頻寬管理的技藝中, 在技藝中熟諳此技者通常可藉由使用者預先定義的以政策 為主,QoS規則而控制每個流量流的頻寬。實際上,網路的 頻寬管理具有數個優點,例如最大允許流量流的保護與端 段端路由擁塞的減少發生。為-了要達成頻寬管理,數個傳 統技術方法提議具有一般化處理器共用(Gps)性質(有關更 詳、”田說明’明參考附錄的2、6、和i 3)。這些技術是㈣ (Weight Fair Queuing) ^ WF2Q (Worst-case-Fair Weighted Fair Queuing)等(有關更詳細說明,請參考附錄、3、4 和12)事貫上,這些傳統機構皆針對以加權為主之頻寬 官理演算法,而且研究團體更加注意演算法。此外,WFQ已由 Internet Engineering Task F〇rce(IETF)機構提議具有 未來整合服務網路的一基本建構方塊。然而,這些技術是 如此複雜以致於他們不能夠經濟有效在高速度網路裝置 中實施(有關更詳細說明,請參考附錄的3和5)。此外,他 們亦不能達成率限制控制的使用者友善控制方式。 ^要決定在上述問題,在一些既有網路設備中,一主動 傳輸率控制方法可在頻寬管理裝置中採用(有關更詳細說 明,請參考附錄的7、8、9、1 〇)。在此一主動傳輸率控制 ΗA7 Description of Invention (1 Field of the Invention The present invention relates to digital packet telecommunications, and more specifically, to a system and method for managing process bandwidth utilization in a packet communication environment. BACKGROUND OF THE INVENTION In a network environment, When the flow of data flow on the network increases, the frustration and width of the network are not important issues. In the technology of network bandwidth management, the person skilled in the technology can usually use policies defined by users in advance. Mainly, QoS rules control the bandwidth of each traffic flow. In fact, network bandwidth management has several advantages, such as the protection of the maximum allowed traffic flow and the reduction of end-to-end routing congestion. To achieve bandwidth management, several traditional technology methods have been proposed to have generalized processor sharing (Gps) properties (for more details, the "field descriptions" refer to Appendix 2, 6, and i 3). These technologies are ㈣ (Weight Fair Queuing) ^ WF2Q (Worst-case-Fair Weighted Fair Queuing), etc. (For more detailed explanation, please refer to the appendix, 3, 4 and 12) As usual, these traditional institutions are focused on weighted official calculations of bandwidth law, And the research community pays more attention to algorithms. In addition, WFQ has been proposed by the Internet Engineering Task Force (IETF) organization to have a basic building block for future integrated service networks. However, these technologies are so complex that they are not cost-effective Implemented in high-speed network devices (for more details, please refer to appendixes 3 and 5). In addition, they cannot achieve user-friendly control methods for rate-limiting control. ^ To decide on the above problems, in some existing In network equipment, an active transmission rate control method can be adopted in the bandwidth management device (for more detailed description, please refer to the appendix 7, 8, 9, 10). In this active transmission rate control Η

裝 訂Binding

線 -4 - 本紙張尺度適用中國國家標準(CNS) Α4規格(210 X 297公釐) 1224915 A7 _______ B7__ 五、發明説明(2 ) 方法中,控制訊息可根據每個流量流的最近速率控制狀態 而主動傳送給網路的每個端點·,以致於所有端點的傳輸率 可基於傳送的控制訊息而主動減慢或加速。然而,主動傳 輸率控制方法會產生許多控制訊息,而且從網路利用的觀 點’這些控制訊息實質是各種的虛擬封包。因此,主動傳 輸率控制方法仍然會浪費許多網路的可用頻寬,即使此方 法可將每個流量流率控制得很好。 發明概述 若要解決網路的上述流程控制,本發明可提供劃時侍列 率技制方法(TDQ-RCS)之一新傳輸率控制方法。根據本發明 的TDQ-RCS可快速決定到達封包的離開時間,根據它的離開 時間而將此到達的封包加入它所屬的劃時佇列,然後按照 預定時間輸出封包。而且,既然這些演算法對於不同大小 的到達封包很簡單,所以經由此TDQ—RCS採用的所有演算法 可在一固定時間内完成。尤其是,TDQ-RCS不會產生任何虛 擬封包、或浪費任何頻寬,但是仍然可達成頻寬管理。因 此,藉由使用創作性TDQ-RCS,本發明可容易獲得下列利益: (1) 網路資源管理; (2) 雙向頻寬管理; (3) 應用/服務/客戶/行動台的頻寬保證; (4) 流量流控制,而不會產生任何虛擬封包;及 (5) QoS控制方式的友善傳輸率限制。 因此,本發明的-優點可根據本發明而基於tdq_rcs提供 用以管理-資料通訊網路頻寬之方法及裝置,而不會產生 本纸張尺度適财@ S家料 -5- A7 B7 五、發明説明(3 任何虛擬封包及浪費頻宽。 本發明的另一優點係根據本發明而基於使用最大片段大 J (MSS)標題的TDQ-RCS而提供用以管理非平衡雙向tcp流 I流傳輸之一資料通訊網路頻寬之方法及裝置,而不會產 生任何虛擬封包及浪費頻寬。 圖式之簡單明 發明其他的觀點和優點將會從拿的下列描述連同附圖變 成顯然,其中: 圖1係根據本發明一具體實施例而顯示一理想劃時佇列 率控制方法(TDQ-RCS)的一簡化方塊圖; 圖2(a)係顯示圖1的理想TDQ-RCS的一輸入封包流程圖; 圖2 (b)係顯示圖1的理想TDQ—RCS的一排程指示符流程圖; 圖3係根據本發明的另一具體實施例而顯示一近似理想 TDQ-RCS的簡化圖; 圖4 (a)係顯示圖3的近似理想tdq—rcs的一輸入封包流程 _, 圖4(b)係顯示圖3的近似理想tdq-RCS的一排程指示符流 程圖。 圖5 (a)係顯示在SYN片段中的MSS圖式;及 圖5(b)係顯示具mss的近似TDQ-RCS的一流程圖。 較佳具體實施例之詳細說明 本發明現將參考顯示本發明具體實施例的附圖而更清楚 描述。雖然,該等描述的具體實施例之中一者係有關一互補 金屬氧化半導體(CMOS)影像感測器應用,但是在技藝中熟 -6- 本紙張尺度適用中國國家標準(CNS) A4規格(21〇x297公釐) 1224915Line-4-This paper size applies Chinese National Standard (CNS) A4 specification (210 X 297 mm) 1224915 A7 _______ B7__ V. Description of the invention (2) In the method, the control message can control the status according to the latest rate of each traffic flow And each endpoint of the network is actively transmitted, so that the transmission rate of all endpoints can be actively slowed down or accelerated based on the transmitted control message. However, the active transmission rate control method generates many control messages, and from the viewpoint of network utilization, these control messages are essentially various virtual packets. Therefore, the active transmission rate control method still wastes the available bandwidth of many networks, even if this method can control the flow rate of each traffic well. SUMMARY OF THE INVENTION To solve the above-mentioned flow control of the network, the present invention can provide a new transmission rate control method, which is one of the time series rate technology (TDQ-RCS). The TDQ-RCS according to the present invention can quickly determine the departure time of an arriving packet, add this arriving packet to its scheduled queue according to its departure time, and then output the packet according to a predetermined time. Moreover, since these algorithms are simple for arriving packets of different sizes, all the algorithms adopted by this TDQ-RCS can be completed in a fixed time. In particular, TDQ-RCS does not generate any virtual packets or waste any bandwidth, but still achieves bandwidth management. Therefore, by using creative TDQ-RCS, the present invention can easily obtain the following benefits: (1) network resource management; (2) two-way bandwidth management; (3) application / service / client / mobile station bandwidth guarantee (4) traffic flow control without generating any virtual packets; and (5) friendly transmission rate limitation of the QoS control method. Therefore, the advantages of the present invention can provide the method and device for managing the bandwidth of the data communication network based on the tdq_rcs according to the present invention, without generating the paper size suitable financial @ S 家 料 -5- A7 B7 Description of the invention (3 Any virtual packet and waste of bandwidth. Another advantage of the present invention is to provide an unbalanced bi-directional TCP stream and I-stream transmission based on the present invention based on TDQ-RCS using the maximum segment large J (MSS) header. One method and device of data communication network bandwidth without generating any virtual packets and wasting bandwidth. The simplicity and clarity of the drawings and other aspects and advantages of the invention will become apparent from the following description taken with the accompanying drawings, of which: FIG. 1 is a simplified block diagram showing an ideal timing queue control method (TDQ-RCS) according to a specific embodiment of the present invention; FIG. 2 (a) is an input packet showing the ideal TDQ-RCS of FIG. 1 Flow chart; FIG. 2 (b) is a flowchart showing a schedule indicator of the ideal TDQ-RCS of FIG. 1; FIG. 3 is a simplified diagram showing an approximate ideal TDQ-RCS according to another embodiment of the present invention; Figure 4 (a) shows the approximate principle of Figure 3. Think of an input packet flow of tdq_rcs_, Figure 4 (b) is a flow chart showing a schedule indicator of the approximately ideal tdq-RCS of Figure 3. Figure 5 (a) is a MSS pattern shown in a SYN segment 5 (b) is a flowchart showing an approximate TDQ-RCS with mss. Detailed description of the preferred embodiments The present invention will now be described more clearly with reference to the drawings showing specific embodiments of the present invention. Although, One of the specific embodiments described is related to a complementary metal oxide semiconductor (CMOS) image sensor application, but is well-known in the art. 6- This paper standard is applicable to the Chinese National Standard (CNS) A4 specification (21〇 x297 mm) 1224915

發明説明U 叫此技者可了解到本發明能以在此發表的許多不同形式具 月丘見她。廷些具體實施例可被提供,所以此揭示將會徹底 與7〇王,並且可將本發明範圍完全傳達給在技藝中熟 技者。 現將更評細描述在附圖中所示本發明的較佳具體實施例 ’其中相同參考數字係表示在所有圖中的指定類似或對靡 的元件。 頻宽管 基於以預先定義的政策為基礎的Q0S規則,根據本發明而 使用在網路的頻寬管理裝置可控制例如QoS路由器的頻寬 管理裝置的每個輸人流量流頻寬。根據本發明_具體實施 例的頻寬管理方法是所謂的TDQ—RCS。本發明的此 方法可陕速決足出現在網路設備的封包離開時間,而且藉 著根據它離開時間而將到達封包加入它的對應劃時佇歹4二 排程而傳送例如Q0S路由器的頻寬管理裝置的到達封包。而 且’此万法的所有演算法能以-固定時間完成。更重要的 TDQ RCS不會產生任何虛擬封包或浪費任何頻寬,但是 仍然可完成頻寬管理裝置的頻寬管理。因此,藉由使用 TDQ-RCS,我們可容易獲得下列利益:(1)網路資源管理, (2)雙向頻寬管理,(3)應用/服務/客戶/站台的保證頻寬, 及(4)不會產生任何虛擬封包的控制流量流。 m佇列率控刹^ 若要簡化TDQ-RCS的處理,就像是目前可的頻寬管理系統 ’率控制可始終使用輸入封包的服務品質(Q〇s)資訊的知識Description of the invention U called the skilled person to understand that the present invention can meet her in many different forms published here. These specific examples can be provided, so this disclosure will be thoroughly related to King 70, and the scope of the present invention can be fully conveyed to those skilled in the art. Preferred embodiments of the invention shown in the drawings will now be described in more detail, wherein like reference numerals designate similar or opposite elements in all figures. Bandwidth Management Based on QOS rules based on pre-defined policies, the bandwidth management device used in the network according to the present invention can control, for example, the bandwidth of each incoming traffic flow of the bandwidth management device of the QoS router. The bandwidth management method according to the embodiment of the present invention is a so-called TDQ-RCS. The method of the present invention can quickly determine the packet departure time of a network device, and transmit the bandwidth of a QOS router, for example, by adding a arriving packet to its corresponding schedule based on its departure time. Manage the device's arrival packets. And 'All algorithms of this method can be completed in a fixed time. The more important TDQ RCS will not generate any virtual packets or waste any bandwidth, but it can still complete the bandwidth management of the bandwidth management device. Therefore, by using TDQ-RCS, we can easily obtain the following benefits: (1) network resource management, (2) two-way bandwidth management, (3) guaranteed bandwidth of applications / services / customers / sites, and (4 ) Does not generate any control flow of virtual packets. m 伫 Rate control brake ^ To simplify the processing of TDQ-RCS, it is like the currently available bandwidth management system ’Rate control can always use the knowledge of the quality of service (Q〇s) information of the input packet

12249151224915

ATAT

’在Ϊ寬管理裝置的一封包率控制模組開始輸 ’匕、處理m ’相關Q〇s資訊始終附加到輸人封包。如 熟諳此技者所已知,一流量分類模組(未在圖顯示) l吊可在頻寬管理裝置的輸入終端上提供。流量分類模组 可確認流入頻寬管理裝置的輸入封包的流量資訊,例如最 大封包率、最小封包率、委託率等。此外,數個封包率控 制f則可錢量分類模財建立。輸人封包的_資訊可從 流量資訊直接或間接取得。流量分類模組的細節可在中華 民國(台灣)專利案號88121943及其對應美國專利案號 09/498,096中找到。 此外,為了要簡化頻寬管理問題的分析,本發明首先只 處理在TDQ-RCS中處理的的單向流量流。然後,本發明可: 藉著應用兩組TDQ-RCS來控制在兩不同方向的流量流而^ 佳處理,如此可達成雙向頻宽管理。 若要實施本發明的TDQ-RCS,時域可劃分成無數的時隙。 每個時隙是固定間隔,而且包含一佇列,其中該佇列可儲 存與必須依排程在此時隙上傳送之封包有關的資訊。’A packet rate control module on the Ϊwide management device starts to output’ D, processing m ’related Q os information is always attached to the input packet. As known to those skilled in the art, a traffic classification module (not shown in the figure) can be provided on the input terminal of the bandwidth management device. The traffic classification module can confirm the traffic information of the incoming packets flowing into the bandwidth management device, such as the maximum packet rate, the minimum packet rate, and the commission rate. In addition, several packet rate control f can be established by the amount classification model. The _information of the input packet can be obtained directly or indirectly from the traffic information. Details of the traffic classification module can be found in the Republic of China (Taiwan) Patent Case No. 88121943 and its corresponding US Patent Case No. 09 / 498,096. In addition, in order to simplify the analysis of the bandwidth management problem, the present invention first deals only with unidirectional traffic flows processed in TDQ-RCS. Then, the present invention can: By applying two sets of TDQ-RCS to control the flow of traffic in two different directions, the processing can be optimized, so that two-way bandwidth management can be achieved. To implement the TDQ-RCS of the present invention, the time domain can be divided into an infinite number of time slots. Each time slot is a fixed interval and contains a queue where the queue can store information about packets that must be transmitted on this time slot on a schedule.

理想的TDO-RC^S 圖1係根據本發明而顯示一理想TDQ-RCS的結構。首先, 為了簡單分析緣故而定義在TDQ-RCS,其中時域3係劃分成 固定間隔的無數時隙31,例如1微秒、而且頻寬管理裝置1 的一記憶體2包含對應佇列21的複數個記憶體單元2丨。每個 4宁列21係對應每個時隙,如此稱為一劃時仔列(tDq) 2 }。每 個TDQ 21可有關輸入封包1〇的資訊,其中該等輸入封包是 裝Ideal TDO-RC ^ S Figure 1 shows the structure of an ideal TDQ-RCS according to the present invention. First, it is defined in TDQ-RCS for the sake of simple analysis. The time domain 3 is divided into a fixed number of time slots 31, for example, 1 microsecond, and a memory 2 of the bandwidth management device 1 contains the corresponding queue 21. A plurality of memory cells 2 丨. Each of the four rows 21 corresponds to each time slot, so it is called a time series (tDq) 2}. Each TDQ 21 can have information about incoming packets 10, where the incoming packets are packed

線 -8 -Line -8-

12249151224915

AT 發明説明(6 在排程的對應時隙上的頻寬管理裝置丨傳送。事實上,當實 施TDQ-RCS時’不容易具有無限時隙,除非記憶體2是非常 大。因此’下面將討論近似理想的TDQ-RCS。此外,為了要 改善處理tcp流量流方式中的TDQ—RCS,設定最大片段大小 (MSS)[參考附錄有關細節的參考12]可運用到TDQ-RCS。 清即參考圖2 (a),輸入封包1 〇,包括封包内容及相關q〇s 貝訊的一輸入封包丨〇是經由一通道11而輸入頻寬管理裝置1 的一率評估器12。在率評估器12申的一 Q〇s以計量模組(未 在圖顯不)然後可基於輸入封包10(步驟21)的QoS資訊而決 足如何處理輸入封包1〇。當一#過度率封包13執行(圖2(a) 的右分枝)時,如果輸入封包10的封包率不超過由輸入封包 10的流量分類模組所預定的合法率,率評估器丨2可直接傳 运頻寬管理裝置1的輸入封包10 (步驟22)。輸入封包1〇的 預足的合法率可在流量分類模組的流量規則中建立。否則 ’率評估器12可採用一過度率封包14的輸入封包1〇,並且 基於過度率封包14的QoS資訊而根據下列方程式(丨)和 (步驟23)計算過度率封包14應該指定的時隙。 POT=CST+PQT ....... ⑴ (2) 其中: 目前系統時間(CST)係表示頻寬管理裝置1的目前時間; 封包侍列時間(PQT)係表示輸入封包10應該由用以封包 率控制的QoS計量模組決定tdQ-RCS所佇列的時間; -9 - 本紙張&度通/Π中㈣家料(CNS) A4規格㈣χ 297公货)AT invention description (6) Bandwidth management device on the corresponding time slot of the schedule. In fact, when implementing TDQ-RCS, 'it is not easy to have infinite time slots unless memory 2 is very large. So' the following will be Discuss near-ideal TDQ-RCS. In addition, in order to improve the processing of TDQ-RCS in TCP traffic flow mode, set the maximum fragment size (MSS) [Ref. 12 for details in the Appendix] can be applied to TDQ-RCS. Fig. 2 (a), the input packet 10 includes an input packet including the packet content and the related q0s Besson, which is a rate evaluator 12 input to the bandwidth management device 1 via a channel 11. The rate evaluator The 12 Q's of a QOS measurement module (not shown in the figure) can then be determined based on the QoS information of the input packet 10 (step 21) to determine how to handle the input packet 10. When a # excessive rate packet 13 is executed ( (Right branch of FIG. 2 (a)), if the packet rate of the input packet 10 does not exceed the legal rate predetermined by the traffic classification module of the input packet 10, the rate evaluator 2 can directly transmit the bandwidth management device 1 Input packet 10 (step 22). Input packet 10 pre-footed The normal rate can be established in the traffic rules of the traffic classification module. Otherwise, the 'rate evaluator 12 can use an input packet 10 of the excessive rate packet 14 and based on the QoS information of the excessive rate packet 14 according to the following equation (丨) and (Step 23) Calculate the time slot that the overrate packet 14 should be designated. POT = CST + PQT... ⑴ (2) where: the current system time (CST) represents the current time of the bandwidth management device 1; Packet Queue Time (PQT) means the time that tdQ-RCS queues the input packet 10 should be determined by the QoS measurement module used for packet rate control; -9-this paper & degree pass / Π 中 ㈣ 家 料 ( CNS) A4 size ㈣χ 297 public goods)

裝 玎Pretend

線 發明説明(7 封包離開時間(ροτ)係表示輸入封包10應該傳送的時間; 時隙間隔大小(TSIS)係表示每個時隙的間隔大小;及 時隙ID(TSID)係表示輸入封包10所屬的時隙編號。 在那之後率評估器12可將過度率封包14分配(步驟24)及 附加到計算時隙(步驟25)的劃時佇列21。 如圖1所示,一排程指示符22是在記憶體2提供,以指示 哪個時隙是輸入封包10應該送出。請即參考圖2(b),排程 指π符22可在時域中時週期性進行下一時隙,而且週期是 等於時隙31的間隔,以致於排程指示符22的時隙可始終與 頻寬管理裝置1的系統時間同步。排程指示符22進行動作可 如下列方程式(3)(步驟26)表示。 TSID = PTSID + 1................ (3) 其中: PTS ID (早先的時隙ID)表示最近的排程時隙數目;及 TSID (先前時隙ID)係表示最後的排程時隙數目。 當排程指示符2 2的時隙進行而具有一非空白劃時區仵列 ,頻寬管理裝置1將送出在此時隙劃時佇列中排列的所有封 包。如此,輸入封包10可排程從頻寬管理裝置1傳送。圖2(a) 和2 (b)係分別顯示理想TDQ-RCS的輸入封包10與排程指示 符22。 如方程式(1)到(3)所示,所有參數的計算是與輸入封包 10的大小與流程號碼(亦即,此流程來自的地方)無關,理 想TDQ-RCS的所有演算法能以一固定時間完成,而且理想 TDQ-RCS可將任何單向流量流率控制得很好。然而,當實施 -10- 本紙張尺度適用中國國家標準(CNS) A4規格(210X 297公釐) 五、發明説明(8 ) 理想TDQ-RCS時,不能實施具有無限個時隙。因此,理想 TDQ-RCS的一近似值將在下面描述。 故免理想的TDQ- 圖3係根據本發明而顯示近似理想TDQ-RCs的結構,其中 —"時間環"30可用到有效模擬如圖丨所示無窮個時隙&的 功能。時間環30是由有限個時隙串32所組成,和每個時隙 串32亦是較時間間隔,而且是等於時隙的間隔。如圖㈣ 不’時隙串32係包含-或多個時陈。當在記憶體2中實施時 隙串31時,在相同時料32中的所有時隙31可始終基於他 們相對的時隙ID而以一升幕順序排序。每個時隙係包含— 劃時佇列,而且一輸入封包可根據它的Q〇s資訊而儲存在一 時隙的劃時彳宁列。 參考圖4(a),其係顯示近似TDQ—RCS輸入封包1〇的一流程 圖。包含封包内容與相關QoS資訊的所有輸入封包1〇仍然是 先輸入率評估器12,而且率評估器12將決定如何根據輸入 封包1〇(步驟41)的Q〇S資訊而處理輸入封包1〇。如果輸入封 包10不超過它的合法率,率評估器12將直接轉送給它(步驟 42)。否則,率評估器12可根據方程式(1)到(3)(步驟43)而 基於輸入封包10的QoS資訊計算輸入封包的所屬的時隙。 ”、:後,率評估器12可進一步計算該計算時隙(tsid)所屬的 時隙成串(TSCID) (44步驟)。如果計算的時隙串(TSCID)包 ό輸入封包1〇所屬(步驟α的左分枝)的時隙ip),率評 估器12便可將輸入封包1〇直接分配(步驟46)及附加到計算 時隙串(步驟47)的劃時佇列。否則,率評估器丨2可在計算 -11 - 本紙張尺度適用中國國家標準(CNS) Ad規格(21〇χ297公釐) 1224915 AT B7 五、發明説明(9 的時隙串(TSCID)中插入一新時隙,並且基於他們的ID而以 一升冪順序保持所有時隙(步驟48)。然後,率評估器12可 將輸入封包非派及附加到在計算時隙串中的此新時隙的劃 2佇列(步驟47)。方程式(4)、(5)、和(6)係顯示在率評估 器12中的時隙與時隙串的計算。 POT=CST+PQT..... r/1x (5) (6) TSCID=TSID mod TRS 其中: CST (目岫系統時間)係表示頻寬管理裝置工的目前時間; PQT (封包佇列時間)係表示輸入封包丨〇的時間應該由近 似TDQ-RCS侍列,用以速率控制; PQT (封包離開時間)係表示輸入封包的時間應該從頻寬 管理裝置1傳輸; tsis(時隙間隔大小)係表示每個時隙31的間隔大小; TSID(時隙ID)係表示輸入封包1〇所屬的時隙數目; TRS (時間環大小)係表示時間環的時隙串數量·,及 TSCIDC時隙串id)係表示計算時隙所屬的時隙串數目。 對於近似TDQ-RCS而了,排程指示符22亦用於時間環3〇。 排程指示符22可週期性進行在時間環3〇附近的下一時隙事 ,而且該週期是等料隙串32的間隔。請即參考圖4(b), 當排程指示符22進行一新時隙串時,頻寬管理裝置(的系統 時間可獲步驟51),&且可用來計算此新時隙中的哪個 -12- 1224915 A7 B7Line invention description (7 packet departure time (ροτ) indicates the time that the input packet 10 should be transmitted; time slot interval size (TSIS) indicates the interval size of each time slot; and time slot ID (TSID) indicates that the input packet 10 belongs to After that, the rate evaluator 12 can allocate the overrate packet 14 (step 24) and attach it to the timed queue 21 for calculating the time slot (step 25). As shown in FIG. 1, a schedule instruction The symbol 22 is provided in the memory 2 to indicate which time slot is the input packet 10 should be sent out. Please refer to FIG. 2 (b), the schedule means that the symbol 22 can periodically perform the next time slot in the time domain, and The period is an interval equal to time slot 31, so that the time slot of the schedule indicator 22 can always be synchronized with the system time of the bandwidth management device 1. The schedule indicator 22 can act as the following equation (3) (step 26) TSID = PTSID + 1 ...... (3) where: PTS ID (early time slot ID) indicates the number of the most recently scheduled time slot; and TSID (previous time slot) Time slot ID) indicates the number of the last scheduled time slot. When the time slot of the schedule indicator 2 2 is performed with a non-blank line Zone queue, the bandwidth management device 1 will send all the packets arranged in the time slot queue. In this way, the input packet 10 can be scheduled to be transmitted from the bandwidth management device 1. Figures 2 (a) and 2 (b ) Shows the input packet 10 and schedule indicator 22 of the ideal TDQ-RCS respectively. As shown in equations (1) to (3), all parameters are calculated with the size and input number of the input packet 10 (ie, this Where the process comes from) has nothing to do with, all algorithms of the ideal TDQ-RCS can be completed in a fixed time, and the ideal TDQ-RCS can control any unidirectional traffic flow rate very well. However, when implementing -10- this paper standard Applicable to China National Standard (CNS) A4 specification (210X 297 mm) 5. Description of the invention (8) When ideal TDQ-RCS cannot be implemented with unlimited time slots. Therefore, an approximate value of ideal TDQ-RCS will be described below. Therefore, the ideal TDQ- FIG. 3 shows the structure of an approximately ideal TDQ-RCs according to the present invention, in which “time loop” 30 can be used to effectively simulate the function of infinite time slots as shown in FIG. 丨 time. The ring 30 is composed of a limited number of time slot strings 32, and each time The slot string 32 is also a time interval, and is equal to the time slot interval. As shown in Figure ㈣, the 'slot string 32 contains-or more time. When the slot string 31 is implemented in the memory 2, the same All time slots 31 in time material 32 can always be sorted in one-scene order based on their relative time slot IDs. Each time slot contains-timed queue, and an input packet can be based on its Q0s information The time-lapse sequence stored in a time slot is shown in FIG. 4 (a), which shows a flowchart similar to the TDQ-RCS input packet 10. All incoming packets 10 containing the packet content and related QoS information are still first entered into the rate evaluator 12, and the rate evaluator 12 will decide how to process the incoming packets 1 based on the QOS information of the incoming packet 10 (step 41). . If the input packet 10 does not exceed its legal rate, the rate evaluator 12 will forward it directly (step 42). Otherwise, the rate evaluator 12 may calculate the time slot to which the input packet belongs based on the QoS information of the input packet 10 according to equations (1) to (3) (step 43). ": After that, the rate evaluator 12 may further calculate the time slot string (TSCID) to which the calculated time slot (tsid) belongs (step 44). If the calculated time slot string (TSCID) packet is input, the packet 10 belongs to ( The time slot ip) of the step (left branch of step α), the rate evaluator 12 can directly allocate the input packet 10 (step 46) and add it to the time series queue of calculating the time slot string (step 47). Otherwise, the rate The evaluator 丨 2 can be inserted in the calculation of -11-this paper size applies the Chinese National Standard (CNS) Ad specification (21 × 297 mm) 1224915 AT B7 V. Description of the invention (9 time slot string (TSCID) a new time Slots, and hold all time slots in one-litre order based on their IDs (step 48). The rate evaluator 12 may then assign the input packet to the new slot in the calculation time slot string Column 2 (step 47). Equations (4), (5), and (6) are the calculations of the time slots and time series shown in the rate evaluator 12. POT = CST + PQT ..... r / 1x (5) (6) TSCID = TSID mod TRS where: CST (head system time) represents the current time of the bandwidth management device; PQT (packet queue time) Indicates that the time of the input packet should be approximated by the TDQ-RCS queue for rate control; PQT (packet departure time) indicates that the time of the input packet should be transmitted from the bandwidth management device 1; tsis (time slot interval size) is Indicates the interval size of each time slot 31; TSID (time slot ID) indicates the number of time slots to which the input packet 10 belongs; TRS (time loop size) indicates the number of time slot strings in the time loop, and TSCIDC time slot string id) indicates the number of timeslot strings to which the timeslot belongs. For approximate TDQ-RCS, the schedule indicator 22 is also used in the time circle 30. The schedule indicator 22 can be performed periodically around the time circle 30. The next time slot is the same, and the period is the interval of the material gap string 32. Please refer to FIG. 4 (b). When the scheduling indicator 22 performs a new time slot string, the system time of the bandwidth management device ( (Step 51), & and can be used to calculate which of the new time slot-12-1224915 A7 B7

五、發明説明(1Q 時隙應該在此時處理(步驟52)。如此,排程指示符22可始 終與系統時間同步。同樣地,進行動作與時.隙計算是分別 如方程式(7)和(8)所示。在計算時隙之後,排程指示符22 將可檢查在此時隙串中的第一時隙ID是否等於計算時隙D 。如果肯定,在此時隙劃時佇列中排列的所有封包將送出( 步騾53),而且此時隙可進一步移除(步驟54)。因此,封包 可藉由使用此方法而準時傳送。有關實施輸入封包與近似 TDQ-RCS的排程指示符處理流程,請分別參考圖4 (a)和4 (〇 OSTSCID= (POSTSCID+1) mod TRS. 0STSID= CST tsIs ⑺⑻ 其中 TRS (時間環大小)係表示在時間環的時隙串數量; P0STSCID (先前排程時隙串ID)係表示最後排程時隙串數 目; 0STSCID (排程時隙串id)係表示排程時隙串數目; CST (目前系統時間)係表示系統的目前時間; TSIS (時隙間隔大小)係表示每個時隙的間隔大小·,及 OSTSID (排程時隙ID)係表示排程時隙數目。 a基於近似理想TDQ-RCS的上述演算法而計算是耗時的。即 是,在將輸入封包ίο分配給時隙31之前,率評估器12必須 找到屬於在計算時隙串中的輸入封包1〇的時隙。實際上,、 此搜尋不是在-固定時間内容易完成。然&,在網路環境 -13- x 297公釐) 本紙張尺度適用中國國家標準(CNS) A4規格(210 1224915 A7 發明説明(11 的特徵疋來自任何傳送器的一傳輸流量流會受限制。實際 上,如果時間環30的大小選取足夠大,在任何時隙串32的 時隙31數將局限在一小數目範圍,而且搜尋可實質以一固 定時間完成。 基於上述,近似理想TDq —RCS的所有演算法能以一合理的 固定時間完成,而且近似TDQ-RCS能以即時發揮功能,而且 既然這些演算法對於不同大小的輸入封包是簡單,所以能 以近似理想TDQ-RCS控制任何單向流量流的速率。V. Description of the invention (1Q time slot should be processed at this time (step 52). In this way, the schedule indicator 22 can always be synchronized with the system time. Similarly, the actions and time slot calculations are performed as in equation (7) and (8). After calculating the time slot, the schedule indicator 22 will check whether the first time slot ID in this time slot string is equal to the calculation time slot D. If it is affirmative, queue up in this time slot All packets arranged in the sequence will be sent out (step 53), and this time slot can be further removed (step 54). Therefore, the packet can be transmitted on time by using this method. Regarding the implementation of the arrangement of input packets and approximate TDQ-RCS Process indicator processing flow, please refer to Figure 4 (a) and 4 (〇OSTSCID = (POSTSCID + 1) mod TRS. 0STSID = CST tsIs ⑺⑻ where TRS (time loop size) is the number of time slot strings in the time loop ; P0STSCID (previously scheduled slot string ID) indicates the number of the last scheduled slot string; 0STSCID (scheduled slot string id) indicates the number of scheduled slot strings; CST (current system time) indicates the current status of the system Time; TSIS (time slot interval size) means each time The interval size and OSTSID (scheduled slot ID) are the number of scheduled slots. A The calculation based on the above algorithm of approximately ideal TDQ-RCS is time-consuming. That is, the input packet is allocated to Before time slot 31, the rate evaluator 12 must find the time slot belonging to the input packet 10 in the calculation time slot string. In fact, this search is not easy to complete in a fixed time. However, in the network environment -13- x 297 mm) This paper size applies the Chinese National Standard (CNS) A4 specification (210 1224915 A7 invention description (11 features). A transmission traffic flow from any transmitter will be restricted. In fact, if the time loop The size of 30 is selected large enough. The number of time slots 31 in any time slot string 32 will be limited to a small number range, and the search can be substantially completed in a fixed time. Based on the above, all algorithms of approximately ideal TDq-RCS can A reasonable fixed time to complete, and the approximate TDQ-RCS can function in real time, and since these algorithms are simple for input packets of different sizes, it can control any unidirectional flow with approximately ideal TDQ-RCS Flow rate.

A最大片段大小的近似TDQ-RCS 如上述’ TDQ-RCS可將任何單向流量流率控制得很好。達 成雙向頻寬管理的簡單方法可在頻寬管理裝置1中使用兩 組TDQ-RCS。然而,為了要處理傳輸控制協定(TCP)流量流 ’ TDQ-RCS必須提高到包括TCP流量流的π時間屆滿,,與 π確認π特徵。若要有助於了解本發明TDQ-RCS的這兩特徵 效果,下列情況可考慮: (1) 當一 T C Ρ流流的合法率非常低,而且一較大尺寸的 封包藉由此TCP流量流而從網路的一終端傳送時,較大尺寸 封包便會被頻寬管理裝置1彳宁列一較長時間,如此,不可避 免便會造成一 TCP時間屆滿事件。在此情況,一較大尺寸的 此封包必須由該終端重新傳送。 (2) 當非常不同速率的兩流量流以兩不同方向(例如,一 方向速率是非常低,且另一方向速率是非常高)在相同TCP 連接中保留,而且在這兩方向傳輸的封包大小是實質相同 。例如,藉著能在高速率方向接收來自端點2的資料封包的 -14- 本紙張尺度適用中國国家標準(CMS) A4規格(210 X 297公釐) A7 B7 五、發明説明(12 ) %點1 (請看圖5a),在低速率方向傳送之確認信號,會始終 由頻寬管理裝置1佇列一較長時間。TCP具有一特殊流量控 制機制。即是’在傳送下_連續封包之前,傳送器必須^ f來自接收器的先前傳輸封包的確認。因此,既然傳送器 等待以低速率方向傳送的確認信號會由頻寬管理裝置工佇 列一較長時間,所以一理想速率不能以非常高速率方向達 成。 - 為了要解決上述情況,根據本發明的一較佳具體實施例 ,來自低速率方向傳送器的封包佇列時間可減少,而無需 改變最初QoS資訊。根據本發明,基於該QoS資訊,如果封 包的有效負荷大小係大於該流量流所預定的合法速率,以 低速率方向而經由傳送器傳送的一封包將可劃分成一連串 較】封包。若要達成此劃分,TCp最大片段大小(奶s)的一 選擇性標題可在本發明使用。MSS是設定成TCP流量流的最 大有效負荷大小。因此,以低速率方向而經由傳送器傳送 的封包可藉著修改TCP的MSS而劃分成一連串較小封包。 如在技藝中熟諳此技者的已知,當一 Tcp連接最初是在電腦 網路兩端點之間建立時,MSS選項便只會在一 SYN片段(SYN) 出現。圖5 (a)係顯示用以修改在syn片段出現的mss之方法 。叫即參考圖5 (a),當端點ί想要在端點2之間來/回收送資 料封包時’一初始同步處理便會在SYN片段的兩端點之間進 ""”中在來自^點1具SYNi的MSSi係表示封包的最大有效 負荷大小,而且端點丨是從端點2接收;並且在來自端點2具 SYN2的MSS2係表示封包的最大有效負荷大小,並且端點2是 -15- 本纸張尺度適财g g *標準(CNS) Μ規格(挪X 297公爱) 1224915 A7 B7 五、發明説明(13 )The approximate TDQ-RCS of the maximum segment size is as described above. TDQ-RCS can control the flow rate of any unidirectional traffic very well. A simple way to achieve bidirectional bandwidth management is to use two sets of TDQ-RCS in the bandwidth management device 1. However, in order to deal with Transmission Control Protocol (TCP) traffic flows, TDQ-RCS must be raised to include the expiration of π time for TCP traffic flows, and π characteristics must be confirmed with π. To help understand the two characteristic effects of the TDQ-RCS of the present invention, the following situations can be considered: (1) When the legal rate of a TCP stream is very low, and a larger-sized packet passes the TCP traffic stream When transmitting from a terminal on the network, the larger size packet will be listed by the bandwidth management device 1 for a longer period of time, so that it will inevitably cause an expiration of TCP time. In this case, a larger-sized packet must be retransmitted by the terminal. (2) When two traffic flows of very different rates are retained in the same TCP connection in two different directions (for example, the rate in one direction is very low and the rate in the other direction is very high), and the packet size transmitted in both directions Are essentially the same. For example, by receiving -14 data packets from endpoint 2 in the high-speed direction, the paper size applies the Chinese National Standard (CMS) A4 specification (210 X 297 mm) A7 B7 V. Description of the invention (12)% Point 1 (see Figure 5a), the confirmation signal transmitted in the low-rate direction will always be queued by the bandwidth management device 1 for a long time. TCP has a special flow control mechanism. That is, 'Before transmitting the next_continuous packet, the transmitter must ^ f acknowledge the previous transmission packet from the receiver. Therefore, since the transmitter waits for an acknowledgement signal to be transmitted in a low rate direction, it will be queued by the bandwidth management device for a long time, so an ideal rate cannot be achieved in a very high rate direction. -In order to solve the above situation, according to a preferred embodiment of the present invention, the queue time of a packet from a low-rate direction transmitter can be reduced without changing the original QoS information. According to the present invention, based on the QoS information, if the payload size of a packet is greater than the legal rate predetermined for the traffic flow, a packet transmitted through the transmitter at a low rate direction can be divided into a series of comparative packets. To achieve this division, an optional title for the maximum fragment size (milk s) of TCp can be used in the present invention. MSS is the maximum payload size set for TCP traffic flow. Therefore, the packets transmitted in the low-speed direction through the transmitter can be divided into a series of smaller packets by modifying the MSS of the TCP. As is known to those skilled in the art, when a TCP connection is initially established between two ends of a computer network, the MSS option will only appear in one SYN segment (SYN). Figure 5 (a) shows the method used to modify the mss appearing in the syn segment. Refer to Figure 5 (a). When the endpoint ί wants to send / receive data packets between endpoints 2, an initial synchronization process will be performed between the two ends of the SYN segment. &Quot; " " The MSSi system with 1 SYNi in ^ indicates the maximum payload size of the packet, and endpoint 丨 is received from endpoint 2; and the MSS2 series with SYN2 from endpoint 2 indicates the maximum payload size of the packet, and Endpoint 2 is -15- This paper is a standard gg * standard (CNS) M specification (Norse X 297 public love) 1224915 A7 B7 V. Description of the invention (13)

從端點1接收。如圖5 (a)所示,根據本發明的頻寬管理裝置 1是位在連接到端點1的網路1 (例如LAN)與連接到端點2的 網路2(例如WAN)之間的連接。當接收SYNi和SYN2時,頻寬管 理裝置1的速率評估器12可決定來自端點1的封包MSS!是否 會造成上述兩情況;再者,來自端點2的封包MSS2是否會造 成上述兩情況。圖5(b)係顯示具MSS的近似TDQ-RCS輸入封 包10的一流程圖。從這兩圖我們可清楚看出具MSS的近似 TDQ-RCS的頻宽管理方法可根據他們相對速率而決定兩端 的MSS值,而且如必要,可修改最初的MSS值。此外,如果 MSS已修改,核對加總TCP標題必須於更正部分重新計算。 如此,任一端將不會在TCP處理中傳送有效負荷大小大於它 MSS的一封包。 如上述,TDQ-RCS的基本觀念已說明,而且用以實施在真 實世界TDQ-RCS的一具體實施例已提供,而且藉由修改MSS 可獲得最佳化TDQ-RCS的一具體實施例。根據本發明,下列 目標可容易達成:Received from endpoint 1. As shown in FIG. 5 (a), the bandwidth management device 1 according to the present invention is located between a network 1 (such as a LAN) connected to the endpoint 1 and a network 2 (such as a WAN) connected to the endpoint 2. Connection. When receiving SYNi and SYN2, the rate evaluator 12 of the bandwidth management device 1 can determine whether the packet MSS from the endpoint 1 will cause the above two situations; further, whether the packet MSS2 from the endpoint 2 will cause the above two situations . Fig. 5 (b) is a flowchart showing an approximate TDQ-RCS input packet 10 with MSS. From these two figures, we can clearly see that the bandwidth management method of the approximate TDQ-RCS with MSS can determine the MSS values at both ends according to their relative rates, and if necessary, modify the initial MSS value. In addition, if the MSS has been modified, the checksum total TCP header must be recalculated in the correction section. In this way, either end will not transmit a packet with a payload size larger than its MSS in TCP processing. As mentioned above, the basic concepts of TDQ-RCS have been explained, and a specific embodiment for implementing TDQ-RCS in the real world has been provided, and a specific embodiment of TDQ-RCS can be optimized by modifying the MSS. According to the present invention, the following objectives can be easily achieved:

(1) 網路資源管理; (2) 雙向頻宽管理; (3) 應用/服務/客戶/行動站台的頻宽保證;及 (4) 控制不會產生任何虛擬封包的流量流。 雖然本發明是從較佳具體實施例的觀點揭示,但是並未 局限在本發明。本發明仍然可經由在技藝中熟諳此技者的 修改或變更,而不致於達背經由下述申請專利所決定本發 明的範圍與精神。 -16- 本紙張尺度適用中國國家標準(CNS) A4規格(210 X 297公釐) 1224915 A7 B7 五、發明説明(Μ ) 附錄 * 參考 [1] 在 1 989年 9 月,由 A. Demers、S. Keshav、和 S. Shenker 在SIGCOMM Symposium on communications Architectures and Protocols 中所發表的名稱” Analysis and S i mu 1 at i on of a Fair Queuing Algorithm” 。 [2] 在 1 993年 6月,由 A. Parekh and R. G· Gallager 在 ACM/IEEE Transactions on Networking,第一冊,編號3 第 344-357頁中所發表的名稱 nA Generalized Processor Sharing Approach to Flow Control-The Single Node Case"。 [3] 在 1999年 6月,由 D.C· Stephens、J.C.R· Bennett 、和 H. Zhang 在 IEEE Journal on Selected Areas in Communications,第 17冊,編號06,第 1145-1158 頁中所發 表的名稱 ’’Implementing Scheduling Algorithms in High-Speed Networks" ° [4] 在 1 996年 3 月,由 J.C.R. Bennett和 H. Zhang在 Proc· IEEE INFOCOM'96 中所發表的名.nWF2Q: Worst -case Fair Weighted Fair Queuing" o [5] 在 1 996 年 4 月’由 J· C· R Bennett 和 H. Zhang 在 NOSSDAV'96中所發表的名稱"Why WFQ Is Not Good Enough for Integrated Services Networks" o [6] 在 1994年’由 0· Yaron和 M. Sidi在 Journal of High Speed Networks的第375-387頁中所發表的名稱 "Generalized Processor Sharing Networks with -17- 本紙張尺度適用中國國家標準(CNS) A4規格(210X297公釐) 1224915 A7 B7 五、發明説明(15 )(1) Network resource management; (2) Two-way bandwidth management; (3) Bandwidth guarantees for applications / services / customers / mobile stations; and (4) Control the traffic flow that does not generate any virtual packets. Although the present invention is disclosed from the viewpoint of a preferred embodiment, it is not limited to the present invention. The present invention can still be modified or changed by a person skilled in the art without departing from the scope and spirit of the present invention determined by the following application patents. -16- This paper size is in accordance with China National Standard (CNS) A4 (210 X 297 mm) 1224915 A7 B7 V. Description of the Invention (M) Appendix * Reference [1] In September 1989, by A. Demers, S. Keshav, and S. Shenker, published in SIGCOMM Symposium on communications Architectures and Protocols, "Analysis and S i mu 1 at i on of a Fair Queuing Algorithm". [2] In June 1 993, the name nA Generalized Processor Sharing Approach to ACM / IEEE Transactions on Networking, Book 1, No. 3, pages 344-357, by A. Parekh and R. G. Gallager Flow Control-The Single Node Case ". [3] In June 1999, the names published by DC Stephens, JCR Bennett, and H. Zhang in IEEE Journal on Selected Areas in Communications, Volume 17, Number 06, pages 1145-1158 '' Implementing Scheduling Algorithms in High-Speed Networks " ° [4] In March 1996, the name published by JCR Bennett and H. Zhang in Proc · IEEE INFOCOM'96. NWF2Q: Worst -case Fair Weighted Fair Queuing " o [5] In April 1996, the name published by J.C.R. Bennett and H. Zhang in NOSDAV'96 " Why WFQ Is Not Good Enough for Integrated Services Networks " o [6] in 1994 The name 'published by Yaron and M. Sidi in the Journal of High Speed Networks on pages 375-387 " Generalized Processor Sharing Networks with -17- This paper size applies to China National Standard (CNS) A4 specifications ( 210X297 mm) 1224915 A7 B7 V. Description of the invention (15)

Exponentially Bounded Burstiness Arrivals [7] 在2000年3月14日,由Pack eteer, Inc.公司所發表 的美國專利案號 6, 038, 216名稱1'Method for Explicit Data Rate Control in a Packet Communication Environment without Data Rate Supervision丨丨。 [8] 在1998年9月1日,由Packeteer,Inc.公司所發表的 美國專利案號 5, 802, 106 名稱"Method for Rapid Data Rate Detect ion in a Packet Communication Environment without Data Rate Supervision" o [9] 在2000年1月25日,由Packeteer, Inc.公司所發表 的美國專利案號6, 018, 516 名稱"Method for Minimizing Unneeded Retransmission of Packets in a Packet Communication Environment Supporting Plurality of Data Link Rates" o [10] 在2000年4月4日,由Packeteer, Inc.公司所發表 的美國專利案號 6, 046, 980名稱"System for Manage Flow Bandwidth Utilization at Network, Transport and Application Layers in Store and Forward Network” 。 [11] 由 W· Richard Stevens 發表的“TCP/IP Illustrated Volume I -The Protocols’’。 [12] 在 2000年 3 月,由 Z· Cao, Z. Wang和 E· Zegura在 INFOCOi/T 00 中所發表的名稱”1^11113(^ Fair Queuing: Fair Bandwidth Sharing Without Per-Flow State"。 [13] 在 1994年 8 月,由 Z. L. Zhang, D. Towsley和 J. -18- 本紙張尺度適用中國國家標準(CNS) A4規格(210 x 297公釐) 裝 訂Exponentially Bounded Burstiness Arrivals [7] U.S. Patent No. 6, 038, 216 issued by Pack eteer, Inc. on March 14, 2000 1'Method for Explicit Data Rate Control in a Packet Communication Environment without Data Rate Supervision 丨 丨. [8] On September 1, 1998, US Patent No. 5, 802, 106 issued by Packeteer, Inc. " Method for Rapid Data Rate Detect ion in a Packet Communication Environment without Data Rate Supervision " o [9] On January 25, 2000, US Patent No. 6,018, 516 issued by Packeteer, Inc. Name " Method for Minimizing Unneeded Retransmission of Packets in a Packet Communication Environment Supporting Plurality of Data Link Rates & quot o [10] U.S. Patent No. 6,046,980, published by Packeteer, Inc. on April 4, 2000 " System for Manage Flow Bandwidth Utilization at Network, Transport and Application Layers in Store and Forward Network. [11] "TCP / IP Illustrated Volume I-The Protocols" by W. Richard Stevens. [12] In March 2000, the name "1 ^ 11113" (^ Fair Queuing: Fair Bandwidth Sharing Without Per-Flow State ", published by Z. Cao, Z. Wang and E. Zegura in INFOCOi / T 00. [13] In August 1994, by ZL Zhang, D. Towsley and J. -18- This paper size applies Chinese National Standard (CNS) A4 (210 x 297 mm) binding

1224915 A7 B7 五、發明説明(16 ) 1^111'〇36在?1:〇(:.八〇^1316(:(^^1/94,第 68-77 頁中所發表的名 稱 'Statistical Analysis of Generalized Processor Sharing Scheduling Discipl ine 丨丨。 -19- 本紙張尺度適用中國國家標準(CNS) A4規格(210X297公爱)1224915 A7 B7 V. Explanation of the invention (16) 1 ^ 111'〇36? 1: 〇 (:. 八 〇 ^ 1316 (: (^^ 1/94, pages 68-77, published under the name 'Statistical Analysis of Generalized Processor Sharing Scheduling Discipl ine 丨 丨. -19- This paper is scaled to China National Standard (CNS) A4 Specification (210X297 Public Love)

Claims (1)

A8 B8 C8 D8 申請專利範圍 ι· 一種用以在一資料通訊網路使用的一頻寬管理裝置中 控制一輸入封包之方法,以管理對應該等輸入封包的任 何流量流率,該頻寬管理裝置具有一記憶體,該記憶體 包含作為劃時佇列的複數個單元,每個佇列係對應時域 的一固疋間隔的時隙,該方法包含下列步驟: (a) 從該輸入封包取回該流量流的服務品質(QoS)資 訊; ’ (b) 基於該QoS資訊而決定該輸入封包的傳輸率是否 超過該流量流所預定的一合法率; (C)如果該輸入封包的傳輸率超過該預定的合法率, 將該輸入封包分配給一劃時佇列;及 (d)當該劃時佇列的對應時間等於該頻寬管理裝置的 系統時間時,自該頻寬管理裝置傳送一㈣在該劃時作 列中的該輸入封包。 2·如申叫專利範圍第丨項之方法,其中該步驟(幻係進一步 包含下列步驟: (cl)如果該輸入封包的傳輸率超過該預定的合法率 ,基於孩輸入封包的Q〇s資訊而決定該輸入封包所屬的 時隙,其中該決定的時隙係對應步驟((〇的該劃時佇列。 3.如申請專利範圍第2項之方法,其中該等複數個時隙是 以具有一週期(時間環大小TRS)的時間環而連續配置, 該時間環是由-固定間隔的複數個時隙串所組成,而且 每個時隙串係包含一或多個時隙,而且其中該步驟(。) 係進一步包含下列步驟: (請先閱讀背面之注意事項再 -- _本頁) 、1T 經濟部中央標隼局員工消費合作社印製 -20' 山 4915 A8 B8 C8 D8 申請專利範圍 (c2)決定該決定時隙所屬的一時隙串·, 請 先 閎 讀 背 5 意 事 項 再 (c3)如果該'决定的_串包含該輸入封包所屬的時 隙’將該輸人封包附加到在該決定時料中的該決 隙的一劃時佇列;及 (⑷如果該決定的時隙串不包含該輸入封包所屬的 時隙’將-新時隙加入該決定的時隙串,並且將該輸入 封包附加到在孩決足時隙串中的該決定時隙的劃時许 列0 4. 如申請專利項之方法,該方法係進_步包含: 在步驟(b)之後,如果該輸人封包的傳輸率不超過該預 定合法傳輸率,便直接傳送該頻寬㈣裝置的該輸入封 包。 訂 5. -種使用在資料通訊網路之頻寬管理裝置,該頻寬管理 裝置係包含: -流分類模組,用以從該輸入封包 (⑽資訊;及基於該QoS資訊而決定該輸入封包;= 率疋否未超過該流量流預定的合法率; 經濟部中央標準局貝工消費合作社印装 T記憶體’其包含當作劃時佇列的複數個單 個佇列係對應時域的一固定間隔時隙; =評估器’如果該輸人封包的傳輸率超過該預定的 口法率,用以將該輸入封包分配給一劃時仵列,… 孩劃時作列的對應時間等於該頻寬管理裝置的系统: 二時,自該頻寬管理裝置傳送㈣在該劃 該 輸入封包。 T J ^ 表適用中 (CNS -21 - 經濟部中央標準局員工消費合作社印¾ 申請專利範圍 6.如申請專利範圍第5項之頻寬管理裝置, 入二包的傳輸率超過該預定的合法率,該:評估= 於诼輸入封包的 。β 土 的時陴工 步夬疋孩輸入封包所屬 時佇列。 ㈣係對應步驟⑷的該劃 7·如申請專利範圍第5之 個睡_ 口、 八見e理裝置,其中該等複數 ,"疋以具有一週期的時間 e , j承阳逑%配置,孩時間環 疋由一固定間隔的複數個時間串所 』甲所組成,而且每個時隙 ά。4多個時隙’而且其中該率評估器可決定兮 ::::所屬的時隙串;如果該決定的時隙串係包含: 貝所屬的時隙,將該輸人封包附加到在該決定時 隙串中的該決定時隙的劃時㈣;如果該決定的時隙不 包含孩輸入封包所屬的時隙,將一新時隙加入該決定的 時隙串’並且將該輸人封包附加到在該決定時隙串中的 該決定時隙的劃時彳宁列。 8·如申請專利範圍第5項之頻寬管理裝置,如果該輸入封 包的傳輸率不超過該預定的合法率,該率評估器可直接 傳送該頻寬管理裝置的該輸入封包。 9· 一種用以在一資料通訊網路使用的頻寬管理裝置中控 制在該資料通訊網路上控制任何兩終端之間的任何雙 向流量流率之方法,該頻宽管理裝置具有一記憶體,其 包含作為劃時佇列的複數個單元,每個佇列係對應在一 時域中的一固定間隔時隙,該方法係包含下列步騾: (a)在該兩終端在其間開始建立一連接期間而偵測 -22- 本紙張幻1逋用中國國家揉準(CNS) Μ胁( 210X297公釐) '〜----- (請先閲讀背面之注意事項再填寫本頁) . 、11 ^4915 A8 B8 C8A8 B8 C8 D8 Patent Application Scope · A method for controlling an input packet in a bandwidth management device used in a data communication network to manage any traffic flow rate corresponding to the input packets, the bandwidth management device It has a memory, which contains a plurality of units as time-lapse queues. Each queue corresponds to a fixed interval time slot in the time domain. The method includes the following steps: (a) fetching from the input packet Return the quality of service (QoS) information of the traffic stream; (b) determine whether the transmission rate of the input packet exceeds a legal rate predetermined by the traffic stream based on the QoS information; (C) if the transmission rate of the input packet Exceeding the predetermined legal rate, allocating the input packet to a time-line queue; and (d) transmitting from the bandwidth management device when the corresponding time of the time-line queue is equal to the system time of the bandwidth management device As soon as the input packet is listed in the row. 2. If the method of claiming the patent scope item 丨, this step (the magic system further includes the following steps: (cl) if the transmission rate of the input packet exceeds the predetermined legal rate, based on the Q0s information of the input packet The time slot to which the input packet belongs is determined, where the determined time slot is the corresponding step ((0). 3. If the method of item 2 of the patent application is applied, wherein the plurality of time slots are A time loop with a period (time loop size TRS) is continuously configured. The time loop is composed of a fixed number of time slot strings, and each time slot string contains one or more time slots. This step (.) Further includes the following steps: (Please read the notes on the back before-_ this page), 1T printed by the Consumer Consumption Cooperative of the Central Bureau of Standards of the Ministry of Economic Affairs-20 'Shan 4915 A8 B8 C8 D8 Patent Application The range (c2) determines the time slot string to which the determined time slot belongs. Please read the 5 notes before (c3) if the 'determined_ string contains the time slot to which the input packet belongs' append the input packet. By the time of that decision Schedule of the gap in the expected queue; and (⑷ If the determined time slot string does not include the time slot to which the input packet belongs' add-new time slot to the determined time slot string, and the input The packet is appended to the scheduled time slot of the determined time slot in the decisive time slot string. 4. If the method of patent application is applied, the method includes the following steps: After step (b), if the input The transmission rate of the packet does not exceed the predetermined legal transmission rate, and then the input packet of the bandwidth / device is directly transmitted. Order 5.-A bandwidth management device used in a data communication network, the bandwidth management device includes:- A flow classification module is used to determine the input packet from the input packet (⑽ information; and based on the QoS information; = rate does not exceed the predetermined legal rate of the traffic flow; printed by the Shell Standard Consumer Cooperative of the Central Standards Bureau of the Ministry of Economic Affairs) The installed T memory contains a plurality of individual queues that are regarded as time-lapse queues corresponding to a fixed-interval time slot in the time domain; = Evaluator 'If the transmission rate of the input packet exceeds the predetermined speaking rate, Used to distribute the input packet Queue the time zone, ... The time corresponding to the time zone schedule is equal to the system of the bandwidth management device: At two o'clock, the input packet is transmitted from the bandwidth management device to the zone. TJ ^ Table applicable (CNS -21-Printed by the Consumer Cooperatives of the Central Bureau of Standards of the Ministry of Economic Affairs ¾ Patent Application Scope 6. If the bandwidth management device of the patent application scope item 5 is used, the transmission rate of the second package exceeds the predetermined legal rate, this: evaluation = Yu Enter the packet. Β soil time, step, and time to enter the queue to which the packet belongs. This is the plan corresponding to step 7. 7 Such as the patent application No. 5 of the sleeping bed, Yami e-device, where The plurals are configured with a period of time e, j Cheng Yang%, and the child time loop is composed of a plurality of fixed time intervals, and each time slot. 4 timeslots' and where the rate evaluator can determine the :::: slot string to which it belongs; if the determined slot string contains: the slot to which it belongs, append the input packet to the The time slot of the decision time slot in the time slot string is determined; if the determined time slot does not include the time slot to which the input packet belongs, a new time slot is added to the determined time slot string and the input packet is The time slot of the decision time slot added to the decision time slot string. 8. If the bandwidth management device of item 5 of the patent application scope, if the transmission rate of the input packet does not exceed the predetermined legal rate, the rate evaluator can directly transmit the input packet of the bandwidth management device. 9. A method for controlling a two-way traffic flow rate between any two terminals on the data communication network in a bandwidth management device used in the data communication network, the bandwidth management device having a memory including As a plurality of time-lapse queues, each queue corresponds to a fixed-interval time slot in a time domain. The method includes the following steps: (a) during the time when the two terminals start to establish a connection, Detect-22- This paper Magic 1 (Chinese National Kneading Standard (CNS) M threat (210X297mm) '~ ----- (Please read the precautions on the back before filling out this page)., 11 ^ 4915 A8 B8 C8 A、申請專利範圍 SYN片段; (b)在該等同步片段中取回在該等兩終端之間傳送的 最大片段大小(MSS)選項標題,其中從一終端傳送的該 MSS選項標題係指定來自另一終端的該輸入封包的有效 負荷; (C)從該輸入封包取回服務品質(Q〇S)資訊; (d) 如果由該MSS標題決定的有效負荷造成該頻寬管 理裝置不能控制該雙向流量流率,基於在該一終端的 QoS資訊中包含的傳輸率而修改從一終端傳送的該Mss 選項標題,如此便可減少該輸入封包的最大有效負荷; 而且如果該MSS選項標題已被修改,可使用該mss選項標 題而重新計算該輸入封包的一 TCP標題的一核對加總; (e) 基於該q〇s資訊而決定該輸入封包的傳輸率是否 超過該輸入封包所預定的一合法率,而不管有效負荷是 否減少; (Ο如果該輸入封包的傳輸率超過該預定的合法率, 將该輸入封包分配給一劃時仔列;及 (g)當該劃時佇列的對應時間等於該頻寬管理裝置的 經濟部中央榡準局員工消費合作社印$L 系統時間,自該頻宽管理裝置傳送佇列在該劃時佇列中 的該輸入封包。 10·如申請專利範圍第9項之方法,其中該步騾(e)係進一步 包含下列步驟: (e 1)如果該輸入封包的傳輸率超過該預定的合法率 ’可基於該輸入封包的Q〇S資訊而決定該輸入封包所屬 -23- 本紙張尺度適用中國國家揉率(〇奶)戌4規/格(210父297公慶) 六、申請專利範圍 的時隙,其中該決定的時 列。 ·、係對應步驟(f)的該劃時件 11.如申請專利範圍第10項之方 ^ Ώ ^ 万去,其中該等複數個時隙县 在具有一週期(TRS)的時間環φ=Μ 嗦疋 衣中連績配置,該時間 σ 由一固定間隔的複數個時隙志j 衣疋 嗦串所組成,而且每個時隙自 係包含一或多個時隙,而且並由 隙亭 "中邊步驟(el)係進一步句 含下列步驟: g (e2)決定該決定時隙所屬的時隙串; (e3)如果該決料隙串係包含該輸人封包所屬的時 隙,將該輸人封包附加到在料料”巾的該決定時 隙的劃時侍列;及 呼 (e4)如果藏決足時隙串不包含該輸人封包所屬的時 隙,在該決定時隙串中將-新_加人該決定的時隙串 ,並且將該輸人封包附加到該決定時隙的劃時件列。 12·如申請專利範圍第9項之方法,其進一步包含:在步驟 (e)之後,如果該輸入封包不超過該預定的合法率,直 接傳送該頻宽管理裝置的該輸入封包。 -24-A. Patent application scope SYN segment; (b) retrieve the maximum segment size (MSS) option header transmitted between the two terminals among the synchronization segments, wherein the MSS option header transmitted from a terminal is designated from The payload of the input packet at another terminal; (C) retrieving quality of service (QoS) information from the input packet; (d) if the bandwidth determined by the MSS header causes the bandwidth management device to fail to control the The two-way traffic flow rate. Modifying the Mss option header transmitted from a terminal based on the transmission rate contained in the QoS information of the terminal, so that the maximum payload of the input packet can be reduced; and if the MSS option header has been changed Modified, the mss option header can be used to recalculate a checksum of a TCP header of the input packet; (e) determine whether the transmission rate of the input packet exceeds a predetermined one of the input packets based on the q0s information Legal rate, regardless of whether the payload is reduced; (o If the transmission rate of the input packet exceeds the predetermined legal rate, assign the input packet to a row And (g) when the corresponding time of the schedule is equal to the time spent on the bandwidth management device ’s Central Consumers ’Bureau of the Ministry of Economic Affairs ’s consumer cooperative to print the $ L system time, the queue transmitted from the bandwidth management device is listed in the schedule 10. The method of item 9 in the scope of patent application, wherein step (e) further includes the following steps: (e 1) If the transmission rate of the input packet exceeds the predetermined legal rate 'may Based on the QOS information of the input packet, the input packet is determined. -23- This paper size applies to the Chinese national kneading rate (0 milk) 戌 4 rules / grid (210 fathers 297 public holidays) 6. Time slots for patent application scope The time sequence of the decision. · The schedule corresponding to step (f) 11. If the scope of the patent application is the 10th item ^ Ώ ^ 10,000, where the multiple timeslot counties have a cycle (TRS) time loop φ = Μ 嗦 疋 continuous configuration in time, the time σ is composed of a fixed interval of a plurality of time slot j j 疋 嗦 series, and each time slot contains one or more Time slot, and not by step "el" The further sentence includes the following steps: g (e2) determines the time slot string to which the decision time slot belongs; (e3) if the data slot string contains the time slot to which the input packet belongs, appends the input packet to the input (E4) If the time slot string is not included in the determined time slot string, the new time slot string will be -new_added The determined time slot string, and the input packet is added to the time-scheduled list of the determined time slot. 12. If the method of the scope of patent application No. 9 further includes: after step (e), if the The input packet does not exceed the predetermined legal rate, and the input packet of the bandwidth management device is directly transmitted. -twenty four-
TW90129433A 2001-11-28 2001-11-28 System and method for managing flow bandwidth utilization in a packet communication environment TWI224915B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
TW90129433A TWI224915B (en) 2001-11-28 2001-11-28 System and method for managing flow bandwidth utilization in a packet communication environment

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
TW90129433A TWI224915B (en) 2001-11-28 2001-11-28 System and method for managing flow bandwidth utilization in a packet communication environment

Publications (1)

Publication Number Publication Date
TWI224915B true TWI224915B (en) 2004-12-01

Family

ID=34568137

Family Applications (1)

Application Number Title Priority Date Filing Date
TW90129433A TWI224915B (en) 2001-11-28 2001-11-28 System and method for managing flow bandwidth utilization in a packet communication environment

Country Status (1)

Country Link
TW (1) TWI224915B (en)

Similar Documents

Publication Publication Date Title
US7123622B2 (en) Method and system for network processor scheduling based on service levels
US6570849B1 (en) TDM-quality voice over packet
US6657987B1 (en) Scheduling methodology for connections with quality of service (QoS) constraints in a polling based media access control (MAC)
Xu et al. CMT-NC: improving the concurrent multipath transfer performance using network coding in wireless networks
EP1552632B1 (en) Apparatus and method for wireless network channel management
CN100388682C (en) Method for improving service quality in SGSN network processor
US6795870B1 (en) Method and system for network processor scheduler
CN101120571A (en) Optimization method and system for wireless tcp connection
EP1872540A2 (en) Method and apparatus to facilitate real-time packet scheduling in a wireless communications system
US6952424B1 (en) Method and system for network processor scheduling outputs using queueing
CN108667573A (en) A kind of data processing method, device and relevant device
JP2001244990A (en) Traffic management system
CN108667746B (en) Method for realizing service priority in deep space delay tolerant network
Hegde et al. Experiences with a centralized scheduling approach for performance management of IEEE 802.11 wireless LANs
WO2016172958A1 (en) Dynamic traffic control method, device and home gateway, and hybrid access aggregation point
CN109428842A (en) A kind of QoS information transfer approach and device
CN103858474A (en) Enhanced performance service-based profiling for transport networks
CN102594665B (en) Service data transmission method and device
WO2011113264A1 (en) Traffic management method and apparatus in switching network
JP4710559B2 (en) Communication terminal and system for controlling token buffer size
CN108809549A (en) A kind of method and apparatus of transmission data
US6862292B1 (en) Method and system for network processor scheduling outputs based on multiple calendars
Fukuda et al. Unfair and inefficient share of wireless LAN resource among uplink and downlink data traffic and its solution
TWI224915B (en) System and method for managing flow bandwidth utilization in a packet communication environment
US20040215812A1 (en) Packet-drop tolerant method for transmitting time-critical data over ethernet

Legal Events

Date Code Title Description
MK4A Expiration of patent term of an invention patent