CN101977159A - Management method of bandwidth resources of narrow band network - Google Patents

Management method of bandwidth resources of narrow band network Download PDF

Info

Publication number
CN101977159A
CN101977159A CN2010105610157A CN201010561015A CN101977159A CN 101977159 A CN101977159 A CN 101977159A CN 2010105610157 A CN2010105610157 A CN 2010105610157A CN 201010561015 A CN201010561015 A CN 201010561015A CN 101977159 A CN101977159 A CN 101977159A
Authority
CN
China
Prior art keywords
bandwidth
paths
node
path
link
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
Application number
CN2010105610157A
Other languages
Chinese (zh)
Inventor
杨晓
康宗绪
杨钊
于进强
罗佳
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Chongqing Jinmei Communication Co Ltd
Original Assignee
Chongqing Jinmei Communication Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Chongqing Jinmei Communication Co Ltd filed Critical Chongqing Jinmei Communication Co Ltd
Priority to CN2010105610157A priority Critical patent/CN101977159A/en
Publication of CN101977159A publication Critical patent/CN101977159A/en
Pending legal-status Critical Current

Links

Images

Abstract

The invention discloses a management method of bandwidth resources of a narrow band network, which comprises the following steps of: (1) calculating the compactness of each node in a routing domain, and taking the node with the biggest compactness value as a central node; (2) taking the central node as a temporary resource manager to manage the current bandwidth resources of the whole network; (3) recalculating the compactness of each node in the routing domain according to cycle, re-determining the central node according to the calculated node with the biggest compactness value, and repeating the steps (3) and (4). The management method has the advantages that: in the method, a flexible recombination strategy is adopted for the network bandwidth resources, and the central node is used for deploying the network bandwidth resources as required, so the method has the capacity of adjusting the resources of the whole network, has very low network management cost, and can realize large-traffic data transmission services in the narrow band network.

Description

