CN1333561C - A method for implementing bandwidth sharing architecture of virtual user ring network - Google Patents
A method for implementing bandwidth sharing architecture of virtual user ring network Download PDFInfo
- Publication number
- CN1333561C CN1333561C CNB031398413A CN03139841A CN1333561C CN 1333561 C CN1333561 C CN 1333561C CN B031398413 A CNB031398413 A CN B031398413A CN 03139841 A CN03139841 A CN 03139841A CN 1333561 C CN1333561 C CN 1333561C
- Authority
- CN
- China
- Prior art keywords
- node
- bandwidth
- network
- subring
- virtual
- 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
Landscapes
- Small-Scale Networks (AREA)
Abstract
The present invention relates to a distribution method for communication network bandwidth. When a user accesses a plurality of nodes on a ring and a plurality of nodes need to be interconnected with each other, a plurality of nodes formes a virtual subring, namely that a whole physical ring is formed by a plurality of virtual subrings; the bandwidth can be shared according to a ring network fairness algorithm between each node in the subrings and between the subrings.
Description
Technical field:
The present invention relates to the communication network allocation method of bandwidth.
Background technology:
In the multiple access communication system, as enterprise network, metropolitan area network and wide area network, these network major parts all are to adopt the ring topology mode, and ring network such as FDDI network or token-ring network are to obtain Internet resources are conducted interviews and weigh by obtaining token on the ring.The use of token makes can only a node visit network at any one time at most; and need certain methods to guarantee to have and have only a token on the ring; like this as long as a certain section on the ring has data message when transmitting; all the other sections on the ring just can only be idle, so just caused the very big waste of bandwidth resources.
Though the ring that constitutes with two layers of exchanged form can be so that the bandwidth of each nodes sharing loop when ring upward between each node bandwidth contention takes place, lacks effective looped network fair algorithm, the actual bandwidth of each node is difficult to guarantee.If adopt the configuration node bandwidth mode,, can not make full use of the bandwidth resources of loop though can increase the fairness of each node.And can regard as when constituting by several virtual subrings when a physical rings, share the looped network bandwidth all lacking effective looped network fair algorithm between each node of subring inside and between subring and the subring.
The objective of the invention is to: solve between each node of above-mentioned subring inside and the looped network bandwidth sharing problem between subring and the subring, and can farthest guarantee the justice between them, a kind of bandwidth sharing system implementation method of Virtual User looped network is provided for this reason.
Summary of the invention:
A, the total bandwidth of establishing looped network are B, and looped network is made of several virtual subrings, distribute the bandwidth B r of a promise for each virtual subring, distribute the bandwidth B n of a promise again at each node of virtual subring inside, should guarantee when band width configuration:
B, when a certain node in the subring need use the bandwidth that surpasses the promise distribute to it, it will go to compete remaining bandwidth resource in the subring according to fair algorithm, and if still can not satisfy the time, then remove to compete remaining bandwidth between subring according to fair algorithm again;
Each node on c, the ring all need to monitor it converting flow, notify other node flow that it can receive and adjust the bandwidth that oneself takies according to the information of other node of receiving;
D, make each node can obtain the network bandwidth liberally by such cover coordination system; The information that each node is sent here based on access flow and other node, oneself is how many network bandwidths of decision use.
Such as in a two-way ring, but the utilized bandwidth information that other node is sent can transmit by up direction, the down direction of walking with data is opposite.Each node estimates the rest network bandwidth resources, and notify other node, estimate the own shared network bandwidth again, and notify its network bandwidth that can use to compare with other node, oneself using the too much network bandwidth partially if find, then should reduce the own shared network bandwidth, until justice.
Major advantage of the present invention is:
1, the business that guarantees high priority can be obtained the required network bandwidth;
2, for the business of low priority, each node in the subring can obtain the network bandwidth of subring liberally, and also can compete the bandwidth resources of whole network between subring and the subring liberally;
3, the network bandwidth can be shared fully, has improved network bandwidth utilization rate.
Description of drawings:
Accompanying drawing 1 is the queue scheduling block diagram of a node of the present invention;
Accompanying drawing 2 is that the message of a node of the present invention sends process chart.
Execution mode:
The invention will be further described below in conjunction with drawings and Examples.
What Fig. 1 represented is the queue scheduling block diagram of a node.Wherein, T
HHigh priority message, T are transmitted in expression
LLow priority message, L are transmitted in expression
HRepresent local high priority message, L
LRepresent local low priority message.
What Fig. 2 represented is the transmission message process chart of a node.
In Fig. 1, each station has four big Class Queue: transmit the high priority message queue, transmit low priority message queue, local high priority message queue and local low priority message queue.Every Class Queue segments (except the high priority message queue of forwarding, because it can be sent out very soon) by the user again, at first every Class Queue is weighted polling dispatching, then four Class Queue is carried out equity dispatching.
Fig. 2 is that the message of a node sends process chart.From initial condition, judge at first whether transmit high-priority queue has message, if having, just begin to transmit and transmit the high priority message, get back to initial state then.Otherwise, check local high priority message queue again, if there is message to be sent, and it is discontented to transmit Low Priority Queuing, just begins to send local high priority message, gets back to initial state then.If it is full to transmit Low Priority Queuing, then should transmits earlier and transmit the low priority message, and send station reduction network bandwidth utilization rate on the message notifying.If local high priority message queue does not have message, then check local low priority message queue again, if there is message to be sent, and the message queue of forwarding low priority does not reach a default waterline, then begin to send local low priority message, get back to initial state then.If transmit Low Priority Queuing the sign that surmounts the preset water level line is arranged, then should transmit earlier and transmit the low priority message, and send station reduction network bandwidth utilization rate on the message notifying.In processing procedure, must respond the bandwidth information that the next stop is sent here, to increase or to reduce local network bandwidth utilization rate.Here the full scale will of mentioning all is by each user's corresponding sign mutually or and get with surmounting the preset water level line index.
Claims (2)
1, a kind of bandwidth sharing system implementation method of Virtual User looped network is characterized in that:
A, the total bandwidth of establishing looped network are B, and looped network is made of several virtual subrings, distribute the bandwidth B r of a promise for each virtual subring, distribute the bandwidth B n of a promise again at each node of virtual subring inside, should guarantee when band width configuration:
B, when a certain node in the subring need use the bandwidth that surpasses the promise distribute to it, it will go to compete remaining bandwidth resource in the subring according to fair algorithm, and if still can not satisfy the time, then remove to compete remaining bandwidth between subring according to fair algorithm again;
Each node on c, the ring all need to monitor it converting flow, notify other node flow that it can receive and adjust the bandwidth that oneself takies according to the information of other node of receiving;
D, make each node can obtain the network bandwidth liberally by above-mentioned coordination system; The information that each node is sent here based on access flow and other node, oneself is how many network bandwidths of decision use.
2, the method of claim 1, it is characterized in that, the information that described each node is sent here based on access flow and other node, what oneself determine to use the step of the network bandwidth to be: in a two-way ring, but the utilized bandwidth information that other node is sent transmits by up direction, the down direction of walking with data is opposite, each node estimates the rest network bandwidth resources, and notify other node, estimate the own shared network bandwidth again, and notify its network bandwidth that can use to compare, oneself using the too much network bandwidth partially if find with other node, then reduce the own shared network bandwidth, until justice.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB031398413A CN1333561C (en) | 2003-07-11 | 2003-07-11 | A method for implementing bandwidth sharing architecture of virtual user ring network |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CNB031398413A CN1333561C (en) | 2003-07-11 | 2003-07-11 | A method for implementing bandwidth sharing architecture of virtual user ring network |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN1571391A CN1571391A (en) | 2005-01-26 |
| CN1333561C true CN1333561C (en) | 2007-08-22 |
Family
ID=34470742
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNB031398413A Expired - Fee Related CN1333561C (en) | 2003-07-11 | 2003-07-11 | A method for implementing bandwidth sharing architecture of virtual user ring network |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN1333561C (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101247327B (en) * | 2007-12-07 | 2010-12-08 | 中国人民解放军理工大学 | Method for implementing dynamic resource obligation of wireless self-organizing network by elephant flow detection |
| CN101499948B (en) * | 2008-02-01 | 2011-11-16 | 杭州华三通信技术有限公司 | Arbitrarily topological intersected ring network protecting method, node and intersected ring network |
| CN103023803B (en) * | 2012-12-12 | 2015-05-20 | 华中科技大学 | Method and system for optimizing virtual links of fiber channel over Ethernet |
Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1331531A (en) * | 2000-06-29 | 2002-01-16 | 杨震 | ATM token-ring network |
| WO2002017552A1 (en) * | 2000-08-24 | 2002-02-28 | Ocular Networks | Apparatus and method for facilitating data packet transportation |
| WO2002037758A2 (en) * | 2000-11-02 | 2002-05-10 | Coriolis Networks, Inc. | Dynamic traffic management on a shared medium |
-
2003
- 2003-07-11 CN CNB031398413A patent/CN1333561C/en not_active Expired - Fee Related
Patent Citations (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1331531A (en) * | 2000-06-29 | 2002-01-16 | 杨震 | ATM token-ring network |
| WO2002017552A1 (en) * | 2000-08-24 | 2002-02-28 | Ocular Networks | Apparatus and method for facilitating data packet transportation |
| WO2002037758A2 (en) * | 2000-11-02 | 2002-05-10 | Coriolis Networks, Inc. | Dynamic traffic management on a shared medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN1571391A (en) | 2005-01-26 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Mao et al. | A TDMA scheduling scheme for many-to-one communications in wireless sensor networks | |
| HK1041996A1 (en) | Resource scheduler and method for scheduling resource in communication system | |
| Cheng et al. | Cross-layer schemes for reducing delay in multihop wireless networks | |
| Kharb et al. | Fuzzy based priority aware scheduling technique for dense industrial IoT networks | |
| Pouzin | Methods, tools, and observations on flow control in packet-switched data networks | |
| Chen et al. | Distributed orchestration of service function chains for edge intelligence in the industrial internet of things | |
| CN103327542A (en) | QoS guarantee method and device applied to MSNET network | |
| Bonald et al. | On the stability of flow-aware CSMA | |
| Bonald et al. | Is the''Law of the Jungle''Sustainable for the Internet? | |
| Kathuria et al. | Reliable packet transmission in WBAN with dynamic and optimized QoS using multi-objective lion cooperative hunt optimizer | |
| CN1333561C (en) | A method for implementing bandwidth sharing architecture of virtual user ring network | |
| CN109729521B (en) | Trust-aware security opportunity data transmission method | |
| Li et al. | Efficient algorithm for maximum lifetime many-to-one data aggregation in wireless sensor networks | |
| Rahman et al. | Performance analysis of leader election algorithms in mobile ad hoc networks | |
| Roy et al. | Priority-aware scheduling method based on linguistic interval type 2 fuzzy logic systems for dense industrial IoT networks employing soft computing | |
| Huang et al. | A performance model for differentiated service over single-hop passive star coupled WDM optical networks | |
| Gong et al. | Maximizing rewards in wireless networks with energy and timing constraints for periodic data streams | |
| Hong et al. | Experimental evaluation of a bandwidth allocation scheme for foundation fieldbus | |
| Sevillano et al. | Analysis of channel utilization for controller area networks | |
| Yang et al. | New polling scheme based on busy/idle queues mechanism | |
| Niyato et al. | Exploiting mobility diversity in sharing wireless access: A game theoretic approach | |
| CN115099476A (en) | Asynchronous scheduling method for power internet of things based on cycle difference set theory | |
| Li et al. | Exploring the throughput boundaries of randomized schedulers in wireless networks | |
| Yi et al. | A truthful mechanism for prioritized medical packet transmissions in beyond-WBANs | |
| Hu et al. | Multi-source dnn task offloading strategy based on in-network computing |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| ASS | Succession or assignment of patent right |
Owner name: HUAWEI TECHNOLOGY CO., LTD. Free format text: FORMER OWNER: GANGWAN NETWORK CO., LTD. Effective date: 20060922 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20060922 Address after: 518129 Bantian HUAWEI headquarters office building, Longgang District, Guangdong, Shenzhen Applicant after: Huawei Technologies Co., Ltd. Address before: 100089, No. 21 West Third Ring Road, Beijing, Haidian District, Long Ling Building, 13 floor Applicant before: Harbour Networks Holdings Limited |
|
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| ASS | Succession or assignment of patent right |
Owner name: SHENZHEN HUAWEI TECHNOLOGIES SOFTWARE CO., LTD. Free format text: FORMER OWNER: HUAWEI TECHNOLOGY CO LTD Effective date: 20120214 |
|
| C41 | Transfer of patent application or patent right or utility model | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20120214 Address after: 518129 Longgang District, Guangdong, Bantian HUAWEI base B District, building 2, building No. Patentee after: Shenzhen Huawei Technologies Co., Ltd. Address before: 518129 Bantian HUAWEI headquarters office building, Longgang District, Guangdong, Shenzhen Patentee before: Huawei Technologies Co., Ltd. |
|
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20070822 Termination date: 20150711 |
|
| EXPY | Termination of patent right or utility model |