CN101248619A - Distributed wireless network with dynamic bandwidth allocation - Google Patents
Distributed wireless network with dynamic bandwidth allocation Download PDFInfo
- Publication number
- CN101248619A CN101248619A CNA2006800257688A CN200680025768A CN101248619A CN 101248619 A CN101248619 A CN 101248619A CN A2006800257688 A CNA2006800257688 A CN A2006800257688A CN 200680025768 A CN200680025768 A CN 200680025768A CN 101248619 A CN101248619 A CN 101248619A
- Authority
- CN
- China
- Prior art keywords
- bandwidth
- communication
- node
- communication node
- time slot
- 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.)
- Pending
Links
- 238000004891 communication Methods 0.000 claims abstract description 161
- 238000000034 method Methods 0.000 claims description 44
- 230000005540 biological transmission Effects 0.000 claims description 15
- 238000012546 transfer Methods 0.000 claims description 10
- 230000006870 function Effects 0.000 claims description 4
- 238000007726 management method Methods 0.000 claims description 3
- 230000008569 process Effects 0.000 description 12
- 230000015572 biosynthetic process Effects 0.000 description 5
- 230000008859 change Effects 0.000 description 5
- 230000001052 transient effect Effects 0.000 description 4
- 230000003044 adaptive effect Effects 0.000 description 3
- 230000007774 longterm Effects 0.000 description 3
- 244000287680 Garcinia dulcis Species 0.000 description 2
- 230000009471 action Effects 0.000 description 2
- 238000013528 artificial neural network Methods 0.000 description 2
- 230000006399 behavior Effects 0.000 description 2
- 238000005516 engineering process Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 238000012986 modification Methods 0.000 description 2
- 230000001537 neural effect Effects 0.000 description 2
- 230000009467 reduction Effects 0.000 description 2
- 101800004660 Aldosterone secretion inhibitory factor Proteins 0.000 description 1
- 230000006978 adaptation Effects 0.000 description 1
- 238000013459 approach Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000008901 benefit Effects 0.000 description 1
- 230000003139 buffering effect Effects 0.000 description 1
- 230000006835 compression Effects 0.000 description 1
- 238000007906 compression Methods 0.000 description 1
- 125000004122 cyclic group Chemical group 0.000 description 1
- 230000001419 dependent effect Effects 0.000 description 1
- 238000007599 discharging Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 230000003993 interaction Effects 0.000 description 1
- 230000007246 mechanism Effects 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 238000012545 processing Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 230000009897 systematic effect Effects 0.000 description 1
- 239000002699 waste material Substances 0.000 description 1
Images
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W72/00—Local resource management
- H04W72/20—Control channels or signalling for resource management
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
- Small-Scale Networks (AREA)
Abstract
A communications network comprising a plurality of communications nodes, wherein each of said plurality of communications nodes can transmit data over a variable bandwidth, each communications node comprising: the apparatus comprises means for predicting its own bandwidth demand, means for transmitting its own predicted own bandwidth demand to the network, means for obtaining bandwidth demand information of other communication nodes on the network, and means for determining its own bandwidth allocation according to a uniform bandwidth allocation scheme, the uniform bandwidth allocation scheme being applicable to the plurality of communication nodes.
Description
Invention field
The present invention relates to a kind of communication network, particularly a kind of distributed wireless communication network.More specifically but non-exclusive ground the present invention relates to a kind of distributed wireless networks with Dynamic Bandwidth Allocation.
Background of invention
Expect to have a kind of communication network, can the dynamic assignment transmission bandwidth to a plurality of communication nodes that are connected to network, satisfying the instant traffic demand of individual node, thereby enhanced quality-of-service (QOS).Dynamic Bandwidth Allocation is a broad terms, and it relates to the method according to instant demand distribute data transmission bandwidth on communication network.In a data communication network, the available bandwidth summation on the network is limited all the time, and each communication node is obliged to go to compete the bandwidth of sufficient amount, so that can transmit data to reach the QOS level of an expectation.For a centralized network, all flows must be through a central controller, and the bandwidth that is assigned to each communication node that is connected to network can be determined by central controller at an easy rate.
On the other hand, in a non-centralized or distributed communication network, there is not central controller.For this distributed communication network, the optimum allocation transmission bandwidth is the work of a difficulty to single communication node.
There is a kind of cut-in method to be proposed for distributed communication network based on competition.But this cut-in method produces a timetable (schedule) usually, and it does not consider the service request or the order of priority of various flows, thus be not desired, because it can not guarantee the service quality of a reasonable level.
In another kind of conventional dynamic bandwidth allocation scheme, flow is classified, and distributes bandwidth according to the preferred order rule of a set of regulations.For example, the data traffic (as video flow) to delay-sensitive is better than being transmitted postponing insensitive data traffic (as the general data flow).When the limited available bandwidth of one of the data traffic of equal priority competition, the possibility of result of allocated bandwidth is difficult to prediction a bit.
And the conventional dynamic bandwidth allocation scheme is normally moved under the hypothesis of known demand bandwidth.This may not gear to actual circumstances.Unsteady flow amount pattern when for example, data traffic has one.The bandwidth allocation scheme of operation will not be optimum on known bandwidth demand hypothesis.
Goal of the invention
So, the purpose of this invention is to provide a kind of distributed communication network that strengthens the Dynamic Bandwidth Allocation scheme that has.
On minimum level, the purpose of this invention is to provide a kind of Dynamic Bandwidth Allocation scheme and be used for distributed communication network.
Summary of the invention
In a broad aspect, the invention describes a kind of communication network that comprises a plurality of communication nodes, each communication node in wherein said a plurality of communication nodes can be at a bandwidth varying transmitting data, and each communication node comprises:
Predict the device of himself bandwidth demand,
Transmit the device of self bandwidth demand of its prediction to network,
Obtain other communication node on the network bandwidth demand information device and
Determine the device of himself allocated bandwidth according to a unified bandwidth allocation scheme, described unified bandwidth allocation scheme can be used for described a plurality of communication node.
Dynamic Bandwidth Allocation has promoted the effective bandwidth utilization on the distributed communication network.
Another aspect the invention provides a kind of bandwidth management method of distributed communication network, and this distributed communication network comprises a plurality of communication nodes, and this method may further comprise the steps:
Predict the bandwidth demand of a plurality of communication nodes,
The bandwidth demand that transmits described a plurality of communication nodes to described communication network,
According to a unified distribution scheme of being shared by described a plurality of communication nodes, the allocate communications bandwidth is to described a plurality of communication nodes.
Preferably, the described bandwidth requirement of a communication node is broadcast to described a plurality of communication node.Each communication node in a plurality of communication nodes can obtain identical bandwidth requirement information, so that carry out optional allocated bandwidth.
Preferably, a kind of time division multiple access access protocol is used in network service, this agreement is divided into a plurality of time slots with one in network communication period, the time slot of one defined amount is used for switching bandwidth information between the communication node by reservation, and the time slot of a defined amount is used for the transfer of data of communication node by reservation.
Preferably, each time channel is a super frame that comprises 256 time slots, and each time slot is that 256 μ s are long, and the regulation time slot in the super frame is reserved to a concrete communication node, is used for switching bandwidth information and enters transmitted data on network.
Preferably, the bandwidth demand of described a plurality of communication nodes was broadcasted during beacon period.
Preferably, described unified bandwidth allocation scheme comprises a fair share allocative decision, and thus, the transmission bandwidth of distributing to a concrete communication node depends on the overall bandwidth demand of the bandwidth demand of its prediction with respect to described a plurality of communication nodes.
Preferably, each communication node in described a plurality of communication node comprises that competition when bandwidth when a described communication node demand exceeds the bandwidth that described communication node reserves obtains the device of extra bandwidth.
Preferably, described extra bandwidth is that communication node obtains by one group of public bandwidth contention agreement competition of described a plurality of communication nodes.
Preferably, only have a communication node to be allowed to compete during a described time slot and obtain extra bandwidth, described during this period a plurality of communication nodes can communicate mutually.
Preferably, the predetermined bandwidth allocation rule is included as the rule of communication node layout allocated bandwidth order of priority.
Preferably, each communicator is included in the device that produces data communication on the bandwidth varying on described distributed network.
Preferably, the described device that produces data communication on described distributed network can improve and reduce the data communication bandwidth of described communication node, is to be broadcasted in described communication network during beacon period in raising on the data communication bandwidth and reduction.
Preferably, described communication node also comprises the device that the release data communication bandwidth when prediction bandwidth demand when described communication node is lower than existing bandwidth is used for other communication node.
Preferably, described communication node comprises that also the competition when prediction bandwidth demand when described communication node is higher than current bandwidth obtains the excessive data communication bandwidth for the device that himself uses.
Preferably, the described device of a communication node bandwidth demand of prediction comprises from the flow rate mode of nearest input flow rate and predicts the device of input flow rate bandwidth following closely.
Preferably, predict that the described device of described communication node bandwidth demand also comprises the device of determining data in buffer flow on the described communication node, so the bandwidth demand of prediction is the function of the flow rate mode of current input stream amount and buffer memory flow.
Description of drawings
In conjunction with example also with reference to the accompanying drawings, below will describe the preferred embodiments of the present invention in detail, wherein:
Fig. 1 is a network layer model according to the video transmission width of IEEE 1394 or the last USB of UWB,
Fig. 2 is the flow chart of an exemplary dynamic bandwidth allocation scheme of the present invention,
Fig. 3 is the algorithm flow chart that a communication node discharges bandwidth,
Fig. 4 is a flow chart that discharges bandwidth to the replacement scheme of network,
Fig. 5 show an exemplary distribution formula network of the present invention and
Fig. 6 is the module map of a typical node.
Preferred embodiment describes in detail
A decentralized network that moves under WiMedia (multi-band OFDM alliance) agreement below will be described, it is as a case study on implementation that adopts the communication network of exemplary distribution formula allocated bandwidth (DBA) scheme.But, should be appreciated that DBA scheme of the present invention and equipment are not limited to the WiMedia system, can be applied to any from group (ad hoc) distributed communication network, particularly supports " beacon " cycle and based on compete/based on the network in reservation data cycle.
For the ease of understanding this case study on implementation, below will be to making schematic illustration by the part of the MAC layer of WiMedia definition.
In a WiMedia MAC distributed network, there is not central controller to go define grid structure and running.Communication node is connected to network, and shares transmission bandwidth by an agreement based on TDMA (time-domain multiple access access).Channel time is divided into " super frame ".Each super frame is that 65ms is long, comprises 256 time slots, and each time slot is that 256 μ s are long, and it is called as medium access access slot (" MAS ").Therefore, this network is a tdma system, in any moment an equipment transmission data is only arranged all.In the beginning of each super frame, there is a beacon period.This beacon period is a data transfer cycles subsequently.In beacon period, each communication equipment (or communication node) sends its beacon package in turn.In a beacon package, information word (IEs) will be broadcasted, and therefore the state of a node will be learned by other node.In data transfer cycles, node can or preferentially be competed access (PCA) and get permission to enter channel by distributed reservation protocol (DRP).DRP is that an equipment is reserved some time slots for the method for its transmission information to miscellaneous equipment.If a time slot is reserved by an equipment, miscellaneous equipment just cannot transmit data during this period.To the time slot of not reserved by any equipment, any equipment can enter channel by the PCA competition during this period.
The IEs that sends in beacon comprises the IEs (ASIEs) of DRP IEs and some application specific.A DRP IE comprises the information of equipment reservation time slot, is used to be transferred to another destination node.For example, still be sent to another node, must send two DRP IEs if make another reservation.ASIE is the IE of a vendor-specific, and it is used for sending the information of concrete application or algorithm requirement normally by each supplier's definition.Diversified ASIEs can be defined and be used for various application.But, should be understood that the ASIF of a supplier's equipment may not understood by another supplier's equipment because ASIE is a vendor-specific.
Fig. 1 shows a hierarchical node network model, wherein has a typical DBA algorithm stationed.This is the typical structure of a media application node.At its top, Video Applications layer 110 and customer interaction.Protocol adaptation layers (PAL) 120 provides a platform, so that the data format of different application layer is worked with a public UWB (super wideband) MAC layer 130.Upper-layer protocol can comprise USB, 1394, IP or other suitable agreement, and is involved by reference to the present invention at this proper standard.The DBA scheme will be implemented on the MAC layer, and it also will comprise a packets of information transmitting and scheduling program and other MAC and procotol, insert with the Internet resources of realizing coordinating.Actual transmissions will realize by PHY (physics) layer and actual channel.
When a communication node is allowed when entering in the network, it permits a bandwidth according to qos requirement is initial.For example, once allowing that the initial bandwidth that enters network may be based on average data rate.In a WiMedia system, the bandwidth of allowance will be the form of DRP time slot.For variable bit rate (VBR) flow, actual instant data transfer rate may be same as average data rate far from.A fixed-bandwidth distribution completely will cause the bad service quality or the non-effective utilization of resources or both to have concurrently.For example, if require a high service quality, the bandwidth of distribution should be near the maximum data rate in source.But in this case, most of bandwidth will be wasted, because maximum data rate only is can reach once in a while.On the other hand, if to the less bandwidth of each devices grant to reach better utilization, the service quality in the time of will having to sacrifice High Data Rate.A kind of Dynamic Bandwidth Allocation scheme of the present invention will relax this predicament.
The DBA scheme comprises following part, and specifies with reference to figure 2-4.
The prediction input flow rate
For example, when each time interval k finishes, with the queue length (q that checks on the buffer in each source
k).With an algorithm in the algorithm of discussing, will carry out the input information bag (λ of next time slot based on following
k) prediction of number.Predicting when time interval k finishes, need processed expection communication flows be X on time interval k+1
k=q
k+ λ
k
The computation bandwidth demand
Then, the flow of prediction is used to determine the suitable distribution that a source should obtain in next time slot.Expection bandwidth X
k, will distribute F with current bandwidth
kWhether compare, should be more, still less or constant with the distribution of determining next time interval k+1.
If X
k-F
k=0, F
K+1=F
k
If X
k-F
k＜0, F
K+1=X
k, bandwidth F
k-X
kTo contribute to dynamic pond (dynamic pool).
If X
k-F
k＞0, this node will use an algorithm in the algorithm discussed below can determine Fk+1 by the more bandwidth of DBA competition.
Discharge extra bandwidth
All ' additionally ' bandwidth of being contributed by low data rate equipment by the time slot delivery mode will be counted as a bandwidth pool (C) that can be used for dynamic assignment.These bandwidth will be assigned to the node of the more bandwidth of competition, and will be for example, following with a kind of method in the method that comes into question by using.
Those have doped the node that requires a littler bandwidth during next super frame, for example, can announce the number of time slot of " release " temporarily in its beacon package by using an ASIE.Similarly, those nodes that require more bandwidth also can announce to want the number of time slot of asking by an ASIE in its beacon.Therefore, each node will have enough information to go to calculate its fair share (fairshare) bandwidth.But, should be understood that the bandwidth of this " release " does not relate to the cancellation that any DRP reserves.It only is temporary transient discharging, and is effective before next bandwidth prediction process.On next super frame, each node will distribute at the enterprising uplink bandwidth of its concrete allocated bandwidth hypothesis identical with the initial bandwidth that enters network.
Obtain to distribute bandwidth
Jump the example of system equally with reference to the 1-of Fig. 5, all nodes can obtain the identical information of related network.When carrying out fair allocat calculating, will obtain identical result.Like this, which node order of priority that will enter which " d/d " time slot will be determined.Can enter these available time slot by PCA.In this scheme, only there is a node that ' competition ' obtained to enter.Thereby will guarantee that it enters successfully.The flow chart of typical method that enters " d/d " time slot is shown in Figure 4 and 5.
Use this DBA scheme, each node can initially be allowed a bandwidth that equals its average data rate.With regard to statistics, at any time, probably some sources will have one than the higher data transfer rate of average data rate and there is a data transfer rate lower than average data rate in other source.The DBA scheme will temporarily not redistributed is had the source of high temporary transient data transfer rate by any ' additionally ' bandwidth with source use of low temporary transient data transfer rate to another.The flow process of this scheme as shown in Figure 2.With reference to Fig. 2, at first carry out a volume forecasting algorithm 210, prediction is based on previous flow.In conjunction with current buffer occupancy amount, calculate and before next predetermined period, handle the needed total number of time slot of desired flow (Xi) (220).In step 220, Xi is divided by the time (Tp) (is unit with the frame) before the next one prediction.
The DRP number of time slot that requires during this cycle is calculated.This number and the DRP time slot of having reserved (Favg) are compared, if they are identical, the distribution of next cycle (Fi+1) will remain Favg, without any need for further action, shown in step 230; If the former is higher, to in beacon, announce the extra slots number that it needs, and collect with category information to produce " fair share " number that will enter the extra slots of next cycle from other node, and reserve time slot with and suitable " additionally " time slot transmission data of having obtained, shown in step 240; If the former is littler, will abdicate " extra slots ", and in its beacon, announce this category information, data are only reserved time slot in residue and are sent out, shown in step 250.
In order to obtain effective Dynamic Bandwidth Allocation, expectation can the accurate description bandwidth demand.For fear of lost packets, the flow number in buffer must not surpass certain length, and packets of information can not stop in buffer an expansion time cycle.Therefore, when the forecast demand bandwidth, should consider input flow rate and the flow number in buffer.The total flow number that will provide more complete needs to handle like this.Although the actual quantity of input flow rate is unknown, can be easy to determine the flow number in buffer.In this, the data of current buffering also can be used for carrying out volume forecasting.Accurately prediction is very important, because if ask too many bandwidth, will waste resource.On the other hand, if ask bandwidth very little, might lose some packets of information.Therefore, a good Forecasting Methodology will be beneficial to and obtain an effective DBA.
For example, for the MPEG video, have been found that its flow rate mode obeys an autoregression (AR) model very approx.Use this discharge model, can obtain gratifying prediction, this will all obey this AR model although will be appreciated that the flow of not all type in following explanation.For those non-AR flows, may need other Forecasting Methodology.For example, have been found that internet traffic is non-linear and self similarity, when the applied forecasting scheme, need consider this category feature.For example, the scheme based on neural net or fuzzy (fuzzy) logic has put forward.This type of example comprises feedforward neural network (Boosting Feed Forward Neural Network) and adaptive fuzzy cluster (the Adaptive Fuzzy Clustering) technology quickened.When lacking suitable Forecasting Methodology, for example, if they are too complicated or be not very accurate, by using the information on queue length in the buffer, the DBA scheme still can improve systematic function to a certain extent.In the typical case implemented, predicted flow rate and buffer queue length had equal weight, and handled in the same manner.Certainly, when making bandwidth request, consider separately some factor or use unequal weight also to be fine.This mainly is to reflect on the specific algorithm of determining entry time.
In order to handle it and after the amount of bandwidth that requires has been determined, be necessary the relatively number of this bandwidth demand and distributed time slot at a node at the flow of next " wheel " lining.If the number of time slot that number of time slot distributes when entering network is identical, then do not need to carry out the bandwidth adjustment.More or less if desired time slot, this category information is comprised in its beacon package under the WiMedia situation, and this information can be added in the ASIE.Because beacon package is a broadcast, it will be learned by all nodes on the network, and comprise the key message that communication linkage between network and the node successfully is set about each node, so bandwidth information will be known concerning all nodes.Bandwidth information will comprise, for example, and the extra slots number that needs, can d/d number of time slot and/or destination address and stream ID.In some examples, may require more information, this will be in following explanation.
After beacon period on super frame, each node has been collected the information of all other nodes.At this moment, each node has known also whether it is the target of any one this bandwidth request or ' release '.In the example that adopts sleep pattern, a node, it is the source (supplier) that bandwidth discharges, and enters sleep pattern during the crack in due course.If it is the target (person of needs) of bandwidth demand, will calculate entry time, therefore, it is not on sleep pattern during the time slot of extra demand, and perhaps it is in opening always.
For the node that does not send any request/release information, they can continue to use distributed time slot to come transmission information.For sending the node that bandwidth discharges information, they must avoid sending data during the time slot that has discharged.Not good even predict the outcome, it has than the expection more data needs to send, and also will so do and avoids conflict.For the node that sends bandwidth request, they will calculate, as following detailed description, to obtain an entry time that discharges time slot.They are qualified to send data during its distributed time slot and its those ' d/d ' time slots that obtained.
In this DBA scheme, the information that allocated bandwidth is carried out in all requirements exchanged during beacon period.Bandwidth information is effectively to a super frame only, but does not need bandwidth information effective to super frame current or following closely.In order there to be the enough time to calculate, the exchange message of bandwidth prediction and time slot request can be used in next super frame or in the actual Dynamic Bandwidth Allocation of next super frame again during beacon period.Although information may not be up-to-date by the time, and possibly can't obtain optimal representation, may remain feasible.But, will be appreciated that the information that is used in the assigning process must obtain from beacon during identical super frame, and the delay of each node acceptance processing bandwidth information will equate.
And forecasting process may take sizable computational resource, if carry out bandwidth prediction too continually, this computation burden may be too big for a communication node.In order to relax this situation, the most frequently used is that each GOP (12 frame of video) is predicted.For keep the bandwidth serviceability to improve and computing capability between balance, be without loss of generality, can increase or reduce to predict between the interval.Whether but, bandwidth release/solicited message should be sent out in the beacon package of each super frame, no matter predict recently.Bandwidth request between prediction can keep identical, or it can change according to queue length state or the flow that has arrived number.
As an example, other details of the various piece of this scheme will be in following description with Video Applications.
Video flow forecast model-AR model
In order to carry out volume forecasting, video flow is characterized by a Mathematical Modeling.Exist many video coding systems, discharge model then depends on coding method to heavens.
In MPEG video system (MPEG 1,2 or 4) lining, produce frame with about 25 to 30 the speed of per second.Usually, when scene steadily the time, the size of frame is smaller, and if relate to a large amount of actions or move, the size of frame will be bigger.Moreover the size of frame usually keeps quite stable during a scene, rapid increase/reduction can occur in the change size of time frame of scene.
Frame can be divided into 3 types: intracoded frame (I), encoded predicted frame (P) and bi-directional predictive coding frame (B).The I frame is independent of other frame and is encoded, thus a little compressible is arranged, but an inlet point is provided.The P frame is to use the motion compensated prediction of preceding 15 I or P frame and is encoded, so can obtain a higher compression ratio.The B frame is normally minimum, because be to use based on hithermost past (front) and future (back) I-P, P-P or P-I frame bi-directional predicted and being encoded.I, P and B frame are to produce with the cyclic sequence of a regular length N, since an I frame, and finish before next I frame; And, a P frame will be arranged to every M frame.Typically, N=12 and M=3 can produce the sequence of an IBBPBBPBBPBB.This sequence is called as an image sets (GOP).The GOP size is meant the summation of all 12 frames in that GOP.
From view angle of statistics, the meaning of this frame classification is that the frame size of I frame sequence can be modeled into a linear autoregression (AR) model.Equally also can be applied on the sequence of P frame, B frame and GOP.But, should be understood that alternately the sequence of I, P and B frame is disobeyed the AR model.This is important information, because the possibility of its hint prediction.
Fundamentals of forecasting is linear autoregression (AR) model.Mean sequence have get back to before the tendency of state.Say simply, that is to say that currency can estimate from the weighted sum of numerical value before:
x(n)＝a
1x(n-1)+a
2x(n-2)+...a
px(n-p)+be(n)
Be a linear combination of numerical value before next numerical value is.
For this equation is set up, the item in the sequence need satisfy some correlations.Correlation is strong more, and model is then suitable more.For example, random digit independent sequence is disobeyed the AR model.To some data, the applicability of this model is normally shown by the experience result.The mpeg video stream amount has been proved to be able to be fit to well this model.The correctness of this model depends on to heavens determines a
iValue.
Coefficient a
iCan draw by following.
Method I: by solve equation R
XxA=-r
[R
xx[1]，R
xx[2]，...，R
xx[p]]
T
R
Xx[n]=E{ (X (t)-E[X (t)]) (and X (t+n)-E[X (t)]) } the steady auto-covariance of (WSS) process X on slot time n of expression broad sense.
In order to find the solution this equation, require to obtain average and the auto-covariance of X, X is the packets of information number that receives.Can carry out a continuous counter, these statistics can be updated by each new data point.Method II: sef-adapting filter (Adaptive filter)
In this method, coefficient a is upgraded by each new data point.
More new formula can have following form:
i)a(n+1)＝a(n)+μe(n)x(n)
ii)a(n+1)＝a(n)+[μe(n)x(n)/||x(n)||
2
Wherein || x (n) ||
2=x (n)
TX (n)
Wherein
It is the error of previous prediction.
μ is a constant, is called as step-length, and it must be selected to guarantee convergence by careful.
More than just some can be used to obtain the method example of AR model coefficient.In any case, also having other method, the DBA scheme is not subject to uses any ad hoc approach.
Although video flow is used to this exemplary embodiments, the DBA scheme is not subject to video flow at all and uses.Other flow can be handled by this DBA scheme as the Internet, voice or audio frequency.Correspondingly, in forecasting process, need a kind of suitable Forecasting Methodology.As an exemplary, use neural net method and/or fuzzy logic technology, can predict internet traffic.
Bandwidth allocation scheme
Forward to now and redistribute the bandwidth that some nodes discharge, suppose to have the bandwidth (C) of some to can be used for dynamic assignment.According to the allocative decision of regulation, available bandwidth can be assigned to the different nodes of seeking more bandwidth.The example of some appropriate bandwidth allocative decisions is in following description, as a reference.Concrete bandwidth allocation algorithm should be incorporated in the DBA scheme, will determine according to the requirement of concrete application, and never be limited by following several:
1. proportional linearity algorithm (Proportional Linear Algorithm)
Suppose that the desired bandwidth that source i requires is Xi, and N customer requirements more bandwidth arranged.Fi represents allocated bandwidth.The most direct method is to distribute bandwidth according to following equation:
This may be the most direct of the relevant utilization of resources and effective method.
2. ratio multinomial algorithm (Proportional Polynomial Algorithm)
Because linear algorithm can not be avoided increasing formation, it may cause unfairness and other problem.In order to relax this problem, by a non-linear assigning process, more bandwidth will be assigned to the stream with bigger formation.This non-linear concrete allocative decision is as follows:
Wherein n is polynomial number of times.
Along with the increase of n, the asymptotic behavior of queue length becomes more approaching, but as long as data transfer rate is different, queue length increases inconsistent situation and still exists.
3. minimum-maximum algorithm (Minmax Algorithm)
In order to obtain the long-term growth buffer of a justice, need a fair allocat so that maximum queue length keeps as much as possible little.Be formulated as a constrained optimization problem:
Minimize max{X
i-F
i}
Constraints
F
i≥0
In order to find the solution this problem:
1) carry out the demands bandwidth according to descending:
2) X1 〉=X2 〉=... 〉=XN, wherein N is ....
3) calculate the C part g1 that need be assigned to X1, make unmet demand X1-g1 equal X2,
4) calculating need be assigned to the part g2 of the residual capacity C-g1 of X1-g1 and X2, makes unmet demand X1-g1-g2 and X2-g2 equal X3.
5) repeating step 3) and 4), up to exhausting available capacity.
The method can be used to avoid the growth difference of queue length.
4. ratio exponentiation algorithm (Proportional Exponential Algorithm)
This algorithm provides the asymptotic behavior identical as the Minmax algorithm, but keeps running time at 0 (N).
5. the relevant distribution (β-dependent Allocation) of β
β represents the queue length growth rate.Can distribute pro rata according to growth rate.
6. other possible algorithm
Can distribute pro rata according to the ratio that bandwidth demand changes.
Above method 2,3 and 4 is intended to realize the fairness of the long-term queue length of basis, when the source ratio more or less is in static state.For the VBR flow, because the source ratio will change often, long-term fairness may not be a problem in this sense.
Select which time slot to be released
In the bandwidth prediction stage, each node must determine how many bandwidth it needs, and bandwidth if desired exceeds when entering network and to obtain the bandwidth of distributing, and it will seek to obtain extra bandwidth.If a node needs less bandwidth, temporarily " release " some time slots will be necessary to determine which time slot is released.Usually, two main method are arranged: 1) each node can select it to want the time slot that discharges independently; 2) a standard strictness, unified will be used for selecting by all nodes.Under first kind of situation, elasticity is higher.For example, node can select to allow output time slot according to channel condition.Have such example, for example because another transmission on trooping of a vicinity, channel condition may be poor especially during some time slot.For example, if a node has determined it to think " release " some time slots, it can discharge the time slot of bad channel conditions.Another example is, if the flow of a specific node has a bigger packets of information size, it may be willing to be intended to send during the continuous slot, selects not discharge those time slots.Each node can determine which standard is most important to it based on its flow, channel or some other factorses.In order to implement these, each node need comprise the tabulation of " d/d " number of time slot.To cause more information to be exchanged like this, and may increase the live load of system.Under second kind of situation, each node only needs to announce the number of time slot of " release ", and each other node knows that all they are which time slot (they are set aside some time to suppose agreement to have required each node broadcasts).For example, be used for handling node last time slot in it is set aside some time with " release " in order to allow the more time.
Enter d/d time slot
The typical method of two kinds of distribution " d/d " time slot as shown in Figure 3 and Figure 4.These two examples at first add up summation (310,420) to the total number from available ' d/d ' time slot of broadcast message.Then, according to the extra slots number of node request, node is ranked (320,420).According to this order, calculate the available extra slots number of each node (330,430).In order to save disposal ability, a specific node only needs himself is calculated.In first method, total number of timeslots of a node demand will be distributed together, shown in step 340 and 350.This is very simple calculating, but causes unfairness probably.In second method, once only distribute a time slot, and along as in the mode shown in the step 440,441,450,460,470 and 480 li, order of priority can change.When remaining ' d/d ' time slot was still arranged, a particular sections was named a person for a particular job and is at first checked its deserved total number of time slot that also is not assigned with (if having distributed enough deserved time slots, concluding time scheduling processes), shown in step 450.According to the formation that is provided with before, the node with high-precedence (li being called " #1 " in step 460) will enter this specific ' d/d ' time slot.If after this sub-distribution, the deserved time slot of #1 remains number still greater than the deserved number of time slot of next node on the line, and it will keep as #1.Otherwise next node will become #1, and initial #1 will correspondingly step back along formation.This method will obtain better fairness, but complexity and computing time will be higher also.Each equipment that participates in DBA will be carried out identical process separately.
Usually, ask more the node of multi-slot will have higher order of priority when attempting entering " d/d " time slot.This is will show that because of the demand in extra bandwidth they need bandwidth by the utmost point.If the time slot of two node request similar numbers needs with there being a mechanism to determine which node obtains priority.Typical standard comprises device id or beacon order, because these numerals are unique, it will produce an absolute order.More complex embodiment can select to consider the passing history of this node, and the node that for example is assigned to less " d/d " time slot in previous round will have a higher priority.In another kind of method, the input flow rate of formation and prediction will be locked respectively.Equipment with the row of queue more will have higher priority.In conjunction with these conditions, may produce better performance or fairness, although it may be paid a price for high complexity more, and during beacon period, have more information and need exchange.In any case, the DBA scheme when decision priority order to using what standard not apply any restriction.Unique requirement is that the method must finally produce a unique order.
In this example, the DBA scheme has an advantage, does not require that promptly each node calculates the entry time of whole " d/d " time slot.Only need know on the point that when should enter time slot and calculate at it.Computing time will be reduced like this.
The example that the DBA typical case implements is described
Fig. 5 shows that a 1-who comprises node A, B, C, D, E, F, G, H, I, J, K (all nodes can be learned the other side mutually) jumps network example.Fig. 6 is the module map of a typical node and comprises various devices, comprise device, the device that obtains information of predicting self bandwidth demand, calculate the device that can enter the device of which ' d/d ' time slot, the device that enters ' d/d ' time slot and broadcast message and the device of temporary transient ' release ' time slot.Suppose that node A, B, C and D are only source nodes, the DBA algorithm is wherein involved.The direction of arrow display data stream, promptly node A is sending data to node E, and Node B is sending data to node F, and node C is sending data to node G, and node D is sending data to node H.The device that requires to activate DBA also is listed.All A, B, C and D have this device.Have other node not participate in the DBA process in network, the network bandwidth is fully utilized.Each node in these four nodes is sending an identical mean bit rate but unique video of different instant bit rates.Begin each node and reserved 6 DRP time slots, so the DBA process is only in these 24 time slot work.
In the ending (k-1) of super frame, it is as follows to predict the outcome:
| Prediction | Buffer memory | Reserve time slot (time slot #) | The extra time slot that needs | |
| A | 8 | 4 | 6(33，49，65，81，97，113) | +6 |
| B | 7 | 1 | 6(34，50，66，82，98，114) | +2 |
| |
1 | 0 | 6(35，52，67，83，99，115) | -5 |
| D | 3 | 1 | 6(36，53，68，84，100，116) | -2 |
Beginning (k) in super frame:
Each node among A, B, C and the D will send an ASIE at its beacon, the extra slots number of request shown in above form.After they have received all beacons, will handle to DBA:
A: it asks the extra slots of maximum quantity, so it has the highest order of priority.Time slot to all requests adds up, and obtaining a result is 8.D/d time slot total number is 7, and writes down the time slot of all releases: 51,67,83,99,115 (last 5 DRP time slots are from node C) and 100 and 116 (last 2 DRP time slots are from node D).
List stored information:
Order of priority tabulation (till it): A
Discharge time slot: 51,67,83,99,100,115,116
Carry out following calculating then:
Release number of time slot=7* (6/8)=5.25 (being truncated to 5) that A will use
5 on the head that A will enter discharges time slot: 51,67,83,99, and the calculating of 100 couples of A finishes.
B: it asks the extra slots of second largest quantity, so it has second order of priority.And it equally collects all information with A.
List stored information:
Order of priority tabulation (till it): A-＞B
Discharge time slot: 51,67,83,99,100,115,116
Carry out following calculating then:
Release number of time slot=the 7* (6/8)=5.25 (being truncated to 5) that will use A:A
Release number of time slot=the 7* (2/8)=1.75 (being truncated to 2) that will use B:B
B will enter the time slot of 2 releases after first 5: 115,116
Calculating to B finishes.
C: it does not have the outer time slot of amount of the claim, does not need to carry out any calculating.
D: the same with C.
Should be understood that d/d time slot allocation is effective to a super frame only.
For the VBR flow, in the ending (n-1) of super frame, the time slot reguisition form can be as shown below:
| Prediction | Buffer memory | Reserve time slot (time slot #) | The extra time slot that needs | |
| A | 1 | 0 | 6(33，49，65，81，97，113) | -5 |
| B | 5 | 2 | 6(34，50，66，82，98，114) | +1 |
| C | 8 | 2 | 6(35，52，67，83，99，115) | +4 |
| D | 7 | 2 | 6(36，53，68，84，100，116) | +3 |
After the beacon on receiving super frame (n):
A: it does not have the outer time slot of amount of the claim, does not need to carry out any calculating.
B: canned data:
Demand time slot sum=8
Discharge time slot sum=5
Order of priority tabulation (till it): C-＞D-＞B
Discharge time slot: 49,65,81,97,113
Calculate:
Release number of time slot=the 5* (4/8)=2.5 (being truncated to 3) that will use C:C
Release number of time slot=the 5* (3/8)=1.875 (being truncated to 2) that will use D:D
Release number of time slot=the 5* (1/8)=0.625 (being truncated to 1) that will use B:B
B will enter 1 and discharge time slot after first 5 discharge time slot.But, only have 5 to discharge time slot, so B will not enter any release time slot.
Calculating to B finishes.
C: canned data:
Request time slot sum=8
Discharge time slot sum=5
Order of priority tabulation (till it): C
Discharge time slot: 49,65,81,97,113
Calculate:
Release number of time slot=the 5* (4/8)=2.5 (being truncated to 3) that will use C:C
C will enter first 3 and discharge time slot: 49,65,81
Calculating to C finishes.
D: canned data:
Request time slot sum=8
Discharge time slot sum=5
Order of priority tabulation (till it): C-＞D
Discharge time slot: 49,65,81,97,113
Calculate:
Release number of time slot=the 5* (4/8)=2.5 (being truncated to 3) that will use C:C
Release number of time slot=the 5* (3/8)=1.875 (being truncated to 2) that will use D:D
D will enter 2 and discharge time slot after first 3 discharge time slot: the calculating of 97,113 couples of D finishes.
More than be a very simple example, it can illustrate the basic operational function of assigning process.As previously mentioned, allocation priority or the method for calculating the release number of time slot that each node will enter are unrestricted.
Though by having described the present invention with reference to above-mentioned example or preferred embodiment, should be appreciated that, these examples just help to understand the present invention, rather than are intended to make restriction.Change that those are obvious or trickle concerning the experienced technical staff in the art or modification, and the improvement of making thereon all should be counted as being equal to the present invention.
And, although by with reference to a kind of WiMedia system description the present invention, should be appreciated that, be without loss of generality, no matter be correct or do not add modification that the present invention can be required to other distributed communication network.
Claims (23)
1. communication network that comprises a plurality of communication nodes, each communication node in wherein said a plurality of communication nodes can be at a bandwidth varying transmitting data, and each communication node comprises:
Predict the device of himself bandwidth demand,
Transmit the device of self bandwidth demand of its prediction to network,
Obtain other communication node on the network bandwidth demand information device and
Determine the device of himself allocated bandwidth according to a unified bandwidth allocation scheme, described public
Bandwidth allocation scheme can be used for described a plurality of communication node.
2. communication network according to claim 1, the bandwidth demand of one of them communication node are broadcast to described a plurality of communication node.
3. communication network according to claim 1, wherein a kind of time division multiple access access protocol is used in network service, this agreement is divided into a plurality of time slots with one in network communication period, the time slot of one defined amount is reserved the bandwidth information exchange that is used between the communication node, and the time slot of a defined amount is reserved the transfer of data that is used for communication node.
4. communication network according to claim 3, wherein each time channel is a super frame that comprises 256 time slots, each time slot is that 256 μ s are long, and the regulation time slot in super frame is reserved to a concrete communication node and is used for switching bandwidth information and enters transmitted data on network.
5. communication network according to claim 1, the bandwidth demand of wherein said a plurality of communication nodes is to be broadcasted during beacon period.
6. communication network according to claim 1, wherein said common bandwidth allocative decision comprises a fair share allocative decision, thus, the transmission bandwidth of distributing to a concrete communication node depends on the total bandwidth need of the bandwidth demand of its prediction with respect to described a plurality of communication nodes.
7. communication network according to claim 1, each communication node in wherein said a plurality of communication nodes comprise competes the device that obtains extra bandwidth when the total bandwidth of a described communication node demand exceeds the bandwidth of described communication node reservation.
8. communication network according to claim 7, wherein said extra bandwidth are that communication node obtains by one group of unified RSVP contention protocols competition of described a plurality of communication nodes.
9. communication network according to claim 7 wherein only has a communication node to be allowed to compete during described time slot and obtains extra bandwidth, and described a plurality of communication nodes can communicate mutually during described time slot.
10. communication network according to claim 1, wherein the predetermined bandwidth allocation rule is included as the rule of communication node layout allocated bandwidth order of priority.
11. communication network according to claim 1, wherein each communicator is included in the device that produces data communication on the bandwidth varying in described distributed network.
12. communication network according to claim 11, the described device that wherein produces data communication in described distributed network can increase or reduce the data communication bandwidth of described communication node, and increase on the data communication bandwidth or minimizing are to be broadcasted in described communication network during beacon period.
The prediction bandwidth demand of described communication node is lower than the device that release data communication bandwidth is used for other communication node when having bandwidth now 13. communication network according to claim 11, wherein said communication node also comprise.
Competition was obtained the excessive data communication bandwidth for the device that himself uses when the prediction bandwidth demand of described communication node was higher than current bandwidth 14. communication network according to claim 11, wherein said communication node also comprise.
15. communication network according to claim 1, wherein the described device of communication node prediction bandwidth demand comprises from the device of the flow rate mode prediction input flow rate bandwidth following closely of nearest input flow rate.
16. communication network according to claim 15, the described device of wherein said communication node prediction bandwidth demand also comprises the device of determining data cached flow in the described communication node, thereby the bandwidth demand of prediction is the flow rate mode of a current input stream amount and the function of buffer memory flow.
17. communication network according to claim 1, wherein said common bandwidth allocative decision comprises a priority scheme, and priority scheme is agreed to give the node of the more bandwidth of requirement so that have priority when obtaining extra bandwidth with priority.
18. communication network according to claim 1, the flow of wherein said communication node are the mpeg video stream amounts, and the prediction bandwidth demand is based on a linear autoregressive models.
19. communication network according to claim 1, wherein data communication bandwidth is available as a plurality of time slots, and the allocated bandwidth in the competition scene is under the fair share rule.
20. communication network according to claim 1, the communication node that the data communication bandwidth that wherein can be used for distributing is assigned to competition additional communication bandwidth is to use the relevant allocation algorithm of a kind of algorithm-proportional linearity algorithm, ratio multinomial algorithm, minimum maximum algorithm, ratio exponentiation algorithm, β in the following algorithm, wherein β is the queue length growth rate, and other algorithm etc.
21. communication network according to claim 1, wherein said communication network have a WiMedia network architecture.
22. the bandwidth management method of a distributed communication network, this distributed communication network comprises a plurality of communication nodes, and this method may further comprise the steps:
Predict the bandwidth demand of a plurality of communication nodes,
The bandwidth demand that transmits described a plurality of communication nodes to described communication network,
According to a public allocative decision of being shared by described a plurality of communication nodes, the allocate communications bandwidth is to described a plurality of communication nodes.
23. bandwidth management method according to claim 22, wherein each described communication node comprises the device of adjusting transmission bandwidth according to the transmission bandwidth of instant distribution.
Applications Claiming Priority (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| HK05111981 | 2005-12-23 | ||
| HK05111981.3 | 2005-12-23 |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN101248619A true CN101248619A (en) | 2008-08-20 |
Family
ID=38188278
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CNA2006800257688A Pending CN101248619A (en) | 2005-12-23 | 2006-12-22 | Distributed wireless network with dynamic bandwidth allocation |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN101248619A (en) |
| WO (1) | WO2007071198A1 (en) |
Cited By (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101888342A (en) * | 2010-07-23 | 2010-11-17 | 中兴通讯股份有限公司 | Bandwidth distribution method and device |
| CN102025478A (en) * | 2009-09-15 | 2011-04-20 | 华为技术有限公司 | Method and device for transmitting and receiving data |
| CN102469508A (en) * | 2010-11-03 | 2012-05-23 | 中兴通讯股份有限公司 | Data flow bit allocating method and device |
| CN102546203A (en) * | 2010-12-20 | 2012-07-04 | 中国移动通信集团广西有限公司 | Business process allocation method and device |
| CN104302008A (en) * | 2014-10-20 | 2015-01-21 | 上海电机学院 | Wireless multi-hop network bandwidth allocation method integrating time division and cache proportion |
| CN105978736A (en) * | 2011-02-01 | 2016-09-28 | 谷歌公司 | System to share network bandwidth among competing applications |
| WO2017000478A1 (en) * | 2015-06-29 | 2017-01-05 | 中兴通讯股份有限公司 | Method and device for transmitting service data with microwave link |
| WO2017219354A1 (en) * | 2016-06-24 | 2017-12-28 | Nokia Technologies Oy | A method, source device and power node for distributed dynamic spectrum allocation |
| CN109728933A (en) * | 2018-11-21 | 2019-05-07 | 电信科学技术第五研究所有限公司 | Distributed Application software network flow control methods |
| CN112804084A (en) * | 2020-12-28 | 2021-05-14 | 中金数据（武汉）超算技术有限公司 | Bandwidth management method and device based on network interconnection line |
| CN118200257A (en) * | 2024-05-15 | 2024-06-14 | 深圳市盛格纳电子有限公司 | Signal high-speed transmission method and system based on high-speed connector |
Families Citing this family (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2009004554A2 (en) * | 2007-06-29 | 2009-01-08 | Nokia Corporation | Method and apparatus for reserving channel capacity |
| US8107451B2 (en) | 2008-08-31 | 2012-01-31 | International Business Machines Corporation | Efficient deallocation of network resources based on network node location extrapolation |
| CN101945430B (en) * | 2010-08-26 | 2013-04-17 | 湘潭大学 | Time sensitive transmission and bandwidth optimization utilization-based method used under IEEE802.15.4 network environment |
| TR201008095A2 (en) * | 2010-10-04 | 2011-09-21 | Nortel Networks Neta� Telekom�N�Kasyon A.�. | Distributed time slot allocation method in mobile communication systems. |
| EP2879339A1 (en) * | 2013-11-27 | 2015-06-03 | Thomson Licensing | Method for distributing available bandwidth of a network amongst ongoing traffic sessions run by devices of the network, corresponding device. |
| CN111565323B (en) * | 2020-03-23 | 2022-11-08 | 视联动力信息技术股份有限公司 | Flow control method and device, electronic equipment and storage medium |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| JP2005020163A (en) * | 2003-06-24 | 2005-01-20 | Sony Corp | Wireless communication system, wireless communication apparatus and wireless communication method, and computer program |
-
2006
- 2006-12-22 CN CNA2006800257688A patent/CN101248619A/en active Pending
- 2006-12-22 WO PCT/CN2006/003536 patent/WO2007071198A1/en active Application Filing
Cited By (22)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102025478B (en) * | 2009-09-15 | 2015-03-18 | 华为技术有限公司 | Method and device for transmitting and receiving data |
| CN102025478A (en) * | 2009-09-15 | 2011-04-20 | 华为技术有限公司 | Method and device for transmitting and receiving data |
| US8891352B2 (en) | 2009-09-15 | 2014-11-18 | Huawei Technologies Co., Ltd. | Data transmission and receiving method and apparatus |
| WO2012009997A1 (en) * | 2010-07-23 | 2012-01-26 | 中兴通讯股份有限公司 | Bandwidth allocation method and apparatus |
| CN101888342B (en) * | 2010-07-23 | 2015-09-16 | 中兴通讯股份有限公司 | Bandwidth allocation methods and device |
| CN101888342A (en) * | 2010-07-23 | 2010-11-17 | 中兴通讯股份有限公司 | Bandwidth distribution method and device |
| CN102469508A (en) * | 2010-11-03 | 2012-05-23 | 中兴通讯股份有限公司 | Data flow bit allocating method and device |
| CN102469508B (en) * | 2010-11-03 | 2015-07-22 | 中兴通讯股份有限公司 | Data flow bit allocating method and device |
| CN102546203B (en) * | 2010-12-20 | 2014-07-02 | 中国移动通信集团广西有限公司 | Business process allocation method and device |
| CN102546203A (en) * | 2010-12-20 | 2012-07-04 | 中国移动通信集团广西有限公司 | Business process allocation method and device |
| CN105978736A (en) * | 2011-02-01 | 2016-09-28 | 谷歌公司 | System to share network bandwidth among competing applications |
| CN105978736B (en) * | 2011-02-01 | 2019-05-31 | 谷歌有限责任公司 | The system of network bandwidth is shared among competitive application |
| CN104302008B (en) * | 2014-10-20 | 2019-03-26 | 上海电机学院 | A kind of wireless multi-hop network bandwidth allocation methods of comprehensive time-division and caching accounting |
| CN104302008A (en) * | 2014-10-20 | 2015-01-21 | 上海电机学院 | Wireless multi-hop network bandwidth allocation method integrating time division and cache proportion |
| WO2017000478A1 (en) * | 2015-06-29 | 2017-01-05 | 中兴通讯股份有限公司 | Method and device for transmitting service data with microwave link |
| US10848976B2 (en) | 2016-06-24 | 2020-11-24 | Nokia Technologies Oy | Method, source device and power node for distributed dynamic spectrum allocation |
| WO2017219354A1 (en) * | 2016-06-24 | 2017-12-28 | Nokia Technologies Oy | A method, source device and power node for distributed dynamic spectrum allocation |
| CN109728933A (en) * | 2018-11-21 | 2019-05-07 | 电信科学技术第五研究所有限公司 | Distributed Application software network flow control methods |
| CN109728933B (en) * | 2018-11-21 | 2021-09-24 | 电信科学技术第五研究所有限公司 | Distributed application software network flow control method |
| CN112804084A (en) * | 2020-12-28 | 2021-05-14 | 中金数据（武汉）超算技术有限公司 | Bandwidth management method and device based on network interconnection line |
| CN118200257A (en) * | 2024-05-15 | 2024-06-14 | 深圳市盛格纳电子有限公司 | Signal high-speed transmission method and system based on high-speed connector |
| CN118200257B (en) * | 2024-05-15 | 2024-07-16 | 深圳市盛格纳电子有限公司 | Signal high-speed transmission method and system based on high-speed connector |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2007071198A1 (en) | 2007-06-28 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101248619A (en) | Distributed wireless network with dynamic bandwidth allocation | |
| US20070189298A1 (en) | Distributed wireless network with dynamic bandwidth allocation | |
| CN101048977B (en) | Dynamic adaptation for wireless communications with enhanced quality of service | |
| AU693365B2 (en) | Method and system for management of frequency spectrum among multiple applications on a shared medium | |
| CN102594682B (en) | Traffic-prediction-based dynamic bandwidth allocation method for gigabit-capable passive optical network (GPON) | |
| US20050007991A1 (en) | Bandwidth allocation method and apparatus for fixed wireless networks | |
| TWI470962B (en) | Method and system for resource allocation in distributed time-division multiplexing systems | |
| CN101297524B (en) | Convergence type resource obligation of data flow | |
| KR101078987B1 (en) | Distributed medium access control for broadband access system | |
| CN101589586B (en) | Recalculating airtime quota in wlan to use up bandwidth | |
| CN109618375B (en) | UAV ad hoc network time slot scheduling method based on service priority and channel interruption probability | |
| CN104219167A (en) | Network resource scheduling method and server | |
| CN105119682A (en) | User level protocol and QoS (Quality of Service) based dynamic wavelength bandwidth distribution method in WDM-EPON (Wavelength Division Multiplexing-Ethernet Passive Optical Network) | |
| CN103248622B (en) | A kind of Online Video QoS guarantee method of automatic telescopic and system | |
| Karadag et al. | Optimal power control, scheduling, and energy harvesting for wireless networked control systems | |
| CN116634442A (en) | Base station resource scheduling method based on traffic and communication characteristic complementation prediction | |
| Jia et al. | Social-aware learning-based online energy scheduling for 5G integrated smart distribution power grid | |
| CN101227369A (en) | System and method for node band width equitable distribution on elastic grouping ring | |
| CN116074260A (en) | Service slice scheduling method in power network | |
| CN101483579B (en) | Method and apparatus for real-time service bandwidth application | |
| Ghazanfar et al. | Application of learning methods for QoS provisioning of multimedia traffic in IEEE802. 11e | |
| CN101107820A (en) | Method and apparatus to enforce airtime quota in service interval in a wireless LAN | |
| Saffer et al. | Analysis of globally gated Markovian limited cyclic polling model and its application to uplink traffic in the IEEE 802.16 network | |
| CN100450250C (en) | Evaluating method for air interface volume of interference limiting system | |
| CN117793584A (en) | Bandwidth allocation method, device, electronic 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 | ||
| C12 | Rejection of a patent application after its publication | ||
| RJ01 | Rejection of invention patent application after publication |
Open date: 20080820 |