The management method of narrowband network bandwidth resources
Technical field
The present invention relates to a kind of communication technology, relate in particular to a kind of management method of narrowband network bandwidth resources.
Background technology
Traditional Routing Protocol adopts shortest path first, do not take into full account the bandwidth availability ratio on the service transmission path, do not possess the whole network resource adjustments ability, this has just caused the flow distribution imbalance on the network, cause the network portion link easily because the overweight generation congestion phenomenon of load, and other link is in idle condition, influences the overall performance of network.In narrowband network, the difficult transmission requirement of supporting big data on flows business of narrow band link, therefore, foregoing problems is more outstanding in narrowband network.
Utilize the TE of OSPF to expand a kind of general practice that the management that realizes Internet resources is present broadband network, OSPF (Open Shortest Path First ospf) is an Interior Gateway Protocol (Interior Gateway Protocol, be called for short IGP), be used in single autonomous system (autonomous system, AS) interior decision-making route.Relative with RIP, OSPF is a link-state routing protocol, and RIP is the distance vector Routing Protocol.Comprise O S P F, all S P F Routing Protocols are based on a mathematical algorithm-D i j k s t r a algorithm.This algorithm can make Route Selection based on Link State, rather than distance vector.Link is the another kind of saying of router interface, so OSPF is also referred to as the Interface status Routing Protocol.OSPF sets up LSD by the state of advertised network interface between the router, generates shortest path tree, and each ospf router uses these shortest path structure routing tables.The OSPF Routing Protocol is the Routing Protocol of a kind of typical Link State (Link-state), generally is used in the same routed domain.Here, routed domain is meant an autonomous system (Autonomous System), i.e. AS, and it is meant one group of network of intercoursing routing iinformation by unified route policy or Routing Protocol.In this AS, all ospf routers are all safeguarded the database (being LSD) of this AS structure of identical description, what deposit in this database is the state information of respective link in the routed domain, and ospf router calculates its ospf routing table by this database just.
As a kind of Routing Protocol of Link State, OSPF is with Link State Advertisement packet LSA(Link State Advertisement) send the all-router in a certain zone to, this point is different with distance vector routing protocol.The router of range ability vector Routing Protocol is that part or all of routing table is passed to the router that is adjacent.OSPF-TE---the OSPF of band traffic engineering.OSPF-TE is the expansion link attribute to the expansion essence of the traffic engineering of OSPF, promptly increases link parameter in the OSPF announcement.This expansion provides a kind of description traffic engineering topology (comprising bandwidth and regulatory limits) and the method for distributing information in a given ospf domain.This topology does not need the topology coupling with conventional routing, but need rely on Network-LSAs when describing the multiple access link.The OSPF-TE traffic engineering database comprises: the link attribute of supervision expansion, local based on the source routing of constraint and whole traffic engineerings.When certain link circuit resource (being generally bandwidth resources) in the network when changing, by filling Opaque LSA and utilize the OSPF extension mechanism to carry out the whole network diffusion, reach the synchronous administrative purposes of each node resource of network.The outer bandwidth cost of this resource management mode meeting occupying volume, expense can be ignored in broadband network; But this administration overhead need reduce as far as possible in the narrowband network the inside, to save valuable link bandwidth resource.
Therefore, the resource management system of present narrowband network can't satisfy user's demand.
Summary of the invention
At the problem in the background technology, the present invention proposes a kind of management method of narrowband network bandwidth resources, comprise the steps:
(1) calculate the tightness of each node in the routed domain, with the node of tightness value maximum as Centroid;
(2) serve as Resource Manager by Centroid temporarily, current whole network bandwidth resources are distributed and managed;
(3) regularly (cycle is determined by network size) recomputates the tightness of each node in the routed domain, and the node according to the tightness value maximum that calculates redefines Centroid, repeating step (3), (4).
Step (1) comprising: if in the routed domain n node arranged, each node is distinguished mark with 1 to n sequence number, with network
In the tightness index definition of a certain node be
Figure 2010105610157100002DEST_PATH_IMAGE002
, x ∈ n, y ∈ n, and x ≠ y, its implication is: remove x
Each node beyond the individual node is to the derivative of the jumping figure sum of x node; The tightness index is carried out normalized,
Figure 2010105610157100002DEST_PATH_IMAGE004
, get
Figure 2010105610157100002DEST_PATH_IMAGE006
The node at result of calculation maximum place is a Centroid;
Wherein,
Figure 2010105610157100002DEST_PATH_IMAGE008
It is the tightness of x node;
For
Figure 731376DEST_PATH_IMAGE008
Tightness value after normalized.
Step (2) comprising:
1) LSD with the OSPF Routing Protocol converts traffic engineering database to;
If the source node that sends service request has the M bar to the path of destination node, the needed bandwidth on demand amount of this time service request is Q,
2) Centroid is according to the information in the traffic engineering database, and under current transmission state, the path bandwidth weights of every paths calculate, and find out the path that the path bandwidth weights meet the demands, and supposes that there is the m bar in the path that meets the demands;
3) by Centroid the remaining bandwidth of every paths in the m paths is calculated and remaining bandwidth is added up, establishing accumulation result is Q1, and as Q1 〉=Q, then the bandwidth on demand amount Q with this service request shares to the m paths and transmission;
As Q1＜Q, then the part that equates with Q1 numerical value among the bandwidth on demand amount Q is shared to the m paths, and calculate the difference Q2 of Q and Q1, the bandwidth of having shared is deducted from respective path, with Q2 as a new bandwidth on demand, repeating step 1), 2), 3), until Q2≤0, finally obtain to share fully all paths of bandwidth on demand amount Q, share to these paths Q and transmission;
4) resource allocation and link adjustment information and traffic engineering database is synchronous.
Described LSD with the OSPF Routing Protocol converts traffic engineering database to, comprise: in the topology table of the LSD of OSPF Routing Protocol, the annexation of each node in the routed domain and the metric Cost of each link have been comprised, according to formula B= / Cost converts to metric Cost, tries to achieve corresponding B, the B that tries to achieve is carried out corresponding, combination with original information in the LSD, thereby form traffic engineering database; In the formula,
Figure 2010105610157100002DEST_PATH_IMAGE012
Be the sign link bandwidth.
Step 2) comprising: establish a certain path P in the M paths, then the bandwidth load rate of path P is
Figure 2010105610157100002DEST_PATH_IMAGE014
Wherein, i is the mark of source node, and j is the mark of destination node, Expression certain bar link from source node i to destination node j;
Figure 2010105610157100002DEST_PATH_IMAGE018
The expression link
Figure 876226DEST_PATH_IMAGE016
The bandwidth load rate,
Figure 2010105610157100002DEST_PATH_IMAGE020
, in the formula,
Figure 2010105610157100002DEST_PATH_IMAGE022
Be link
Figure 396069DEST_PATH_IMAGE016
Remaining bandwidth,
Figure 2010105610157100002DEST_PATH_IMAGE024
Be link
Figure 335075DEST_PATH_IMAGE016
Capacity;
Figure 2010105610157100002DEST_PATH_IMAGE026
Expression meets the path
The link of P
Figure 282171DEST_PATH_IMAGE016
Figure 2010105610157100002DEST_PATH_IMAGE028
For meeting the peaked link of bandwidth load rate of path P, also be the bandwidth load rate of path P;
The bandwidth weights of calculating path P,
Figure 2010105610157100002DEST_PATH_IMAGE030
,
Wherein,
Figure 2010105610157100002DEST_PATH_IMAGE032
Bandwidth weights for path P;
Figure 2010105610157100002DEST_PATH_IMAGE034
Remaining bandwidth minimum value for the link that meets path P;
Calculate the average of the bandwidth weights in all paths from the source node to the destination node,
Figure 2010105610157100002DEST_PATH_IMAGE036
Wherein, e is the set in all paths from source node i to destination node j in the routed domain;
Search and satisfy condition
Figure 2010105610157100002DEST_PATH_IMAGE038
All paths, promptly get the m paths that meets the demands.
In the step 3), each paths is shared bandwidth as follows:
If a certain path P in the m paths is according to the bandwidth absorption rate of following formula calculating path P
Figure 2010105610157100002DEST_PATH_IMAGE040
,
Figure 2010105610157100002DEST_PATH_IMAGE042
Wherein, e1 is the set in the path be made up of the m paths;
Figure 2010105610157100002DEST_PATH_IMAGE044
,
Figure 439450DEST_PATH_IMAGE032
Be the bandwidth weights of path P,
Figure 170645DEST_PATH_IMAGE038
Average for the bandwidth weights in all paths from the source node to the destination node;
Each paths is by each self-corresponding bandwidth absorption rate
Figure 164009DEST_PATH_IMAGE040
Q shares to bandwidth on demand.
In the step 3), judge bandwidth summation that each paths the is shared Q1＜Q that whether satisfies condition as follows:
Calculate the summation Q1 of the bandwidth that the m paths shared; Calculate the least residue bandwidth of each paths in the m paths, that paths of least residue bandwidth value minimum is designated as t, then its least residue bandwidth is
Figure 2010105610157100002DEST_PATH_IMAGE046
, the bandwidth absorption rate of this paths is , then this paths bandwidth of sharing is
Figure 2010105610157100002DEST_PATH_IMAGE050
, if t apportioned bandwidth in path satisfies condition
Figure 2010105610157100002DEST_PATH_IMAGE052
, think that then the condition of Q1 〉=Q is set up, promptly bandwidth on demand Q has been shared, and can transmit; Otherwise, bandwidth on demand Q has not also been shared, calculate the difference Q2=Q-Q1 of Q and Q1, the bandwidth of having shared is deducted from respective path, with Q2 as a new bandwidth on demand, repeating step 1), 2), 3), until Q2≤0, finally obtain to share fully all paths of bandwidth on demand amount Q, share to these paths Q and transmission.
Useful technique effect of the present invention is: this method is by taking flexible reorganization strategy to network bandwidth resources, by Centroid distributed in demand network bandwidth resources, possess the whole network resource adjustments ability, network management overhead is very little, can realize big data on flows transport service in narrowband network.
Description of drawings
Fig. 1, Centroid software module graph of a relation of the present invention;
Fig. 2, Centroid of the present invention are selected by degree index result of calculation schematic diagram;
Fig. 3, Centroid of the present invention are selected by tightness index result of calculation schematic diagram.
Embodiment
The solution of the present invention can be sketched and be: choose Centroid from each node, carry out resource allocation by Centroid for the current business request of all the other nodes, according to running status, the regular update Centroid, and carry out resource allocation for the current business request of all the other nodes by new Centroid.This scheme can be carried out flexibility reorganization to network bandwidth resources, and network bandwidth resources is distributed according to need, and has avoided in the prior art, though transmission path has obtained the shortizationest, the problem of network congestion can occur; And Centroid itself also dynamically adjusted, and well taken into account the actual transmissions state of network, makes narrowband network can satisfy the needs of big data on flows transport service; Its concrete scheme is:
(1) calculate the tightness of each node in the routed domain, with the node of tightness value maximum as Centroid;
(2) serve as Resource Manager by Centroid temporarily, current whole network bandwidth resources are managed;
(3) regularly recomputate the tightness of each node in the routed domain, the node according to the tightness value maximum that calculates redefines Centroid, repeating step (3), (4).
The matter of utmost importance that needs in this scheme to solve is how to choose Centroid; In the prior art, when describing this centralization problem, general expenditure index is described the direct influence power that node produced in the static network, the node number of its value for directly linking to each other with this node.If have n node in the network, then the degree index definition of node x is
Figure 2010105610157100002DEST_PATH_IMAGE054
, the node number that directly links to each other of d (x) expression and node x wherein is called the degree of this node.If the availability index is carried out the centralization of node, the ability that then can embody this node and establish direct links between the node around it.But this " ability of establishing direct links " can't reflect the resource allocation of node, and therefore, the inventor has proposed the tightness index:
Tightness (Closeness Centrality) can be described out node in the network arrives other node in the network by network complexity, the tightness index can reflect the structure of the network overall situation more than the degree index, use the tightness index and carry out the size that the node degree value has not only been considered in centralization, but also considered the centrality of node present position in network, as Fig. 2 is according to the result who spends index test, and Fig. 3 is the result according to the tightness index test.By contrasting easy discovery, carry out the centralization accuracy of test apparently higher than carrying out the centralization accuracy of test according to the degree index according to the tightness index.Therefore, the tightness index has better reflected the ability that node is exerted one's influence to other node by network.
The strategy that Centroid is selected is to utilize the centralization index of tightness index as network.At each node in the network, calculate the shortest path jumping figure summation that it arrives every other node, if unreachable between another node in node and the network, getting this path jumping figure is 255.The node of jumping figure summation minimum is the Centroid of network.Node regularly (adopting a timer) carries out the calculating of network center's node, if better Centroid, will shift automatically.
Start a timer after the topology collection that node is initiated is finished, time span is T minute (adjusting according to network size), carries out network center's node behind the timer expiry and calculates and shift.Once calculate and may have a plurality of Centroids, check whether present node is one of Centroid this moment.If then do not shift, otherwise from the node that meets the demands, select one at random, notify it ready, and network topological information is transferred on the new node as Centroid and to special target localization message of its transmission.
The concrete scheme of choosing Centroid is:
If n node arranged in the routed domain, each node is distinguished mark with 1 to n sequence number, with a certain node in the network tightly
Density index is defined as
Figure 295170DEST_PATH_IMAGE002
, x ∈ n, y ∈ n, and x ≠ y, its implication is: each except that x node
Node is to the derivative of the jumping figure sum of x node; The tightness index is carried out normalized,
Figure 94498DEST_PATH_IMAGE004
, get
Figure 680201DEST_PATH_IMAGE006
The node at result of calculation maximum place is a Centroid;
Wherein,
Figure 110045DEST_PATH_IMAGE008
It is the tightness of x node;
Figure 413987DEST_PATH_IMAGE006
For
Figure 751428DEST_PATH_IMAGE008
Tightness value after normalized.
After choosing Centroid, just can utilize the easier ability that other node is exerted one's influence of Centroid, come resource has been distributed, its concrete mode is:
1) LSD (LSD is that OSPF Routing Protocol itself has) with the OSPF Routing Protocol converts traffic engineering database to; This conversion of database is the basis that Centroid carries out subsequent treatment;
If the source node that sends service request has the M bar to the path of destination node, the needed bandwidth on demand amount of this time service request is Q,
2) Centroid is according to the information in the traffic engineering database, and under current transmission state, the path bandwidth weights of every paths calculate, and find out the path that the path bandwidth weights meet the demands, and supposes that there is the m bar in the path that meets the demands;
3) by Centroid the remaining bandwidth of every paths in the m paths is calculated and remaining bandwidth is added up, establishing accumulation result is Q1, and as Q1 〉=Q, then the bandwidth on demand amount Q with this service request shares to the m paths and transmission;
As Q1＜Q, then the part that equates with Q1 numerical value among the bandwidth on demand amount Q is shared to the m paths, and calculate the difference Q2 of Q and Q1, the bandwidth of having shared is deducted from respective path, with Q2 as a new bandwidth on demand, repeating step 1), 2), 3), until Q2≤0, finally obtain to share fully all paths of bandwidth on demand amount Q, share to these paths Q and transmission;
4) resource allocation and link adjustment information and traffic engineering database is synchronous.
Abovementioned steps has summarized a basic program train of thought, and following is some specific embodiments that can realize it:
LSD with the OSPF Routing Protocol described in the step 1) converts traffic engineering database to, comprise: in the topology table of the LSD of OSPF Routing Protocol, the annexation of each node in the routed domain and the metric Cost of each link have been comprised, according to formula B=
Figure 457215DEST_PATH_IMAGE010
/ Cost converts to metric Cost, tries to achieve corresponding B, the B that tries to achieve is carried out corresponding, combination with original information in the LSD, thereby form traffic engineering database; In the formula, be the sign link bandwidth.
Step 2) be: establish a certain path P in the M paths, then the bandwidth load rate of path P is
Figure 854699DEST_PATH_IMAGE014
Wherein, i is the mark of source node, and j is the mark of destination node,
Figure 660586DEST_PATH_IMAGE016
Expression certain bar link from source node i to destination node j;
Figure 801717DEST_PATH_IMAGE018
The expression link
Figure 299694DEST_PATH_IMAGE016
The bandwidth load rate,
Figure 133658DEST_PATH_IMAGE020
, in the formula, Be link
Figure 91436DEST_PATH_IMAGE016
Remaining bandwidth,
Figure 506237DEST_PATH_IMAGE024
Be link
Figure 511102DEST_PATH_IMAGE016
Capacity;
Figure 11353DEST_PATH_IMAGE026
Expression meets the link of path P
Figure 431970DEST_PATH_IMAGE016
Figure 969787DEST_PATH_IMAGE028
For meeting the peaked link of bandwidth load rate of path P, also be the bandwidth load rate of path P;
The bandwidth weights of calculating path P,
Figure 145553DEST_PATH_IMAGE030
,
Wherein, Bandwidth weights for path P;
Figure 419725DEST_PATH_IMAGE034
Remaining bandwidth minimum value for the link that meets path P;
Calculate the average of the bandwidth weights in all paths from the source node to the destination node,
Figure 543539DEST_PATH_IMAGE036
Wherein, e is the set in all paths from source node i to destination node j in the routed domain;
Search and satisfy condition
Figure 890207DEST_PATH_IMAGE032
Figure 302734DEST_PATH_IMAGE038
All paths, promptly get the m paths that meets the demands.
In the step 3), each paths is shared bandwidth as follows:
If a certain path P in the m paths is according to the bandwidth absorption rate of following formula calculating path P ,
Figure 636949DEST_PATH_IMAGE042
Wherein, e1 is the set in the path be made up of the m paths;
Figure 891868DEST_PATH_IMAGE044
,
Figure 854008DEST_PATH_IMAGE032
Be the bandwidth weights of path P, Average for the bandwidth weights in all paths from the source node to the destination node;
Each paths is by each self-corresponding bandwidth absorption rate
Figure 846421DEST_PATH_IMAGE040
Q shares to bandwidth on demand.
In the step 3), judge bandwidth summation that each paths the is shared Q1＜Q that whether satisfies condition as follows:
Calculate the summation Q1 of the bandwidth that the m paths shared; Calculate the least residue bandwidth of each paths in the m paths, that paths of least residue bandwidth value minimum is designated as t, then its least residue bandwidth is
Figure 206995DEST_PATH_IMAGE046
, the bandwidth absorption rate of this paths is
Figure 656431DEST_PATH_IMAGE048
, then this paths bandwidth of sharing is
Figure 88549DEST_PATH_IMAGE050
, if t apportioned bandwidth in path satisfies condition
Figure 41462DEST_PATH_IMAGE052
, think that then the condition of Q1 〉=Q is set up, promptly bandwidth on demand Q has been shared, and can transmit; Otherwise, bandwidth on demand Q has not also been shared, calculate the difference Q2=Q-Q1 of Q and Q1, the bandwidth of having shared is deducted from respective path, with Q2 as a new bandwidth on demand, repeating step 1), 2), 3), until Q2≤0, finally obtain to share fully all paths of bandwidth on demand amount Q, share to these paths Q and transmission.

