201044819 i^〇Jiwi.doc/n 六、發明說明： 【發明所屬之技術領域】 t發明是有_路域機，且 種網路交換機的頻寬分配方法。 疋名關於 【先前技術】201044819 i^〇Jiwi.doc/n VI. Description of the invention: [Technical field to which the invention pertains] The t invention is a method for allocating a bandwidth of a network switch. Anonymous About [Prior Art]
O o 释缺網際触成為人們生活中不可 迗由四面八方相互傳遞的封包，則 = 服器或網路交換器來管控網路間的封包流2所明的網賴 =管控網路交換機的頻寬分配上，、知的網路交換 ，吊使Μ下的三種方式來分_較換機的各仔列缓衝 =頻寬。第-種方式是針對每—個糾緩衝區的頻寬都 個限制，而所有⑽顺衝區的頻寬總和恰等於網 又換機的賴寬，缺點是空的糾頻寬未能被使用。 另外，習知_路交換機還使用以下酬的第二種的 ，寬分配方法。纽是針_路交錢的各㈣緩衝區依 ，其需求分配固定的_。但是由於依據固定_分配的 丁，緩衝區的頻寬會隨著總頻寬變化而不同。因此，此種 ，寬分配的对雜充份_織，但卻無法達到仔列頻 寬控制，也是很難得到最佳化。 、再者，習知的網路交換機還使用第三種的頻寬分配方 這種頻寬分配方式是透過第三層的協定或是資源預流 協識刀配(Resource ReSerVation Protocol，RSVP)來建構的， 3 201044819 _> lUOJlWl.uu^/n 在實施上非常的複雜 【發明内容】 本發明提供—種網路交換 佇列緩衝區的頻寬需卡 πJ鴻見刀配万忐依據各 配，提升_^率動_各糾、_的頻寬分 r列、ίίϊί::?網路交換機的頻寬排程裝置，依據各 右沾/需求，動態調整各佇列緩衝區的頻寬分 配，有效率的_網路交換機的頻寬。 姻政提出—種網路交換機的頻寬分配方法，其中的 :路:換機包括多數個件列緩衝區。此頻寬分配方“ 龍1針對各件顺衝區設定高頻寬臨界值及低頻寬臨 二:二且，分別依據各件列緩衝區的低頻寬臨界值分配 =氏’頁，至各^了列緩衝區。然後，分配剩餘頻寬至頻寬需 求大於最低則、於該高職臨界值⑽舰衝區。並 且，禁止織需求大於高頻寬臨界值_舰衝區的封包 傳輸。 在本發明之-實施例中，上述之剩餘頻寬等於網路交 換機的總頻寬減去仔列緩衝區的最低頻寬的總和 、在本發明之一貫施例♦，上述之分配剩餘頻寬至頻寬 需求大於最賴寬且小於高頻寬臨界值⑽舰衝區，，的 步驟包括利用加權猶環法(weighted round r〇bin)、加權平衡 仔列法（weighted fair queue)或調度加權循環法（defidt weighted round robin)來達成。 201044819 JIUOJLWA.doc/jj 求藉中’上述之纖衝區的頻寬霉 得。財位㈣内件列緩衝區的資料傳輸的數量來錢 告頻貧it明之實施例中’上述之頻寬分配方法更包接 ;至:二=頻寬臨界值的件列緩衝區的頻寬需求下 出。ι界值時，重新啟树舰衝區的資料傳 Ο ο 傳輸======瓣裝置，包括 數器m〜二 驗衝區、多數個需求頻寬計 區編味：各;二:阜，接排程器，列緩衝 區，用W職接沾列緩衝 接排γ ^ 1緩衝區的頻寬需求。而頻寬配置控制 排“ 接收騎列緩衝區所對應的高頻寬臨 值八配界值’並依據各佇列緩衝區的低頻寬臨界 枯;_’、見小於南頻寬臨界值的佇列緩衝區，並 t止頻寬需求大於高頻寬臨界值的仔列緩衝區的封包傳 基於上述’本發明藉由監控狩列緩衝區的頻寬需求， 各符列緩衝區的頻寬需求及各传列緩衝區所設定的 =頻見臨界值及低頻寬臨界值來動態調整各仵列緩衝區間 =頻寬分配。使得網路交換機的頻寬分配更具有彈性且更 有效率，進一步提升網路的整許 為讓本發明之上述特徵和優點i更明顯易懂，下文特 5 201044819 3 lUOJlWl.UUWll 舉實施例’並配合所附圖式作詳細說明如下。 【實施方式】 明參…、圖1，圖1繪示本發明的實施例的網路交換機 的頻寬分配方法的流程圖。其中的步驟包括：首先，針對 網路交換機上的所有的㈣緩衝區分別肢高頻寬臨界值 以及低頻寬臨界值(步驟S11G)。請注意，此處的每一個仰 =衝區的㈣寬臨界值不需要相等，可以依據各 祕㈣似需求來分顺高頻寬臨界值。相同 白、，母-贿顺舰的_寬臨界值也*需要相等，因 此’ ^賴衝區的低齡臨界值也可以被設置為相 不相寺的值。 ^成了各彳宁賴衝區的高頻寬臨界仙及低 技後，接著則分別依據各糾缓衝區的低頻寬 以界值來分配頻寬(步驟S12G)。步驟S12 = 路交:機上的每—個佇列緩衝區都有-定限度的最低 則最小f求㈣包傳輸。而在步驟S120後， 緩衝區的頻寬需求進行計算，並判斷各仵列 :的頻見需求絲有超過雜舰衝區所被分配 (步驟S130)。—旦發現有佇列緩衝區的頻寬需长 =宁，區所被分配到的最低頻寬的狀況時，芯 需求超過其所分配到的最低頻寬 ^ 進仃剩餘頻寬的分配(步驟8140卜 在此’所謂的各仵列緩衝區的頻寬需求的計算在本實 201044819 i.doc/n =二傳輸: 料傳=數==，列緩衝區： 扣除已二是網路交換機的總頻寬 ❹ 〇 有的仔列緩衝區的最低頻Ϊ的^交換機的總頻寬減去所 加權加權循環法、 為本_具通常知識者所熟知，在 斗管一旦針對各仔列緩衝區的頻寬需求的 ίΓΪ發有伶列緩衝區的頻寬需求超過該传列缓衝巴的 列緩衝區進行封包的傳輸(步驟S⑽）。、、 在此，右要恢復頻寬需求超過其高頻寬臨 緩衝區的封包傳輸動作，則、I的<丁列 對該仔列緩衝區所計算出的』件。也就'是 的高頻寬臨界值。树低至低於其所對應 網路二發明的—實施例的 計數器241〜：之:列制器23〇、需求頻寬 〇 汉1丁〜後衝區qb1〜qB7。苴中 器220雛傳輸埠21〇，而頻寬配置控制謂、則輕接排 201044819 程器220並由各需求頻寬計數器241〜247接收各仔列缓衝 區QB1〜QB7的需求頻寬。佇列緩衝區qB1〜qB7則共同 耦接至排程器220並分別耦接至需求頻寬計數器241〜247。 頻寬配置控制器230接收件列緩衝區qb 1〜QB7的高 頻寬臨界值HBWT及低頻寬臨界值LBWT。在本實施中， 由於佇列緩衝區QB1〜QB7共有七個，因此頻寬配置控制 器230所接收的尚頻寬臨界值HBWT及低頻寬臨界值 LBWT可以各有七個數值，以分別對應佇列緩衝區QB1 至佇列緩衝區QB7。 另外，頻I配置控制器230並由頻寬計數器241〜247 接收並獲知佇列緩衝區QBi〜QB7的頻寬需求，頻寬配置 控制器230並分別依據各佇列緩衝區Qm〜 綠界值聰T分配最纖至各伶列緩衝區"J = 餘頻見至頻寬需求大於最低頻寬且小於高頻寬臨界值 HBWT的仵列缓衝區。另夕卜，頻寬配置控制器2川還禁止 =寬需求大於高頻寬臨界值HBWT的仔列緩衝區的封包 ，上㈣各㈣緩衝區_寬需糊是藉由頻寬計 241〜247計算獲得的。以頻寬計數器241城例，頻 =數器2仙接至传列緩衝區Qm，並計算單位時間内 H衝區QB1的封包的傳遞數(例如是封包位元的傳遞 i L厂Γ獲得㈣緩舰QB1的f求頻寬(而關於仵列 區QB2〜QB7的需求頻寬的獲得方式也可依此類推）。 圖2A的繪示中可以清楚的發現，仰緩衝區QB1的需 201044819 .aoc/n 求頻寬恰等於其所對應的低頻寬臨界值LBWT1。相同的， 符列緩衝區QB2的需求頻寬也恰等於其所對應的低頻寬 臨界值LBWT2。另外，佇列緩衝區QB3-QB7的需求頻寬 則分別小於或等於其所對應的低頻寬臨界值LBWT3〜 LBWT7，因此，在圖2A的繪示中，頻寬配置控制器23〇 僅需要配置最低頻寬至各佇列緩衝區qB1_qB7即可以滿 足所有的封包傳遞的要求。 Ο 接著則請參照圖2B，圖2B繪示圖2A的網路交換機 的頻寬排程裝置200的另-實施方式的示意圖。在圖2B 的繪示中’佇列緩衝區QB1的需求頻寬已經超過的其所對 應的高頻寬臨界值HBWT卜因此，頻寬配置控制哭23〇 求頻寬計數器241所傳送的需求頻寬與^寬臨 2 fWT1進㈣較，域雌的舰聽QBi的封 2遞。另外，件列緩衝區qB2的需求頻寬則大於其所對 頻寬臨界值Η斯2。因此，頻O o Interpretation of the Internet has become a packet that people can't communicate with each other in all directions, then = server or network switch to control the flow of packets between networks 2 Depending on the bandwidth of the network switch Allocating, and knowing the network exchange, the three ways of subdividing are divided into different buffers = bandwidth. The first way is to limit the bandwidth of each buffer, and the sum of the bandwidths of all (10) buffers is equal to the width of the network and the change of the machine. The disadvantage is that the empty correction width cannot be used. . In addition, the conventional switch also uses the second, wide allocation method of the following pay. New Zealand is the buffer of each of the four (four) buffers, and its demand allocation is fixed _. However, due to the fixed_distributed D, the bandwidth of the buffer will vary with the total bandwidth. Therefore, such a wide distribution of miscellaneous woven, but can not achieve the control of the frequency bandwidth, it is difficult to optimize. Furthermore, the conventional network switch also uses the third type of bandwidth allocator. This bandwidth allocation method is through the third layer protocol or the Resource ReSerVation Protocol (RSVP). Constructed, 3 201044819 _> lUOJlWl.uu^/n is very complicated in implementation [invention] The present invention provides a network exchange queue buffer bandwidth required to be πJ Hongjian knife with Wanqi according to each , improve _^ rate _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ _ , efficient _ network switch bandwidth. Marriage proposed - a bandwidth allocation method for network switches, where: Road: The switch includes a plurality of column buffers. The bandwidth allocation party "Dragon 1 sets the high-bandwidth threshold value and the low-frequency width II for each of the sub-zones. The sum is divided into two according to the low-frequency wide-threshold value of each column buffer, to each column. Buffer. Then, the remaining bandwidth is allocated until the bandwidth demand is greater than the minimum, at the high service threshold (10), and the woven demand is greater than the high frequency wide threshold _ ship-to-ship packet transmission. In the present invention - In an embodiment, the remaining bandwidth is equal to the total bandwidth of the network switch minus the lowest bandwidth of the buffer buffer. In the consistent embodiment of the present invention, the allocated residual bandwidth to bandwidth requirement is greater than The most lenient and less than the high-frequency wide-threshold (10) ship-shooting zone, the steps include weighted round r〇bin, weighted fair queue, or defid weighted round robin 201044819 JIUOJLWA.doc/jj seeks to borrow the bandwidth of the above-mentioned fiber-punching area. The number of data transmission in the buffer of the internals (four) internals column buffers the money in the example of the case Bandwidth The allocation method is more inclusive; to: the bandwidth requirement of the block buffer of the second=bandwidth threshold value is output. When the value is 界Boundary value, the data of the re-starting ship rushing zone is transmitted ο Transmission ====== The device includes several meters m to two inspection areas, and most of the required bandwidth widths are programmed: each; two: 阜, connected to the scheduler, column buffer, buffered with the W interface buffer γ ^ 1 buffer The bandwidth requirement of the area. The bandwidth configuration control row "receives the high-frequency wide-valued eight-bounding value corresponding to the riding buffer" and according to the low-frequency width of each buffer buffer; _', see less than the south bandwidth The threshold buffer of the threshold value, and the packet buffer of the buffer buffer whose bandwidth requirement is greater than the high frequency wide threshold value is based on the above-mentioned invention. By monitoring the bandwidth requirement of the hunting buffer buffer, the frequency of each buffer buffer is The wide demand and the frequency threshold and the low frequency wide threshold set by each of the hash buffers are used to dynamically adjust the bandwidth allocation between the buffers. The bandwidth distribution of the network switch is more flexible and more efficient, and the network is further improved to make the above features and advantages of the present invention more obvious. The following is a specific example. The details are as follows with reference to the drawings. [Embodiment] FIG. 1 and FIG. 1 are flowcharts showing a method for allocating a bandwidth of a network switch according to an embodiment of the present invention. The steps include: first, respectively, for each of the (four) buffers on the network switch, the limb high frequency width threshold and the low frequency width threshold (step S11G). Please note that the (four) wide thresholds of each of the elevation and puncturing zones need not be equal, and the high-frequency wide-threshold value can be divided according to the requirements of each secret (four). The same white, mother-bribery ship's _width threshold also needs to be equal, so the lower threshold of the 'Lai Chong District can also be set to the value of the phase. ^ After becoming the high-frequency wide-thickness and low-tech of each of the 彳宁赖区, the bandwidth is then allocated according to the low-frequency width of each correction buffer by the boundary value (step S12G). Step S12 = Road crossing: Each of the array buffers on the machine has a minimum of the limit, and the minimum f is (four) packet transmission. After the step S120, the bandwidth requirement of the buffer is calculated, and it is judged that the frequency of the queues is more than that of the miscellaneous ship area (step S130). Once the bandwidth of the buffer is found to be long = Ning, the minimum bandwidth required for the zone, the core demand exceeds the allocated minimum bandwidth and the remaining bandwidth is allocated (steps) 8140 Bu in this 'the so-called bandwidth requirements of each buffer buffer in the real 201044819 i.doc / n = two transmission: material transmission = number ==, column buffer: deducted two is the network switch The total bandwidth ❹ the lowest frequency of the buffer buffer, the total bandwidth of the switch minus the weighted weighting method, which is known to the general knowledge, The bandwidth requirement is that the bandwidth requirement of the buffer buffer exceeds the column buffer of the hash buffer for packet transmission (step S(10)). Here, the right bandwidth to be recovered exceeds its high frequency width. In the buffer transmission action of the buffer, the I<d" is calculated for the buffer of the buffer. It is also the high frequency wide threshold. The tree is lower than the corresponding network II invention. - Counter 241 of the embodiment:: column controller 23 需求, demand bandwidth 〇 1丁〜后冲区qb1~qB7. 苴中器220 chick transmission 埠21〇, and the bandwidth configuration control says that the light is connected to the 201044819 processor 220 and is received by each demand bandwidth counter 241~247 The bandwidths of the buffers QB1 to QB7 are coupled to the scheduler 220 and coupled to the required bandwidth counters 241 247 to 247. The bandwidth configuration controller 230 receives the column buffers. The high-bandwidth threshold HBWT and the low-bandwidth threshold LBWT of qb 1 to QB7. In this embodiment, since there are seven queue buffers QB1 QQB7, the bandwidth threshold value HBWT received by the bandwidth configuration controller 230 and The low frequency wide threshold LBWT may have seven values each to correspond to the buffer buffer QB1 to the buffer buffer QB7. In addition, the frequency I configures the controller 230 and receives and knows the buffer buffer by the bandwidth counters 241 247 247. QBi~QB7 bandwidth requirement, bandwidth configuration controller 230 and according to each queue buffer Qm~ green boundary value C is allocated the most fiber to each buffer buffer"J = residual frequency see bandwidth demand is greater than最 column buffer with the lowest frequency and less than the high frequency wide threshold HBWT In addition, the bandwidth configuration controller 2 is also prohibited = the bandwidth requirement is greater than the high frequency wide threshold HBWT packet buffer, the upper (four) each (four) buffer _ wide paste is calculated by the bandwidth meter 241 ~ 247 Obtained. In the bandwidth counter 241 city example, the frequency=number 2 sen is connected to the hash buffer Qm, and the number of packets transmitted by the H-zone QB1 per unit time is calculated (for example, the transmission of the packet bit i L factory) Γ Obtain (4) the bandwidth of the slow-going QB1 f (and the way to obtain the demand bandwidth of the QB2~QB7) can be similar. It can be clearly seen in the drawing of FIG. 2A that the required bandwidth of the buffer buffer QB1 201044819 .aoc/n is exactly equal to the corresponding low frequency wide threshold LBWT1. Similarly, the required bandwidth of the register buffer QB2 is also equal to its corresponding low-frequency wide threshold LBWT2. In addition, the required bandwidth of the buffer buffers QB3-QB7 is less than or equal to the corresponding low-frequency wide thresholds LBWT3 LB LBWT7. Therefore, in the illustration of FIG. 2A, the bandwidth configuration controller 23 only needs to be configured. The lowest frequency is wide enough to each buffer buffer qB1_qB7 to meet all packet delivery requirements. Ο Next, please refer to FIG. 2B. FIG. 2B is a schematic diagram showing another embodiment of the bandwidth scheduling apparatus 200 of the network switch of FIG. 2A. In the drawing of FIG. 2B, the corresponding high frequency width threshold HBWT of the bandwidth of the queue buffer QB1 has been exceeded. Therefore, the bandwidth configuration controls the bandwidth of the demand transmitted by the bandwidth counter 241. ^ Wide Pro 2 fWT1 into (four), the domain female ship listens to QBi's seal 2 hand. In addition, the demand bandwidth of the block buffer qB2 is greater than the threshold value of the bandwidth threshold. Therefore, frequency
餘頻寬配置於仵舰衝區QB2來進行封包傳遞。、 求褒，若是有超過一個以上的仔列緩衝區的需 :高頻寬臨界值時，頻寬配置控制器 ^ 見都能有效的被利用，推而祖此 路父換機的頻 相&升網路交換機的封包傳遞效 9 201044819 月匕。此外，佇列緩 動態的被改變，以拇的鬲、低頻寬臨界值的設定還可以 雖然本發明已：加網路交換機的適應性。 本發明，任何所屬實施例揭露如上，然其並非用以限定 本發明之精神和範有通常知識者，在不銳離 發明之保護朗^& 可作些許之更動與潤飾，故本 固田規後附之申請專利範圍所界定者為準。 【圖式簡單說明】 Ο 法的實施_網路交換機的頻寬分配方 程裝ΐ:會林發明的-實施例的網略交換機的囊 的另===網路交換機的頰寬排程裝㈣。 【主要元件符號說明】 S110〜S160 :頻寬分配方法的步驟 200 :頻寬排程裝置 210 :傳輸埠 220 :排程器 230 :頻寬配置控制器 QB1-QB7 :佇列緩衝區 241〜247 :頻寬計數器 HBWT、HBWT1〜HBWT2 :高頻寬臨界值 LBWT、LBWT1〜LBWT 7 :低頻寬臨二值 10The residual bandwidth is configured in the QB2 of the ship's rushing area for packet transmission. If you have more than one buffer buffer: the high-bandwidth threshold, the bandwidth configuration controller can be effectively used, and the frequency andamp; The packet transmission effect of the network switch is 9 201044819. In addition, the slow dynamics of the array are changed, and the setting of the threshold of the thumb and the low frequency is also possible. Although the invention has been adapted to the adaptability of the network switch. The present invention is not limited to the spirit and scope of the present invention, and may be modified and retouched without departing from the invention. The scope defined in the appended patent application shall prevail. [Simple description of the diagram] Implementation of the method _ The bandwidth allocation equation of the network switch is installed: the invention of the network of the invention - the pocket of the network switch of the other === the width of the network switch of the network switch (4) . [Description of Main Component Symbols] S110 to S160: Step 200 of Bandwidth Allocation Method: Bandwidth Scheduling Device 210: Transmission 埠 220: Scheduler 230: Bandwidth Configuration Controller QB1-QB7: Array Buffers 241 to 247 : Bandwidth counter HBWT, HBWT1~HBWT2: High-frequency wide threshold LBWT, LBWT1~LBWT 7: Low-frequency wide-end binary value 10