CN102769914A - Fair scheduling method based on mixed businesses in wireless network - Google Patents

Fair scheduling method based on mixed businesses in wireless network Download PDF

Info

Publication number
CN102769914A
CN102769914A CN2012101307465A CN201210130746A CN102769914A CN 102769914 A CN102769914 A CN 102769914A CN 2012101307465 A CN2012101307465 A CN 2012101307465A CN 201210130746 A CN201210130746 A CN 201210130746A CN 102769914 A CN102769914 A CN 102769914A
Authority
CN
China
Prior art keywords
link
bandwidth
service
wireless network
business
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.)
Granted
Application number
CN2012101307465A
Other languages
Chinese (zh)
Other versions
CN102769914B (en
Inventor
黄东
黄林果
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Individual
Original Assignee
Individual
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Individual filed Critical Individual
Priority to CN201210130746.5A priority Critical patent/CN102769914B/en
Publication of CN102769914A publication Critical patent/CN102769914A/en
Application granted granted Critical
Publication of CN102769914B publication Critical patent/CN102769914B/en
Expired - Fee Related legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Abstract

The invention provides a fair scheduling method based on mixed businesses in a wireless network. Efficient transmission of the mixed businesses in the wireless network is realized by steps of unified scheduling of an uplink and a downlink in a wireless network system, establishment of a resource management mechanism and a business bandwidth request mechanism of the wireless network system, calculation of effective bandwidth of the wireless network system and the like.

Description

A kind of equity dispatching method based on mixed service in the wireless network
Technical field
The present invention relates to wireless communication technology field, particularly relate to mobile communication and Optimum Theory.
Background technology
Along with the develop rapidly of wireless communication technology, current wireless communication system be faced with simultaneously number of users increase sharply with the user various multimedia services are required to improve constantly this two significant challenge.In order to tackle these challenges, Radio Network System must improve constantly on the basis of power system capacity, and the service quality of assurance different user acquisition satisfaction (Quality of Service, QoS).
In the wireless network type of mixed service comprise hard QoS service (Hard Quality of Serivce), do one's best (Best Effort) professional and soft service quality (Soft Quality of Serivce) business.Value of utility is the quantized values of a kind of user of sign to the satisfaction of its requested service.Value of utility and receiving terminal user's transmission rate, or distribute the bandwidth that obtains relevant, the scheduling reference model of existing mixed service is as shown in Figure 1.The value of utility of dissimilar business has different correlation forms with transmission rate or bandwidth, and the business of identical type also possibly have different effectiveness parameters.Than transmission rate and throughput of system, value of utility more can reflect professional characteristic and receiving terminal to this professional satisfaction.In addition; Some real time business or semireal time are professional; Higher like voice (VOP) business, video stream traffic and IPTV (IPTV) business etc. to QoS index requests such as time delay and transmission rates; Therefore when channel condition was relatively poor, the resource that possibly be assigned to can't satisfy its qos requirement and produce assigned interrupt.
Up to the present, people are to the progressive maturation of the research of the packet scheduling problem of cable network.Because wire link has the constant characteristic of transmission bandwidth, can be based on the packet scheduling algorithm of cable network for all Business Streams provide clear and definite throughput and time delay assurance in the short arbitrarily time, thus make the cable network user can obtain good QoS.Yet; We are difficult to and will be grafted directly to the service dispatching mechanism of cable network design in the middle of the wireless network environment; This is because wireless network itself has a lot of particularity than cable network; Therefore; For improving the resource utilization of wireless network; Need the mixed service dispatching method of design of High Efficiency, typical service dispatching model as shown in Figure 1.
Summary of the invention
Technical problem to be solved by this invention is: the mixed service that solves in the wireless network can't realize fair transmission problem.
The present invention solves the problems of the technologies described above a kind of equity dispatching method based on mixed service in the wireless network is provided, and it is characterized in that:
A, the up link and the down link of Radio Network System carried out uniform dispatching;
B, set up the resource management mechanism of Radio Network System;
C, set up the service bandwidth request mechanism of Radio Network System;
The effective bandwidth of D, calculating Radio Network System.
In the said steps A; Through the access point in wireless network the virtual data bag is set; Use single unified scheduler that the virtual data bag is dispatched; When the virtual data bag is dispatched; The AP point sends the poll instruction through producing corresponding sequence; Strive for transmission opportunity for the packet of up link, total flow process as shown in Figure 2.The virtual data bag that wherein produces in the up link obtains through specific uplink service stream mode; The virtual data bag that produces in the down link is classified to the actual data packet in the down link through the internal schedule device among use Fig. 3 and is arranged acquisition, and actual data packet and virtual data bag are distinguished through the internal schedule device and obtained.Actual packet is directly sent in down link, and the virtual data bag in up link is sent out through polling message and the corresponding TXOP information of distribution.
Among the said step B, the substep of the resource management mechanism of Radio Network System is: a. selects the queued packets of high-priority users to get into scheduler buffer, participates in the channel allocation in the current resource allocation cycle; B. carrying out traffic measurement information obtains and is used for the estimated bandwidth demand; Be used to reshuffle Internet resources and the routing mechanism that satisfies business need is set; And for guaranteeing professional QoS; Need each professional QOS in the mixed service is monitored; And the corresponding bandwidth demand distributed, the corresponding business scheduling model is as shown in Figure 4.
Said step (C), so that the ON-OFF traffic model, the corresponding sub-steps of: a. Calculating queue length, in the presence of the arrival of the service queue length to
Figure 982998DEST_PATH_IMAGE001
, in case there is no business to reach the queue length is
Figure 336357DEST_PATH_IMAGE002
; b . using
Figure 53777DEST_PATH_IMAGE003
Get a traffic reaches the estimated time interval between which
Figure 448986DEST_PATH_IMAGE004
is the weight coefficient,
Figure 263359DEST_PATH_IMAGE005
for the first
Figure 961187DEST_PATH_IMAGE006
an estimated time of arrival traffic, the average cumulative error,
Figure 228221DEST_PATH_IMAGE007
is
Figure 427121DEST_PATH_IMAGE008
before the estimated time of history can ask every,
Figure 532218DEST_PATH_IMAGE008
for the first
Figure 525581DEST_PATH_IMAGE006
a service transmitting bandwidth request desired time interval,
Figure 217594DEST_PATH_IMAGE009
is the total time t to reach the amount of data service queues,: for the moment
Figure 477991DEST_PATH_IMAGE011
total amount of data leaving service queues,
Figure 845518DEST_PATH_IMAGE012
output queue for the business link maximum transmission rate; c.? using
Figure 87144DEST_PATH_IMAGE013
estimates the average arrival rate, which
Figure 362267DEST_PATH_IMAGE014
is the weight coefficient, for the first
Figure 714806DEST_PATH_IMAGE006
a business to reach the actual average rate,
Figure 443728DEST_PATH_IMAGE016
is
Figure 460225DEST_PATH_IMAGE017
estimation error, for the first times the accumulated error,
Figure 555854DEST_PATH_IMAGE019
for the first
Figure 874578DEST_PATH_IMAGE006
a service transmitting bandwidth request at the moment.
Wherein step D, using rules
Figure 663280DEST_PATH_IMAGE020
for equivalent bandwidth calculation, where
Figure 543512DEST_PATH_IMAGE021
cache size associated with spatial parameters,
Figure 981446DEST_PATH_IMAGE022
is the time,
Figure 339746DEST_PATH_IMAGE023
is the weight coefficient,
Figure 248534DEST_PATH_IMAGE024
, where
Figure 361984DEST_PATH_IMAGE025
is sent to destination collection,
Figure 224897DEST_PATH_IMAGE026
for the virtual bandwidth aggregation,
Figure 449205DEST_PATH_IMAGE027
for the network chain Road collection,
Figure 448385DEST_PATH_IMAGE028
is a link
Figure 732736DEST_PATH_IMAGE029
Using sub-link
Figure 82946DEST_PATH_IMAGE030
collection, is a link
Figure 292528DEST_PATH_IMAGE029
capacity,
Figure 918419DEST_PATH_IMAGE032
with the sender to the destination terminal is connected to the sub-link connection p
Figure 818242DEST_PATH_IMAGE030
valid estimate the bandwidth, if p contains Routing
Figure 623704DEST_PATH_IMAGE033
, then
Figure 921961DEST_PATH_IMAGE034
, otherwise it is zero, the link
Figure 309080DEST_PATH_IMAGE029
for the sub-link
Figure 616565DEST_PATH_IMAGE030
allocated link capacity, if the child link on the traffic is sent to destination set, then
Figure 740433DEST_PATH_IMAGE035
, otherwise zero,
Figure 349269DEST_PATH_IMAGE036
as a valid estimate the bandwidth,
Figure 398128DEST_PATH_IMAGE037
, the average arrival rate for the business,
Figure 346492DEST_PATH_IMAGE038
as cache size,
Figure 314448DEST_PATH_IMAGE039
is the Hurst parameter,
Figure 410580DEST_PATH_IMAGE040
as the packet loss rate, is the standard deviation.
Beneficial effect of the present invention is: a kind of equity dispatching method based on mixed service in the wireless network is provided; Up link and down link through to Radio Network System carry out uniform dispatching, set up the resource management mechanism of Radio Network System, set up Radio Network System the service bandwidth request mechanism, calculate the steps such as effective bandwidth of Radio Network System, realized the high efficiency of transmission of mixed service in the wireless network.
Description of drawings
Fig. 1 is the scheduling reference model of existing mixed service;
Fig. 2 is total schematic flow sheet;
Fig. 3 is an internal schedule device model sketch map;
Fig. 4 is the service dispatching model.

Claims (5)

1. equity dispatching method based on mixed service in the wireless network, the mixed service that solves in the wireless network can't realize fair transmission problem, comprises the steps:
A, the up link and the down link of Radio Network System carried out uniform dispatching;
B, set up the resource management mechanism of Radio Network System;
C, set up the service bandwidth request mechanism of Radio Network System;
The effective bandwidth of D, calculating Radio Network System.
2. according to the method for claim 1; It is characterized in that for said steps A: the virtual data bag is set by the access point in wireless network; Use single unified scheduler that the virtual data bag is dispatched; When the virtual data bag is dispatched; Access point (AP) sends the poll instruction by producing corresponding sequence; For the packet of up-link is striven for transmission opportunity; The virtual data bag that wherein produces in the up-link obtains by specific uplink service stream mode; The virtual data bag that produces in the downlink is classified to the actual data packet in the downlink by use internal schedule device and is arranged acquisition; Actual data packet and virtual data bag are distinguished by the internal schedule device and are obtained; Actual packet is directly sent in downlink, and the virtual data bag in up-link is sent out by polling message and the corresponding TXOP information of distribution.
3. according to the method for claim 1; It is characterized in that for said step B: the substep of the resource management mechanism of Radio Network System is: a. selects the queued packets of high-priority users to get into scheduler buffer, participates in the channel allocation in the current resource allocation cycle; B. carrying out traffic measurement information obtains and is used for the estimated bandwidth demand; Be used to reshuffle Internet resources and the routing mechanism that satisfies business need is set; And, need each professional QOS in the mixed service is monitored, and the corresponding bandwidth demand is distributed for guaranteeing professional QoS.
4 The method according to claim 1, for the step C, wherein: Let the ON-OFF traffic model, the sub-steps of: a. Calculating queue length, in the presence of the arrival of the service queue length is
Figure 149258DEST_PATH_IMAGE001
In case there is no business to reach the queue length is
Figure 66398DEST_PATH_IMAGE002
; b. using
Figure 846135DEST_PATH_IMAGE003
get a traffic flow between the estimated arrival time interval, where is the weight coefficient
Figure 242668DEST_PATH_IMAGE005
is the first
Figure 65130DEST_PATH_IMAGE006
an estimated time of arrival of traffic, the average cumulative error,
Figure 332163DEST_PATH_IMAGE007
is before the estimated time of history can ask every, for the first
Figure 599831DEST_PATH_IMAGE006
a service transmitting bandwidth request the desired time interval,
Figure 354160DEST_PATH_IMAGE009
to the time t of the total amount of data reaches service queues,: for the moment
Figure 145716DEST_PATH_IMAGE011
Business queue accumulated leave the amount of data,
Figure 575560DEST_PATH_IMAGE012
for the service queues maximum transfer rate of the output link; c.? using
Figure 817185DEST_PATH_IMAGE013
estimates the average arrival rate, where
Figure 92309DEST_PATH_IMAGE014
is the weight coefficient,
Figure 735780DEST_PATH_IMAGE015
is first
Figure 726739DEST_PATH_IMAGE006
a business to reach the actual average rate,
Figure 455660DEST_PATH_IMAGE016
is
Figure 65633DEST_PATH_IMAGE017
estimation error,
Figure 563610DEST_PATH_IMAGE018
for the first
Figure 335257DEST_PATH_IMAGE006
times the accumulated error,
Figure 285896DEST_PATH_IMAGE019
the first
Figure 168401DEST_PATH_IMAGE006
transmission bandwidth of operation and time of the request.
5 The method according to claim 1, wherein for the step D in that: using rules
Figure 927410DEST_PATH_IMAGE020
for equivalent bandwidth calculation, where
Figure 869958DEST_PATH_IMAGE021
cache size associated with spatial parameters,
Figure 307893DEST_PATH_IMAGE022
is the time,
Figure 728510DEST_PATH_IMAGE023
is the weight coefficient,
Figure 201079DEST_PATH_IMAGE024
, where
Figure 845687DEST_PATH_IMAGE025
is sent to destination collection, for the virtual bandwidth aggregation,
Figure 182177DEST_PATH_IMAGE027
is network link collection, is a link
Figure 465707DEST_PATH_IMAGE029
Using sub-link collection,
Figure 562025DEST_PATH_IMAGE031
is a link
Figure 212449DEST_PATH_IMAGE029
capacity,
Figure 57915DEST_PATH_IMAGE032
with the sender to the destination terminal is connected to the sub-link connection p valid estimate the bandwidth, if p contains
Figure 523848DEST_PATH_IMAGE030
Routing
Figure 356675DEST_PATH_IMAGE033
, then
Figure 717249DEST_PATH_IMAGE034
, contrary is zero, the link
Figure 104368DEST_PATH_IMAGE029
for the sub-link
Figure 474169DEST_PATH_IMAGE030
allocated link capacity, if the child link
Figure 364765DEST_PATH_IMAGE030
on the traffic flow is sent to destination set, then
Figure 568344DEST_PATH_IMAGE035
, otherwise zero,
Figure 364131DEST_PATH_IMAGE036
as a valid estimate the bandwidth,
Figure 537623DEST_PATH_IMAGE037
for the business, the average arrival rate, as the cache size, as the Hurst parameter,
Figure 143551DEST_PATH_IMAGE040
is the packet loss rate,
Figure 855155DEST_PATH_IMAGE041
is the standard deviation.
CN201210130746.5A 2012-04-29 2012-04-29 Fair scheduling method based on mixed businesses in wireless network Expired - Fee Related CN102769914B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201210130746.5A CN102769914B (en) 2012-04-29 2012-04-29 Fair scheduling method based on mixed businesses in wireless network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201210130746.5A CN102769914B (en) 2012-04-29 2012-04-29 Fair scheduling method based on mixed businesses in wireless network

Publications (2)

Publication Number Publication Date
CN102769914A true CN102769914A (en) 2012-11-07
CN102769914B CN102769914B (en) 2014-11-26

Family

ID=47097132

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201210130746.5A Expired - Fee Related CN102769914B (en) 2012-04-29 2012-04-29 Fair scheduling method based on mixed businesses in wireless network

Country Status (1)

Country Link
CN (1) CN102769914B (en)

Cited By (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106507389A (en) * 2016-10-21 2017-03-15 黄东 A kind of Optimization Design of wireless network
CN106658557A (en) * 2016-10-21 2017-05-10 黄东 Hybrid network resource optimization method based on heterogeneous service
CN111711688A (en) * 2020-06-16 2020-09-25 北京百度网讯科技有限公司 Data transmission method, device and equipment based on transmitter and storage medium
CN115866772A (en) * 2023-02-16 2023-03-28 江西惜能照明有限公司 Network bandwidth allocation method, device, medium and equipment based on intelligent lamp pole

Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2003024034A1 (en) * 2001-09-07 2003-03-20 Telefonaktiebolaget Lm Ericsson (Publ) Method and arrangements to achieve a dynamic resource distribution policy in packet based communication networks
CN1964320A (en) * 2006-09-21 2007-05-16 电子科技大学 A method for packet dispatching of variable parameter for real-time mixed service environment
CN101111070A (en) * 2006-08-18 2008-01-23 清华大学 Fairness resource scheduling method based on resource scheduling in broadband wireless access system
CN102014500A (en) * 2010-12-23 2011-04-13 柳州职业技术学院 Method for efficiently allocating bandwidths in wireless access network

Patent Citations (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2003024034A1 (en) * 2001-09-07 2003-03-20 Telefonaktiebolaget Lm Ericsson (Publ) Method and arrangements to achieve a dynamic resource distribution policy in packet based communication networks
CN101111070A (en) * 2006-08-18 2008-01-23 清华大学 Fairness resource scheduling method based on resource scheduling in broadband wireless access system
CN1964320A (en) * 2006-09-21 2007-05-16 电子科技大学 A method for packet dispatching of variable parameter for real-time mixed service environment
CN102014500A (en) * 2010-12-23 2011-04-13 柳州职业技术学院 Method for efficiently allocating bandwidths in wireless access network

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106507389A (en) * 2016-10-21 2017-03-15 黄东 A kind of Optimization Design of wireless network
CN106658557A (en) * 2016-10-21 2017-05-10 黄东 Hybrid network resource optimization method based on heterogeneous service
CN111711688A (en) * 2020-06-16 2020-09-25 北京百度网讯科技有限公司 Data transmission method, device and equipment based on transmitter and storage medium
CN111711688B (en) * 2020-06-16 2023-02-28 阿波罗智能技术(北京)有限公司 Data transmission method, device and equipment based on transmitter and storage medium
CN115866772A (en) * 2023-02-16 2023-03-28 江西惜能照明有限公司 Network bandwidth allocation method, device, medium and equipment based on intelligent lamp pole

Also Published As

Publication number Publication date
CN102769914B (en) 2014-11-26

Similar Documents

Publication Publication Date Title
Asadi et al. Network-assisted outband D2D-clustering in 5G cellular networks: Theory and practice
CN1706158B (en) A scheduler system and method thereof
CN102378386B (en) Wireless resource scheduling method of LTE (Long Term Evolution) uplink
CN103248884B (en) A kind of control the system of video rate, base station and method
CN103596224B (en) Resource regulating method based on multistage-mapping under a kind of high-speed mobile environment
US20130286842A1 (en) Transmitting apparatus, transmission method, and transmission system
CN102111819A (en) Delay-tolerant network
CN102769914B (en) Fair scheduling method based on mixed businesses in wireless network
CN101562841A (en) Service scheduling method, device and system thereof
Lee Throughput analysis model for IEEE 802.11 e EDCA with multiple access categories
Gao et al. Admission control based on rate-variance envelop for VBR traffic over IEEE 802.11 e HCCA WLANs
CN101951683A (en) Resource distribution method in WiMax system
Du et al. Downlink scheduling for multimedia multicast/broadcast over mobile WiMAX: Connection-oriented multistate adaptation
Nie et al. Adaptive polling service for next-generation IEEE 802.16 wimax networks
CN113328879B (en) Cloud data center network QoS (quality of service) guaranteeing method based on network calculus
Korakis et al. Providing quality of service guarantees in wireless LANs compliant with 802.11 e
Huang et al. A four-way-polling QoS scheduler for IEEE 802.11 e HCCA
CN1728597A (en) Method and device for controlling flow rate in media access control layer of broadband CDMA system
Dalvi et al. DCF Improvement for Satisfactory Throughput of 802. 11 WLAN
Wang et al. A priority-based EDF scheduling algorithm for H. 264 video transmission over WiMAX network
Huang et al. Gaussian approximation based admission control for variable bit rate traffic in IEEE 802.11 e WLANs
Ciftcioglu et al. Opportunistic scheduling with frame aggregation for next generation wireless LANs
Huang et al. Capacity enhancement for a rate-variance-envelop-based admission control in IEEE 802.11 e HCCA WLANs
Seyedzadegan et al. Weighted window and class-based weighted window methods for per-station TCP fairness in IEEE 802.11 WLANs
Riza et al. Improving QoS in WLAN using dynamic weighted fair scheduling

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
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20141126

Termination date: 20200429