Claims (7)

1. the management method of narrowband network bandwidth resources is characterized in that: comprise the steps:
(1) calculate the tightness of each node in the routed domain, with the node of tightness value maximum as Centroid;
(2) serve as Resource Manager by Centroid temporarily, current whole network bandwidth resources are managed;
(3) recomputate the tightness of each node in the routed domain by the cycle, the node according to the tightness value maximum that calculates redefines Centroid, repeating step (3), (4).
2. the management method of narrowband network bandwidth resources according to claim 1, it is characterized in that: step (1) comprising: if in the routed domain n node arranged, each node is distinguished mark with 1 to n sequence number, the tightness of a certain node in the network is referred to
Mark is defined as
Figure 2010105610157100001DEST_PATH_IMAGE002
, x ∈ n, y ∈ n, and x ≠ y, its implication is: each node except that x node arrives
The derivative of the jumping figure sum of x node; The tightness index is carried out normalized,
Figure 2010105610157100001DEST_PATH_IMAGE004
, get
Figure 2010105610157100001DEST_PATH_IMAGE006
The node at result of calculation maximum place is a Centroid;
Wherein,
Figure 2010105610157100001DEST_PATH_IMAGE008
It is the tightness of x node;
Figure 844818DEST_PATH_IMAGE006
For
Figure 453654DEST_PATH_IMAGE008
Tightness value after normalized.
3. the management method of narrowband network bandwidth resources according to claim 1, it is characterized in that: step (2) comprising:
1) LSD with the OSPF Routing Protocol converts traffic engineering database to;
If the source node that sends service request has the M bar to the path of destination node, the needed bandwidth on demand amount of this time service request is Q,
2) Centroid is according to the information in the traffic engineering database, and under current transmission state, the path bandwidth weights of every paths calculate, and find out the path that the path bandwidth weights meet the demands, and supposes that there is the m bar in the path that meets the demands;
3) by Centroid the remaining bandwidth of every paths in the m paths is calculated and remaining bandwidth is added up, establishing accumulation result is Q1, and as Q1 〉=Q, then the bandwidth on demand amount Q with this service request shares to the m paths and transmission;
As Q1＜Q, then the part that equates with Q1 numerical value among the bandwidth on demand amount Q is shared to the m paths, and calculate the difference Q2 of Q and Q1, the bandwidth of having shared is deducted from respective path, with Q2 as a new bandwidth on demand, repeating step 1), 2), 3), until Q2≤0, finally obtain to share fully all paths of bandwidth on demand amount Q, share to these paths Q and transmission;
4) resource allocation and link adjustment information and traffic engineering database is synchronous.
4. as the management method of narrowband network bandwidth resources as described in the claim 3, it is characterized in that: described LSD with the OSPF Routing Protocol converts traffic engineering database to, comprise: in the topology table of the LSD of OSPF Routing Protocol, the annexation of each node in the routed domain and the metric Cost of each link have been comprised, according to formula B=
Figure 2010105610157100001DEST_PATH_IMAGE010
/ Cost converts to metric Cost, tries to achieve corresponding B, the B that tries to achieve is carried out corresponding, combination with original information in the LSD, thereby form traffic engineering database; In the formula,
Figure 2010105610157100001DEST_PATH_IMAGE012
Be the sign link bandwidth.
5. as the management method of narrowband network bandwidth resources as described in the claim 3, it is characterized in that: step 2) comprising: establish M
A certain path P in the paths, then the bandwidth load rate of path P is
Figure 2010105610157100001DEST_PATH_IMAGE014
Wherein, i is the mark of source node, and j is the mark of destination node,
Figure 2010105610157100001DEST_PATH_IMAGE016
Expression certain bar link from source node i to destination node j;
Figure 2010105610157100001DEST_PATH_IMAGE018
The expression link
Figure 3978DEST_PATH_IMAGE016
The bandwidth load rate,
Figure 2010105610157100001DEST_PATH_IMAGE020
, in the formula,
Figure 2010105610157100001DEST_PATH_IMAGE022
Be link
Figure 266856DEST_PATH_IMAGE016
Surplus
Surplus bandwidth,
Figure 2010105610157100001DEST_PATH_IMAGE024
Be link
Figure 359446DEST_PATH_IMAGE016
Capacity;
Figure 2010105610157100001DEST_PATH_IMAGE026
Expression meets the link of path P
Figure 580212DEST_PATH_IMAGE016
Figure 2010105610157100001DEST_PATH_IMAGE028
For meeting the path
The peaked link of bandwidth load rate of P also is the bandwidth load rate of path P;
The bandwidth weights of calculating path P,
Figure 2010105610157100001DEST_PATH_IMAGE030
,
Wherein,
Figure 2010105610157100001DEST_PATH_IMAGE032
Bandwidth weights for path P;
Figure 2010105610157100001DEST_PATH_IMAGE034
Remaining bandwidth minimum value for the link that meets path P;
Calculate the average of the bandwidth weights in all paths from the source node to the destination node,
Figure 2010105610157100001DEST_PATH_IMAGE036
Wherein, e is the set in all paths from source node i to destination node j in the routed domain;
Search and satisfy condition
Figure 656928DEST_PATH_IMAGE032
Figure 2010105610157100001DEST_PATH_IMAGE038
All paths, promptly get the m paths that meets the demands.
6. as the management method of narrowband network bandwidth resources as described in the claim 3, it is characterized in that: in the step 3), each paths is shared bandwidth as follows:
If a certain path P in the m paths is according to the bandwidth absorption rate of following formula calculating path P
Figure 2010105610157100001DEST_PATH_IMAGE040
,
Figure 2010105610157100001DEST_PATH_IMAGE042
Wherein, e1 is the set in the path be made up of the m paths;
Figure 2010105610157100001DEST_PATH_IMAGE044
,
Figure 771384DEST_PATH_IMAGE032
Be the bandwidth weights of path P,
Figure 847924DEST_PATH_IMAGE038
Average for the bandwidth weights in all paths from the source node to the destination node;
Each paths is by each self-corresponding bandwidth absorption rate
Figure 621233DEST_PATH_IMAGE040
Q shares to bandwidth on demand.
7. as the management method of narrowband network bandwidth resources as described in the claim 3, it is characterized in that: in the step 3), judge bandwidth summation that each paths the is shared Q1＜Q that whether satisfies condition as follows:
Calculate the summation Q1 of the bandwidth that the m paths shared; Calculate the least residue bandwidth of each paths in the m paths, that paths of least residue bandwidth value minimum is designated as t, then its least residue bandwidth is
Figure 2010105610157100001DEST_PATH_IMAGE046
, the bandwidth absorption rate of this paths is , then this paths bandwidth of sharing is
Figure 2010105610157100001DEST_PATH_IMAGE050
, if t apportioned bandwidth in path satisfies condition
Figure 2010105610157100001DEST_PATH_IMAGE052
, think that then the condition of Q1 〉=Q is set up, promptly bandwidth on demand Q has been shared, and can transmit; Otherwise, bandwidth on demand Q has not also been shared, calculate the difference Q2=Q-Q1 of Q and Q1, the bandwidth of having shared is deducted from respective path, with Q2 as a new bandwidth on demand, repeating step 1), 2), 3), until Q2≤0, finally obtain to share fully all paths of bandwidth on demand amount Q, share to these paths Q and transmission.
CN2010105610157A 2010-11-26 2010-11-26 Management method of bandwidth resources of narrow band network Pending CN101977159A (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN2010105610157A CN101977159A (en) 2010-11-26 2010-11-26 Management method of bandwidth resources of narrow band network

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN2010105610157A CN101977159A (en) 2010-11-26 2010-11-26 Management method of bandwidth resources of narrow band network

Publications (1)

Publication Number Publication Date
CN101977159A true CN101977159A (en) 2011-02-16

Family

ID=43577006

Family Applications (1)

Application Number Title Priority Date Filing Date
CN2010105610157A Pending CN101977159A (en) 2010-11-26 2010-11-26 Management method of bandwidth resources of narrow band network

Country Status (1)

Country Link
CN (1) CN101977159A (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102340543A (en) * 2011-10-18 2012-02-01 华为技术有限公司 Method and equipment for selecting master node of system
CN102447576A (en) * 2011-10-20 2012-05-09 深圳市国电科技通信有限公司 Automatic election method for local end equipment of network
CN107432019A (en) * 2015-01-12 2017-12-01 华为技术有限公司 First and second network nodes and method therein
WO2021109726A1 (en) * 2019-12-06 2021-06-10 北京金山云网络技术有限公司 Bandwidth limitation method, apparatus and system
CN116708304A (en) * 2023-08-01 2023-09-05 腾讯科技（深圳）有限公司 Switching method and device of data transmission paths, storage medium and electronic equipment

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7254130B1 (en) * 1999-06-11 2007-08-07 British Telecommunications Public Limited Company Predictively allocated bandwidth in a communications network
CN101022387A (en) * 2007-03-28 2007-08-22 中兴通讯股份有限公司 Communication band width dynamic distributing method in chain type group network

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US7254130B1 (en) * 1999-06-11 2007-08-07 British Telecommunications Public Limited Company Predictively allocated bandwidth in a communications network
CN101022387A (en) * 2007-03-28 2007-08-22 中兴通讯股份有限公司 Communication band width dynamic distributing method in chain type group network

Cited By (10)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102340543A (en) * 2011-10-18 2012-02-01 华为技术有限公司 Method and equipment for selecting master node of system
WO2012163211A1 (en) * 2011-10-18 2012-12-06 华为技术有限公司 Method and device for selecting master node for system
CN102340543B (en) * 2011-10-18 2013-12-04 华为技术有限公司 Method and equipment for selecting master node of system
CN102447576A (en) * 2011-10-20 2012-05-09 深圳市国电科技通信有限公司 Automatic election method for local end equipment of network
CN102447576B (en) * 2011-10-20 2015-05-06 深圳市国电科技通信有限公司 Automatic election method for local end equipment of network
CN107432019A (en) * 2015-01-12 2017-12-01 华为技术有限公司 First and second network nodes and method therein
US10499373B2 (en) 2015-01-12 2019-12-03 Huawei Technologies Co., Ltd. First and second network nodes and methods thereof
CN107432019B (en) * 2015-01-12 2020-04-28 华为技术有限公司 First and second network nodes and methods therein
WO2021109726A1 (en) * 2019-12-06 2021-06-10 北京金山云网络技术有限公司 Bandwidth limitation method, apparatus and system
CN116708304A (en) * 2023-08-01 2023-09-05 腾讯科技（深圳）有限公司 Switching method and device of data transmission paths, storage medium and electronic equipment

Similar Documents

Publication Publication Date Title
CN101606341B (en) Technique for efficiently routing ip traffic on CE-CE paths across a provider network
EP2911348B1 (en) Control device discovery in networks having separate control and forwarding devices
CN100454841C (en) Multi-domain routing computation method and system
US7902973B2 (en) Alarm reordering to handle alarm storms in large networks
CN102804712B (en) Method and apparatus for selecting between multiple equal cost paths
CN103650435B (en) Routing traffic method of adjustment, device and controller
CN101155134B (en) Path computation and network topological method, structure and system
US8493869B2 (en) Distributed constraints-based inter-domain network traffic management
CN111654438B (en) Method, controller and system for establishing forwarding path in network
CN103379032A (en) Acquisition method and device for cross-domain end-to-end route and secondary route computation element
CN101572674A (en) Routing computation method and device thereof
CN101753455B (en) Forwarding method and device thereof
CN103346979A (en) Flow distribution method and equipment in SPBM network
CN102136998B (en) Traffic engineering and server selection joint optimization method, system and related equipment
CN101977159A (en) Management method of bandwidth resources of narrow band network
CN105472484A (en) Wave channel balancing route wavelength allocation method of power backbone optical transport network
CN101110765A (en) Method for supporting multiple service quality based on OSPF protocol
CN101521601A (en) Method, system and device for advertising adjacent network domain of DS-TE information
CN1953409A (en) A networking method for semi-network configuration of network and its system
CN108184175A (en) The elastic optical network Multicast Routing and frequency spectrum distributing method being limited based on MC nodes
CN106789179A (en) A kind of resource allocation methods based on SDN frameworks
Zhang et al. Survivable path computation in PCE-based multi-domain networks
CN104702510A (en) Message forwarding method and device in RPR network
CN1984038B (en) Cascade management system and method for selecting end to end routing
CN101051992B (en) Method for calculating customer layer service route in multilayer network

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

Application publication date: 20110216