CN109873723B - On-demand bandwidth allocation method based on node service priority - Google Patents
On-demand bandwidth allocation method based on node service priority Download PDFInfo
- Publication number
- CN109873723B CN109873723B CN201910147957.1A CN201910147957A CN109873723B CN 109873723 B CN109873723 B CN 109873723B CN 201910147957 A CN201910147957 A CN 201910147957A CN 109873723 B CN109873723 B CN 109873723B
- Authority
- CN
- China
- Prior art keywords
- data
- node
- central controller
- nodes
- frame
- 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.)
- Active
Links
- 238000000034 method Methods 0.000 title claims abstract description 19
- 230000005540 biological transmission Effects 0.000 claims abstract description 34
- 238000012790 confirmation Methods 0.000 claims abstract description 14
- 230000006855 networking Effects 0.000 claims abstract description 6
- 230000008569 process Effects 0.000 claims description 2
- 230000004044 response Effects 0.000 description 4
- 238000010586 diagram Methods 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 239000002699 waste material Substances 0.000 description 2
- 235000008694 Humulus lupulus Nutrition 0.000 description 1
- 238000004891 communication Methods 0.000 description 1
- 230000002860 competitive effect Effects 0.000 description 1
- 238000011161 development Methods 0.000 description 1
- 230000004069 differentiation Effects 0.000 description 1
Images
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses an on-demand bandwidth allocation method based on node service priority, which comprises the following steps: in the networking stage, the central controller records the service priority of the nodes; in the data transmission stage, the central controller sends a data request frame to the nodes and polls the nodes in sequence; after receiving the data request frame, the node judges whether the current node has uplink data to be sent, if not, the node returns a confirmation frame, does not have a data mark, and continuously polls the next node; the steps are repeated until all the nodes finish polling, the requirements of high-bandwidth services are guaranteed to a certain extent by distinguishing different service priorities of the nodes, the relative fairness of bandwidth allocation among all the priorities is guaranteed, and the bandwidth utilization rate is improved.
Description
Technical Field
The invention relates to the technical field of network communication, in particular to a bandwidth-on-demand allocation method based on node service priority.
Background
The rapid development of the Internet increases the types of services transmitted in the network, and under the condition of limited network resources, when a large amount of service data are simultaneously transmitted, network congestion may be caused, the traditional network only provides best-effort services, and cannot effectively meet the requirements of services with high real-time requirements, and when different service priorities are distinguished, the probability of collision is increased in a competitive mode, so that the channel utilization rate is low, and the network performance requirements of real-time services cannot be met. In a centralized network environment, it is inefficient to poll nodes in the network once in a polling manner.
How to improve the utilization rate of bandwidth under the condition of limited bandwidth resources, perform priority differentiation on various services in a centralized network, allocate transmission opportunities according to service priorities so as to ensure the transmission quality of high-priority services, balance the bandwidth occupied by each priority service and ensure the relative fairness of bandwidth allocation among the priorities.
However, according to the bandwidth allocation method with a fixed priority, bandwidth waste is easily caused, i.e., bandwidth resources are not fully utilized. For example, the high priority service allocates too much bandwidth, and there may be no data transmission in the data transmission process, which may cause waste of resources.
Disclosure of Invention
In order to solve the technical problems, the invention provides a method for allocating bandwidth on demand based on node service priority, so as to meet the requirements of guaranteeing high-bandwidth services, ensure the relative fairness of bandwidth allocation among all priorities and improve the bandwidth utilization rate.
In order to achieve the purpose, the technical scheme of the invention is as follows: a method for on-demand bandwidth allocation based on node traffic priority, the method comprising:
and 4, repeating the steps 1-3 until all the nodes finish polling.
Further, the recording of the service priority of the node by the central controller specifically includes: the node packages the service priority information of the node into an access request frame, the node sends the access request frame to a central controller, and the central controller records the service priority of the node.
Further, the data marking field in the acknowledgement frame is marked with 0 without data marking, and the data marking field in the acknowledgement frame is marked with 1 with data marking.
The invention has the following advantages:
(1) the invention ensures the requirement of high bandwidth service to a certain extent by differentiating different service priorities of the nodes, ensures the relative fairness of bandwidth allocation among the priorities and improves the throughput of network data transmission.
(2) The invention improves the bandwidth utilization rate by judging whether the nodes have more data transmission.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly described below.
Fig. 1 is a flowchart of a method for allocating bandwidth on demand based on node service priority according to an embodiment of the present invention;
FIG. 2 is a diagram of an ACK frame format according to an embodiment of the present invention;
fig. 3 is a schematic diagram of a tree network topology disclosed in the embodiment of the present invention.
Detailed Description
The technical solution in the embodiments of the present invention will be clearly and completely described below with reference to the accompanying drawings in the embodiments of the present invention.
The invention provides a demand bandwidth allocation method based on node service priority, which is based on the principle that the requirements of high bandwidth service are ensured to a certain extent by distinguishing different service priorities of nodes, the relative fairness of bandwidth allocation among the priorities is ensured, and the throughput of network data transmission is improved, so that the purposes of ensuring the requirements of the high bandwidth service, ensuring the relative fairness of the bandwidth allocation among the priorities and improving the bandwidth utilization rate are achieved.
The present invention will be described in further detail with reference to examples and specific embodiments.
As shown in fig. 1, a method for allocating bandwidth on demand based on node service priority includes:
and 4, repeating the steps 1-3 until all the nodes finish polling.
Wherein, the data mark field is more-data field, and occupies 1 bit in the confirmation frame.
The central controller records the service priority of the node, and specifically includes: the node packages the service priority information of the node into an access request frame, the node sends the access request frame to a central controller, and the central controller records the service priority of the node.
The data marking field in the acknowledgement frame is marked with a data marking field as 0 in the absence of data marking, and the data marking field in the acknowledgement frame is marked with a data marking field as 1 in the presence of data marking.
The frame format is shown in fig. 2, and the frame control field is described as follows: type (2): occupies 2 bits, can divide the frame into 4 types in total, and currently uses a control frame, a management frame and a data frame.
Subtype: takes 4 bits to distinguish frames of the same type but different subtypes.
And (4) service type: occupies 2 bits and is distinguished according to different service types of the nodes, and 4 service types are provided.
JS: takes 4 bits to mark the number of hops still needed from the current node to the destination node.
SA, DA1-DA 3: each of which takes 12 bits to mark a source address and a destination address, and DA1-DA3 indicates the address of the relay node.
Length: takes 10 bits, and can be represented in the range of 0 to 1023, and is used for marking the length of the data portion.
DATA: the DATA part is used to store DATA part information for various different types of frames.
More-data: it takes 1 bit to mark whether the node has more data to transmit, 0 indicates no data, and 1 indicates data.
The length of each field in the frame format is parameterized and can be adjusted according to specific scenes and applications.
Wherein the frame types are specified as follows: as shown in the first table,
watch 1
Three types of frames are mainly defined for the current algorithm: data frames, control frames, and management frames.
The type value of the data frame is 00, the subtype value of the data request frame is defined as 0000, and the subtype value of the data response frame is defined as 0001. The type value of the control frame is 01 and the subtype value of ACK is defined as 0000. The type value of the management frame is 10, and the subtype value of the access request frame is 0000.
Data Request (Data Request) — in the Data transmission phase, the CCO sends a Data Request frame by polling each node, and encapsulates the information that the CCO needs to issue to the node in its payload section.
Data Response (Data Response) -when a node receives a Data request frame sent by the CCO and the node has Data to send to the CCO, it will send this frame, encapsulating the Data that the node sent to the CCO in its payload section.
Acknowledgement frame (ACK) -ACK is used to respond to data request frames sent by the CCO, unlike data response frames, which are returned when a node has no data to send to the CCO.
Access Request (Access Request) -when a node starts to back off after receiving a beacon frame broadcasted by COO, when the back off value is 0, the node sends the frame to CCO, and the frame marks different service types of the node.
As shown in fig. 3, in the multi-hop network, it is assumed that the CCO polls the nodes in sequence according to the sequence stored by the nodes in the networking stage, and according to the difference of the real-time requirements of the services, the CCO records the priorities of the nodes, and for the nodes with different service priorities, the CCO allocates different maximum transmission opportunities to the nodes in the polling process. The higher the priority, the more maximum transmission opportunities are obtained; the lower the priority, the less maximum transmission opportunities are obtained.
Referring to IEEE 802.11e, the traffic flow is divided into 4 different priorities, as shown in table two,
watch two
The CCO allocates the maximum transmission opportunity according to the priority of the node service, and it is assumed that the allocation ratio of the maximum transmission opportunity from high to low according to the priority is 4: 3: 2: transmission opportunities correspond to the number of times the node is polled during data transmission. If the node service type is Voice, namely the priority is 0, allocating 4 transmission opportunities to the node service type at most; if the node service type is Video, namely the priority is 1, allocating 3 transmission opportunities to the node service type at most; if the node service type is Best-effort, namely the priority is 2, allocating 3 transmission opportunities to the node service type at most; if the node service type is Background, that is, the priority is 3, the node service type is allocated with 1 transmission opportunity at most. According to the distribution principle, each node is guaranteed to transmit fairly and the utilization rate of the bandwidth is improved as far as possible.
The detailed procedure of data transmission is as follows:
And 7, finishing polling all the nodes according to the steps 2-6, and ending a polling period.
The above description is only a preferred embodiment of the method for allocating bandwidth on demand based on node traffic priority disclosed in the present invention, and it should be noted that, for those skilled in the art, many variations and modifications can be made without departing from the inventive concept, and these modifications and improvements are within the scope of the present invention.
Claims (3)
1. An on-demand bandwidth allocation method based on node service priority, the method comprising:
step 1, networking stage: the central controller records the service priority of the nodes;
step 2, data transmission stage: the central controller sends a data request frame to the nodes and polls the nodes in sequence;
step 3, after receiving the data request frame, the node judges whether the current node has uplink data to send, if the current node has no uplink data to send, the current node only returns a confirmation frame to the central controller, and carries out no data marking on a data marking field in the confirmation frame, the central controller continuously polls the next node, if the current node has uplink data to send, the data is sent to the central controller, if the node still has uplink data to send, the data marking field in the confirmation frame has data marking, and sends the marked confirmation frame and the data to the central controller together, and the central controller continuously polls the node until the node has no data to send or reaches the maximum transmission opportunity limit; for nodes with different service priorities, CCO allocates different maximum transmission opportunities to the nodes in the polling process; the higher the priority, the more maximum transmission opportunities are obtained; the lower the priority, the less maximum transmission opportunities are obtained;
and 4, repeating the steps 1-3 until all the nodes finish polling.
2. The method for allocating bandwidth on demand according to claim 1, wherein the central controller records the service priority of the node as: the node packages the service priority information of the node into an access request frame, the node sends the access request frame to a central controller, and the central controller records the service priority of the node.
3. The method of claim 1, wherein the data-free marking of the data flag field in the acknowledgement frame is to mark the data flag field as 0, and the data marking of the data flag field in the acknowledgement frame is to mark the data flag field as 1.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910147957.1A CN109873723B (en) | 2019-02-28 | 2019-02-28 | On-demand bandwidth allocation method based on node service priority |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201910147957.1A CN109873723B (en) | 2019-02-28 | 2019-02-28 | On-demand bandwidth allocation method based on node service priority |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109873723A CN109873723A (en) | 2019-06-11 |
| CN109873723B true CN109873723B (en) | 2022-02-18 |
Family
ID=66919436
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201910147957.1A Active CN109873723B (en) | 2019-02-28 | 2019-02-28 | On-demand bandwidth allocation method based on node service priority |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109873723B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112188639B (en) * | 2020-09-07 | 2022-08-19 | 珠海格力电器股份有限公司 | Communication method based on WiFi Mesh network and related equipment |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4829297A (en) * | 1987-05-08 | 1989-05-09 | Allen-Bradley Company, Inc. | Communication network polling technique |
| CN1859184A (en) * | 2005-12-30 | 2006-11-08 | 华为技术有限公司 | Method for increasing communication link layer protocol efficiency |
| CN101631065A (en) * | 2008-07-16 | 2010-01-20 | 华为技术有限公司 | Method and device for controlling congestion of wireless multi-hop network |
| CN103795597A (en) * | 2014-03-03 | 2014-05-14 | 西南大学 | ZigBee network control system and network-induced delay computing method thereof |
| CN104066094A (en) * | 2014-06-19 | 2014-09-24 | 云南大学 | Wireless cognitive network spectrum access method based on two-level roll polling |
| CN106130824A (en) * | 2016-07-22 | 2016-11-16 | 杨志军 | Integration of three networks broadband access priority polling control method and system |
| CN107733689A (en) * | 2017-09-15 | 2018-02-23 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | Dynamic weighting polling dispatching strategy process based on priority |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US10333816B2 (en) * | 2015-09-22 | 2019-06-25 | Ca, Inc. | Key network entity detection |
-
2019
- 2019-02-28 CN CN201910147957.1A patent/CN109873723B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US4829297A (en) * | 1987-05-08 | 1989-05-09 | Allen-Bradley Company, Inc. | Communication network polling technique |
| CN1859184A (en) * | 2005-12-30 | 2006-11-08 | 华为技术有限公司 | Method for increasing communication link layer protocol efficiency |
| CN101631065A (en) * | 2008-07-16 | 2010-01-20 | 华为技术有限公司 | Method and device for controlling congestion of wireless multi-hop network |
| CN103795597A (en) * | 2014-03-03 | 2014-05-14 | 西南大学 | ZigBee network control system and network-induced delay computing method thereof |
| CN104066094A (en) * | 2014-06-19 | 2014-09-24 | 云南大学 | Wireless cognitive network spectrum access method based on two-level roll polling |
| CN106130824A (en) * | 2016-07-22 | 2016-11-16 | 杨志军 | Integration of three networks broadband access priority polling control method and system |
| CN107733689A (en) * | 2017-09-15 | 2018-02-23 | 西南电子技术研究所（中国电子科技集团公司第十研究所） | Dynamic weighting polling dispatching strategy process based on priority |
Non-Patent Citations (1)
| Title |
|---|
| 一种基于优先级的综合接入系统自适应I/O调度方案;韩国栋等;《电子与信息学报》;20040120(第01期);131-136页 * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109873723A (en) | 2019-06-11 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP4025777B2 (en) | Channel time allocation method in wireless personal area network | |
| JP3737353B2 (en) | COMMUNICATION DEVICE AND COMMUNICATION LINE ALLOCATION METHOD | |
| CN108430111B (en) | Mixed type time slot reservation method in distributed TDMA protocol | |
| US6879579B1 (en) | Medium access control protocol for data communications | |
| US8526386B2 (en) | System for uplink scheduling packet based data traffic in wireless system | |
| JP5351368B2 (en) | Apparatus and method for acquiring an uplink traffic channel in a wireless communication system | |
| CN107949062B (en) | Dynamic allocation method for time slot resources of broadband ad hoc network based on multi-level frame structure | |
| WO2019141082A1 (en) | Wireless communication method and wireless access device, network planning device, and terminal device | |
| KR100678223B1 (en) | Method and apparatus for packet transmitting in a communication system | |
| US7512089B2 (en) | MAC layer protocol for a wireless DSL network | |
| US7920586B2 (en) | System and method for selecting a medium access technique for transmitting packets over a network | |
| EP1956742A2 (en) | Wireless LAN system and transmission method of data thereof | |
| CN109962760B (en) | Service scheduling method suitable for wireless TDMA ad hoc network | |
| US7570634B2 (en) | Priority queuing of frames in a TDMA network | |
| US7349378B2 (en) | Local area network resource manager | |
| JP2007159105A (en) | Method for dynamically managing bandwidth for transport streams in wireless network | |
| JP4163698B2 (en) | Wireless communication apparatus, bandwidth allocation method, and program | |
| CN112217728A (en) | Satellite channel hybrid access method based on pre-allocation and on-demand reservation | |
| JP4335219B2 (en) | Wireless LAN traffic priority control method and apparatus | |
| CN109873723B (en) | On-demand bandwidth allocation method based on node service priority | |
| CN114449589A (en) | Time slot resource reservation system and method | |
| US7139251B1 (en) | Scheduling for links having changing parameters | |
| CN113939030A (en) | Dynamic TDMA time slot allocation method based on node priority | |
| CN105491677A (en) | Carrier sense multiple access with collision avoidance (CSMA-CA) method based on network coding | |
| CN112261693A (en) | Resource allocation method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| TR01 | Transfer of patent right |
Effective date of registration: 20231116 Address after: 903-261, 9th Floor, Building 17, No. 30 Shixing Street, Shijingshan District, Beijing, 100043 Patentee after: Beijing Xunlian Intelligent Technology Co.,Ltd. Address before: Room 119, Zhongchuang building, No.2 DARUI Road, Guandong Industrial Park, Donghu New Technology Development Zone, Wuhan, Hubei 430000 Patentee before: WUHAN SHENGLIAN ZHIRONG MICROELECTRONICS TECHNOLOGY CO.,LTD. |
|
| TR01 | Transfer of patent right |