CN103368871A - Bandwidth allocation method and bandwidth allocation device - Google Patents
Bandwidth allocation method and bandwidth allocation device Download PDFInfo
- Publication number
- CN103368871A CN103368871A CN2013103164117A CN201310316411A CN103368871A CN 103368871 A CN103368871 A CN 103368871A CN 2013103164117 A CN2013103164117 A CN 2013103164117A CN 201310316411 A CN201310316411 A CN 201310316411A CN 103368871 A CN103368871 A CN 103368871A
- Authority
- CN
- China
- Prior art keywords
- node
- duration
- allocation
- current
- downlink
- 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
Links
Images
Landscapes
- Mobile Radio Communication Systems (AREA)
Abstract
The invention discloses a bandwidth allocation method and a bandwidth allocation device and belongs to the field of communication. The method comprises the following steps of: determining total downlink duration of each slave node which can be allocated in a PD period through a central node; respectively setting an initial allocatable downlink duration for each slave node, wherein the initial allocatable downlink duration of each slave node is less than the total downlink duration of each slave node; by taking an MAP period as a unit, allocating downlink duration for each slave node; updating the initial allocatable downlink duration of each slave node according to the downlink duration which is allocated to each slave node, obtaining the current allocatable downlink duration of each slave node, and when the current allocatable downlink duration of each slave node is less than the allocation duration required by single scheduling of each slave node, updating the current allocatable downlink duration of each slave node, wherein the updated current allocatable downlink duration of each slave node is equal to the sum of the current allocatable downlink duration before updating and the initial allocatable downlink duration. According to the method, time delay can be reduced.
Description
Technical field
The present invention relates to the communications field, particularly a kind of bandwidth allocation methods and device.
Background technology
HINOC(High Performance Network Over Coax, high-performance coaxial cable broadband access network) refers to, at FTTB (Fiber To The Building, Fiber-To-The-Building) on the network configuration basis, utilize residential quarter corridor and the indoor cable tv coax of having arranged, the fiber optic network of structure is to the Access Network between the subscriber household network.Entity device among the HINOC comprises HB (HINOC Bridge, high-performance coaxial cable broadband access network bridge) and HM (HINOC Modem, high-performance coaxial cable broadband access network modulator-demodulator).Wherein, HB is between fiber optic network and HM, and HM is between HB and user terminal.A HB controls some HM.
HINOC adopts time division multiplexing mode to carry out transfer of data, and its time shaft cuts off take 64 milliseconds as the cycle, and each such cycle is called PD(Probe Down, descending detection) cycle.A PD cycle comprises some continuous MAP(Media Access Plan, media access planning) cycle.Wherein, HB broadcasts the MAP frame in each MAP cycle to all HM.The MAP frame of current MAP periodic broadcasting has carried the allocated bandwidth situation of HB for the next MAP cycle duration of each HM planning.HM need to carry out data transmit-receive according to the planning of MAP frame, to avoid channel confliction.The method that existing HB adopts the MAP frame to carry out allocated bandwidth comprises: at first, according to the bandwidth that the user buys, determine that each HM allows total data communication time of being assigned at each PD in the cycle.Next allows the call duration time that is assigned to when setting each scheduling for each HM.Then, begin to last MAP cycle from first MAP cycle in PD cycle, successively and each HM(of round-robin scheduling be each HM allocate communications time), until HM a PD in the cycle total data communication time all exhaust and/or reach the PD cycle duration.
In realizing process of the present invention, the inventor finds that there is following problem at least in prior art: the bandwidth that the user buys is different, so that allow total call duration time of being assigned with also different in the cycle at each PD between the HM.Like this, some MAP cycles in the back in a PD cycle, the short HM of total call duration time allows the call duration time that is assigned with at a PD in the cycle in front MAP cycle consumes and is over, and the long HM of total call duration time also has call duration time, so, some MAP cycles will only have the long HM of total call duration time to be scheduled in the back in PD cycle, the short HM of total call duration time is not owing to there being call duration time then can't be scheduled, so that the time-delay of the short HM of total call duration time increases, thereby cause user terminal time-delay corresponding to the short HM of total call duration time to increase, even may cause the user terminal can't proper communication, seriously reduced user's experience sense.
Summary of the invention
In order to solve the problem of prior art, the embodiment of the invention provides a kind of bandwidth allocation methods and device.Described technical scheme is as follows:
On the one hand, the embodiment of the invention provides a kind of bandwidth allocation methods, and described method comprises:
Centroid is determined the total descending duration that each can be assigned in cycle at a PD from node, and a described PD cycle comprises a plurality of MAP cycles;
Be respectively that each is described from the Node configuration allocation of downlink duration that just begins, each described first allocation of downlink duration that begins from node is less than each described described total descending duration from node;
Take the described MAP cycle as unit, described from node allocation of downlink duration for each;
According to distributing to each described descending duration from node, upgrade each described first allocation of downlink duration that begins from node, but obtain each described current allocation of downlink duration from node, when but each described current allocation of downlink duration from node all need distribute duration less than each described single dispatching office from node, but upgrade each described current allocation of downlink duration from node, but but the described current allocation of downlink duration before each described current allocation of downlink duration from the node=renewal after the renewal+described allocation of downlink duration that just begins.
Alternatively, described take the described MAP cycle as unit, described from node allocation of downlink duration for each, comprising:
Judge but whether the current current allocation of downlink duration from node of scheduling that needs need distribute duration less than the described current single dispatching office from node of scheduling that needs;
Need distribute duration if but the described current current allocation of downlink duration from node that needs scheduling is not less than the described current single dispatching office from node of scheduling that needs, the residue of then judging the current MAP cycle is planned descending total time slot and whether need be distributed duration more than or equal to the described current single dispatching office from node of scheduling that needs;
If planning descending total time slot, the residue in described current MAP cycle need distribute duration more than or equal to the described current single dispatching office from node of scheduling that needs, then described current need scheduling satisfy schedulable condition from node the time, for described current need scheduling from node allocation of downlink duration, described schedulable condition comprises: described current not being scheduled when last rotation degree from node of scheduling that need, or need distribute the duration sum above setting threshold for the described current descending duration that distributes from node of scheduling that needs with the described current single dispatching office from node of scheduling that needs described in the last rotation degree;
Each is described from node for cyclic polling, until finish the distribution of the total time slot of actual downstream in described current MAP cycle.
Alternatively, described setting threshold be described in the last rotation degree, that has dispatched is described from node each described descending duration that is assigned to when the node single is scheduled, a maximum descending duration.
Alternatively, described current need scheduling satisfy schedulable condition from node the time, for described current need scheduling from node allocation of downlink duration, comprising:
Judge described Centroid whether have downlink data send to described current need scheduling from node;
If have described downlink data send to described current need scheduling from node, then described current need scheduling satisfy described schedulable condition from node the time, for described current need scheduling from node allocation of downlink duration.
Alternatively, described basis has been distributed to each described descending duration from node, upgrades each described first allocation of downlink duration that begins from node, comprising:
If without described downlink data send to described current need scheduling from node, then need distribute duration from the described current described current single dispatching office from node of scheduling that needs of from the first allocation of downlink duration that begins of node, deducting of scheduling that needs.
Alternatively, described Centroid is determined each described total descending duration that can be assigned in the cycle at a PD from node according to following formula:
total_token_down=(B*T
pd*T
min)/(N*8)*R
Wherein, total_token_down represents each described total descending duration that can be assigned in the cycle at current PD from node, and B represents each described bandwidth of buying from user corresponding to node, T
PdThe time span in a described PD cycle of expression, N representation unit length data, T
MinRepresent that each describedly sends the minimum time the time that described unit length data consume from node, R represents each described predetermined ratio that accounts for from the total descending duration that is assigned to of node total duration, described total duration is each described total descending duration and total up duration sum that can be assigned in the cycle at current PD from node.
On the other hand, the embodiment of the invention provides a kind of allocated bandwidth device, and described device comprises:
Determination module is used for determining each total descending duration that can be assigned in the cycle at a PD from node that a described PD cycle comprises a plurality of MAP cycles;
Module is set, is used for being respectively that each is described from the Node configuration allocation of downlink duration that just begins, each described first allocation of downlink duration that begins from node is less than each described described total descending duration from node;
Distribution module, be used for take the described MAP cycle as unit, described from node allocation of downlink duration for each;
Update module, be used for according to distributing to each described descending duration from node, upgrade each described first allocation of downlink duration that begins from node, but obtain each described current allocation of downlink duration from node, when but each described current allocation of downlink duration from node all need distribute duration less than each described single dispatching office from node, but upgrade each described current allocation of downlink duration from node, but but the described current allocation of downlink duration before each described current allocation of downlink duration from the node=renewal after the renewal+described allocation of downlink duration that just begins.
Alternatively, described distribution module comprises:
The first judging unit, but be used for judging whether the current current allocation of downlink duration from node of scheduling that needs need distribute duration less than the described current single dispatching office from node of scheduling that needs;
The second judging unit, but be not less than the described current single dispatching office from node of scheduling that needs and need distribute duration if be used for the described current current allocation of downlink duration from node that needs scheduling, the residue of then judging the current MAP cycle is planned descending total time slot and whether need be distributed duration more than or equal to the described current single dispatching office from node of scheduling that needs;
Allocation units, need distribute duration if plan descending total time slot for the residue in described current MAP cycle more than or equal to the described current single dispatching office from node of scheduling that needs, then described current need scheduling satisfy schedulable condition from node the time, for described current need scheduling from node allocation of downlink duration, described schedulable condition comprises: described current not being scheduled when last rotation degree from node of scheduling that need, or need distribute the duration sum above setting threshold for the described current descending duration that distributes from node of scheduling that needs with the described current single dispatching office from node of scheduling that needs described in the last rotation degree; Each is described from node for cyclic polling, until finish the distribution of the total time slot of actual downstream in described current MAP cycle.
Alternatively, the described setting threshold that described allocation units adopt be described in last rotation degree, that has dispatched is described from node each described descending duration that is assigned to when the node single is scheduled, a descending duration of maximum.
Alternatively, described allocation units also are used for:
Judge described Centroid whether have downlink data send to described current need scheduling from node;
If have described downlink data send to described current need scheduling from node, then described current need scheduling satisfy described schedulable condition from node the time, for described current need scheduling from node allocation of downlink duration.
Alternatively, described update module also is used for:
If without described downlink data send to described current need scheduling from node, then need distribute duration from the described current described current single dispatching office from node of scheduling that needs of from the first allocation of downlink duration that begins of node, deducting of scheduling that needs.
Alternatively, described determination module is determined each described total descending duration that can be assigned in the cycle at a PD from node according to following formula:
total_token_down=(B*T
pd*T
min)/(N*8)*R
Wherein, total_token_down represents each described total descending duration that can be assigned in the cycle at current PD from node, and B represents each described bandwidth of buying from user corresponding to node, T
PdThe time span in a described PD cycle of expression, N representation unit length data, T
MinRepresent that each describedly sends the minimum time the time that described unit length data consume from node, R represents each described predetermined ratio that accounts for from the total descending duration that is assigned to of node total duration, described total duration is each described total descending duration and total up duration sum that can be assigned in the cycle at current PD from node.
The beneficial effect that the technical scheme that the embodiment of the invention provides is brought is: by being respectively each from the Node configuration allocation of downlink duration that just begins, each from the first allocation of downlink duration that begins of node less than each total descending duration from node; According to distributing to each descending duration from node, upgrade each from the first allocation of downlink duration that begins of node, but obtain each from the current allocation of downlink duration of node; Can be but that each is from the current allocation of downlink duration of node updates several times; When but each current allocation of downlink duration from node all need distribute duration less than each single dispatching office from node, but upgrade each from the current allocation of downlink duration of node, but but the current allocation of downlink duration before each the current allocation of downlink duration from node after the renewal=renewal+allocation of downlink that just begins duration; Like this, all are put on an equal footing from node, be but that all are from the current allocation of downlink duration of node updates in the identical moment, but can solve in the back in PD cycle some MAP cycles will only have more can being scheduled from node of total allocation of downlink time length ratio, but the HM that total allocation of downlink time length ratio is less is because the problem that does not have call duration time then can't be scheduled, but reduced the less time-delay from node of total allocation of downlink time length ratio, improved the user and experience.
Description of drawings
In order to be illustrated more clearly in the technical scheme in the embodiment of the invention, the accompanying drawing of required use was done to introduce simply during the below will describe embodiment, apparently, accompanying drawing in the following describes only is some embodiments of the present invention, for those of ordinary skills, under the prerequisite of not paying creative work, can also obtain according to these accompanying drawings other accompanying drawing.
Fig. 1 is the flow chart of a kind of bandwidth allocation methods of providing of the embodiment of the invention one;
Fig. 2 is the flow chart of a kind of bandwidth allocation methods of providing of the embodiment of the invention two;
Fig. 3 is the structural representation of a kind of allocated bandwidth device of providing of the embodiment of the invention three;
Fig. 4 is the structural representation of a kind of allocated bandwidth device of providing of the embodiment of the invention four.
Embodiment
For making the purpose, technical solutions and advantages of the present invention clearer, embodiment of the present invention is described further in detail below in conjunction with accompanying drawing.
The technical scheme that the embodiment of the invention is described is applicable under the time-multiplexed data transfer mode, and Centroid (can be described as host node) is for distributing bandwidth from node, is specially adapted to that HB is that HM distributes bandwidth among the HINCO.The course of work of HB and HM comprises among the HINCO: at first, after HM reached the standard grade, HM and the HB of this HM of control shook hands, and the process of shaking hands is also referred to as the admittance process.In the admittance process, HB and HM can decide through consultation the modulation format of HM.Secondly, HB and HM enter the PD cycle.When each PD cycle began, HB can broadcast the Pd frame to all online HM, and the Pd frame has been pointed out the start-stop position of first MAP frame.The MAP frame is for communication period and the duration of telling that each HM distributed for each HM in the next MAP cycle, and in other words, the MAP frame carries out the data transmission for notifying each HM, HB will when dispatch HM.Usually, distribute in order to keep channel equalization, it is each HM allocate communications duration that HB adopts the mode of the scheduling of taking turns.Particularly, suppose to have N online HM.The 1st MAP cycle, HB is followed successively by N HM allocate communications time, is that the time that a HM distributes is a set point (this set point is less than the assignable total call duration time of each HM) at every turn.If the time slot in the 1st MAP cycle also is not finished, then be followed successively by again N HM allocate communications time.That is to say, since the 1st MAP cycle to last MAP cycle, dispatch successively and circularly each HM.
Embodiment one
The embodiment of the invention provides a kind of bandwidth allocation methods, and referring to Fig. 1, method flow comprises:
Step 101: Centroid is determined the total descending duration that each can be assigned in cycle at a PD from node, and a PD cycle comprises a plurality of MAP cycles.
Each total descending duration that can be assigned in the cycle at a PD from node depends on the bandwidth that each is bought from user corresponding to node.
Step 102: be respectively each from the Node configuration allocation of downlink duration that just begins, each from the first allocation of downlink duration that begins of node less than each total descending duration from node.
Particularly, each, can be understood as less than each total descending duration from node from the first allocation of downlink duration that begins of node, and any one is from the first total descending duration of allocation of downlink duration less than this node oneself that begin of node.For example, suppose that online HM has a and b.Wherein, a first begins the allocation of downlink duration less than the total descending duration of a oneself, the first total descending duration of allocation of downlink duration less than b oneself that begin of b.
Alternatively, total descending duration/x that the first allocation of downlink duration that begins=each HM can be assigned in the current PD cycle of each HM, x is natural number and 2≤x≤8.
Step 103: take the MAP cycle as unit, for each from node allocation of downlink duration.
Particularly, Centroid is in the mode of the scheduling of taking turns, for each from node allocation of downlink duration.
Step 104: according to distributing to each descending duration from node, upgrade each from the first allocation of downlink duration that begins of node, but obtain each from the current allocation of downlink duration of node, when but each current allocation of downlink duration from node all need distribute duration less than each single dispatching office from node, but upgrade each from the current allocation of downlink duration of node, but but the current allocation of downlink duration before each the current allocation of downlink duration from node after the renewal=renewal+allocation of downlink that just begins duration.
Particularly, according to distributing to each descending duration from node, upgrade each from the first allocation of downlink duration that begins of node, but obtain each from the current allocation of downlink duration of node, comprise: the first allocation of downlink duration that begins from each from node, deduct and distribute to each from the descending duration of node, but obtain each from the current allocation of downlink duration of node.
The embodiment of the invention is by being respectively each from the Node configuration allocation of downlink duration that just begins, each from the first allocation of downlink duration that begins of node less than each total descending duration from node; According to distributing to each descending duration from node, upgrade each from the first allocation of downlink duration that begins of node, but obtain each from the current allocation of downlink duration of node; Can be but that each is from the current allocation of downlink duration of node updates several times; When but each current allocation of downlink duration from node all need distribute duration less than each single dispatching office from node, but upgrade each from the current allocation of downlink duration of node, but but the current allocation of downlink duration before each the current allocation of downlink duration from node after the renewal=renewal+allocation of downlink that just begins duration; Like this, all are put on an equal footing from node, be but that all are from the current allocation of downlink duration of node updates in the identical moment, but can solve in the back in PD cycle some MAP cycles will only have more can being scheduled from node of total allocation of downlink time length ratio, but the HM that total allocation of downlink time length ratio is less is because the problem that does not have call duration time then can't be scheduled, but reduced the less time-delay from node of total allocation of downlink time length ratio, improved the user and experience.
Embodiment two
The embodiment of the invention HB in the HINCO provide a kind of bandwidth allocation methods as HM distributes bandwidth as example, and referring to Fig. 2, method flow comprises:
Step 201: Centroid is determined the total descending duration that each can be assigned in cycle at a PD from node.
Wherein, a PD cycle comprises a plurality of MAP cycles.
Particularly, before the cycle, specifically can be in the admittance process of HB and HM at the 1st MAP of current PD in the cycle, HB determines the total descending duration that each HM can be assigned in the cycle at a PD.
Further, this step 201 also comprises: Centroid is determined the total up duration that each can be assigned in cycle at a PD from node.
Wherein, each HM can be called total duration that each HM can be assigned in the cycle at current PD in total descending duration and the total up duration sum that current PD can be assigned in the cycle.Particularly, each HM refers at total duration that current PD can be assigned in the cycle, and each HM in the cycle during the transmission of data, reach the needed communication time of bandwidth that user corresponding to each HM buys at each PD.Therefore, each HM total duration that can be assigned in the cycle at current PD depends on the bandwidth that user corresponding to each HM buys.
In total duration, the shared ratio of total descending duration and total up duration can be predetermined ratio, and for example total descending duration accounts for 3/4, and total up duration accounts for 1/4.Like this, under the prerequisite of known total duration and ratio, can obtain total descending duration and total up duration.
Preferably, each HM can calculate according to formula 1 at total duration that current PD can be assigned in the cycle.Formula 1 is as follows:
Total_token=(B*T
Pd* T
MinThe formula of)/(N*8) 1
Wherein, total_token represents total duration that each HM can be assigned in the cycle at current PD, and unit is s(second); B represents the bandwidth that user corresponding to each HM buys, and unit is bps(bit per second, bits per second); T
PdThe duration (being generally 0.064s) in a PD cycle of expression, unit is s; N representation unit length data, unit is Byte; T
MinRepresent that each HM sends a minimum duration in the duration that unit length data consume, unit is s.
Alternatively, T
MinObtain manner comprise: at first, the modulation format (having stored each HM modulation format separately among the HB) according to each HM the transmission of data obtains message transmission rate V corresponding to each HM
nWherein, modulation format is corresponding one by one with message transmission rate.Secondly, adopt T
n=N/V
nCalculate respectively each HM and once send or accept the duration T that unit length data consume
nAt last, from T corresponding to each HM
nThe middle T value of minimum of selecting is as T
Min
By formula 1 as can be known, each HM is only determined by the bandwidth that user corresponding to each HM buys at total duration that each PD can be assigned in the cycle, the HM that bandwidth is larger, and it is more that it always can consume communication time.Particularly, formula 1 be by bandwidth formula proving out, the computing formula of bandwidth as shown in Equation 2:
Wherein, N
PdRepresent a PD amount of information that each HM need to communicate by letter in the cycle, unit is Byte.N
Pd* 8 expressions are converted to bit with the unit of amount of information by Byte.
Further, in conjunction with formula 2, the derivation of formula 1 comprises steps A～C:
Steps A, calculate N by formula 3
Pd
N
Pd=total_token*V
MinFormula 3
Wherein, V
MinWith T
MinCorresponding, represent the fastest in the traffic rate of each a HM traffic rate, unit is Byte/s(byte per second).
Step B, estimate out V by formula 4
Min
V
Min=N/T
MinFormula 4
Particularly, aforementioned unit length data N represents, single is dispatched the data volume that each HM once sent or accepted data.N is set point, usually is set as 1518Byte.
What deserves to be explained is, because the modulation format of the transmission of data may be different between the HM, so the T of each HM
nMay be different.From formula 1 as can be known, T
MinLarger, total communication time is larger, and selects T
MinReason be T
MinRepresent that the fastest HM of message transmission rate, as standard, can guarantee under the prerequisite of identical bandwidth T with the fastest that HM of message transmission rate
nLarger HM also can obtain and T
nThe minimum identical total communication time of HM, thus the fairness of shared network between the user further guaranteed.
Step C, with N
Pd(formula 3) and V
Min(formula 4) substitution formula 2 obtains formula 5:
Converse total_token according to formula 5, namely obtain formula 1.
Based on formula 1, suppose that each is R from the predetermined ratio that the total descending duration that is assigned to of node accounts for total duration, each total descending duration that is assigned to from node is total_token_down, then the computing formula of total_token_down such as formula 6:
Total_token_down=(B*T
Pd* T
MinThe * of)/(N*8) R formula 6
Step 202: be respectively each from the Node configuration allocation of downlink duration that just begins, each from the first allocation of downlink duration that begins of node less than each total descending duration from node.
Alternatively, total descending duration/x that the first allocation of downlink duration that begins=each HM can be assigned in the current PD cycle of each HM, x is natural number and 2≤x≤8.
This step 202 also comprises: be respectively each and just begin to distribute up duration from Node configuration, each begins to distribute up duration less than each total up duration from node from the first of node.
In actual applications, can a descending token bucket be set for each HM, initial token quantity of filling is corresponding with the allocation of downlink duration that just begins in the descending token bucket.HM of every descending scheduling just deducts from the descending token of HM of scheduling when the duration of sub-distribution to this HM, has upgraded token quantity in the descending token bucket.Similarly, can also a up token bucket be set for each HM.
Step 203: take the MAP cycle as unit, for each from node allocation of downlink duration.
Wherein, for each from node allocation of downlink duration, comprising: Centroid takes turns to dispatch each from node.Further, this step 203 comprises:
Step 2031: but judge whether the current current allocation of downlink duration from node of scheduling that needs need distribute duration less than the current single dispatching office from node of scheduling that needs.
Need distribute duration if but the current current allocation of downlink duration from node that need dispatch is not less than the current single dispatching office from node of scheduling that needs, then execution in step 2032; Otherwise, if but the current current allocation of downlink duration from node of scheduling that needs need distribute duration less than the current single dispatching office from node of scheduling that needs, and then execution in step 205.
Wherein, but the current current allocation of downlink duration of the HM of scheduling that needs can be according to distributing to each descending duration from node, but to upgrade the allocation of downlink duration that each obtains behind the first allocation of downlink duration that begins of node.For example, suppose that the current HM that need dispatch is n HM among N the HM.But the current allocation of downlink duration of n HM can be, remaining token quantity (specifically seeing also step 204) also in the descending token bucket of n HM.
Wherein, Centroid can be current the setting the current single dispatching office from node of scheduling that needs from node and needing the allocation of downlink duration of scheduling that need in advance.The single dispatching office needs the allocation of downlink duration to describe, and when HB dispatches a HM each time, need distribute to the up duration of this HM.In other words, HB determines that the current single dispatching office of the HM of scheduling that needs needs the allocation of downlink duration.The current single dispatching office of the HM of scheduling that needs needs the allocation of downlink duration to be preferably a predetermined value.
Step 2032: whether the residue of judging the current MAP cycle is planned descending total time slot need distribute duration more than or equal to the current single dispatching office from node of scheduling that needs.
Need distribute duration if the residue in current MAP cycle is planned descending total time slot more than or equal to the current single dispatching office from node of scheduling that needs, then execution in step 2033; Otherwise, if planning descending total time slot, the residue in current MAP cycle need distribute duration less than the current single dispatching office from node of scheduling that needs, then finish the distribution of the total time slot of actual downstream in current MAP cycle, execution in step 206.
The residue in current MAP cycle is planned descending total time slot, the descending total time slot (having distributed to the descending duration from node) that takies from node that the descending total time slot of the plan in current MAP cycle deducts that the current MAP cycle dispatched.
Particularly, HB presets the descending total time slot of plan (with the up total time slot of plan) in each MAP cycle.The descending total time slot of the plan in each MAP cycle represents the MAP cycle duration that downlink data transmission that HB plans takies, otherwise, the MAP cycle duration that the transmitting uplink data that the up total time slot of the plan in MAP cycle represents to plan takies.Usually, a MAP is in the cycle, and the ratio of planning between up total time slot and the descending middle time slot of plan is 1:3.
Step 2033: judge whether downlink data to send to current need scheduling from node.
If have downlink data to send to current need scheduling from node, then execution in step 2034; Otherwise, if without downlink data to send to current need scheduling from node, then execution in step 204.
Particularly, downlink data is the data that HB sends to HM, and HB can know whether and will send downlink data to which HM.
Step 2034: current need scheduling satisfy schedulable condition from node the time, for current need scheduling from node allocation of downlink duration.
Wherein, schedulable condition comprises: current not being scheduled when last rotation degree or need distributing the duration sum above setting threshold for the current descending duration and the current single dispatching office from node of scheduling that needs that distribute from node that need dispatch in last rotation degree from node of need dispatching.
Wherein, one takes turns and is scheduling to, and each was all dispatched once by Centroid at least from node.
Further, this step 2034 may further comprise the steps the A-step e:
Steps A: detect current whether when last rotation degree, being scheduled once at least from node of scheduling that need.
If what current need were dispatched be not scheduled execution in step D from node when last rotation degree; If what current need were dispatched had been scheduled once execution in step B from node at least when last rotation degree.
Wherein, one takes turns and is scheduling to, and each was all dispatched once by Centroid at least from node.Particularly, one take turns scheduling and comprise at least: according to the dispatching sequence, each was all dispatched once by Centroid successively from node.The dispatching sequence is the dispatching sequence who sets in advance, and supposes that online HM is a, b and c, and the dispatching sequence dispatches first b, dispatches a again, then dispatches c.So, one take turns scheduling and comprise at least: b, a, c were scheduled once successively.Easily know, the dispatching sequence not simultaneously, a scheduling sequencing of taking turns in the scheduling is different.For example, take turns in the scheduling one, the dispatching sequence can be a, b, c, perhaps b, a, c, perhaps c, a, b etc.
Step B: check in last rotation degree, need distribute the duration sum whether to surpass setting threshold for the current descending duration and the current single dispatching office from node of scheduling that needs that distribute from node of scheduling of needing.
When not surpassing predetermined threshold, execution in step C then; When surpassing predetermined threshold, execution in step E.
Preferably, this setting threshold can be, in last rotation degree, dispatched each need distribute the duration from node single dispatching office from node, a maximum duration; At this moment, setting threshold is the value of a dynamic change.
By way of example, if the single dispatching office of a, b and c need distribute duration to be followed successively by 0.1ms, 0.2ms and 0.3ms, that suppose first scheduling in the epicycle scheduling is b:
During scheduling b, b did not dispatch, and for b distributes 0.2ms, setting threshold is 0.2ms, and b has distributed 0.2ms;
Scheduling a, a did not dispatch, and was that a distributes 0.1ms, because 0.1ms is less than 0.2ms, so setting threshold or 0.2ms, a has distributed 0.1ms;
Scheduling c, c was not scheduled, and was that c distributes 0.3ms, because 0.3ms is greater than 0.2ms, so setting threshold changes to 0.3ms automatically, c has distributed 0.3ms;
Dispatch again b, because b has distributed the single dispatching office of 0.2ms+b to take long 0.2ms〉setting threshold 0.3ms, judge that b does not satisfy schedulable condition, b can not dispatch;
Dispatching a, is 0.3ms because a has distributed the single dispatching office of 0.1ms+a to take long 0.1ms＜setting threshold again, judges that a satisfies schedulable condition, and for a distributes 0.1ms, a has distributed 0.2ms;
Dispatch again c and since c distributed 0.3ms+c the single dispatching office take long 0.3ms setting threshold 0.3ms, judge that c does not satisfy schedulable condition, c can not dispatch;
Dispatch a again, because a has distributed the single dispatching office of 0.2ms+a to take long 0.1ms=setting threshold 0.3ms, judge that a does not satisfy schedulable condition, a can not dispatch, epicycle finishing scheduling (a, b, c all can not dispatch).
Need to prove, setting threshold can also by human configuration, be fixed value, for example a 0.3ms.By way of example, the single dispatching office of supposing a, b and c need distribute duration to be followed successively by 0.1ms, 0.2ms and 0.3ms.When setting threshold is 0.3ms, mean that c can only be scheduled once, b can be scheduled once, and a can be scheduled twice.
Step C: for current need scheduling from node allocation of downlink duration.
Particularly, for equaling the current single dispatching office from node of scheduling that needs, the current descending duration from the node distribution that need dispatch need distribute duration.
Step D: for current need scheduling from node allocation of downlink duration.
When predetermined threshold is in last rotation degree, dispatched each need distribute the duration from node single dispatching office from node, during a maximum duration, this step D also comprises: the more current size that need distribute duration and setting threshold from the single dispatching office of node that needs scheduling, if greater than, then upgrade setting threshold and be current need scheduling need distribute duration from node single dispatching office; If be not more than, then withdraw from this flow process.
Step e: detect each and whether all when last rotation degree, be scheduled at least once from node;
When each from node at least one from node not when being scheduled at least the last rotation degree time a time, scheduling is next from node; Otherwise, when each from node when all being scheduled at least time a time execution in step 205 the last rotation degree.
Repeated execution of steps A-step e, cyclic polling each from node, until finish the distribution of the total time slot of actual downstream in current MAP cycle.Particularly, the total time slot of the actual downstream in MAP cycle needs not be equal to the descending total time slot of plan.This is because the quantity of the HM of different MAP cycle descending schedulings is different, again because to distribute to the duration of different HM during single scheduling HM also different.By way of example, it is 1ms that the residue of supposing the current MAP cycle is planned descending total time slot, and it is 2ms that the current HM single dispatching office that needs scheduling need distribute duration, and the residue that this means the current MAP cycle is planned descending total time slot dispatches this current HM that needs scheduling not.At this moment, the descending planning in the current MAP cycle that can declare to be finished, the total time slot of the actual downstream in so current MAP cycle can shorten 1ms than the descending total time slot of plan.
Step 204: according to distributing to each descending duration from node, upgrade each from the first allocation of downlink duration that begins of node, but obtain each from the current allocation of downlink duration of node.
Particularly, after n HM is by descending scheduling, upgrade the descending token bucket of n HM: the token that distributes when from descending token bucket, deducting current descending scheduling (allocation of downlink that just begins duration deducts the descending duration of distributing to n HM), but obtain the current allocation of downlink duration of n HM.
Need to prove, in the step 2033, when to send to without downlink data current need scheduling from node the time, also can not upgrade each from the first allocation of downlink duration that begins of node.
Further, this step 204 also comprises: for each behind node allocation of downlink duration, upgrade current MAP cycle residue and plan descending total time slot.
Step 205: travel through each from node, whether all need distribute duration less than each single dispatching office from node but detect each current allocation of downlink duration from node;
When but each current allocation of downlink duration from node all need distribute duration less than each single dispatching office from node, but upgrade each from the current allocation of downlink duration of node, but but the current allocation of downlink duration before each the current allocation of downlink duration from node after the renewal=renewal+allocation of downlink that just begins duration.
Otherwise, but when at least one current allocation of downlink duration from node was not less than this at least one single dispatching office from node and need distributes duration, then execution in step 206.
Particularly, when the wheel finishing scheduling, if but the current allocation of downlink duration of each HM all need distribute duration less than the single dispatching office of each HM, mean that then each HM has not had assignable descending duration, at this moment, refill the token bucket of each HM, the token quantity of filling can be corresponding with the allocation of downlink duration that just begins.
Step 206: judge current the planning up total time slot from the node residue and whether being not less than the current single dispatching office from node of scheduling that needs and distributing duration of scheduling that need;
Need distribute duration if be not less than the current single dispatching office from node of scheduling that needs, then for current need scheduling distribute up duration from node.Distribute the process of up duration with the process of allocation of downlink duration, i.e. repeating step 203-205 for what current need were dispatched from node.
Otherwise, if need distribute duration less than the current single dispatching office from node of scheduling that needs, then finish the distribution of actual total time slot in this MAP cycle, carry out the distribution of the time slot in next MAP cycle.
The embodiment of the invention is by being respectively each from the Node configuration allocation of downlink duration that just begins, each from the first allocation of downlink duration that begins of node less than each total descending duration from node; According to distributing to each descending duration from node, upgrade each from the first allocation of downlink duration that begins of node, but obtain each from the current allocation of downlink duration of node; Can be but that each is from the current allocation of downlink duration of node updates several times; When but each current allocation of downlink duration from node all need distribute duration less than each single dispatching office from node, but upgrade each from the current allocation of downlink duration of node, but but the current allocation of downlink duration before each the current allocation of downlink duration from node after the renewal=renewal+allocation of downlink that just begins duration; Like this, all are put on an equal footing from node, be but that all are from the current allocation of downlink duration of node updates in the identical moment, but can solve in the back in PD cycle some MAP cycles will only have more can being scheduled from node of total allocation of downlink time length ratio, but the HM that total allocation of downlink time length ratio is less is because the problem that does not have call duration time then can't be scheduled, but reduced the less time-delay from node of total allocation of downlink time length ratio, improved the user and experience.
Embodiment three
The embodiment of the invention provides a kind of allocated bandwidth device, is applicable to the bandwidth allocation methods that embodiment one provides.This allocated bandwidth device can be Centroid.Referring to Fig. 3, this device comprises:
The embodiment of the invention is by being respectively each from the Node configuration allocation of downlink duration that just begins, each from the first allocation of downlink duration that begins of node less than each total descending duration from node; According to distributing to each descending duration from node, upgrade each from the first allocation of downlink duration that begins of node, but obtain each from the current allocation of downlink duration of node; Can be but that each is from the current allocation of downlink duration of node updates several times; When but each current allocation of downlink duration from node all need distribute duration less than each single dispatching office from node, but upgrade each from the current allocation of downlink duration of node, but but the current allocation of downlink duration before each the current allocation of downlink duration from node after the renewal=renewal+allocation of downlink that just begins duration; Like this, all are put on an equal footing from node, be but that all are from the current allocation of downlink duration of node updates in the identical moment, but can solve in the back in PD cycle some MAP cycles will only have more can being scheduled from node of total allocation of downlink time length ratio, but the HM that total allocation of downlink time length ratio is less is because the problem that does not have call duration time then can't be scheduled, but reduced the less time-delay from node of total allocation of downlink time length ratio, improved the user and experience.
Embodiment four
The embodiment of the invention provides a kind of allocated bandwidth device, is applicable to the bandwidth allocation methods that embodiment one or two provides.This allocated bandwidth device can be Centroid (for example HB).Referring to Fig. 4, this device comprises:
Alternatively, determination module 401 is determined the total descending duration that each can be assigned in cycle at a PD from node according to following formula:
total_token_down=(B*T
pd*T
min)/(N*8)*R
Wherein, total_token_down represents the total descending duration that each can be assigned in cycle at current PD from node, and B represents the bandwidth that each is bought from user corresponding to node, T
PdThe time span in a described PD cycle of expression, N representation unit length data, T
MinRepresent each each minimum time from the time that described unit length data of node transmission consume from node, R represents each from the predetermined ratio that the total descending duration that is assigned to of node accounts for total duration, total duration is each total descending duration and total up duration sum that can be assigned in the cycle at current PD from node.
Alternatively, total descending duration/x that the first allocation of downlink duration that begins=each HM can be assigned in the current PD cycle of each HM, x is natural number and 2≤x≤8.
Alternatively, distribution module 403 comprises:
The first judging unit 4031, but be used for judging whether the current current allocation of downlink duration from node of scheduling that needs need distribute duration less than the current single dispatching office from node of scheduling that needs.
The second judging unit 4032, but be not less than the current single dispatching office from node of scheduling that needs and need distribute duration if be used for the current current allocation of downlink duration from node that needs scheduling, the residue of then judging the current MAP cycle is planned descending total time slot and whether need be distributed duration more than or equal to the current single dispatching office from node of scheduling that needs.
Alternatively, the setting threshold that allocation units 4033 adopt be in last rotation degree, dispatched from node each descending duration that when the node single is scheduled, is assigned to, a descending duration of maximum.
Judge Centroid whether have downlink data send to current need scheduling from node; If have downlink data send to current need scheduling from node, then current need scheduling satisfy schedulable condition from node the time, for current need scheduling from node allocation of downlink duration.
If without downlink data send to current need scheduling from node, then need distribute duration from the current current single dispatching office from node of scheduling that needs of from the first allocation of downlink duration that begins of node, deducting of scheduling that needs, but obtain the current current allocation of downlink duration from node that needs scheduling.
The embodiment of the invention is by being respectively each from the Node configuration allocation of downlink duration that just begins, each from the first allocation of downlink duration that begins of node less than each total descending duration from node; According to distributing to each descending duration from node, upgrade each from the first allocation of downlink duration that begins of node, but obtain each from the current allocation of downlink duration of node; Can be but that each is from the current allocation of downlink duration of node updates several times; When but each current allocation of downlink duration from node all need distribute duration less than each single dispatching office from node, but upgrade each from the current allocation of downlink duration of node, but but the current allocation of downlink duration before each the current allocation of downlink duration from node after the renewal=renewal+allocation of downlink that just begins duration; Like this, all are put on an equal footing from node, be but that all are from the current allocation of downlink duration of node updates in the identical moment, but can solve in the back in PD cycle some MAP cycles will only have more can being scheduled from node of total allocation of downlink time length ratio, but the HM that total allocation of downlink time length ratio is less is because the problem that does not have call duration time then can't be scheduled, but reduced the less time-delay from node of total allocation of downlink time length ratio, improved the user and experience.
Need to prove: the allocated bandwidth device that above-described embodiment provides is when distributing bandwidth, only the division with above-mentioned each functional module is illustrated, in the practical application, can as required the above-mentioned functions distribution be finished by different functional modules, the internal structure of the equipment of being about to is divided into different functional modules, to finish all or part of function described above.In addition, allocated bandwidth device and bandwidth allocation methods embodiment that above-described embodiment provides belong to same design, and its specific implementation process sees embodiment of the method for details, repeats no more here.
The invention described above embodiment sequence number does not represent the quality of embodiment just to description.
The all or part of step that one of ordinary skill in the art will appreciate that realization above-described embodiment can be finished by hardware, also can come the relevant hardware of instruction to finish by program, described program can be stored in a kind of computer-readable recording medium, the above-mentioned storage medium of mentioning can be read-only memory, disk or CD etc.
The above only is preferred embodiment of the present invention, and is in order to limit the present invention, within the spirit and principles in the present invention not all, any modification of doing, is equal to replacement, improvement etc., all should be included within protection scope of the present invention.
Claims (12)
1. a bandwidth allocation methods is characterized in that, described method comprises:
Centroid is determined the total descending duration that each can be assigned in cycle at a PD from node, and a described PD cycle comprises a plurality of MAP cycles;
Be respectively that each is described from the Node configuration allocation of downlink duration that just begins, each described first allocation of downlink duration that begins from node is less than each described described total descending duration from node;
Take the described MAP cycle as unit, described from node allocation of downlink duration for each;
According to distributing to each described descending duration from node, upgrade each described first allocation of downlink duration that begins from node, but obtain each described current allocation of downlink duration from node, when but each described current allocation of downlink duration from node all need distribute duration less than each described single dispatching office from node, but upgrade each described current allocation of downlink duration from node, but but the described current allocation of downlink duration before each described current allocation of downlink duration from the node=renewal after the renewal+described allocation of downlink duration that just begins.
2. method according to claim 1 is characterized in that, described take the described MAP cycle as unit, described from node allocation of downlink duration for each, comprising:
Judge but whether the current current allocation of downlink duration from node of scheduling that needs need distribute duration less than the described current single dispatching office from node of scheduling that needs;
Need distribute duration if but the described current current allocation of downlink duration from node that needs scheduling is not less than the described current single dispatching office from node of scheduling that needs, the residue of then judging the current MAP cycle is planned descending total time slot and whether need be distributed duration more than or equal to the described current single dispatching office from node of scheduling that needs;
If planning descending total time slot, the residue in described current MAP cycle need distribute duration more than or equal to the described current single dispatching office from node of scheduling that needs, then described current need scheduling satisfy schedulable condition from node the time, for described current need scheduling from node allocation of downlink duration, described schedulable condition comprises: described current not being scheduled when last rotation degree from node of scheduling that need, or need distribute the duration sum above setting threshold for the described current descending duration that distributes from node of scheduling that needs with the described current single dispatching office from node of scheduling that needs described in the last rotation degree;
Each is described from node for cyclic polling, until finish the distribution of the total time slot of actual downstream in described current MAP cycle.
3. method according to claim 2 is characterized in that,
Described setting threshold be described in the last rotation degree, that has dispatched is described from node each described descending duration that is assigned to when the node single is scheduled, a maximum descending duration.
4. method according to claim 3 is characterized in that, described current need scheduling satisfy schedulable condition from node the time, for described current need scheduling from node allocation of downlink duration, comprising:
Judge described Centroid whether have downlink data send to described current need scheduling from node;
If have described downlink data send to described current need scheduling from node, then described current need scheduling satisfy described schedulable condition from node the time, for described current need scheduling from node allocation of downlink duration.
5. method according to claim 4 is characterized in that, described basis has been distributed to each described descending duration from node, upgrades each described first allocation of downlink duration that begins from node, comprising:
If without described downlink data send to described current need scheduling from node, then need distribute duration from the described current described current single dispatching office from node of scheduling that needs of from the first allocation of downlink duration that begins of node, deducting of scheduling that needs.
6. each described method is characterized in that according to claim 1-5, and described Centroid is determined each described total descending duration that can be assigned in the cycle at a PD from node according to following formula:
total_token_down=(B*T
pd*T
min)/(N*8)*R
Wherein, total_token_down represents each described total descending duration that can be assigned in the cycle at current PD from node, and B represents each described bandwidth of buying from user corresponding to node, T
PdThe time span in a described PD cycle of expression, N representation unit length data, T
MinRepresent that each describedly sends the minimum time the time that described unit length data consume from node, R represents each described predetermined ratio that accounts for from the total descending duration that is assigned to of node total duration, described total duration is each described total descending duration and total up duration sum that can be assigned in the cycle at current PD from node.
7. an allocated bandwidth device is characterized in that, described device comprises:
Determination module is used for determining each total descending duration that can be assigned in the cycle at a PD from node that a described PD cycle comprises a plurality of MAP cycles;
Module is set, is used for being respectively that each is described from the Node configuration allocation of downlink duration that just begins, each described first allocation of downlink duration that begins from node is less than each described described total descending duration from node;
Distribution module, be used for take the described MAP cycle as unit, described from node allocation of downlink duration for each;
Update module, be used for according to distributing to each described descending duration from node, upgrade each described first allocation of downlink duration that begins from node, but obtain each described current allocation of downlink duration from node, when but each described current allocation of downlink duration from node all need distribute duration less than each described single dispatching office from node, but upgrade each described current allocation of downlink duration from node, but but the described current allocation of downlink duration before each described current allocation of downlink duration from the node=renewal after the renewal+described allocation of downlink duration that just begins.
8. device according to claim 7 is characterized in that, described distribution module comprises:
The first judging unit, but be used for judging whether the current current allocation of downlink duration from node of scheduling that needs need distribute duration less than the described current single dispatching office from node of scheduling that needs;
The second judging unit, but be not less than the described current single dispatching office from node of scheduling that needs and need distribute duration if be used for the described current current allocation of downlink duration from node that needs scheduling, the residue of then judging the current MAP cycle is planned descending total time slot and whether need be distributed duration more than or equal to the described current single dispatching office from node of scheduling that needs;
Allocation units, need distribute duration if plan descending total time slot for the residue in described current MAP cycle more than or equal to the described current single dispatching office from node of scheduling that needs, then described current need scheduling satisfy schedulable condition from node the time, for described current need scheduling from node allocation of downlink duration, described schedulable condition comprises: described current not being scheduled when last rotation degree from node of scheduling that need, or need distribute the duration sum above setting threshold for the described current descending duration that distributes from node of scheduling that needs with the described current single dispatching office from node of scheduling that needs described in the last rotation degree; Each is described from node for cyclic polling, until finish the distribution of the total time slot of actual downstream in described current MAP cycle.
9. device according to claim 8 is characterized in that,
The described setting threshold that described allocation units adopt be described in last rotation degree, that has dispatched is described from node each described descending duration that is assigned to when the node single is scheduled, a descending duration of maximum.
10. device according to claim 9 is characterized in that, described allocation units also are used for:
Judge described Centroid whether have downlink data send to described current need scheduling from node;
If have described downlink data send to described current need scheduling from node, then described current need scheduling satisfy described schedulable condition from node the time, for described current need scheduling from node allocation of downlink duration.
11. device according to claim 10 is characterized in that, described update module also is used for:
If without described downlink data send to described current need scheduling from node, then need distribute duration from the described current described current single dispatching office from node of scheduling that needs of from the first allocation of downlink duration that begins of node, deducting of scheduling that needs.
12. each described device is characterized in that according to claim 7-11, described determination module is determined each described total descending duration that can be assigned in the cycle at a PD from node according to following formula:
total_token_down=(B*T
pd*T
min)/(N*8)*R
Wherein, total_token_down represents each described total descending duration that can be assigned in the cycle at current PD from node, and B represents each described bandwidth of buying from user corresponding to node, T
PdThe time span in a described PD cycle of expression, N representation unit length data, T
MinRepresent that each describedly sends the minimum time the time that described unit length data consume from node, R represents each described predetermined ratio that accounts for from the total descending duration that is assigned to of node total duration, described total duration is each described total descending duration and total up duration sum that can be assigned in the cycle at current PD from node.
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 true CN103368871A (en) | 2013-10-23 |
| CN103368871B 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) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104580015A (en) * | 2014-12-24 | 2015-04-29 | 中国船舶重工集团公司第七二二研究所 | Communication method and device based on HINOC |
| CN110519110A (en) * | 2019-10-12 | 2019-11-29 | 驷途(上海)科技有限公司 | Cloud broadband configuration device |
| CN111585850A (en) * | 2020-04-09 | 2020-08-25 | 北京瀚诺半导体科技有限公司 | HINOC channel binding method, chip and equipment |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2003084152A1 (en) * | 2002-03-28 | 2003-10-09 | Marconi Uk Intellectual Property Ltd | Method and arrangement for dinamic allocation of network resources |
| 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 |
-
2013
- 2013-07-25 CN CN201310316411.7A patent/CN103368871B/en active Active
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2003084152A1 (en) * | 2002-03-28 | 2003-10-09 | Marconi Uk Intellectual Property Ltd | Method and arrangement for dinamic allocation of network resources |
| 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系统的调度机制研究", 《万方硕士学位论文库》 * |
| 彭武熹等: "HINOC网络中的动态带宽调度算法", 《电脑知识与技术》 * |
Cited By (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104580015A (en) * | 2014-12-24 | 2015-04-29 | 中国船舶重工集团公司第七二二研究所 | Communication method and device based on HINOC |
| CN104580015B (en) * | 2014-12-24 | 2018-06-19 | 中国船舶重工集团公司第七二二研究所 | Communication means and device based on HINOC |
| CN110519110A (en) * | 2019-10-12 | 2019-11-29 | 驷途(上海)科技有限公司 | Cloud broadband configuration device |
| CN110519110B (en) * | 2019-10-12 | 2023-06-23 | 驷途(上海)科技有限公司 | Cloud broadband configuration device |
| CN111585850A (en) * | 2020-04-09 | 2020-08-25 | 北京瀚诺半导体科技有限公司 | HINOC channel binding method, chip and equipment |
| CN111585850B (en) * | 2020-04-09 | 2021-06-15 | 北京瀚诺半导体科技有限公司 | HINOC channel binding method, chip and equipment |
Also Published As
| Publication number | Publication date |
|---|---|
| CN103368871B (en) | 2016-08-10 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| JP2020519036A5 (en) | ||
| CN103298079B (en) | Data transmission method, access point and site | |
| CN112165691A (en) | Content delivery network scheduling method, device, server and medium | |
| RU2006122543A (en) | SERVICE QUALITY PLANNER FOR A WIRELESS COMMUNICATION NETWORK | |
| CN104053239B (en) | A kind of time-domain resource distribution method and device | |
| CN110392360A (en) | A kind of available resources report method and device | |
| CN103368871A (en) | Bandwidth allocation method and bandwidth allocation device | |
| CN103118435B (en) | A kind of node scheduling method, equipment and system | |
| CN103906242A (en) | Wireless communication method, system, base station and user equipment | |
| CN104363635A (en) | Rapid energy consumption optimization stream medium application bandwidth resource allocation method | |
| KR20110023126A (en) | Real time charging system and method for modification control of quality of service and charging | |
| CN102595419A (en) | Method and system for spectrum allocation in cognitive radio network | |
| CN110401522B (en) | Data communication device, controller and data communication method thereof | |
| CN103313411A (en) | Multiservice resource distribution method and device | |
| CN104580015A (en) | Communication method and device based on HINOC | |
| CN101765033B (en) | Dynamic time slot allocating method applied to coaxial load-bearing Ethernet equipment | |
| CN101127704B (en) | A method and device for dynamic bandwidth allocation | |
| CN103260196B (en) | A kind of control method of transmission bandwidth, Apparatus and system | |
| JP2001203696A (en) | Artificial satellite mount data bus control method, and its system | |
| CN102883326A (en) | Method for distributing frequency spectrum resources in cognitive network | |
| KR20070091504A (en) | Method and system for allocating resource to heterogeneous mobile stations based on distributed scheduling in a wireless communication system | |
| CN104509133B (en) | Device-to-device closes in service method, base station and the user equipment for transmitting signal | |
| CN103428873B (en) | Method, user terminal and the base station of information processing | |
| WO2018213638A1 (en) | Devices, systems, and methods for resource allocation of shared spectrum | |
| US20150270986A1 (en) | Credit-based dynamic bandwidth allocation for time-division multiple access communications |
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 |