CN103368871B - A kind of bandwidth allocation methods and device - Google Patents
A kind of bandwidth allocation methods and device Download PDFInfo
- Publication number
- CN103368871B CN103368871B CN201310316411.7A CN201310316411A CN103368871B CN 103368871 B CN103368871 B CN 103368871B CN 201310316411 A CN201310316411 A CN 201310316411A CN 103368871 B CN103368871 B CN 103368871B
- Authority
- CN
- China
- Prior art keywords
- node
- duration
- allocation
- downlink
- dispatch
- 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
Abstract
The invention discloses a kind of bandwidth allocation methods and device, belong to the communications field.Method includes: Centroid determines each total descending duration can being assigned within a PD cycle from node；Being respectively each and arrange, from node, the allocation of downlink duration that just begins, each is less than each total descending duration from node from the first allocation of downlink duration that begins of node；In units of MAP cycle, for each from node allocation of downlink duration；According to distributing to each descending duration from node, update each first allocation of downlink duration that begins from node, obtain each from node currently can allocation of downlink duration, when each from node currently can allocation of downlink duration be respectively less than each dispatch required distribution duration from the single of node time, update each from node currently can allocation of downlink duration, after renewal each from node currently can before allocation of downlink duration=renewal currently can the allocation of downlink duration+allocation of downlink that just begins duration.The present invention can reduce time delay.
Description
Technical field
The present invention relates to the communications field, particularly to a kind of bandwidth allocation methods and device.
Background technology
(High Performance Network Over Coax, high-performance coaxial cable broadband accesses HINOC
Network) refer to, on the basis of the network structure of FTTB (Fiber To The Building, FTTB), profit
With community corridor and the most arranged indoor cable tv coax, the fiber optic network of structure is to subscriber household
Access network between network.Entity device in HINOC includes HB (HINOC Bridge, high-performance coaxial electrical
Cable broadband access network bridge) and HM (HINOC Modem, high-performance coaxial cable broadband access network modulatedemodulate
Adjust device).Wherein, HB is between fiber optic network and HM, and HM is between HB and user terminal.One
HB controls some HM.
HINOC uses time division multiplexing mode to carry out data transmission, and its time shaft cuts off with 64 milliseconds for the cycle,
Each such cycle is called PD (Probe Down, the descending detection) cycle.If a PD cycle includes
Dry continuous print MAP (Media Access Plan, media the access planning) cycle.Wherein, HB is at each MAP
Cycle broadcasts MAP frame to all HM.It is each HM rule that the MAP frame of current MAP cycle broadcast carries HB
The bandwidth distribution condition of the next MAP cycle duration drawn.HM needs to carry out data according to the planning of MAP frame
Transmitting-receiving, to avoid channel confliction.The method that existing HB uses MAP frame to carry out bandwidth distribution includes: first,
The bandwidth bought according to user, determines that each HM allows the total data being assigned within each PD cycle
Call duration time.Secondly, the call duration time being assigned to is allowed when setting each scheduling for each HM.So
After, start to last MAP cycle from first MAP cycle in PD cycle, successively and round-robin scheduling is every
Individual HM (be each HM distribute call duration time), until during total within a PD cycle for HM data communication
Between all exhaust and/or reach PD cycle duration.
During realizing the present invention, inventor finds that prior art at least there is problems in that user purchases
The bandwidth bought is different so that allow the total call duration time being allocated the most different between HM within each PD cycle.
So, some MAP cycle after a PD cycle, the short HM of total call duration time is a PD cycle
The call duration time that interior permission is allocated is in MAP cycle consumption above, and total call duration time length
HM also has call duration time, then, after the PD cycle, some MAP cycle are by the most total call duration time length
HM can be scheduled, and the HM that always call duration time is short is not owing to having call duration time then cannot be scheduled so that total
The time delay of the HM that call duration time is short increases, thus the user terminal corresponding for HM causing total call duration time short prolongs
Shi Zengchang, in some instances it may even be possible to cause user terminal cannot proper communication, seriously reduce the experience sense of user.
Summary of the invention
In order to solve problem of the prior art, embodiments provide a kind of bandwidth allocation methods and device.
Described technical scheme is as follows:
On the one hand, embodiments providing a kind of bandwidth allocation methods, described method includes:
Centroid determines each total descending duration can being assigned within a PD cycle from node, an institute
Stating the PD cycle includes multiple MAP cycle；
It is respectively each and described the allocation of downlink duration that just begins is set from node, each described initial from node
Can be less than described in each from described total descending duration of node by allocation of downlink duration；
In units of described MAP cycle, for described in each from node allocation of downlink duration；
According to distributing to described in each from the descending duration of node, update and begin from the first of node described in each
Allocation of downlink duration, obtain each described from node currently can allocation of downlink duration, when described in each from joint
Point currently can be respectively less than that each is described when the single of node dispatches required distribution duration by allocation of downlink duration,
Update each described from node currently can allocation of downlink duration, described current from node of each after renewal
Can before allocation of downlink duration=renewal described currently can allocation of downlink duration+described just begin allocation of downlink time
Long；
Described Centroid determines according to below equation and can be assigned within a PD cycle from node described in each
Total descending duration:
Wherein, total_token_down represent each described from node can be assigned within the current PD cycle total
Descending duration, B represents the bandwidth that each described user corresponding from node buys, TpdRepresent a described PD
The time span in cycle, N representation unit length data, TminRepresent that each is described from described in node transmission one
A time minimum in the time that unit length data are consumed, R represents each described distributing from node
To the predetermined ratio that accounts in total duration of total descending duration, described total time a length of each described working as from node
The total descending duration can being assigned in the front PD cycle and total up duration sum；
Described in units of described MAP cycle, for described in each from node allocation of downlink duration, including:
Judge currently can whether dispatch by allocation of downlink duration from node currently need to dispatched less than described currently need
Dispatch required distribution duration from the single of node；
If described current currently can dispatch not less than described currently need by allocation of downlink duration from node that need to dispatch
Dispatch required distribution duration from the single of node, then judge the residue plan of current MAP cycle descending total time
Whether gap is more than or equal to the described current distribution duration needed for the single of node is dispatched that need to dispatch；
If the descending total time slot of the residue plan of described current MAP cycle more than or equal to described current need to dispatch from
The single scheduling required distribution duration of node, then described current need to dispatch when meeting schedulable condition from node,
For described current need to dispatch from node allocation of downlink duration, described schedulable condition includes: described currently need adjust
Degree from node when previous rotation degree was not scheduled or described when in previous rotation degree for described
Currently need to dispatch from the descending duration of node distribution with described current need to dispatch dispatch institute from the single of node
Duration sum need to be distributed less than setting threshold value；
Each is described from node, until completing the total time slot of actual downstream of described current MAP cycle for cyclic polling
Distribution.
Alternatively, described set threshold value as described when, in previous rotation degree, scheduled is described from node
Each described descending duration being assigned to when node single is scheduled, a maximum descending duration.
Alternatively, described current need to dispatch when meeting schedulable condition from node, for described currently need scheduling
From node allocation of downlink duration, including:
Judge described Centroid whether have downlink data be sent to described current need to dispatch from node；
If have described downlink data be sent to described current need to dispatch from node, then described currently need scheduling
When node meets described schedulable condition, for described current need to dispatch from node allocation of downlink duration.
Alternatively, described basis has distributed to that each is described from the descending duration of node, update each described from
The first allocation of downlink duration that begins of node, including:
If without described downlink data be sent to described current need to dispatch from node, then from described currently need scheduling
The first allocation of downlink duration that begins from node deduct described current need to dispatch dispatch institute from the single of node
Duration need to be distributed.
On the other hand, embodiments providing a kind of bandwidth distributor, described device includes:
Determine module, for determining each total descending duration can being assigned within a PD cycle from node,
One described PD cycle includes multiple MAP cycle；
Module is set, for being respectively described in each, allocation of downlink duration that just begins, each institute is set from node
State the first allocation of downlink duration that begins from node to be less than described in each from described total descending duration of node；
Distribution module, in units of described MAP cycle, for described in each from node allocation of downlink duration；
More new module, for described from the descending duration of node according to distributing to each, updates described in each
From the first allocation of downlink duration that begins of node, obtain each described from node currently can allocation of downlink duration,
When currently can be respectively less than described in each and dispatch institute from the single of node by allocation of downlink duration from node described in each
When need to distribute duration, update each described from node currently can allocation of downlink duration, each institute after renewal
State from node currently can before allocation of downlink duration=renewal described currently can allocation of downlink duration+described initially
Can allocation of downlink duration；
Described determine that module determines according to below equation and can be assigned within a PD cycle from node described in each
Total descending duration:
Wherein, total_token_down represent each described from node can be assigned within the current PD cycle total
Descending duration, B represents the bandwidth that each described user corresponding from node buys, TpdRepresent a described PD
The time span in cycle, N representation unit length data, TminRepresent that each is described from described in node transmission one
A time minimum in the time that unit length data are consumed, R represents each described distributing from node
To the predetermined ratio that accounts in total duration of total descending duration, described total time a length of each described working as from node
The total descending duration can being assigned in the front PD cycle and total up duration sum；
Described distribution module includes:
First judging unit, for judge currently need to dispatch from node currently can allocation of downlink duration whether
Less than the described current distribution duration needed for the single of node is dispatched that need to dispatch；
Second judging unit, if for described current need to dispatch from node currently can allocation of downlink duration not
Less than the described current distribution duration needed for the single of node is dispatched that need to dispatch, then judge current MAP cycle
The descending total time slot of residue plan whether more than or equal to described current need to dispatch dispatch from the single of node required
Distribution duration；
Allocation unit, if the descending total time slot of residue plan for described current MAP cycle is more than or equal to described
That currently need to dispatch dispatches required distribution duration from the single of node, then described current need to dispatch from node
When meeting schedulable condition, for described current need to dispatch from node allocation of downlink duration, described schedulable condition bag
Include: described current need to dispatch from node when previous rotation degree not being scheduled or described when previous
Wheel scheduling in for described current need to dispatch from node distribution descending duration with described current need to dispatch from
The single scheduling required distribution duration sum of node is less than setting threshold value；Each is described from node for cyclic polling,
Until completing the distribution of the total time slot of actual downstream of described current MAP cycle.
Alternatively, described allocation unit use described set threshold value as described when in previous rotation degree,
Scheduling described is from node each described descending duration being assigned to when node single is scheduled, maximum
A descending duration.
Alternatively, described allocation unit is additionally operable to:
Judge Centroid whether have downlink data be sent to described current need to dispatch from node；
If have described downlink data be sent to described current need to dispatch from node, then described currently need scheduling
When node meets described schedulable condition, for described current need to dispatch from node allocation of downlink duration.
Alternatively, described more new module is additionally operable to:
If without described downlink data be sent to described current need to dispatch from node, then from described currently need scheduling
The first allocation of downlink duration that begins from node deduct described current need to dispatch dispatch institute from the single of node
Duration need to be distributed.
The technical scheme that the embodiment of the present invention provides has the benefit that by being respectively each from node
Arranging the allocation of downlink duration that just begins, each is less than each from node from the first allocation of downlink duration that begins of node
Total descending duration；According to distributing to each descending duration from node, update each initial from node
Can allocation of downlink duration, obtain each from node currently can allocation of downlink duration；Can be each several times
Currently can allocation of downlink duration from node updates；When each currently can be respectively less than by allocation of downlink duration from node
Each is when the single of node dispatches required distribution duration, update each from node currently can allocation of downlink time
Long, after renewal each from node currently can before allocation of downlink duration=renewal currently can allocation of downlink duration
+ the allocation of downlink that just begins duration；So, put on an equal footing all from node, be all from joint in the same time mutually
Point update currently can allocation of downlink duration, can solve the PD cycle after some MAP cycle will the most always
Can more can being scheduled from node of allocation of downlink time length ratio, and total can allocation of downlink time length ratio less
The problem that then cannot be scheduled owing to not having call duration time of HM, decrease total can allocation of downlink time length ratio relatively
Few time delay from node, improves Consumer's Experience.
Accompanying drawing explanation
For the technical scheme being illustrated more clearly that in the embodiment of the present invention, institute in embodiment being described below
The accompanying drawing used is needed to be briefly described, it should be apparent that, the accompanying drawing in describing below is only the present invention
Some embodiments, for those of ordinary skill in the art, on the premise of not paying creative work,
Other accompanying drawing can also be obtained according to these accompanying drawings.
Fig. 1 is the flow chart of a kind of bandwidth allocation methods that the embodiment of the present invention one provides；
Fig. 2 is the flow chart of a kind of bandwidth allocation methods that the embodiment of the present invention two provides；
Fig. 3 is the structural representation of a kind of bandwidth distributor that the embodiment of the present invention three provides；
Fig. 4 is the structural representation of a kind of bandwidth distributor that the embodiment of the present invention four provides.
Detailed description of the invention
For making the object, technical solutions and advantages of the present invention clearer, below in conjunction with accompanying drawing to the present invention
Embodiment is described in further detail.
The technical scheme that the embodiment of the present invention describes is applicable under time-multiplexed data transfer mode, centromere
Point (can be described as host node) is for distributing bandwidth from node, and being particularly well-suited to HB in HINCO is HM distribution band
Wide.In HINCO, the work process of HB with HM includes: first, after HM reaches the standard grade, and HM and this HM of control
HB shake hands, the process shaken hands is also referred to as receiving process.During receiving, HB and HM can be with business
Determine the modulation format of HM.Secondly, HB and HM enters the PD cycle.When each PD cycle starts, HB meeting
Broadcast Pd frame gives all online HM, and Pd frame indicates the start-stop position of first MAP frame.MAP frame is used for
Tell that each HM is communication time period and the duration of each HM distribution in next MAP cycle, in other words,
MAP frame is used for notifying each HM, and when HB will dispatch HM carries out data transmission.Usually, in order to
Keeping channel equalization distribution, HB uses the mode of scheduling of taking turns to be that each HM distributes communication time.Specifically,
Assume there is N number of online HM.At the 1st MAP cycle, HB is followed successively by N number of HM and distributes call duration time,
It is to be that (this setting value is assignable less than each HM total logical for a setting value time that a HM distributes every time
The letter time).If the time slot of the 1st MAP cycle is also not run out, followed by being followed successively by N number of HM distribution communication
Time.It is to say, start to last MAP cycle from the 1st MAP cycle, successively and cyclically
Dispatch each HM.
Embodiment one
Embodiments providing a kind of bandwidth allocation methods, see Fig. 1, method flow includes:
Step 101: Centroid determine that each can be assigned within a PD cycle from node total descending time
Long, a PD cycle includes multiple MAP cycle.
Each total descending duration can being assigned within a PD cycle from node depends on that each is corresponding from node
User buy bandwidth.
Step 102: be respectively each and allocation of downlink duration that just begins is set from node, each initial from node
Each total descending duration from node can be less than by allocation of downlink duration.
Specifically, each is less than each total descending duration from node from the first allocation of downlink duration that begins of node,
It is to be understood that any one is less than the most descending of this node oneself from the first allocation of downlink duration that begins of node
Duration.For example, it is assumed that online HM has a and b.Wherein, the first allocation of downlink duration that begins of a is less than a
The total descending duration of oneself, the first allocation of downlink duration total descending duration less than b oneself that begins of b.
Alternatively, the first allocation of downlink duration that begins=each HM of each HM can be assigned in the current PD cycle
Total descending duration/x, x be natural number and 2≤x≤8.
Step 103: in units of MAP cycle, for each from node allocation of downlink duration.
Specifically, Centroid is in the way of scheduling of taking turns, for each from node allocation of downlink duration.
Step 104: according to distributing to each descending duration from node, update each and begin from the first of node
Allocation of downlink duration, obtain each from node currently can allocation of downlink duration, when each current from node
Can allocation of downlink duration be respectively less than each when the single of node dispatches required distribution duration, update each from joint
Point currently can allocation of downlink duration, each after renewal from node currently can be before allocation of downlink duration=renewal
Currently can the allocation of downlink duration+allocation of downlink that just begins duration.
Specifically, according to distributing to each descending duration from node, update each and begin from the first of node
Allocation of downlink duration, obtain each from node currently can allocation of downlink duration, including: from each from node
First begin in allocation of downlink duration, deduct and distribute to each descending duration from node, obtain each from
Node currently can allocation of downlink duration.
The embodiment of the present invention arranges, from node, the allocation of downlink duration that just begins by being respectively each, and each is from joint
The first allocation of downlink duration that begins of point is less than each total descending duration from node；According to distribute to each from
The descending duration of node, updates each first allocation of downlink duration that begins from node, obtains each from node
Currently can allocation of downlink duration；Can be several times each currently can allocation of downlink duration from node updates；When
Each currently can be respectively less than each and dispatches required distribution duration from the single of node by allocation of downlink duration from node
Time, update each from node currently can allocation of downlink duration, each currently can divide from node after renewal
Join before descending duration=renewal currently can the allocation of downlink duration+allocation of downlink that just begins duration；So, by institute
Have and put on an equal footing from node, be in the same time mutually all from node updates currently can allocation of downlink duration, permissible
Solve after the PD cycle some MAP cycle by the most total can allocation of downlink time length ratio more from node
Can be scheduled, total can the less HM of allocation of downlink time length ratio owing to not having call duration time then cannot to be adjusted
The problem of degree, decrease total can the less time delay from node of allocation of downlink time length ratio, improve Consumer's Experience.
Embodiment two
As a example by embodiment of the present invention HB in HINCO is for HM distribution bandwidth, it is provided that a kind of bandwidth distribution side
Method, sees Fig. 2, and method flow includes:
Step 201: Centroid determine that each can be assigned within a PD cycle from node total descending time
Long.
Wherein, a PD cycle includes multiple MAP cycle.
Specifically, before the 1st MAP cycle within the current PD cycle, can be specifically HB Yu HM
During receiving, HB determines the total descending duration that each HM can be assigned within a PD cycle.
Further, this step 201 also includes: Centroid determine each from node within a PD cycle
The total up duration that can be assigned to.
Wherein it is possible to the total descending duration that each HM can be assigned within the current PD cycle with total up time
Long sum is referred to as total duration that each HM can be assigned within the current PD cycle.Specifically, each HM is working as
The total duration can being assigned in the front PD cycle refers to, when each HM transmits data in each PD cycle, reach
To the communication time required for the bandwidth that user corresponding for each HM buys.Therefore, each HM is at current PD
The total duration can being assigned in cycle depends on the bandwidth that user corresponding for each HM is bought.
In total duration, total descending duration can be predetermined ratio with the ratio shared by total up duration, such as
Total descending duration accounts for 3/4, and total up duration accounts for 1/4.So, on the premise of known total duration and ratio,
Total descending duration and total up duration can be obtained.
Preferably, total duration that each HM can be assigned within the current PD cycle can calculate according to formula 1
Obtain.Formula 1 is as follows:
Total_token=(B*Tpd*Tmin)/(N*8) formula 1
Wherein, total_token represents total duration that each HM can be assigned within the current PD cycle, and unit is
S (second)；B represents the bandwidth that corresponding for each HM user buys, unit be bps (bit per second,
Bits per second)；TpdRepresenting the duration (usually 0.064s) in a PD cycle, unit is s；N represents single
Bit length data, unit is Byte；TminRepresent that each HM sends that unit length data are consumed time
A duration minimum in length, unit is s.
Alternatively, TminAcquisition mode include: first, according to each HM transmission data modulation format (HB
In store the respective modulation format of each HM), obtain message transmission rate V corresponding to each HMn.Wherein,
Modulation format and message transmission rate one_to_one corresponding.Secondly, T is usedn=N/VnCalculate each HM respectively to carry out
Once send or accept the duration T that unit length data are consumedn.Finally, from the T that each HM is correspondingnIn
Select a minimum T value as Tmin。
From formula 1, total duration that each HM can be assigned within each PD cycle is only by each HM pair
The bandwidth that the user answered buys determines, the HM that bandwidth is the biggest, it is the most that it always can consume communication time.Specifically,
Formula 1 is by the formula proving of bandwidth out, the computing formula of bandwidth as shown in Equation 2:
Wherein, NpdRepresenting that in the PD cycle, each HM needs the quantity of information of communication, unit is Byte.Npd*8
Represent and the unit of quantity of information is converted to bit by Byte.
Further, in conjunction with formula 2, the derivation of formula 1 includes step A～C:
Step A, calculate N by formula 3pd。
Npd=total_token*VminFormula 3
Wherein, VminWith TminCorresponding, represent a traffic rate the fastest in the traffic rate of each HM,
Unit is Byte/s (bytes-per-second).
Step B, estimate out V by formula 4min。
Vmin=N/TminFormula 4
Specifically, aforementioned unit length data N represent, single is dispatched each HM and once sent or accept
The data volume of data.N is setting value, is typically set at 1518Byte.
What deserves to be explained is, may be different owing to transmitting the modulation format of data between HM, the most each HM
TnMay be different.Knowable to formula 1, TminThe biggest, total communication time is the biggest, and selects TminReason
It is, TminRepresent that HM that message transmission rate is the fastest, make with that HM that message transmission rate is the fastest
For standard, it is possible to ensure on the premise of identical bandwidth, TnBigger HM also can obtain and TnMinimum HM
Identical total communication time, thus it is further ensured that between user the fairness sharing network.
Step C, by Npd(formula 3) and Vmin(formula 4) substitutes into formula 2, obtains formula 5:
Converse total_token according to formula 5, i.e. obtain formula 1.
Based on formula 1, it is assumed that each is from making a reservation for that the total descending duration being assigned to of node accounts for total duration
Ratio is R, each from node be assigned to total descending time a length of total_token_down, then
The computing formula of total_token_down such as formula 6:
Step 202: be respectively each and allocation of downlink duration that just begins is set from node, each initial from node
Each total descending duration from node can be less than by allocation of downlink duration.
Alternatively, the first allocation of downlink duration that begins=each HM of each HM can be assigned in the current PD cycle
Total descending duration/x, x be natural number and 2≤x≤8.
This step 202 also includes: is respectively each and arranges from node and just begin to distribute up duration, each from
First the beginning of node distributes up duration less than each total up duration from node.
In actual applications, can be that each HM arranges a descending token bucket, descending token bucket is initially filled out
The token quantity filled is corresponding with the allocation of downlink duration that just begins.Every HM of descending scheduling, just from scheduling
The descending token of HM deducts when sub-distribution is to the duration of this HM, updated token quantity in descending token bucket.
Similarly, it is also possible to for each HM, one up token bucket is set.
Step 203: in units of MAP cycle, for each from node allocation of downlink duration.
Wherein, for each from node allocation of downlink duration, including: Centroid takes turns to dispatch each from node.
Further, this step 203 includes:
Step 2031: judge currently can whether be less than currently by allocation of downlink duration from node currently need to dispatched
That need to dispatch dispatches required distribution duration from the single of node.
If currently need to dispatch from node currently can allocation of downlink duration not less than currently need to dispatch from node
Single scheduling required distribution duration, then perform step 2032；Otherwise, if currently need to dispatch from node
Currently can dispatch required distribution duration less than currently need to dispatch from the single of node by allocation of downlink duration, then hold
Row step 205.
Wherein, the HM that currently need to dispatch currently can allocation of downlink duration it may be that according to distributing to each
From the descending duration of node, update each distribution obtained after the first allocation of downlink duration that begins of node
Row duration.For example, it is assumed that the HM that currently need to dispatch is the n-th HM in N number of HM.N-th HM works as
Before can allocation of downlink duration it may be that the n-th HM descending token bucket in still remaining token quantity (concrete
Refer to step 204).
Wherein, Centroid can in advance for currently need to dispatch from node sets currently need to dispatch from node
The single required allocation of downlink duration of scheduling.The required allocation of downlink duration of single scheduling describes, and HB is each time
During one HM of scheduling, the up duration of this HM need to be distributed to.In other words, HB decision currently need to be dispatched
The required allocation of downlink duration of single scheduling of HM.Needed for the single scheduling of the HM that currently need to dispatch during allocation of downlink
A long preferably predetermined value.
Step 2032: judge that whether the descending total time slot of residue plan of current MAP cycle is more than or equal to currently needing
The distribution duration needed for the single of node is dispatched of scheduling.
If the descending total time slot of residue plan of current MAP cycle is more than or equal to the list from node currently need to dispatched
Secondary scheduling required distribution duration, then perform step 2033；Otherwise, if under the residue plan of current MAP cycle
The total time slot of row dispatches required distribution duration less than currently need to dispatch from the single of node, then complete current MAP
The distribution of the total time slot of actual downstream in cycle, performs step 206.
The residue of current MAP cycle plans descending total time slot it may be that the plan of current MAP cycle is descending always
The descending total time slot taken from node that time slot deducts current MAP cycle scheduled (has been distributed to from node
Descending duration).
Specifically, HB presets the descending total time slot of plan (with planning up total time slot) of each MAP cycle.
Descending total time slot of planning of each MAP cycle represents the MAP cycle that the downlink data transmission that HB is planned takies
Duration, otherwise, up total time slot of planning of MAP cycle represents the MAP that planned transmitting uplink data takies
Cycle duration.Usually, in a MAP cycle, plan up total time slot and plan between descending middle time slot
Ratio be 1:3.
Step 2033: determine whether that downlink data to be sent to currently need to dispatch from node.
If have that downlink data to be sent to currently need to dispatch from node, then perform step 2034；Otherwise, if
Without downlink data to be sent to currently need to dispatch from node, then perform step 204.
Specifically, downlink data is the data that HB is sent to HM, and HB is able to know that whether to send lower line number
According to which HM.
Step 2034: currently need to dispatch when meeting schedulable condition from node, for currently need to dispatch from joint
Point allocation of downlink duration.
Wherein, schedulable condition includes: currently need to dispatch from node when previous rotation degree was not scheduled,
Or when previous rotation degree being the descending duration from node distribution currently need to dispatched and currently need to dispatch
Required distribution duration sum is dispatched not less than setting threshold value from the single of node.
Wherein, one takes turns and is scheduling to, and each was all at least dispatched once by Centroid from node.
Further, this step 2034 comprises the following steps A-step E:
Step A: detection currently need to dispatch from node whether when previous rotation degree was at least scheduled one
Secondary.
If currently need to dispatch from node not when previous rotation degree is scheduled, perform step D；If currently needing
Scheduling from node when previous rotation degree was at least scheduled once, perform step B.
Wherein, one takes turns and is scheduling to, and each was all at least dispatched once by Centroid from node.Specifically,
One takes turns scheduling at least includes: according to dispatching sequence, each was dispatched once by Centroid the most successively from node.
Dispatching sequence is the dispatching sequence pre-set, it is assumed that online HM is a, b and c, and dispatching sequence can be
First dispatch b, then dispatch a, then dispatch c.So, one take turns scheduling at least include: b, a, c successively by
Dispatched once.Being readily apparent that, during dispatching sequence's difference, one to take turns the scheduling sequencing in scheduling be different
's.Such as, taking turns in scheduling one, dispatching sequence can be a, b, c, or b, a, c, or c, a,
B etc..
Step B: check when in previous rotation degree for currently need to dispatch from node distribution descending duration with
From the single of node, that currently need to dispatch dispatches whether required distribution duration sum exceedes setting threshold value.
When not less than predetermined threshold, then perform step C；When exceeding predetermined threshold, perform step E.
Preferably, this setting threshold value is it may be that when, in previous rotation degree, scheduled is each from node
From node single scheduling required distribution duration, a maximum duration；At this moment, set threshold value be one move
The value of state change.
For example, if the single scheduling required distribution duration of a, b and c be followed successively by 0.1ms, 0.2ms and
0.3ms, it is assumed that first dispatch in epicycle scheduling is b:
During scheduling b, the unscheduled mistake of b, distribute 0.2ms for b, set threshold value as 0.2ms, b has distributed 0.2ms；
The scheduling unscheduled mistake of a, a, distributes 0.1ms for a, owing to 0.1ms is less than 0.2ms, therefore sets
Threshold value or 0.2ms, a has distributed 0.1ms；
Scheduling c, c were not scheduled, and distributed 0.3ms for c, owing to 0.3ms is more than 0.2ms, therefore set
Determine threshold value automatically to change to 0.3ms, c and distributed 0.3ms；
Dispatch b again, distributed the required duration 0.2ms of single scheduling of 0.2ms+b due to b set threshold value
0.3ms, it is determined that b is unsatisfactory for schedulable condition, b can not dispatch；
Dispatch a again, distributed due to a 0.1ms+a the single required duration 0.1ms of scheduling < set threshold value as
0.3ms, it is determined that a meets schedulable condition, has distributed 0.2ms for a distribution 0.1ms, a；
Dispatch c again, distributed due to c 0.3ms+c the single required duration 0.3ms of scheduling > set threshold value
0.3ms, it is determined that c is unsatisfactory for schedulable condition, c can not dispatch；
Dispatching a again, the required duration 0.1ms=of single scheduling having distributed 0.2ms+a due to a sets threshold value
0.3ms, it is determined that a is unsatisfactory for schedulable condition, a can not dispatch, and epicycle finishing scheduling (all can not by a, b, c
Scheduling).
It should be noted that setting threshold value can also be fixed value, such as a 0.3ms by human configuration.
For example, it is assumed that the single scheduling required distribution duration of a, b and c is followed successively by 0.1ms, 0.2ms and 0.3ms.
When setting threshold value as 0.3ms, it is meant that c can only be scheduled once, b can be scheduled once, and a is permissible
It is scheduled twice.
Step C: for currently need to dispatch from node allocation of downlink duration.
Specifically, for currently need to dispatch from node distribution descending duration equal to currently need to dispatch from node
Single scheduling required distribution duration.
Step D: for currently need to dispatch from node allocation of downlink duration.
When predetermined threshold is when, in previous rotation degree, scheduled is each from the scheduling of node single from node
In required distribution duration, during a maximum duration, this step D also includes: more currently need to dispatch from
The single scheduling required distribution duration of node and the size setting threshold value, if being more than, the most more new settings threshold value is
The distribution duration needed for the scheduling of node single currently need to dispatched；If being not more than, then exit this flow process.
Step E: detect each from node the most all when being at least scheduled once previous rotation degree；
When each from node at least one from node not when previous rotation degree was at least scheduled once
Time, scheduling is next from node；Otherwise, when each from node when previous rotation degree is the most at least scheduled
When crossing one time, perform step 205.
Repeated execution of steps A-step E, cyclic polling each from node, until complete current MAP cycle
The distribution of the total time slot of actual downstream.Specifically, under the total time slot of the actual downstream of MAP cycle needs not be equal to plan
The total time slot of row.This is because, the quantity of the HM of different MAP cycle descending schedulings is different, adjusts due to single again
The duration distributing to different HM during degree HM is the most different.For example, it is assumed that the residue meter of current MAP cycle
Drawing descending total time slot is 1ms, a length of 2ms during the required distribution of HM single scheduling currently need to dispatched, this meaning
The descending total time slot of residue plan current MAP cycle dispatches this HM that currently need to dispatch not.At this moment, may be used
Descending planning with the current MAP cycle that declares to be finished, then actual downstream total time slot meeting of current MAP cycle
1ms is shortened than planning descending total time slot.
Step 204: according to distributing to each descending duration from node, update each and begin from the first of node
Allocation of downlink duration, obtain each from node currently can allocation of downlink duration.
Specifically, after the n-th HM is by descending scheduling, update the descending token bucket of the n-th HM: under from
(allocation of downlink that just begins duration deducts and distributes to deduct the token that current downlink scheduled time division joins in row token bucket
To the descending duration of the n-th HM), obtain the n-th HM currently can allocation of downlink duration.
It should be noted that in step 2033, when to be sent to currently need to dispatch without downlink data from node
Time, it is also possible to do not update each first allocation of downlink duration that begins from node.
Further, this step 204 also includes: for each after node allocation of downlink duration, update work as
Front MAP cycle residue plans descending total time slot.
Step 205: travel through each from node, detect each from node currently can allocation of downlink duration the most equal
Required distribution duration is dispatched from the single of node less than each；
When each currently can be respectively less than each and dispatches required point from the single of node by allocation of downlink duration from node
When timing is long, update each from node currently can allocation of downlink duration, after renewal each from node work as
Before can before allocation of downlink duration=renewal currently can the allocation of downlink duration+allocation of downlink that just begins duration.
Otherwise, when at least one from node currently can allocation of downlink duration not less than this at least one from node
Single scheduling required distribution duration time, then perform step 206.
Specifically, at the end of wheel scheduling, if each HM's currently can be respectively less than each HM by allocation of downlink duration
Single scheduling required distribution duration, then mean that each HM does not has an assignable descending duration, at this moment,
Refilling the token bucket of each HM, the token quantity of filling can be relative with the allocation of downlink duration that just begins
Should.
Step 206: judge whether that currently need to dispatch needs not less than current from the up total time slot of node residue plan
The distribution duration needed for the single of node is dispatched of scheduling；
If being no less than the distribution duration needed for the single of node is dispatched currently need to dispatched, then for currently needing to adjust
That spends distributes up duration from node.The process of up duration is distributed with distribution from node for currently need to dispatch
The process of descending duration, i.e. repeats step 203-205.
Otherwise, if dispatching required distribution duration less than currently need to dispatch from the single of node, then complete this MAP
The distribution of actual total time slot in cycle, carries out the distribution of the time slot of next MAP cycle.
The embodiment of the present invention arranges, from node, the allocation of downlink duration that just begins by being respectively each, and each is from joint
The first allocation of downlink duration that begins of point is less than each total descending duration from node；According to distribute to each from
The descending duration of node, updates each first allocation of downlink duration that begins from node, obtains each from node
Currently can allocation of downlink duration；Can be several times each currently can allocation of downlink duration from node updates；When
Each currently can be respectively less than each and dispatches required distribution duration from the single of node by allocation of downlink duration from node
Time, update each from node currently can allocation of downlink duration, each currently can divide from node after renewal
Join before descending duration=renewal currently can the allocation of downlink duration+allocation of downlink that just begins duration；So, by institute
Have and put on an equal footing from node, be in the same time mutually all from node updates currently can allocation of downlink duration, permissible
Solve after the PD cycle some MAP cycle by the most total can allocation of downlink time length ratio more from node
Can be scheduled, total can the less HM of allocation of downlink time length ratio owing to not having call duration time then cannot to be adjusted
The problem of degree, decrease total can the less time delay from node of allocation of downlink time length ratio, improve Consumer's Experience.
Embodiment three
Embodiments provide a kind of bandwidth distributor, it is adaptable to the bandwidth distribution that embodiment one provides
Method.This bandwidth distributor can be Centroid.Seeing Fig. 3, this device includes:
Determine module 301, for determine that each can be assigned within a PD cycle from node total descending time
Long, a PD cycle includes multiple MAP cycle.
Arranging module 302, arrange, from node, the allocation of downlink duration that just begins for being respectively each, each is from joint
The first allocation of downlink duration that begins of point is less than each total descending duration from node.
Distribution module 303, in units of MAP cycle, for each from node allocation of downlink duration.
More new module 304, for according to distributing to each descending duration from node, updating each from node
The first allocation of downlink duration that begins, obtain each from node currently can allocation of downlink duration, when each is from joint
Point currently can allocation of downlink duration be respectively less than each when the single of node dispatches required distribution duration, update
Each from node currently can allocation of downlink duration, after renewal each from node currently can allocation of downlink time
Long=update before currently can the allocation of downlink duration+allocation of downlink that just begins duration.
The embodiment of the present invention arranges, from node, the allocation of downlink duration that just begins by being respectively each, and each is from joint
The first allocation of downlink duration that begins of point is less than each total descending duration from node；According to distribute to each from
The descending duration of node, updates each first allocation of downlink duration that begins from node, obtains each from node
Currently can allocation of downlink duration；Can be several times each currently can allocation of downlink duration from node updates；When
Each currently can be respectively less than each and dispatches required distribution duration from the single of node by allocation of downlink duration from node
Time, update each from node currently can allocation of downlink duration, each currently can divide from node after renewal
Join before descending duration=renewal currently can the allocation of downlink duration+allocation of downlink that just begins duration；So, by institute
Have and put on an equal footing from node, be in the same time mutually all from node updates currently can allocation of downlink duration, permissible
Solve after the PD cycle some MAP cycle by the most total can allocation of downlink time length ratio more from node
Can be scheduled, total can the less HM of allocation of downlink time length ratio owing to not having call duration time then cannot to be adjusted
The problem of degree, decrease total can the less time delay from node of allocation of downlink time length ratio, improve Consumer's Experience.
Embodiment four
Embodiments provide a kind of bandwidth distributor, it is adaptable to the bandwidth that embodiment one or two provides
Distribution method.This bandwidth distributor can be Centroid (such as HB).Seeing Fig. 4, this device includes:
Determine module 401, for determine that each can be assigned within a PD cycle from node total descending time
Long, a PD cycle includes multiple MAP cycle.
Optionally it is determined that according to below equation, module 401 determines that each can divide within a PD cycle from node
The total descending duration being fitted on:
Wherein, total_token_down represent each from node can be assigned within the current PD cycle the most descending
Duration, B represents each bandwidth bought from the user that node is corresponding, TpdRepresent a described PD cycle time
Between length, N representation unit length data, TminRepresent that each is each from described in node transmission one from node
Time minimum in the time that unit length data are consumed, R represents each being assigned to from node
The predetermined ratio that total descending duration accounts in total duration, time total a length of each can within the current PD cycle from node
The total descending duration being assigned to and total up duration sum.
Arranging module 402, arrange, from node, the allocation of downlink duration that just begins for being respectively each, each is from joint
The first allocation of downlink duration that begins of point is less than each total descending duration from node.
Alternatively, the first allocation of downlink duration that begins=each HM of each HM can be assigned in the current PD cycle
Total descending duration/x, x be natural number and 2≤x≤8.
Distribution module 403, in units of MAP cycle, for each from node allocation of downlink duration.
Alternatively, distribution module 403 includes:
First judging unit 4031, for judge currently need to dispatch from node currently can allocation of downlink duration
Whether dispatch required distribution duration less than currently need to dispatch from the single of node.
Second judging unit 4032, if for currently need to dispatch from node currently can allocation of downlink duration not
Dispatch required distribution duration less than currently need to dispatch from the single of node, then judge the surplus of current MAP cycle
Remaining plan descending total time slot whether more than or equal to currently need to dispatch when the single of node dispatches required distribution
Long.
Allocation unit 4033, if the descending total time slot of residue plan for current MAP cycle is more than or equal to current
That need to dispatch dispatches required distribution duration from the single of node, then meet scheduling currently need to dispatch from node
During condition, for currently need to dispatch from node allocation of downlink duration, schedulable condition includes: currently need to dispatch
From node when previous rotation degree was not scheduled or when in previous rotation degree for currently dispatching
From the descending duration of node distribution with the distribution duration sum needed for the single of node is dispatched currently need to dispatched not
Exceed setting threshold value；Cyclic polling each from node, during until the actual downstream that completes current MAP cycle is total
The distribution of gap.
Alternatively, threshold value that what allocation unit 4033 used set as when in previous rotation degree, scheduled from
In node each descending duration being assigned to when node single is scheduled, a maximum descending duration.
More new module 404, for according to distributing to each descending duration from node, updating each from node
The first allocation of downlink duration that begins, obtain each from node currently can allocation of downlink duration, when each is from joint
Point currently can allocation of downlink duration be respectively less than each when the single of node dispatches required distribution duration, update
Each from node currently can allocation of downlink duration, after renewal each from node currently can allocation of downlink time
Long=update before currently can the allocation of downlink duration+allocation of downlink that just begins duration.
Allocation unit 4033 is additionally operable to:
Judge whether Centroid have that downlink data is sent to currently need to dispatch from node；If there being downlink data
Be sent to currently need to dispatch from node, then currently need to dispatch when meeting schedulable condition from node, for working as
Front need to dispatch from node allocation of downlink duration.
More new module 404 is used for:
If without downlink data be sent to currently need to dispatch from node, then from currently need to dispatch from the beginning of node
The allocation of downlink that begins duration deducts the distribution duration needed for the single of node is dispatched currently need to dispatched, obtains
Currently need to dispatch from node currently can allocation of downlink duration.
The embodiment of the present invention arranges, from node, the allocation of downlink duration that just begins by being respectively each, and each is from joint
The first allocation of downlink duration that begins of point is less than each total descending duration from node；According to distribute to each from
The descending duration of node, updates each first allocation of downlink duration that begins from node, obtains each from node
Currently can allocation of downlink duration；Can be several times each currently can allocation of downlink duration from node updates；When
Each currently can be respectively less than each and dispatches required distribution duration from the single of node by allocation of downlink duration from node
Time, update each from node currently can allocation of downlink duration, each currently can divide from node after renewal
Join before descending duration=renewal currently can the allocation of downlink duration+allocation of downlink that just begins duration；So, by institute
Have and put on an equal footing from node, be in the same time mutually all from node updates currently can allocation of downlink duration, permissible
Solve after the PD cycle some MAP cycle by the most total can allocation of downlink time length ratio more from node
Can be scheduled, total can the less HM of allocation of downlink time length ratio owing to not having call duration time then cannot to be adjusted
The problem of degree, decrease total can the less time delay from node of allocation of downlink time length ratio, improve Consumer's Experience.
It should be understood that the bandwidth distributor that above-described embodiment provides is when distributing bandwidth, only with above-mentioned
The division of each functional module is illustrated, and in actual application, can above-mentioned functions be divided as desired
Join and completed by different functional modules, the internal structure of equipment will be divided into different functional modules, with complete
Become all or part of function described above.It addition, the bandwidth distributor of above-described embodiment offer and band
Bandwidth allocation method embodiment belongs to same design, and it implements process and refers to embodiment of the method, the most no longer
Repeat.
The invention described above embodiment sequence number, just to describing, does not represent the quality of embodiment.
One of ordinary skill in the art will appreciate that all or part of step realizing above-described embodiment can be passed through
Hardware completes, it is also possible to instructing relevant hardware by program and complete, described program can be stored in
In a kind of computer-readable recording medium, storage medium mentioned above can be read only memory, disk or
CD etc..
The foregoing is only presently preferred embodiments of the present invention, not in order to limit the present invention, all the present invention's
Within spirit and principle, any modification, equivalent substitution and improvement etc. made, should be included in the present invention's
Within protection domain.
Claims (8)
1. a bandwidth allocation methods, it is characterised in that described method includes:
Centroid determine each from node can be assigned within a descending detection PD cycle total descending time
Long, a described PD cycle includes that multiple media access planning MAP cycle；
It is respectively each and described the allocation of downlink duration that just begins is set from node, each described initial from node
Can be less than described in each from described total descending duration of node by allocation of downlink duration；
In units of described MAP cycle, for described in each from node allocation of downlink duration；
According to distributing to described in each from the descending duration of node, update and begin from the first of node described in each
Allocation of downlink duration, obtain each described from node currently can allocation of downlink duration, when described in each from joint
Point currently can be respectively less than that each is described when the single of node dispatches required distribution duration by allocation of downlink duration,
Update each described from node currently can allocation of downlink duration, described current from node of each after renewal
Can before allocation of downlink duration=renewal described currently can allocation of downlink duration+described just begin allocation of downlink time
Long；
Described Centroid determines according to below equation and can be assigned within a PD cycle from node described in each
Total descending duration:
Wherein, total_token_down represent each described from node can be assigned within the current PD cycle total
Descending duration, B represents the bandwidth that each described user corresponding from node buys, TpdRepresent a described PD
The time span in cycle, N representation unit length data, TminRepresent that each is described from described in node transmission one
A time minimum in the time that unit length data are consumed, R represents each described distributing from node
To the predetermined ratio that accounts in total duration of total descending duration, described total time a length of each described working as from node
The total descending duration can being assigned in the front PD cycle and total up duration sum；
Described in units of described MAP cycle, for described in each from node allocation of downlink duration, including:
Judge currently can whether dispatch by allocation of downlink duration from node currently need to dispatched less than described currently need
Dispatch required distribution duration from the single of node；
If described current currently can dispatch not less than described currently need by allocation of downlink duration from node that need to dispatch
Dispatch required distribution duration from the single of node, then judge the residue plan of current MAP cycle descending total time
Whether gap is more than or equal to the described current distribution duration needed for the single of node is dispatched that need to dispatch；
If the descending total time slot of the residue plan of described current MAP cycle more than or equal to described current need to dispatch from
The single scheduling required distribution duration of node, then described current need to dispatch when meeting schedulable condition from node,
For described current need to dispatch from node allocation of downlink duration, described schedulable condition includes: described currently need adjust
Degree from node when previous rotation degree was not scheduled or described when in previous rotation degree for described
Currently need to dispatch from the descending duration of node distribution with described current need to dispatch dispatch institute from the single of node
Duration sum need to be distributed less than setting threshold value；
Each is described from node, until completing the total time slot of actual downstream of described current MAP cycle for cyclic polling
Distribution.
Method the most according to claim 1, it is characterised in that
Described set threshold value as described when in previous rotation degree, scheduled is described each described from node
The descending duration being assigned to when node single is scheduled, a maximum descending duration.
Method the most according to claim 2, it is characterised in that described current need to dispatch from node
When meeting schedulable condition, for described current need to dispatch from node allocation of downlink duration, including:
Judge described Centroid whether have downlink data be sent to described current need to dispatch from node；
If have described downlink data be sent to described current need to dispatch from node, then described currently need scheduling
When node meets described schedulable condition, for described current need to dispatch from node allocation of downlink duration.
Method the most according to claim 3, it is characterised in that described basis has been distributed to described in each
From the descending duration of node, update that each is described from the first allocation of downlink duration that begins of node, including:
If without described downlink data be sent to described current need to dispatch from node, then from described currently need scheduling
The first allocation of downlink duration that begins from node deduct described current need to dispatch dispatch institute from the single of node
Duration need to be distributed.
5. a bandwidth distributor, it is characterised in that described device includes:
Determine module, for determine each from node can be assigned within a descending detection PD cycle total
Row duration, described PD cycle includes that multiple media access planning MAP cycle；
Module is set, for being respectively described in each, allocation of downlink duration that just begins, each institute is set from node
State the first allocation of downlink duration that begins from node to be less than described in each from described total descending duration of node；
Distribution module, in units of described MAP cycle, for described in each from node allocation of downlink duration；
More new module, for described from the descending duration of node according to distributing to each, updates described in each
From the first allocation of downlink duration that begins of node, obtain each described from node currently can allocation of downlink duration,
When currently can be respectively less than described in each and dispatch institute from the single of node by allocation of downlink duration from node described in each
When need to distribute duration, update each described from node currently can allocation of downlink duration, each institute after renewal
State from node currently can before allocation of downlink duration=renewal described currently can allocation of downlink duration+described initially
Can allocation of downlink duration；
Described determine that module determines according to below equation and can be assigned within a PD cycle from node described in each
Total descending duration:
Wherein, total_token_down represent each described from node can be assigned within the current PD cycle total
Descending duration, B represents the bandwidth that each described user corresponding from node buys, TpdRepresent a described PD
The time span in cycle, N representation unit length data, TminRepresent that each is described from described in node transmission one
A time minimum in the time that unit length data are consumed, R represents each described distributing from node
To the predetermined ratio that accounts in total duration of total descending duration, described total time a length of each described working as from node
The total descending duration can being assigned in the front PD cycle and total up duration sum；
Described distribution module includes:
First judging unit, for judge currently need to dispatch from node currently can allocation of downlink duration whether
Less than the described current distribution duration needed for the single of node is dispatched that need to dispatch；
Second judging unit, if for described current need to dispatch from node currently can allocation of downlink duration not
Less than the described current distribution duration needed for the single of node is dispatched that need to dispatch, then judge current MAP cycle
The descending total time slot of residue plan whether more than or equal to described current need to dispatch dispatch from the single of node required
Distribution duration；
Allocation unit, if the descending total time slot of residue plan for described current MAP cycle is more than or equal to described
That currently need to dispatch dispatches required distribution duration from the single of node, then described current need to dispatch from node
When meeting schedulable condition, for described current need to dispatch from node allocation of downlink duration, described schedulable condition bag
Include: described current need to dispatch from node when previous rotation degree not being scheduled or described when previous
Wheel scheduling in for described current need to dispatch from node distribution descending duration with described current need to dispatch from
The single scheduling required distribution duration sum of node is less than setting threshold value；Each is described from node for cyclic polling,
Until completing the distribution of the total time slot of actual downstream of described current MAP cycle.
Device the most according to claim 5, it is characterised in that
Described allocation unit use described set threshold value as described when in previous rotation degree, scheduled institute
State from node each described descending duration being assigned to when node single is scheduled, under maximum one
Row duration.
Device the most according to claim 6, it is characterised in that described allocation unit is additionally operable to:
Judge Centroid whether have downlink data be sent to described current need to dispatch from node；
If have described downlink data be sent to described current need to dispatch from node, then described currently need scheduling
When node meets described schedulable condition, for described current need to dispatch from node allocation of downlink duration.
Device the most according to claim 7, it is characterised in that described more new module is additionally operable to:
If without described downlink data be sent to described current need to dispatch from node, then from described currently need scheduling
The first allocation of downlink duration that begins from node deduct described current need to dispatch dispatch institute from the single of node
Duration need to be distributed.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310316411.7A CN103368871B (en) | 2013-07-25 | 2013-07-25 | A kind of bandwidth allocation methods and device |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201310316411.7A CN103368871B (en) | 2013-07-25 | 2013-07-25 | A kind of bandwidth allocation methods and device |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN103368871A CN103368871A (en) | 2013-10-23 |
| CN103368871B true CN103368871B (en) | 2016-08-10 |
Family
ID=49369432
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201310316411.7A Active CN103368871B (en) | 2013-07-25 | 2013-07-25 | A kind of bandwidth allocation methods and device |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN103368871B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104580015B (en) * | 2014-12-24 | 2018-06-19 | 中国船舶重工集团公司第七二二研究所 | Communication means and device based on HINOC |
| CN110519110B (en) * | 2019-10-12 | 2023-06-23 | 驷途(上海)科技有限公司 | Cloud broadband configuration device |
| CN111585850B (en) * | 2020-04-09 | 2021-06-15 | 北京瀚诺半导体科技有限公司 | HINOC channel binding method, chip and equipment |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102369685A (en) * | 2011-09-06 | 2012-03-07 | 华为技术有限公司 | Source distribution indication method, device and system |
| CN102624560A (en) * | 2012-03-12 | 2012-08-01 | 深圳市天威视讯股份有限公司 | Distributed-deployment and centralized-control cable TV (Television) network broadband access system |
| CN103067223A (en) * | 2012-12-28 | 2013-04-24 | 中国船舶重工集团公司第七二二研究所 | Peer-to-peer (p2p) testing method based on high-performance network over coax (HINOC) |
| CN103067222A (en) * | 2012-12-27 | 2013-04-24 | 中国船舶重工集团公司第七二二研究所 | High performance network over coax (HINOC) based HIMAC frame loopback test method |
| CN103220231A (en) * | 2012-01-19 | 2013-07-24 | 上海未来宽带技术股份有限公司 | HiNOC data flow processing system and method |
| CN103220194A (en) * | 2012-01-19 | 2013-07-24 | 上海未来宽带技术股份有限公司 | HiNOC equipment and implementation method thereof |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| GB0207507D0 (en) * | 2002-03-28 | 2002-05-08 | Marconi Corp Plc | An apparatus for providing communications network resource |
-
2013
- 2013-07-25 CN CN201310316411.7A patent/CN103368871B/en active Active
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102369685A (en) * | 2011-09-06 | 2012-03-07 | 华为技术有限公司 | Source distribution indication method, device and system |
| CN103220231A (en) * | 2012-01-19 | 2013-07-24 | 上海未来宽带技术股份有限公司 | HiNOC data flow processing system and method |
| CN103220194A (en) * | 2012-01-19 | 2013-07-24 | 上海未来宽带技术股份有限公司 | HiNOC equipment and implementation method thereof |
| CN102624560A (en) * | 2012-03-12 | 2012-08-01 | 深圳市天威视讯股份有限公司 | Distributed-deployment and centralized-control cable TV (Television) network broadband access system |
| CN103067222A (en) * | 2012-12-27 | 2013-04-24 | 中国船舶重工集团公司第七二二研究所 | High performance network over coax (HINOC) based HIMAC frame loopback test method |
| CN103067223A (en) * | 2012-12-28 | 2013-04-24 | 中国船舶重工集团公司第七二二研究所 | Peer-to-peer (p2p) testing method based on high-performance network over coax (HINOC) |
Non-Patent Citations (2)
| Title |
|---|
| 刘长明.HINOC系统的调度机制研究.《万方硕士学位论文库》.2012, * |
| 彭武熹等.HINOC网络中的动态带宽调度算法.《电脑知识与技术》.2013,第9卷(第5期), * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103368871A (en) | 2013-10-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101800693B (en) | Method for managing data transmission in moca network and coaxial cable network | |
| CN110505653B (en) | Method, equipment and computer storage medium for controlling service quality | |
| Bisdikian et al. | MLAP: A MAC level access protocol for the HFC 802.14 network | |
| CN105591795B (en) | Bandwidth allocation method and device | |
| CN103905343B (en) | Method for dynamically allocating broadband resources | |
| CN106793133A (en) | The dispatching method of multi-service QoS is ensured in a kind of electric power wireless communication system | |
| CN103368871B (en) | A kind of bandwidth allocation methods and device | |
| CN106569897B (en) | The polling method and device of shared bus based on collaborative multi-task scheduling mechanism | |
| CN110392360A (en) | A kind of available resources report method and device | |
| CN102595419B (en) | Method and system for spectrum allocation in cognitive radio network | |
| CN102611605A (en) | Scheduling method, device and system of data exchange network | |
| CN105376176A (en) | Method, device and system for guaranteeing the service quality of mobile Internet video services | |
| CN103118435B (en) | A kind of node scheduling method, equipment and system | |
| CN104580015A (en) | Communication method and device based on HINOC | |
| CN103313411A (en) | Multiservice resource distribution method and device | |
| CN101895931A (en) | Searching and balance idea based industrial wireless network communication resource distributing method | |
| CN101127704B (en) | A method and device for dynamic bandwidth allocation | |
| Rao et al. | A survey and comparison of GTS allocation and scheduling algorithms in IEEE 802.15. 4 wireless sensor networks | |
| JP2001203696A (en) | Artificial satellite mount data bus control method, and its system | |
| CN102984717B (en) | The evaluation method and system of power system capacity | |
| CN109429347B (en) | Time slot allocation method and device | |
| CN103428873B (en) | Method, user terminal and the base station of information processing | |
| CN103828294B (en) | Fiduciary power management | |
| CN107483359B (en) | The method, apparatus and system of Dynamic Bandwidth Allocation | |
| CN115802504A (en) | Information processing method, device, equipment and computer readable storage medium |
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 |