CN100539523C - A kind of dynamic link bandwidth allocation methods that is used for Resilient Packet Ring - Google Patents
A kind of dynamic link bandwidth allocation methods that is used for Resilient Packet Ring Download PDFInfo
- Publication number
- CN100539523C CN100539523C CNB038257440A CN03825744A CN100539523C CN 100539523 C CN100539523 C CN 100539523C CN B038257440 A CNB038257440 A CN B038257440A CN 03825744 A CN03825744 A CN 03825744A CN 100539523 C CN100539523 C CN 100539523C
- Authority
- CN
- China
- Prior art keywords
- rate
- fair
- idle
- advertisement
- speed
- Prior art date
- Legal status (The legal status 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 status listed.)
- Expired - Fee Related
Links
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/42—Loop networks
- H04L12/437—Ring fault isolation or reconfiguration
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0241—Advertisements
- G06Q30/0251—Targeted advertisements
- G06Q30/0262—Targeted advertisements during computer stand-by mode
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0241—Advertisements
- G06Q30/0273—Determination of fees for advertising
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/42—Loop networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L12/00—Data switching networks
- H04L12/28—Data switching networks characterised by path configuration, e.g. LAN [Local Area Networks] or WAN [Wide Area Networks]
- H04L12/42—Loop networks
- H04L12/427—Loop networks with decentralised control
- H04L12/433—Loop networks with decentralised control with asynchronous transmission, e.g. token ring, register insertion
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L41/00—Arrangements for maintenance, administration or management of data switching networks, e.g. of packet switching networks
- H04L41/08—Configuration management of networks or network elements
- H04L41/0896—Bandwidth or capacity management, i.e. automatically increasing or decreasing capacities
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/20—Traffic policing
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/22—Traffic shaping
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/25—Flow control; Congestion control with rate being modified by the source upon detecting a change of network conditions
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/08—Monitoring or testing based on specific metrics, e.g. QoS, energy consumption or environmental parameters
- H04L43/0876—Network utilisation, e.g. volume of load or congestion level
- H04L43/0894—Packet rate
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L43/00—Arrangements for monitoring or testing data switching networks
- H04L43/16—Threshold monitoring
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Business, Economics & Management (AREA)
- Strategic Management (AREA)
- Accounting & Taxation (AREA)
- Development Economics (AREA)
- Finance (AREA)
- Economics (AREA)
- Game Theory and Decision Science (AREA)
- Entrepreneurship & Innovation (AREA)
- Marketing (AREA)
- Physics & Mathematics (AREA)
- General Business, Economics & Management (AREA)
- General Physics & Mathematics (AREA)
- Theoretical Computer Science (AREA)
- Computer Hardware Design (AREA)
- General Engineering & Computer Science (AREA)
- Small-Scale Networks (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a kind of method that is used for the dynamic link allocated bandwidth of Resilient Packet Ring, this method has adopted a kind of new fair allocat mode, in an advertisement at interval, measure one group of variable, and use this group variable to calculate local fair rate, determine advertisement speed by local fair rate, each node on the Resilient Packet Ring guarantees the fair allocat of the bandwidth on the Resilient Packet Ring according to this advertisement rate transmissioning data bag; This method is compared with existing method, for idle speed has been introduced integration, thereby has obtained 100% bandwidth availability ratio, and has avoided using the notion of " congestion state " in the existing fair allocat mode.
Description
Technical field
The present invention relates to a kind of data communication technology that is used for wide area network (WAN) or Local Area Network.More particularly, relate to a kind of Resilient Packet Ring (Resilient Packet Ring, method of dynamic link allocated bandwidth RPR) of being used for.
Background technology
Resilient Packet Ring is a kind of metropolitan area network of brand-new circulus, and it supports the data service of three kinds of grades of service, has the bandwidth availability ratio height, characteristics such as reliability height.Realize one of key technology of Resilient Packet Ring, be dynamically, go up the node of competitive resource for ring liberally link bandwidth assignment.The present invention discloses a kind of new dynamic link bandwidth allocation methods.Compare with the scheme that present Resilient Packet Ring working group (IEEE802.17 working group) proposes, it is simpler, and has higher bandwidth availability ratio.The task of IEEE802.17 working group is to formulate the technical standard of Resilient Packet Ring (RPR).Resilient Packet Ring (RPR) technology is used for the data communication of wide area network (WAN) or Local Area Network, compares with the data communication technology that is used for wide area network or local area network (LAN) now, and it has two tangible advantages:
1. more effective on bandwidth usage.
2. protection mechanism fast so that with failure detection time at same magnitude (less than 50ms).
In order to obtain effective transmission, Resilient Packet Ring (RPR) is not discarded in any packet of waiting in line to transmit.In this process, upstream node might send too many business, guarantees that each node that encircles has identical chance to send the user's data bag so need a mechanism.
In the mechanism of IEEE802.17 working group suggestion, each node will send a special bag that is called fair bag, and this bag is used to notify the upstream node advertisement speed that suggestion is used.
In order to ensure in all node justices, each node is no more than the business of advertisement speed (advertising rate) with transmission, and the value of this advertisement speed (advertising rate) is one less the advertisement speed that produces of the advertisement speed of coming from downstream node and this node.
How to determine advertisement speed (advertising rate) by downstream node next advertisement speed and local advertising speed, be the key of guaranteeing network performance.In IEEE802.17 working group, the mechanism of suggestion is to determine advertisement speed (advertising transmission rate), and it also influences local advertisement speed.This mechanism is summarized as follows:
At present, the fair allocat mode that is proposed by IEEE802.17 working group has two kinds, a kind of radical pattern that is called, and another kind is called conservative mode.
The non-weighting version of the fair allocat mode of IEEE802.17 proposition only is discussed here.It should be noted that: the new dynamic link bandwidth allocation methods that proposes in the present patent application is the fair allocat mode of weighting.
Description to the fair allocat mode is:
Insert speed (add_rate): being inserted into the byte count value of this locality bag of enjoying fair bandwidth on the ring in advertisement at interval by node, is the byte count value of having set fair significance bit (FE bit) bag;
Local fair rate (local_fair_rate): insert the filtering type of speed, different mode algorithm difference;
The advertisement speed (received_advertising_rate) that receives: the bearer rate in the fair information of A type;
The advertisement interval: in each advertisement at interval, will send the fair information of A type to upstream node, the fair information of A type is advertisement speed (advertising_rate).
Advertisement speed: this speed is defined as follows:
The first, if local node is congested, and local fair rate is greater than the advertisement speed that receives, and the value of then advertisement speed (advertising_rate) equals local fair rate (local_fair_rate).
The second, if local node is congested, and local fair rate is not more than the advertisement speed of reception, and the value of then advertisement speed (advertising_rate) equals the advertisement speed (received_advertising_rate) that receives from the downstream.
The 3rd, if local node is not congested, the value of then advertisement speed (advertising_rate) equals the advertisement speed that receives from the downstream, if receive null value speed then advertisement speed is zero, the maximum of expression link rate.
The main difference of radical pattern and conservative mode and some nuance depend on how to define local fair rate (1ocal_fair_rate).In radical pattern, local fair rate (local_fair_rate) is a low pass filtered wave mode of inserting speed (add_rate).In conservative mode, local fair rate (local_fair_rate) is the low pass filtered wave mode of inserting speed (add_rate), and is similar to radical pattern, and,
If link utilization is lower than 85% (low threshold is following), then increase the value of local fair rate; If link utilization greater than 95% (more than the high threshold), then reduces the value of local fair rate.
Compare with the radical pattern of fair allocat mode, the conservative mode of fair allocat mode has more performance under different condition, and its cost is that the maximum bandwidth utilance only is 95%, lower in some cases.
The subject matter of radical pattern is, when the own bandwidth demand amount of congested node during much smaller than upstream node bandwidth demand amount (as shown in Figure 3), bandwidth can't correctly be distributed in institute is active, causes source utilance low (as shown in Figure 4).
Summary of the invention
Problem at allocated bandwidth existence in the prior art: in radical pattern, when non-consumption bandwidth source and the mixing of consumption bandwidth source, the stationarity of allocated bandwidth causes bandwidth waste, and for example in the conservative mode, the maximum bandwidth utilance only is 95%, and waste is more serious when multiple source is the consumption bandwidth source.The method that the purpose of this invention is to provide a kind of dynamic link allocated bandwidth that is used for Resilient Packet Ring newly, this method is compared with the existing fair allocat mode that IEEE802.17 working group proposes, more simple, bandwidth availability ratio is higher, and can guarantee the fairness of allocated bandwidth.
For reaching above purpose, the present invention has adopted following technical scheme:
The present invention has adopted a kind of new fair allocat mode, and this method of salary distribution has adopted the advertisement notion of (advertisement interval) at interval.In an advertisement at interval, this method of salary distribution may further comprise the steps:
A. the value of measurand
Add_rate: the byte count that is inserted into this locality bag of enjoying fair bandwidth on the ring by node.
Total_add_rate: the total amount of byte that is inserted into this locality bag on the ring by node.
Fw_rate: the byte count of enjoying the forwarding bag on the ring of fair bandwidth.
Total_fw_rate: the total amount of byte of transmitting bag on the ring.
B. the target of this new fair allocat mode is to guarantee correctly to be distributed in making full use of of link in all competition nodes with the Time Bandwidth justice.In order to realize this target, need to calculate local fair rate (local_fair_rate) according to following steps:
B1. use formula idle_rate=link_rate-total_add_rate-total_fw_rate to obtain idle speed idle_rate, variable link_rate is when the link full load in the formula, advertisement byte count at interval;
If b2. idle speed idle_rate＜idle_rate_threshold (idle_rate_threshold reach as high as link rate 99.99%) then uses formula
acc_idle＝(α-1)＊acc_idle/α
Otherwise, use formula
acc_idle＝acc_idle+idle_rate/β
acc_idle＝min(acc_idle，unreserved_rate)，
Acc_idle is the integration of idle speed in the formula, and its value is no more than admissible rate unreserved_rate;
B3. use formula
Local_fair_rate=(δ-1) * local_fair_rate/ δ+add_rate/ (δ * weight)+acc_idle/ δ obtains local fair rate (local_fair_rate), and weight is the weights of weighted-fair method of salary distribution node in the formula.
C. determine advertisement speed (advertising_rate), may further comprise the steps:
If c1. the value of the advertisement speed of Jie Shouing less than the value of local fair rate (be received_advertising_rate＜local_fair_rate), the value of the advertisement speed (received_advertising_rate) that the value of then advertisement speed (advertising_rate) equals to receive;
If the byte count of c2. enjoying the forwarding bag on the ring of fair bandwidth (is that fw_rate＜advertisng_rate), the value of then advertisement speed (advertsing_rate) equals local fair rate (local_fair_rate) less than the value of advertisement speed;
If c3. the direct count that is inserted into this locality bag of enjoying fair bandwidth on the ring by node is greater than there being bag etc. to be inserted in minimum packet size (be add_rate〉minimum packet size) or this node Low Priority Queuing, the value of then advertisement speed (advertising_rate) equals local fair rate (local_fair_rate);
C4. otherwise, the advertisement speed (received_advertisng_rate) that the value of advertisement speed (advertising_rate) equals to receive.
D. the node of each on Resilient Packet Ring is to be no more than above-mentioned the 3rd the determined advertisement rate transmissioning data of step bag, to guarantee the fair allocat of bandwidth on the Resilient Packet Ring.
The technique scheme that the present invention adopts, with respect to existing technology, for idle speed is introduced integration, thereby obtain 100% bandwidth availability ratio, (in most of real case, because the advertisement rule of local fair rate (local_fair_rate) has only a link can obtain 100% utilance), this method of salary distribution has also been avoided the notion of " congestion state " in existing fair allocat mode.Therefore, the new method of salary distribution of the present invention's employing has been compared following some advantage with the existing method of salary distribution:
The first, the advantage on " target ":
1. the existing method of salary distribution attempts to be in " congestion state " at some node, and the assurance bandwidth is distributed to all competition nodes liberally.
2. the new method of salary distribution is a basic calculation advertisement speed with the idle speed of each node, is devoted to guarantee that the link utilization of each part is 100%.For the fair allocat mode of single choke point, as a rule, have only a link can obtain 100% link utilization, this also is one of purpose of fair allocat mode.
The second, the advantage on the method for salary distribution:
1. congestion state: in the existing method of salary distribution, if do not have congestion point on the ring, each node will broadcast " null value ", represent maximum value bandwidth.Only when being in congestion state or receive non-null value broadcasting, node will be broadcasted non-null value.In the new method of salary distribution, there is not the notion of " congestion state ", each station will be broadcasted according to the above method of salary distribution, greatly reduce the complexity of the method for salary distribution.
2. the measurement of idle speed: the purpose of measurement is to calculate a comprehensive duty ratio index (the I index of PID in the similar control theory (ratio, integration, differential) controller, and then draw local fair rate (local_fair_rate) and advertisement speed, to guarantee 100% link bandwidth utilization rate.And the existing method of salary distribution must be measured many statistical informations and calculates advertisement speed.
3. advertisement speed: the computational methods difference of advertisement speed.In the new method of salary distribution, if node has sent bag or has had bag etc. to be sent, under the condition of local fair rate (local_fair_rate) less than the advertisement speed (received_advertising_rate) that receives, RPR will broadcast its local fair rate (local_fair_rate) (above-mentioned regular 3) in the station.
4. local fair rate (local_fair_rate): the computing mechanism that obtains local fair rate (local_fair_rate) between existing fair allocat mode and the new fair allocat mode is different fully.
Description of drawings
Fig. 1 is definite method flow of (local_fair_rate) in the distribution method used of the present invention.
Fig. 2 is definite method flow of advertisement speed (advertising_rate) in the distribution method used of the present invention.
Fig. 3 is the height-low bandwidth setting among one of embodiment height-low bandwidth embodiment.
Fig. 4 is the simulation result of Fig. 3 embodiment according to the radical pattern of existing fair allocat mode.
Fig. 5 is the simulation result of Fig. 3 embodiment according to the conservative mode of existing fair allocat mode.
Fig. 6 is the simulation result of the mode of fair allocat used according to the present invention of Fig. 3 embodiment.
Fig. 7 is the arrangement and the traffic demand of standing among the embodiment of one of present embodiment parking lot.
Fig. 8 is the radical pattern simulation result according to existing fair allocat mode of Fig. 4 embodiment.
Fig. 9 is the conservative mode simulation result according to existing fair allocat mode of Fig. 4 embodiment.
Figure 10 is the simulation result of the mode of fair allocat used according to the present invention of Fig. 4 embodiment.
Embodiment
Be described in further detail below in conjunction with the concrete enforcement of accompanying drawing technical scheme.The invention discloses a kind of method that is used for the dynamic link allocated bandwidth of Resilient Packet Ring, this method is based on adopting the advertisement fair allocat mode of (advertisement interval) notion at interval, in an advertisement at interval, this fair allocat mode may further comprise the steps:
A. measure the value of one group of variable
Add_rate: the byte count that is inserted into this locality bag of enjoying fair bandwidth on the ring by node.
Total_add_rate: the total amount of byte that is inserted into this locality bag on the ring by node.
Fw_rate: the byte count of enjoying the forwarding bag on the ring of fair bandwidth.
Total_fw_rate: the total amount of byte of transmitting bag on the ring.
B. the target of this new fair allocat mode is to guarantee correctly to be distributed in making full use of of link in all competition nodes with the Time Bandwidth justice.In order to realize this target, need to calculate local fair rate (local_fair_rate) according to following steps, Fig. 1 has described definite method of local fair rate (local_fair_rate):
B1. use formula idle_rate=link_rate-total_add_rate-total_fw_rate to obtain idle speed idle_rate, variable link_rate is when the link full load in the formula, advertisement byte count at interval;
If b2. idle fast idle_rate＜idle_rate_threshold (idle_rate_threshold reach as high as link rate 99.99%) then uses formula
Acc_idle=(α-1) * acc_idle/ α (in all emulation, α=16)
Otherwise, use formula
Acc_idle=acc_idle+idle_rate/ β (β=32, guaranteeing does not have the free time)
acc_idle＝min(acc_idle，unreserved_rate)，
Acc_idle is the integration of idle speed in the formula, and its value is no more than admissible rate unreserved_rate;
B3. use formula
Local_fair_rate=(δ-1) * local_fair_rate/ δ+add_rate/ (δ * weight)+acc_idle/ δ obtains local fair rate (local_fair_rate), and weight is the weights of weighted-fair method of salary distribution node in the formula.
C. determine advertisement speed (advertising_rate), may further comprise the steps that Fig. 2 has described definite method of advertisement speed (advertising_rate):
If c1. the value of the advertisement speed of Jie Shouing (is received_advertising_rate＜local_fair_rate) less than the value of local fair rate, the value of the advertisement speed (received_advertising_rate) that the value of then advertisement speed (advertising_rate) equals to receive, this is similar to the existing method of salary distribution;
If c2. enjoying the byte count of the forwarding bag on the ring of fair bandwidth (is fw_rate＜advertisng_rate) less than the value of advertisement speed, the value of then advertisement speed (advertsing_rate) equals local fair rate (local_fair_rate), and to adopt the single choke point method of salary distribution to handle disconnected choke point similar to the existing method of salary distribution for this;
If c3. the direct count that is inserted into this locality bag of enjoying fair bandwidth on the ring by node is greater than there being bag etc. to be inserted in minimum packet size (be add_rate〉minimum packet size) or this node Low Priority Queuing, the value of then advertisement speed (advertising_rate) equals local fair rate (local_fair_rate), and these are different with the existing method of salary distribution;
C4. otherwise, the advertisement speed (received_advertisng_rate) that the value of advertisement speed (advertising_rate) equals to receive, these may be different with the existing method of salary distribution, in the existing method of salary distribution, if do not take place congestedly, node may be broadcasted null value speed and be replaced.
D. the node of each on Resilient Packet Ring is to be no more than above-mentioned the 3rd the determined advertisement rate transmissioning data of step bag, to guarantee the fair allocat of bandwidth on the Resilient Packet Ring.
The fair allocat mode that the present invention uses has been passed through simulation study.Simulation study relates to all 8 cases that fair allocat mode that IEEE802.17 working group proposes is assessed, and existing fair allocat mode and the compatibility test between the fair allocat mode newly.
Embodiment (1) height-low bandwidth:
Figure 3 shows that height-low bandwidth setting.The optimum wideband of node S5 is assigned as 12.5M (because special simulation parameter, this value exceeds 5%), and node S1 is 137.5M.Figure 4 shows that the simulation result of radical pattern, by in the simulation result of Fig. 4 as seen, adopt fair allocat mode radical pattern, node S1 actual allocated to bandwidth vibrating between the 46M to 130M, can't reach stable state.This also is the main cause that fair allocat mode conservative mode is introduced into.Adopt fair allocat mode conservative mode, bandwidth availability ratio is no more than 95%.When the node of a plurality of high bandwidth requirements was arranged in the upstream, bandwidth waste was more serious.
Figure 5 shows that the simulation result of conservative mode.
Figure 6 shows that the simulation result of new fair allocat mode.
Present embodiment has embodied new fair allocat mode and has had high bandwidth availability ratio, and as shown in Figure 6, new fair allocat mode has realized 100% bandwidth availability ratio, compares with radical pattern shown in Figure 4, has avoided bandwidth waste.
Embodiment (2) parking lot:
As shown in Figure 7, be the arrangement and the traffic demand in parking lot.
As shown in Figure 8, use the simulation result of the radical pattern of the existing method of salary distribution for this embodiment.
As shown in Figure 9, use the simulation result of the conservative mode of the existing method of salary distribution for this embodiment.
As shown in figure 10, use the simulation result of new fair allocat mode for this embodiment.
Present embodiment is used for testing the basic demand of the method for salary distribution: fairness.Show that from these simulation results the new method of salary distribution is the same with all existing methods of salary distribution, can guarantee the fair allocat of bandwidth.Identical with radical pattern aspect bandwidth availability ratio, and the bandwidth availability ratio of conservative mode only is about 90%.
Claims (2)
1. dynamic link bandwidth allocation methods that is used for Resilient Packet Ring, this method is characterized in that based on adopting the advertisement fair allocat mode of notion at interval in an advertisement at interval, this method may further comprise the steps:
A. measure one group of variable, comprising: add_rate is inserted into the direct count that wrap this locality of enjoying fair bandwidth on the ring by node; Total_add_rate is inserted into the total amount of byte that wrap this locality on the ring by node; Fw_rate, the byte count of enjoying the forwarding bag on the ring of fair bandwidth; Total_fw_rate transmits the total amount of byte of wrapping on the ring;
B. use the variable that records, obtain local fair rate;
C. the advertisement speed that provides by local fair rate and downstream node is determined advertisement speed;
D. each node on the Resilient Packet Ring is determined advertisement speed with step c, and according to this advertisement rate transmissioning data bag, guarantees the fair allocat of bandwidth on the Resilient Packet Ring;
Wherein said step b further may further comprise the steps:
B1. use formula idle_rate=link_rate-total_add_rate-total_fw_rate to obtain idle speed idle_rate, variable link_rate is when the link full load in the formula, advertisement byte count at interval;
If the idle speed thresholding of b2. idle speed idle_rate＜idle_rate_threshold then uses formula
acc_idle＝(α-1)*acc_idle/α
Otherwise, use formula
acc_idle＝acc_idle+idle_rate/β
acc_idle＝min(acc_idle，unreserved_rate)，
Acc_idle is the integration of idle speed in the formula, and its value is no more than admissible rate unreserved_rate;
B3. use formula
Local_fair_rate=(δ-1) * local_fair_rate/ δ+add_rate/ (δ * weight)+acc_idle/ δ obtains local fair rate, and weight is the weights of weighted-fair method of salary distribution node in the formula.
2. the dynamic link bandwidth allocation methods of Resilient Packet Ring as claimed in claim 1 is characterized in that, described step c further may further comprise the steps:
If c1. the value of the advertisement speed of Jie Shouing is less than the value of local fair rate, the value of the advertisement speed that the value of then advertisement speed equals to receive;
C2. otherwise, if enjoy the value of the byte count of the forwarding bag on the ring of fair bandwidth less than local fair rate, the value of then advertisement speed equals local fair rate;
C3. otherwise, if the direct count that is inserted into this locality bag of enjoying fair bandwidth on the ring by node is greater than there being bag etc. to be inserted in minimum packet size or this node Low Priority Queuing, the value of then advertisement speed equals local fair rate;
C4. otherwise, the advertisement speed that the value of advertisement speed equals to receive.
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| PCT/CN2003/000002 WO2004062195A1 (en) | 2003-01-02 | 2003-01-02 | A method for distributing dynamic liink bandwith for resilient packet ring |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1720690A CN1720690A (en) | 2006-01-11 |
| CN100539523C true CN100539523C (en) | 2009-09-09 |
Family
ID=32686800
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB038257440A Expired - Fee Related CN100539523C (en) | 2003-01-02 | 2003-01-02 | A kind of dynamic link bandwidth allocation methods that is used for Resilient Packet Ring |
Country Status (5)
| Country | Link |
|---|---|
| US (1) | US7672229B2 (en) |
| CN (1) | CN100539523C (en) |
| AU (1) | AU2003303508A1 (en) |
| BR (1) | BRPI0317917B1 (en) |
| WO (1) | WO2004062195A1 (en) |
Families Citing this family (10)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN100356748C (en) * | 2004-09-17 | 2007-12-19 | 杭州华三通信技术有限公司 | Equalizing ring selecting method for elastic block ring flow |
| US7948881B2 (en) * | 2005-04-15 | 2011-05-24 | New Jersey Institute Of Technology | Distributed bandwidth allocation for resilient packet ring networks |
| CN101136829B (en) * | 2006-08-30 | 2010-08-18 | 中兴通讯股份有限公司 | Method and device for improving equitable efficiency of elastic grouping ring |
| US20080137666A1 (en) * | 2006-12-06 | 2008-06-12 | Applied Micro Circuits Corporation | Cut-through information scheduler |
| US20100265833A1 (en) * | 2009-04-16 | 2010-10-21 | Ou Frank Y | Network bandwidth determination |
| US8089878B2 (en) | 2009-06-05 | 2012-01-03 | Fahd Alharbi | Allocating bandwidth in a resilient packet ring network by P controller |
| US8310930B2 (en) | 2009-06-05 | 2012-11-13 | New Jersey Institute Of Technology | Allocating bandwidth in a resilient packet ring network by PI controller |
| US8307111B1 (en) * | 2010-04-13 | 2012-11-06 | Qlogic, Corporation | Systems and methods for bandwidth scavenging among a plurality of applications in a network |
| US20120008497A1 (en) * | 2010-07-07 | 2012-01-12 | Loop Telecommunication International, Inc. | Method of bandwidth allocation in resilient packet ring network and associated computer-readable storage medium |
| CN111131365B (en) * | 2018-11-01 | 2022-11-08 | 金山云(深圳)边缘计算科技有限公司 | Method and system for utilizing idle network resources of networking equipment |
Family Cites Families (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US5822540A (en) * | 1995-07-19 | 1998-10-13 | Fujitsu Network Communications, Inc. | Method and apparatus for discarding frames in a communications device |
| US5546377A (en) * | 1995-10-31 | 1996-08-13 | Digital Equipment Corporation | Efficient distributed method for computing max-min fair rates of a limited resource in ATM networks |
| WO1997035410A1 (en) * | 1996-03-18 | 1997-09-25 | General Instrument Corporation | Dynamic bandwidth allocation for a communication network |
| US7336680B2 (en) * | 2001-09-18 | 2008-02-26 | Scientific-Atlanta, Inc. | Multi-carrier frequency-division multiplexing (FDM) architecture for high speed digital service |
| US7126910B1 (en) * | 2001-12-13 | 2006-10-24 | Alcatel | Load balancing technique for a resilient packet ring |
| US20030163593A1 (en) * | 2002-02-25 | 2003-08-28 | William March Rice University | Method and system for implementing a fair, high-performance protocol for resilient packet ring networks |
| US20040032826A1 (en) * | 2002-08-02 | 2004-02-19 | Kamakshi Sridhar | System and method for increasing fairness in packet ring networks |
| US20050275752A1 (en) * | 2002-10-15 | 2005-12-15 | Koninklijke Philips Electronics N.V. | System and method for transmitting scalable coded video over an ip network |
| US7428211B2 (en) * | 2002-11-18 | 2008-09-23 | Wuhan Fiberhome Networks Co. Ltd. | Transmission apparatus and method of multi-service tributaries over RPR |
| KR100484305B1 (en) * | 2002-11-26 | 2005-04-20 | 한국전자통신연구원 | Resource allocation method for providing load balancing and fairness on dual rings |
| KR100560748B1 (en) * | 2003-11-11 | 2006-03-13 | 삼성전자주식회사 | method for bandwidth allocation using resilient packet ring fairness mechanism |
-
2003
- 2003-01-02 BR BRPI0317917A patent/BRPI0317917B1/en not_active IP Right Cessation
- 2003-01-02 AU AU2003303508A patent/AU2003303508A1/en not_active Abandoned
- 2003-01-02 US US10/541,325 patent/US7672229B2/en not_active Expired - Fee Related
- 2003-01-02 CN CNB038257440A patent/CN100539523C/en not_active Expired - Fee Related
- 2003-01-02 WO PCT/CN2003/000002 patent/WO2004062195A1/en not_active Application Discontinuation
Non-Patent Citations (1)
| Title |
|---|
| 弹性分组环中MAC协议公平性研究. 陶滢，吴重庆，刘学，张广思，张勇.铁道学报，第24卷第6期. 2002 * |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2004062195A1 (en) | 2004-07-22 |
| US20060106672A1 (en) | 2006-05-18 |
| AU2003303508A1 (en) | 2004-07-29 |
| CN1720690A (en) | 2006-01-11 |
| BRPI0317917B1 (en) | 2016-05-31 |
| BR0317917A (en) | 2005-11-29 |
| US7672229B2 (en) | 2010-03-02 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN100539523C (en) | A kind of dynamic link bandwidth allocation methods that is used for Resilient Packet Ring | |
| CN103347302B (en) | Dynamic service bandwidth allocation methods in SCPC/DAMA satellite system | |
| CN103929777B (en) | Vehicle network data distribution jamming control method based on congestion game | |
| CN106506043A (en) | Data transmission method, control device and equipment in a kind of PLC system | |
| CN100550805C (en) | A kind of wireless multi-hop and self transfer back network base station and bandwidth allocation methods thereof | |
| CN101272338B (en) | Method for port band width configuration on non-line speed interface plate and non-line speed interface plate | |
| CN101741713B (en) | Dynamic distribution method for radio local area network uplink bandwidth | |
| CN101753449B (en) | Resource management system supporting the probability guarantee of end-to-end delay and the method thereof | |
| CN105992233A (en) | Method and device for calculating capacity baseline of network service | |
| CN103874133B (en) | A kind of method, device and the access point apparatus of bandwidth control | |
| CN106533833A (en) | Method for reducing conflict of carrier interception multipath accessing resources | |
| CN102316483B (en) | A kind of EVDO system ensures the method and device of applied business QoS | |
| Lee et al. | A priority based algorithm for adaptive superframe adjustment and GTS allocation (PASAGA) in IEEE 802.15. 4 LR-WAN | |
| CN108965168B (en) | Internet of vehicles occupation resource fair allocation optimization method based on utility function | |
| JP3508562B2 (en) | Communication bandwidth allocation method | |
| CN100568847C (en) | Frame scheduling in differentiated services networks and buffer management unified algorithm | |
| CN111278163B (en) | Channel access method for solving problem of hidden terminal of short-distance wireless Internet of things | |
| CN111800823B (en) | Priority-based power wireless terminal data transmission method and device | |
| CN103117830A (en) | Non-real-time service timeslot packaging method for multi-frequency time division multiple access system | |
| Hou et al. | Safety message data transmission model and congestion control scheme in VANET | |
| CN103338481A (en) | Method and base station for avoiding link congestion in chain-type wireless network | |
| US20120008497A1 (en) | Method of bandwidth allocation in resilient packet ring network and associated computer-readable storage medium | |
| RU2319310C2 (en) | Method for dynamic distribution of bandwidth of communication line on dynamic packet ring | |
| CN101167387A (en) | Mobile communication system service bandwidth dynamic control distributing method | |
| CN102904831B (en) | A kind of QoS assurance of aeronautical communications network and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20090909 Termination date: 20200102 |
|
| CF01 | Termination of patent right due to non-payment of annual fee |