CN101729430A - Dynamic resource allocation system and allocation method used for supporting end-to-end time delay warranty - Google Patents
Dynamic resource allocation system and allocation method used for supporting end-to-end time delay warranty Download PDFInfo
- Publication number
- CN101729430A CN101729430A CN201010013728A CN201010013728A CN101729430A CN 101729430 A CN101729430 A CN 101729430A CN 201010013728 A CN201010013728 A CN 201010013728A CN 201010013728 A CN201010013728 A CN 201010013728A CN 101729430 A CN101729430 A CN 101729430A
- Authority
- CN
- China
- Prior art keywords
- time delay
- phb
- link
- routing configuration
- information
- 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
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses a dynamic resource allocation system used for supporting end-to-end time delay warranty, mainly solving the problems that the existing differentiated service network QoS warranty capacity is low and network resource is not fully utilized. The system thereof comprises a boundary router, a resource manager and a core router; wherein the resource manager calculates time delay allocation value on each link of end-to-end transmission path according to time delay upper limit requirement in a service request message transmitted by the boundary router and combining link load degree in network load information and time delay estimated value of each PHB at each link port; on related core router, optimal PHB is dynamically selected for resource allocation and packet retransmission by matching of time delay allocation value and bandwidth requirement according to local available resource state. The invention can effectively balance network load, reduce QoS warranty granularity and improve network resource utilization ratio while ensuring service end-to-end time delay requirement and can be applied to IP network and packet switching network.
Description
Technical field
The invention belongs to data communication technology field, relate to the resource allocation methods in the differentiated services network, be applicable to IP network and packet switching network etc.
Background technology
Along with the popularizing and developing rapidly of internet, the demand of utilizing the internet to transmit multimedia messages also increases day by day, and Internet resources also present tense situation.Have service that QoS guarantees and more rational Resource Allocation in Networks method for the business of different service quality QoS feature provides, will become the key factor that influences internet future development.
What the internet adopted is towards connectionless IP agreement, and the forwarding service of " doing one's best " is provided for all groupings liberally.Traditional IP agreement, some special field expectations of reserving by protocol headers guarantee and flow control, for example the traffic class field in type of service field and the IPv6 protocol header in the IPv4 protocol header for grouping provides QoS.
Differentiated Services is from the complexity that reduces QoS and realize and improve extensibility, and the work of complexity has all been focused on the fringe node of network, and the internal node of network only carries out simple stateless and transmits.Particularly, Differentiated Services is used the different service domains of these special field of IP head as grouping, border router at network, with single stream classify, integer becomes different behavior aggregate flows with gathering, and assembling the tag field of information stores to each IP packet, be called Differentiated Services code-point DSCP, on the network internal router, select corresponding single-hop behavior PHB to transmit according to the DSCP in the IP packet header, thereby provide the scheduling of extra fine quality to transmit service aggregate flow with identical DSCP value.
The Differentiated Services biggest advantage be simple effectively, extensibility is strong, meets the characteristics of IP network.Therefore, differentiated service will become the IP QoS architecture of main flow.But Differentiated Services can only provide the QoS of relative priority level to guarantee to different classes of aggregate flow, and the QoS that is promptly provided guarantees that granularity is big, and QoS guarantees to be only limited in the different service domains, does not possess QoS ability end to end.Under the light situation of network load, deterministic QoS service can be provided, when network load is heavier, then may cause the QoS of all streams in the network processing of all demoting.
Based on above shortcoming, the multiple apparatus and method that can provide end-to-end QoS to guarantee of introducing in differentiated service have been provided prior art.For example (Request For Comments RFC) in the file, introduces the Differentiated Services architecture with bandwidth broker BB at RFC2638.In addition, some acceptance controlling methods have been proposed also, in the hope of Internet resources are carried out reasonable distribution and use.These methods, guarantee ability though improved the QoS of network traffic to a certain extent, but the QoS that is provided guarantees that granularity is too big, can't providing end to end, time delay guarantees, and owing to do not consider the Network Load Balance situation, thereby can not make full use of Internet resources, cause its Scalable Performance to reduce.
Summary of the invention
The objective of the invention is to overcome the defective of above-mentioned prior art, a kind of Dynamic Resource Allocation for Multimedia system and distribution method that is used to support the end-to-end time delay assurance is provided, to make full use of Internet resources, balance network load improves its Scalable Performance.
For achieving the above object, the present invention is used to support the Dynamic Resource Allocation for Multimedia system of end-to-end time delay assurance, comprising:
Border router is used to access service to send business request information to explorer, and all packet header extend information territories of access service are filled;
Explorer, be used for time delay upper limit requirement according to business, in conjunction with network load information, calculate the time delay apportioning cost of access service on each section link of end-to-end transmission path, and to core router, send routing configuration message, according to the routing configuration result, to border router feedback resources configuration result;
Core router is used for according to routing configuration message, and in conjunction with local available resources state, Dynamic Selection single-hop behavior PHB carries out routing configuration, and the routing configuration result is fed back to explorer;
Transmission between described border router, explorer and the core router is to be undertaken by the control signaling message that signaling channel transmits.
For achieving the above object, the present invention is used to support the dynamic resource allocation method of end-to-end time delay assurance, and step comprises as follows:
(1) occupied bandwidth of each link of this locality of obtaining according to this locality monitoring of core router, calculate each link load degree according to following formula:
P
j＝B
j?/B
j0
Wherein, P
jBe the link load degree of link j, B
jBe the occupied bandwidth of link j, B
J0Bandwidth for link j;
(2) each core router is encapsulated in the load updating message network load information of real-time update explorer with the time delay estimated value of link load degree and each PHB;
(3) after border router listens to access service arrival, generate business request information, be sent to explorer, this business request information comprises QoS desired value and route result of calculations such as professional bandwidth, the requirement of the time delay upper limit;
(4) explorer receive and extract service bandwidth, the time delay upper limit requires and route result of calculation, in conjunction with network load information and professional time delay upper limit requirement, calculates time delay apportioning cost on end-to-end each section of transmission path link according to following steps:
4a) obtain the link load degree P of each link according to network load information
j, j ∈ K
L, calculate the normalization degree of load of every section link:
J ∈ K
L, then the time delay preassignment value on every section link is: d '
j=D* η
j, j ∈ K
L,
Wherein, K
L=1,2 ..., and L} represents the set of all links on the transmission path, and L is the link sum on the transmission path, and D represents professional time delay upper limit requirement, η
j, j ∈ K
LThe normalization degree of load of expression link j, P
kThe link load degree of expression link k,
The link load degree summation of all links on the expression transmission path, d '
j, j ∈ K
LTime delay preassignment value on the expression link j and having
4b) initialization K '
L=K
LAnd n=L, initialization K '
LIn the link load degree be P
i=P
jAnd i=j, i ∈ K '
L, j ∈ K
L, time delay preassignment value is d
i=d '
j, and i=j, i ∈ K '
L, j ∈ K
L, initialization d
α=0,
Wherein, K '
LThe set of expression time delay link to be allocated, n represents K '
LMiddle time delay link number to be allocated, P
iExpression K '
LThe link load degree of middle link i, d
iExpression K '
LThe time delay preassignment value of middle link i, d
αThe expression time delay factor;
4c) at K '
LIn according to formula
Obtain the link k of current link load degree maximum, calculate d
k=d '
k+ d
α, from set K '
LMiddle deletion link k subtracts 1 with n,
Wherein, d
kTime delay apportioning cost on the expression link k, d '
kTime delay preassignment value on the expression link k;
4d) according to the time delay estimated value D of each PHB correspondence of link port
i, { 1, M} is with time delay apportioning cost d for i ∈
kMatch time delay and distribute the interval [D of limit
p, D
q], make it satisfy D
p≤ d
k≤ D
q, p ∈ 1, M}, q ∈ 1, M},
Wherein, D
i, { 1, M} represents the pairing time delay estimated value of the link port i of place level PHB to i ∈, and M represents the total progression of PHB, D
p, D
qRepresent the pairing time delay estimated value of p level PHB and q level PHB respectively;
4e) judge whether n is 1, if not 1, then forward step 4f to); Otherwise forward step 4g to);
4f) calculate d=|d
k-D
p|-| d
k-D
q|, if d＜0, then α=p and D
α=D
p, if d 〉=0, then α=q and D
α=D
q, upgrade d
α=d
k-D α upgrades time delay apportioning cost d
k=D
α, forward step 4c to),
Wherein, α represents optional PHB time delay upper limit grade, D
αThe time delay estimated value of representing α level PHB;
4g) upgrade time delay apportioning cost d
k=D
p, the time delay apportioning cost that obtains each link on the transmission path is d
k, k ∈ K
L, so far, the time delay apportioning cost computational process of each section link finishes on the transmission path, and the summation of the time delay apportioning cost on all links satisfies
(5) explorer is encapsulated into service bandwidth requirement, routing iinformation and time delay apportioning cost and sends to relevant core router in the routing configuration message and carry out routing configuration, and waits for the routing configuration result of each core router;
(6) core router extracts the bandwidth requirement of access service and the time delay higher limit of being distributed from the routing configuration message of receiving, in conjunction with QoS desired values such as the available bandwidth of each PHB on the respective link port that local available resources state provided and time delay estimated values, go forward side by side walking along the street by configuration according to following steps Dynamic Selection PHB forwarding behavior:
6a) according to time delay apportioning cost d
k, in all PHB set, carry out the coupling first time, obtain the optional PHB set K that the time delay estimated value is not more than the time delay apportioning cost
1:
Wherein,
Represent k
1The pairing time delay estimated value of level PHB;
6b), gather K at optional PHB according to the bandwidth requirement B of business
1In, carry out the coupling second time, obtain the optional PHB set K that available bandwidth is not less than the service bandwidth requirement
2:
Wherein,
k
2∈ K
1Represent k
2The available bandwidth of level PHB;
6c) at optional PHB set K
2In, the PHB that gets time delay estimated value maximum is as best PHB s as a result:
Wherein, D
kExpression K
2In the time delay estimated value of k level PHB correspondence, D
sThe time delay estimated value of representing best PHB s level correspondence;
If 6d) do not match PHB, then select acquiescence PHB or return PHB selection failure;
(7) core router feeds back to explorer with the routing configuration result, if routing configuration success, then the DSCP value of selected PHB correspondence is encapsulated in the routing configuration success message and feeds back to explorer, if the routing configuration failed message is then fed back in the routing configuration failure;
(8) after explorer receives the routing configuration result of corresponding core router, if all routing configuration results are the routing configuration success message, then extract the DSCP in the routing configuration success message and the DSCP of each core router correspondence is encapsulated in the resource allocation success message and feed back to border router, if have a routing configuration failed message, then the resource allocation failed message fed back to border router;
(9) border router is then filled the DSCP of each the core router correspondence on the transmission path if receive the resource allocation success message to the header extension information field of this traffic packets, if receive the resource allocation failed message, then refusal inserts this business;
(10) core router will be resolved to corresponding PHB forwarding behavior with own corresponding DSCP and carry out packet forward according to the extend information territory of packet header.
The present invention compared with prior art has following advantage:
(1) the present invention is because on explorer, time delay upper limit requirement according to access service, in conjunction with the link load degree on each section of transmission path link that network load information provided, calculate the time delay preassignment value on each section link of end-to-end transmission path, again in conjunction with the time delay estimated value of each each PHB of respective link port that network load information provided, calculate the time delay apportioning cost on each section link of end-to-end transmission path, not only time delay guarantees for business provides end to end, and balanced effectively offered load, and the QoS that has reduced Differentiated Services guarantees granularity.
(2) the present invention is because on core router, bandwidth requirement and time delay apportioning cost according to access service, available bandwidth and the time delay estimated value of each PHB on the relevant link that is provided in conjunction with local available resources state, the best PHB of Dynamic Selection carries out routing configuration and packet forward, not only guarantee, more can make full use of network bandwidth resources for access service provides bandwidth and time delay.
Description of drawings
Fig. 1 is a Dynamic Resource Allocation for Multimedia system construction drawing of the present invention;
Fig. 2 is the border router structure chart in the system of the present invention;
Fig. 3 is the explorer structure chart in the system of the present invention;
Fig. 4 is the core router structure chart in the system of the present invention;
Fig. 5 is a dynamic resource allocation method general flow chart of the present invention;
Fig. 6 is the sub-process figure that calculates each section chain-circuit time delay apportioning cost in the inventive method;
Fig. 7 is the sub-process figure that Dynamic Selection PHB transmits behavior in the inventive method.
Embodiment:
Below in conjunction with drawings and Examples content of the present invention is described in detail:
With reference to Fig. 1, the Dynamic Resource Allocation for Multimedia system configuration that is used to support end-to-end time delay to guarantee of the present invention comprises: border router 1, explorer 2 and core router 3.Wherein, transmission is that control signaling message by the signaling channel transmission carries out between border router 1, explorer 2 and the core router 3, and the control signaling message comprises 7 kinds of load updating message, business request information, resource allocation success message, resource allocation failed message, routing configuration message, routing configuration success message and routing configuration failed messages.
Described border router 1, after listening to access service arrival, QoS index requests such as the bandwidth of access service and the time delay upper limit and route result of calculation are encapsulated in the business request information, send to explorer 2, and, processing is filled in the extend information territory of these all packet headers of access service according to the resource allocation result that explorer 2 feeds back.The concrete structure of this module as shown in Figure 2, it comprises service requesting information generation module 11 and packet header control information packing module 12.Wherein, service requesting information generation module 11 is packaged into business request information with QoS index requests such as the bandwidth of access service and the time delay upper limit and route result of calculation, and sends to explorer 2; Packet header control information packing module 12, resource allocation result according to explorer 2 feedbacks, control information is carried out in the extend information territory of traffic packets head filled processing, if resource allocation result is the resource allocation success message, then each core router 3 pairing DSCP on the transmission path that carries in this message are filled into the extend information territory of these all packet headers of business, otherwise, if the resource allocation failed message is then given tacit consent to and is filled or the refusal service access.
Described explorer 2, QoS index request and route result of calculations such as the service bandwidth in the business request information of extraction border router 1 and the time delay upper limit, according to the network load information that obtains from each core router 3, calculate the time delay apportioning cost on each section link on the end-to-end transmission path, and time delay apportioning cost and bandwidth requirement be encapsulated into send to corresponding core router 3 in the routing configuration message, according to the routing configuration result of corresponding core router three feedback, generate resource allocation result and feed back to border router 1.The concrete structure figure of this module as shown in Figure 3, it comprises network load information storehouse 21, service requesting information extraction module 22, time delay balance Distribution Calculation module 23, routing configuration information output module 24 and resource allocation result output module 25.Wherein, network load information storehouse 21 receives the load updating message of each core router, and provides network load information for time delay balance Distribution Calculation module 23; Service requesting information extraction module 22, from business request information, extract QoS index request and route result of calculations such as the professional bandwidth and the time delay upper limit, and the time delay upper limit required and route result of calculation sends time delay balance Distribution Calculation module 23 to, service bandwidth is required and routing iinformation sends routing configuration information output module 24 to; Time delay balance Distribution Calculation module 23, the time delay upper limit of extracting according to service requesting information extraction module 22 requires and route result of calculation, the link load degree in the network load information that provides in conjunction with network load information storehouse 21 and the time delay estimated value of each link port, calculate the time delay apportioning cost on each section link of end-to-end transmission path, and send the time delay apportioning cost to routing configuration information output module 24; Routing configuration information output module 24, the time delay apportioning cost that service bandwidth requires and time delay balance Distribution Calculation module 23 calculates that service requesting information extraction module 22 is extracted is packaged into routing configuration message, and this message is sent to corresponding core router 3; Resource allocation result output module 25, receive the routing configuration result of corresponding core router three feedback, if all routing configuration results are the routing configuration success message, then each core router and corresponding D SCP thereof are encapsulated in the resource allocation success message, feed back to border router 1, if having the routing configuration result of a core router is the routing configuration failed message, then the feedback resource allocation failed message is given border router 1.
Described core router 3, occupied bandwidth and each PHB available resources state of each link port place on local each link of monitoring, generate the load updating message and send to explorer 2 in real time, from the routing configuration message that explorer 2 sends, extract professional time delay apportioning cost and bandwidth requirement, available resources state in conjunction with each PHB of respective link port, Dynamic Selection PHB carries out routing configuration, and the routing configuration result is fed back to explorer 2.The concrete structure figure of this module as shown in Figure 4, it comprises local submodule 31, load information computing module 32, PHB available resource information extraction module 33, PHB and DSCP mapping table 34, routing configuration information extraction module 35, PHB Dynamic Selection and resource distribution module 36 and the routing configuration feedback module 37 measured in real time.Wherein, the local submodule 31 of measuring in real time, available resources states such as the occupied bandwidth on local all links of monitoring in real time and the available bandwidth of each each PHB correspondence of link port place and time delay estimated value, and send the time delay estimated value of the occupied bandwidth of each link and each each PHB correspondence of link port place to load information computing module 32, send available resources states such as the available bandwidth of each each PHB correspondence of link port place and time delay estimated value to PHB available resource information extraction module 33; Load information computing module 32, measure the occupied bandwidth of submodule 31 in real time according to this locality, calculate the link load degree of local each link, and the time delay estimated value of link load degree and each PHB of link port place is packaged into the load updating message, send to explorer 2; PHB available resource information extraction module 33, the available resources state of each each PHB of link port place of this locality that the local measurement in real time of extraction submodule 31 monitors, and supply PHB Dynamic Selection and resource distribution module 36 to carry out the PHB selection; PHB and DSCP mapping table 34 are stored the PHB of each grade and the corresponding relation of DSCP, and provide PHB mapping to DSCP for routing configuration feedback module 37; Routing configuration information extraction module 35, service bandwidth requirement, routing iinformation and time delay apportioning cost in the routing configuration message of extraction explorer 2, and send PHB Dynamic Selection and resource distribution module 36 to; PHB Dynamic Selection and resource distribution module 36, according to bandwidth requirement and time delay higher limit, the available resources state of each PHB of relevant link port that is provided in conjunction with PHB available resource information extraction module 33, Dynamic Selection PHB goes forward side by side walking along the street by configuration, sends PHB and configuration result to routing configuration feedback module 37; Routing configuration feedback module 37, the PHB and the configuration result that provide according to PHB Dynamic Selection and resource distribution module 36, if configuration successful, then inquire about PHB and DSCP mapping table 34 the DSCP that is mapped as with selected PHB, and DSCP is encapsulated into feeds back to explorer 2 in the routing configuration success message, if PHB selects failure or configuration failure, then feed back the routing configuration failed message and give explorer 2.
With reference to Fig. 5, the dynamic resource allocation method that is used to support the end-to-end time delay assurance of the present invention may further comprise the steps:
Step 1: the occupied bandwidth of each link of this locality that each core router obtains according to this locality monitoring, calculate the link load degree of each link according to following formula:
P
j＝B
j/B
j0
Wherein, P
jBe the link load degree of link j, B
jBe the occupied bandwidth of link j, B
J0Bandwidth for link j.
Step 2: each core router is encapsulated in the load updating message network load information of real-time update explorer with the time delay estimated value of link load degree and each PHB.
Step 3: border router generates business request information after listening to access service arrival, is sent to explorer, and this business request information comprises QoS desired value and route result of calculations such as professional bandwidth, the requirement of the time delay upper limit.
Step 4: explorer receives and extracts service bandwidth, the requirement of the time delay upper limit and route result of calculation, in conjunction with network load information and professional time delay upper limit requirement, calculates the time delay apportioning cost on end-to-end each section of transmission path link.
Wherein, network load information comprises the link load degree of each bar link in the network and the time delay estimated value of each PHB of each link port place.
With reference to Fig. 6, the concrete steps that this step is calculated the time delay apportioning cost on end-to-end each section of transmission path link are as follows:
Step 4-1: the link load degree P that obtains each link according to network load information
j, j ∈ K
L, calculate the normalization degree of load of every section link:
J ∈ K
L, then the time delay preassignment value on every section link is: d '
j=D* η
j, j ∈ K
L,
Wherein, K
L=1,2 ..., and L} represents the set of all links on the transmission path, and L is the link sum on the transmission path, and D represents professional time delay upper limit requirement, η
j, j ∈ K
LThe normalization degree of load of expression link j, P
kThe link load degree of expression link k,
The link load degree summation of all links on the expression transmission path, d '
j, j ∈ K
LTime delay preassignment value on the expression link j and having
Step 4-2: initialization K '
L=K
LAnd n=L, initialization K '
LIn the link load degree be P
i=P
jAnd i=j, i ∈ K '
L, j ∈ K
L, time delay preassignment value is d
i=d '
j, and i=j, i ∈ K '
L, j ∈ K
L, initialization d
α=0,
Wherein, K '
LThe set of expression time delay link to be allocated, n represents K '
LMiddle time delay link number to be allocated, P
iExpression K '
LThe link load degree of middle link i, d
iExpression K '
LThe time delay preassignment value of middle link i, d
αThe expression time delay factor;
Step 4-3: at K '
LIn according to formula
Obtain the link k of current link load degree maximum, calculate d
k=d '
k+ d
α, from set K '
LMiddle deletion link k subtracts 1 with n,
Wherein, d
kTime delay apportioning cost on the expression link k, d '
kTime delay preassignment value on the expression link k;
Step 4-4: the time delay estimated value D that obtains each PHB correspondence of link port according to network load information
i, { 1, M} is with time delay apportioning cost d for i ∈
kMatch time delay and distribute the interval [D of limit
p, D
q], make it satisfy D
p≤ d
k≤ D
q, p ∈ 1, M}, q ∈ 1, M},
Wherein, D
i, { 1, M} represents the pairing time delay estimated value of the link port i of place level PHB to i ∈, and M represents the total progression of PHB, D
p, D
qRepresent the pairing time delay estimated value of p level PHB and q level PHB respectively;
Step 4-5: judge whether n is 1, if not 1, then forward step 4-6 to, otherwise forward step 4-7 to;
Step 4-6: calculate d=|d
k-D
p|-| d
k-D
q|, if d＜0, then α=p and D
α=D
p, if d 〉=0, then α=q and D
α=D
q, upgrade d
α=d
k-D
α, upgrade time delay apportioning cost d
k=D
α, forward step 4-3 to,
Wherein, α represents optional PHB time delay upper limit grade, D
αThe time delay estimated value of representing α level PHB;
Step 4-7: upgrade time delay apportioning cost d
k=D
p, the time delay apportioning cost that obtains each link on the transmission path is d
k, k ∈ K
L, so far, the time delay apportioning cost computational process of each section link finishes on the transmission path, and the summation of the time delay apportioning cost on all links satisfies
Step 5: explorer is encapsulated into service bandwidth requirement, routing iinformation and time delay apportioning cost and sends to relevant core router in the routing configuration message and carry out routing configuration, and waits for the routing configuration result of each core router.
Step 6: core router extracts the bandwidth requirement of access service and the time delay higher limit of being distributed from the routing configuration message of receiving, in conjunction with QoS desired values such as the available bandwidth of each PHB on the respective link port that local available resources state provided and time delay estimated values, Dynamic Selection PHB forwarding behavior is gone forward side by side walking along the street by configuration.
Wherein, local available resources state comprises the available bandwidth and the time delay estimated value of each each PHB correspondence of link port place.
With reference to Fig. 7, Dynamic Selection PHB forwarding behavior go forward side by side walking along the street by the configuration concrete steps as follows:
Step 6-1: according to time delay apportioning cost d
k, in all PHB set, carry out the coupling first time, obtain the optional PHB set K that the time delay estimated value is not more than the time delay apportioning cost
1:
Wherein,
Represent k
1The pairing time delay estimated value of level PHB;
Step 6-2: according to the bandwidth requirement B of business, at optional PHB set K
1In, carry out the coupling second time, obtain the optional PHB set K that available bandwidth is not less than the service bandwidth requirement
2:
Wherein,
k
2∈ K
1Represent k
2The available bandwidth of level PHB;
Step 6-3: at optional PHB set K
2In, the PHB that gets time delay estimated value maximum is as best PHB s as a result:
Wherein, D
kExpression K
2In the time delay estimated value of k level PHB correspondence, D
sThe time delay estimated value of representing best PHB s level correspondence;
Step 6-4:, then select acquiescence PHB or return PHB selection failure if do not match PHB.
Step 7: core router feeds back to explorer with the routing configuration result, if routing configuration success, then the DSCP value of selected PHB correspondence is encapsulated in the routing configuration success message and feeds back to explorer, if the routing configuration failed message is then fed back in the routing configuration failure.
Step 8: after explorer receives the routing configuration result of corresponding core router, if all routing configuration results are the routing configuration success message, then extract the DSCP in the routing configuration success message and the DSCP of each core router correspondence is encapsulated in the resource allocation success message and feed back to border router, if have a routing configuration failed message, then the resource allocation failed message fed back to border router.
Step 9: border router is then filled the DSCP of each the core router correspondence on the transmission path if receive the resource allocation success message to the header extension information field of this traffic packets, if receive the resource allocation failed message, then refusal inserts this business.
Step 10: core router will be resolved to corresponding PHB forwarding behavior with own corresponding DSCP and carry out packet forward according to the extend information territory of packet header.
The resource allocation process that utilizes said method to finish, not only can guarantee the end-to-end time delay requirement of access service, and balance network load effectively, the granularity that QoS guarantees reduced, improve network resource utilization, be applicable to packet switching network and IP network.
The term explanation:
QoS:Quality of Service, service quality
DSCP:DiffServ Code Point, the Differentiated Services code-point
PHB:Per-hop Behavior, the single-hop behavior.
Claims (8)
1. Dynamic Resource Allocation for Multimedia system that is used to support that end-to-end time delay guarantees comprises:
Border router (1) is used to access service to send business request information to explorer (2), and all packet header extend information territories of access service is filled;
Explorer (2), be used for time delay upper limit requirement according to business, in conjunction with network load information, calculate the time delay apportioning cost of access service on each section link of end-to-end transmission path, and to core router (3), send routing configuration message, according to the routing configuration result, to border router (1) feedback resources configuration result;
Core router (3) is used for according to routing configuration message, and in conjunction with local available resources state, Dynamic Selection single-hop behavior PHB carries out routing configuration, and the routing configuration result is fed back to explorer (2);
Transmission between described border router (1), explorer (2) and the core router (3) is to be undertaken by the control signaling message that signaling channel transmits.
2. Dynamic Resource Allocation for Multimedia according to claim 1 system, wherein border router (1) comprising:
Service requesting information generation module (11) is used to generate business request information, and this business request information is sent to explorer (2);
Packet header control information packing module (12) is used to receive the resource distribution result of explorer (2), and control information is carried out in the extend information territory of traffic packets head filled.
3. Dynamic Resource Allocation for Multimedia according to claim 1 system, wherein explorer (2) comprising:
Network state information storehouse (21) is used to receive the load lastest imformation that each core router (3) upgrades, and provides network load information for time delay balance Distribution Calculation module (23);
Service requesting information extraction module (22), the service bandwidth that is used for extracting business request information requires, the time delay upper limit requires and route result of calculation, and the time delay upper limit required and route result of calculation sends time delay balance Distribution Calculation module (23) to, service bandwidth is required and routing iinformation sends routing configuration information output module (24) to;
Time delay balance Distribution Calculation module (23), the time delay upper limit that is used for extracting according to service requesting information extraction module (22) requires and route result of calculation, the network load information that provides in conjunction with network load information storehouse (21), calculate the time delay apportioning cost on each section link of end-to-end transmission path, and send the time delay apportioning cost to routing configuration information output module (24);
Routing configuration information output module (24), the time delay apportioning cost that service bandwidth requirement, routing iinformation and the time delay balance Distribution Calculation module (23) that is used for that service requesting information extraction module (22) is transmitted exported is packaged into corresponding routing configuration message, and sends each routing configuration message to corresponding core router (3);
Resource allocation result output module (25) is used for generating resource allocation result according to the routing configuration result that each core router (3) that receives is fed back, and resource allocation result is fed back to border router (1).
4. Dynamic Resource Allocation for Multimedia according to claim 1 system, wherein core router (3) comprising:
The local submodule (31) of measuring in real time, be used for the occupied bandwidth on local each link that links to each other of monitoring in real time, and the available bandwidth and the time delay estimated value of each PHB correspondence on each link port, send the time delay estimated value of each PHB correspondence on the occupied bandwidth of each link and each link port to load information computing module (32), send the available bandwidth and the time delay estimated value of each PHB correspondence on each link port to PHB available resource information extraction module (33);
Load information computing module (32), be used for measuring in real time the time delay estimated value of each PHB correspondence on the occupied bandwidth of each link that submodule (31) transmitted and each link port according to this locality, link load degree on each link that calculating links to each other with this locality, and the time delay estimated value of each PHB correspondence on the link load degree of each link and each link port is packaged into the load lastest imformation, send to explorer (2);
PHB available resource information extraction module (33) is used for extracting the local local available resources state of measuring submodule (31) in real time, and sends PHB Dynamic Selection and resource distribution module (36) to;
PHB and DSCP mapping table (34), the mapping relations that are used to store PHB and DSCP, and provide PHB mapping to DSCP for routing configuration feedback module (37);
Routing configuration information extraction module (35) is used for extracting service bandwidth requirement, routing iinformation and the time delay apportioning cost of the routing configuration message that explorer (2) sends, and sends PHB Dynamic Selection and resource distribution module (36) to;
PHB Dynamic Selection and resource distribution module (36), be used for service bandwidth requirement, routing iinformation and time delay apportioning cost according to routing configuration information extraction module (35) extraction, the local available resources state that provides in conjunction with PHB available resource information extraction module (33), Dynamic Selection PHB carries out routing configuration, and sends PHB and configuration result to routing configuration feedback module (37);
Routing configuration feedback module (37), the PHB and the routing configuration result that provide according to PHB Dynamic Selection and resource distribution module (36) is provided, inquiry PHB and DSCP mapping table (34) are mapped as corresponding D SCP with selected PHB, generate the routing configuration result, and this routing configuration result is fed back to explorer (2).
5. Dynamic Resource Allocation for Multimedia according to claim 1 system, wherein, the control signaling message of signaling channel transmission comprises 7 kinds of load updating message, business request information, resource allocation success message, resource allocation failed message, routing configuration message, routing configuration success message and routing configuration failed messages.
6. a dynamic resource allocation method that is used to support the end-to-end time delay assurance comprises the steps:
(1) occupied bandwidth of each link of this locality of obtaining according to this locality monitoring of each core router, calculate each link load degree according to following formula:
P
j＝B
j/B
j0
Wherein, P
jBe the link load degree of link j, B
jBe the occupied bandwidth of link j, B
J0Bandwidth for link j;
(2) each core router is encapsulated in the load updating message network load information of real-time update explorer with the time delay estimated value of link load degree and each PHB;
(3) after border router listens to access service arrival, generate business request information, be sent to explorer, this business request information comprises QoS desired value and route result of calculations such as professional bandwidth, the requirement of the time delay upper limit;
(4) explorer receive and extract service bandwidth, the time delay upper limit requires and route result of calculation, in conjunction with network load information and professional time delay upper limit requirement, calculates time delay apportioning cost on end-to-end each section of transmission path link according to following steps:
4a) obtain the link load degree P of each link according to network load information
j, j ∈ K
L, calculate the normalization degree of load of every section link:
Then the time delay preassignment value on every section link is:
d′
j＝D*η
j，j∈K
L，
Wherein, K
L=1,2 ..., and L} represents the set of all links on the transmission path, and L is the link sum on the transmission path, and D represents professional time delay upper limit requirement, η
j, j ∈ K
LThe normalization degree of load of expression link j, P
kThe link load degree of expression link k,
The link load degree summation of all links on the expression transmission path, d '
j, j ∈ K
LTime delay preassignment value on the expression link j and having
4b) initialization K '
L=K
LAnd n=L, initialization K '
LIn the link load degree be P
i=P
jAnd i=j, i ∈ K '
L, j ∈ K
L, time delay preassignment value is d
i=d '
j, and i=j, i ∈ K '
L, j ∈ K
L, initialization d
α=0,
Wherein, K '
LThe set of expression time delay link to be allocated, n represents K '
LMiddle time delay link number to be allocated, P
iExpression K '
LThe link load degree of middle link i, d
iExpression K '
LThe time delay preassignment value of middle link i, d
αThe expression time delay factor;
4c) at K '
LIn according to formula
Obtain the link k of current link load degree maximum, calculate d
k=d '
k+ d
α, from set K '
LMiddle deletion link k subtracts 1 with n,
Wherein, d
kTime delay apportioning cost on the expression link k, d '
kTime delay preassignment value on the expression link k;
4d) according to the time delay estimated value D of each PHB correspondence of link port
i, { 1, M} is with time delay apportioning cost d for i ∈
kMatch time delay and distribute the interval [D of limit
p, D
q], make it satisfy D
p≤ d
k≤ D
q, p ∈ 1, M}, q ∈ 1, M},
Wherein, D
i, { 1, M} represents the pairing time delay estimated value of the link port i of place level PHB to i ∈, and M represents the total progression of PHB, D
p, D
qRepresent the pairing time delay estimated value of p level PHB and q level PHB respectively;
4e) judge whether n is 1, if not 1, then forward step 4f to), otherwise forward step 4g to);
4f) calculate d=|d
k-D
p|-| d
k-D
q|, if d＜0, then α=p and D
α=D
p, if d 〉=0, then α=q and D
α=D
q, upgrade d
α=d
k-D
α, upgrade time delay apportioning cost d
k=D
α, forward step 4c to),
Wherein, α represents optional PHB time delay upper limit grade, D
αThe time delay estimated value of representing α level PHB;
4g) upgrade time delay apportioning cost d
k=D
p, the time delay apportioning cost that obtains each link on the transmission path is d
k, k ∈ K
L, so far, the time delay apportioning cost computational process of each section link finishes on the transmission path, and the summation of the time delay apportioning cost on all links satisfies
(5) explorer is encapsulated into service bandwidth requirement, routing iinformation and time delay apportioning cost and sends to relevant core router in the routing configuration message and carry out routing configuration, and waits for the routing configuration result of each core router;
(6) core router extracts the bandwidth requirement of access service and the time delay higher limit of being distributed from the routing configuration message of receiving, in conjunction with QoS desired values such as the available bandwidth of each PHB on the respective link port that local available resources state provided and time delay estimated values, go forward side by side walking along the street by configuration according to following steps Dynamic Selection PHB forwarding behavior:
6a) according to time delay apportioning cost d
k, in all PHB set, carry out the coupling first time, obtain the optional PHB set K that the time delay estimated value is not more than the time delay apportioning cost
1:
Wherein,
Represent k
1The pairing time delay estimated value of level PHB;
6b), gather K at optional PHB according to the bandwidth requirement B of business
1In, carry out the coupling second time, obtain the optional PHB set K that available bandwidth is not less than the service bandwidth requirement
2:
Wherein,
k
2∈ K
1Represent k
2The available bandwidth of level PHB;
6c) at optional PHB set K
2In, the PHB that gets time delay estimated value maximum is as best PHB s as a result:
Wherein, D
kExpression K
2In the time delay estimated value of k level PHB correspondence, D
sThe time delay estimated value of representing best PHB s level correspondence;
If 6d) do not match PHB, then select acquiescence PHB or return PHB selection failure;
(7) core router feeds back to explorer with the routing configuration result, if routing configuration success, then the DSCP value of selected PHB correspondence is encapsulated in the routing configuration success message and feeds back to explorer, if the routing configuration failed message is then fed back in the routing configuration failure;
(8) after explorer receives the routing configuration result of corresponding core router, if all routing configuration results are the routing configuration success message, then extract the DSCP in the routing configuration success message and the DSCP of each core router correspondence is encapsulated in the resource allocation success message and feed back to border router, if have a routing configuration failed message, then the resource allocation failed message fed back to border router;
(9) border router is then filled the DSCP of each the core router correspondence on the transmission path if receive the resource allocation success message to the header extension information field of this traffic packets, if receive the resource allocation failed message, then refusal inserts this business;
(10) core router will be resolved to corresponding PHB forwarding behavior with own corresponding DSCP and carry out packet forward according to the extend information territory of packet header.
7. dynamic resource allocation method according to claim 6, wherein the described network load information of step (2) comprises the link load degree of each bar link in the network and the time delay estimated value of each PHB of each link port place.
8. dynamic resource allocation method according to claim 6, the described local available resources state of step (2) wherein comprises the available bandwidth and the time delay estimated value of each each PHB correspondence of link port place.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010013728XA CN101729430B (en) | 2010-01-15 | 2010-01-15 | Dynamic resource allocation system and allocation method used for supporting end-to-end time delay warranty |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201010013728XA CN101729430B (en) | 2010-01-15 | 2010-01-15 | Dynamic resource allocation system and allocation method used for supporting end-to-end time delay warranty |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN101729430A true CN101729430A (en) | 2010-06-09 |
| CN101729430B CN101729430B (en) | 2012-05-23 |
Family
ID=42449671
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201010013728XA Expired - Fee Related CN101729430B (en) | 2010-01-15 | 2010-01-15 | Dynamic resource allocation system and allocation method used for supporting end-to-end time delay warranty |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN101729430B (en) |
Cited By (15)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103546212A (en) * | 2013-10-30 | 2014-01-29 | 南京艾科朗克信息科技有限公司 | Multi-granularity optical network test control method for services |
| WO2016082105A1 (en) * | 2014-11-25 | 2016-06-02 | 华为技术有限公司 | Transmission access scheduling method, access point device and station device |
| CN106454920A (en) * | 2016-11-02 | 2017-02-22 | 北京邮电大学 | Resource allocation optimization algorithm based on time delay guarantee in LTE (Long Term Evolution) and D2D (Device-to-Device) hybrid network |
| CN106656807A (en) * | 2015-11-02 | 2017-05-10 | 华为技术有限公司 | Message forwarding method and SDN switch |
| CN107222407A (en) * | 2016-03-21 | 2017-09-29 | 华为技术有限公司 | A kind of determination method of time delay index, apparatus and system |
| WO2018086412A1 (en) * | 2016-11-08 | 2018-05-17 | 华为技术有限公司 | Time delay control method, apparatus and system |
| CN108260169A (en) * | 2018-01-26 | 2018-07-06 | 重庆邮电大学 | A kind of service function chain dynamic deployment method ensured based on QoS |
| CN109587078A (en) * | 2018-12-17 | 2019-04-05 | 联想(北京)有限公司 | A kind of adjusting method, the network equipment and electronic equipment |
| CN111327688A (en) * | 2020-01-21 | 2020-06-23 | 北京奇艺世纪科技有限公司 | Resource scheduling method, server and readable storage medium |
| CN112600763A (en) * | 2020-12-09 | 2021-04-02 | 西安邮电大学 | Low-cost flow distribution implementation method capable of guaranteeing delay |
| CN113132252A (en) * | 2019-12-30 | 2021-07-16 | 瞻博网络公司 | Injection for unequal link connections in an internal switching fabric |
| CN113391985A (en) * | 2021-06-09 | 2021-09-14 | 北京猿力未来科技有限公司 | Resource allocation method and device |
| CN114363737A (en) * | 2021-12-09 | 2022-04-15 | 国网新疆电力有限公司 | Optical transmission network resource optimization configuration method, system and storage medium thereof |
| CN115695895A (en) * | 2021-07-21 | 2023-02-03 | 成都极米科技股份有限公司 | Method, device, equipment and storage medium for improving data transmission rate |
| CN113132252B (en) * | 2019-12-30 | 2024-05-31 | 瞻博网络公司 | Injection for unequal link connections in an internal switching fabric |
-
2010
- 2010-01-15 CN CN201010013728XA patent/CN101729430B/en not_active Expired - Fee Related
Cited By (23)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103546212A (en) * | 2013-10-30 | 2014-01-29 | 南京艾科朗克信息科技有限公司 | Multi-granularity optical network test control method for services |
| WO2016082105A1 (en) * | 2014-11-25 | 2016-06-02 | 华为技术有限公司 | Transmission access scheduling method, access point device and station device |
| CN106656807A (en) * | 2015-11-02 | 2017-05-10 | 华为技术有限公司 | Message forwarding method and SDN switch |
| CN107222407A (en) * | 2016-03-21 | 2017-09-29 | 华为技术有限公司 | A kind of determination method of time delay index, apparatus and system |
| CN106454920B (en) * | 2016-11-02 | 2019-10-08 | 北京邮电大学 | Resource allocation optimization algorithm based on Delay Guarantee in a kind of LTE and D2D hybrid network |
| CN106454920A (en) * | 2016-11-02 | 2017-02-22 | 北京邮电大学 | Resource allocation optimization algorithm based on time delay guarantee in LTE (Long Term Evolution) and D2D (Device-to-Device) hybrid network |
| CN108063653B (en) * | 2016-11-08 | 2020-02-14 | 华为技术有限公司 | Time delay control method, device and system |
| CN108063653A (en) * | 2016-11-08 | 2018-05-22 | 华为技术有限公司 | A kind of delay control method, apparatus and system |
| WO2018086412A1 (en) * | 2016-11-08 | 2018-05-17 | 华为技术有限公司 | Time delay control method, apparatus and system |
| CN108260169B (en) * | 2018-01-26 | 2021-04-02 | 重庆邮电大学 | QoS guarantee-based dynamic service function chain deployment method |
| CN108260169A (en) * | 2018-01-26 | 2018-07-06 | 重庆邮电大学 | A kind of service function chain dynamic deployment method ensured based on QoS |
| CN109587078A (en) * | 2018-12-17 | 2019-04-05 | 联想(北京)有限公司 | A kind of adjusting method, the network equipment and electronic equipment |
| CN113132252A (en) * | 2019-12-30 | 2021-07-16 | 瞻博网络公司 | Injection for unequal link connections in an internal switching fabric |
| CN113132252B (en) * | 2019-12-30 | 2024-05-31 | 瞻博网络公司 | Injection for unequal link connections in an internal switching fabric |
| CN111327688A (en) * | 2020-01-21 | 2020-06-23 | 北京奇艺世纪科技有限公司 | Resource scheduling method, server and readable storage medium |
| CN111327688B (en) * | 2020-01-21 | 2022-03-25 | 北京奇艺世纪科技有限公司 | Resource scheduling method, server and readable storage medium |
| CN112600763B (en) * | 2020-12-09 | 2022-08-19 | 西安邮电大学 | Low-cost flow distribution implementation method capable of guaranteeing delay |
| CN112600763A (en) * | 2020-12-09 | 2021-04-02 | 西安邮电大学 | Low-cost flow distribution implementation method capable of guaranteeing delay |
| CN113391985A (en) * | 2021-06-09 | 2021-09-14 | 北京猿力未来科技有限公司 | Resource allocation method and device |
| CN115695895A (en) * | 2021-07-21 | 2023-02-03 | 成都极米科技股份有限公司 | Method, device, equipment and storage medium for improving data transmission rate |
| CN115695895B (en) * | 2021-07-21 | 2024-05-10 | 极米科技股份有限公司 | Method, device, equipment and storage medium for improving data transmission rate |
| CN114363737B (en) * | 2021-12-09 | 2024-02-20 | 国网新疆电力有限公司 | Optical transmission network resource optimal configuration method, system and storage medium thereof |
| CN114363737A (en) * | 2021-12-09 | 2022-04-15 | 国网新疆电力有限公司 | Optical transmission network resource optimization configuration method, system and storage medium thereof |
Also Published As
| Publication number | Publication date |
|---|---|
| CN101729430B (en) | 2012-05-23 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101729430B (en) | Dynamic resource allocation system and allocation method used for supporting end-to-end time delay warranty | |
| CN103650435B (en) | Routing traffic method of adjustment, device and controller | |
| WO2017005223A1 (en) | Information sharing method of smart electricity meter, smart electricity meter and acquisition router | |
| CN108809857A (en) | A method of the traffic monitoring based on SDN and service quality securing strategy | |
| CN105897575A (en) | Path computing method based on multi-constrained path computing strategy under SDN | |
| CN105610714B (en) | The control method and device and SDN controller of SDN network | |
| CN100505639C (en) | Method of implementing resource application for multi-service streams | |
| CN102571557A (en) | Dynamically generating application-layer traffic optimization protocol maps | |
| CN105323099B (en) | Business network flowmeter factor method, network resource scheduling method and network element | |
| CN102972009A (en) | A system and method to implement joint server selection and path selection | |
| JP2004236332A (en) | Identification of packet data flow for multiplexing | |
| CN102075444A (en) | Network system and method for guaranteeing multi-type service quality | |
| CN109787801A (en) | A kind of network service management methods, devices and systems | |
| CN101849388B (en) | For the method for quality of service management of the next generation network based on Ethernet | |
| CN104348743A (en) | Whole-network load balancing method and device | |
| CN101094153A (en) | Method and apparatus for transmitting data between the sending station and the receiving station | |
| CN106161053A (en) | A kind of SDN controller QoS manages system and method | |
| CN101325542B (en) | Method for acquiring PCE capability information between fields, PCE and capability-acquiring apparatus | |
| CN103595764B (en) | The Multi-service QoS safeguard system of a kind of ultra-large VSAT system and its implementation | |
| CN101753449A (en) | Resource management system supporting the probability guarantee of end-to-end delay and the method thereof | |
| CN101599843A (en) | Quality control method for multicast service based on IPv6 | |
| CN106464670A (en) | Network entity and service policy management method | |
| Wang et al. | Edge-based traffic engineering for OSPF networks | |
| CN101345714B (en) | Access method and system for label exchange route | |
| Mammeri | Framework for parameter mapping to provide end-to-end QoS guarantees in IntServ/DiffServ architectures |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| C14 | Grant of patent or utility model | ||
| GR01 | Patent grant | ||
| CF01 | Termination of patent right due to non-payment of annual fee |
Granted publication date: 20120523 Termination date: 20160115 |
|
| EXPY | Termination of patent right or utility model |