CN104579999B - A kind of new routing algorithm solving optical network congestion - Google Patents
A kind of new routing algorithm solving optical network congestion Download PDFInfo
- Publication number
- CN104579999B CN104579999B CN201410659925.7A CN201410659925A CN104579999B CN 104579999 B CN104579999 B CN 104579999B CN 201410659925 A CN201410659925 A CN 201410659925A CN 104579999 B CN104579999 B CN 104579999B
- Authority
- CN
- China
- Prior art keywords
- link
- cost
- function
- network
- congestion
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Active
Links
Landscapes
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention provides a kind of to realize traffic engineering to reach the New Algorithm of flow equalization in optical-fiber network.Piecewise linearity is set by the cost function of link to successively decrease the new route implementation idea of concave function.Cost function in traditional traffic engineering algorithm is the function of link utilization, and for the high load links in punishment routing plan, usual this function is defined as piecewise linearity and is incremented by convex function.But it is when the link utilization is relatively uniform using the defect of this inear increment convex function, the number of links on the path becomes the major influence factors of path cost, the link obstructions that the few path of hop count will be chosen so as to and select the such two kinds of situations in this path to can result in when there is congestion link and its small total link cost in a link.It can achieve the purpose that flow equalization under the conditions of reasonable setting of link weights using the present invention with New Algorithm, alleviate link congestion, reduce business packet loss, improve optical-fiber network transmission characteristic.
Description
Technical field
The present invention designs technical field of photo communication, wherein the thinking for introducing traffic engineering in optical packet switching carries out flow
The equalization of distribution.Being specifically designed a kind of link cost function is the new routing algorithm of linear concave function of successively decreasing.
Technical background
1, during optical packet switching refers to from information source to the stay of two nights, the payload part of data packet is kept in the optical domain, and
It is different based on exchange, control technology, the control section (expense) of data packet can at the intermediate switching node with or without
Cross the transformation of O/E/O.In other words, the transmission of data packet carries out in wide area, and routes and carry out in the electrical or optical domain.Light
Packet switch all uses this mixed solution at present, and transmission is realized in the optical domain with exchange, route with forwarding capability with
The mode of electricity is realized.
2, the key technology of optical packet switching are as follows: the generation of light packet, the synchronization of light packet, solve competition method and
Optical buffer, the regeneration of light packet.
3, the main implementation method of traffic engineering is showed paths using CR- LDP calculating, recycles the mode that shows paths
It establishes label switched path (LSP) and carries out assignment of traffic using label switched path.Had using the benefit of traffic engineering: being supported
Explicit routing is not selected, flow equalization, self-healing recovery, heat source by forwarding grouping to be limited realizing route according to purpose
Grade etc..Generally there are two types of implementations for traffic engineering: online mode and offline mode.
GMPLS traffic engineering control planes are introduced, can simplify and control information processing routing choosing in optical packet switch network
The process selected, meanwhile, GMPLS perfect traffic engineering mechanism can reduce network traffics traffic congestion rate and reduce packet loss
Rate, to realize load balancing, and protection and Restoration Mechanism.
Summary of the invention
(1) technical problems to be solved
In optical packet switching, flow distribution unevenness leads to link obstructions, and packet loss rises, and network performance decline provides
A technique for traffic engineering, by the cost function of link be set as piecewise linearity successively decrease concave function Novel road by calculating
Method.
(2) technical solution
It is specific as follows
1, a method of it realizing traffic engineering in optical-fiber network, label switched path, the road Bing Yici is established with this algorithm
Diameter realizes route assignment.It is characterized in that, link cost function is set to segmented line by the weight that link is rationally arranged
Property is successively decreased concave function, is comprised steps that.
Step 1 determines next-hop routing node, initialization flow according to the service bandwidth that is randomly generated, start node requirement
Amount distribution；
Link cost upper limit is arranged in step 2, and the setting of the upper limit must be adapted with the scale of network and the needs of flow,
And according to the development need timing adjustment link cost upper limit of network.
Step 3 defines the cost function of link, wherein this cost function is a kind of recessed letter that piecewise linearity is successively decreased
Number.
Step 4 determines routing plan according to new cost function, is assigned by the new route flow.
Step 5, carries out link congestion detection, and discovery congestion then changes cost function, otherwise, carries out the distribution of new flow.
Preferably, traffic initial allocation is needed in view of flow equalization in network in the step 1, it is characterised in that: institute
It states in step 1, its total cost and minimum after using shortest path first or negative cost loop algorithm that can make assignment of traffic.
In this way it is considered that the flow distribution under original state is relatively reasonable.
Preferably, cost upper limit described in the step 2 needs according to network initial flow and in a longer range
Network traffic demand, network topology structure and interstitial content determine jointly.
Preferably, the needs of cost function described in the step 3 are given by network simulation data, it is characterised in that: step
Cost function in rapid three is that a kind of piecewise linearity is successively decreased concave function, concrete thought be when the link is highly congested,
The cost of this link needs to be arranged larger accordingly, so the cost of reduction need to set small from cost upper limit；
Similarly, when the congestion level of the link is relatively low, what the cost of this link needed to be arranged accordingly is smaller, so from cost
The cost of reduction need to set big in limit.
(3) beneficial effect
The present invention solves optical network congestion by a kind of new algorithm, belongs to traffic engineering problem, beneficial effect is as follows
Shown in Fig. 1,
When using traditional traffic engineering algorithms, cost function is the convex function of linear increment, when link utilization ratio
When more uniform, major influence factors of the number of links on the path as path cost, path s → l → n → t as shown in the figure,
The few path of hop count will be selected.That is, when a lot of traffic arrives, it necessarily will appear the possibility of link congestion.And when one
There is congestion link in link and chain roadlock that its total link cost hour selects the such two kinds of situations in this path to can result in
Plug.For example link m → n sections of link is congestion link in figure, but path s → l → m → n → t cost and it is less than remaining path
When, traditional routing will preferentially select this paths, and the congestion of link m → n will lead to the congestion in entire path.But divide when using
When section linear decrease function, since the cost of all links all changes, so total cost can be set to no congestion
The path of link is minimum.So as to avoid the deficiency of above-mentioned traditional algorithm.
Specific embodiment is as shown in Figure 2
Step 1, according to be randomly generated service bandwidth, start node requirement operation negative cost loop algorithm determine next-hop road
By node；
Link cost upper limit is arranged in step 2, and the setting of the upper limit must be adapted with the scale of network and the needs of flow,
And according to the development need timing adjustment link cost upper limit of network.
Step 3 defines the cost function of link, wherein this cost function is a kind of recessed letter that piecewise linearity is successively decreased
Number.
Step 4 determines routing plan according to new cost function, is assigned by the new route flow.
Step 5, carries out link congestion detection, and discovery congestion then changes cost function, otherwise, carries out the distribution of new flow.
The detailed description that scheme of the invention is carried out in conjunction with a simply example, is shown in Fig. 3,
By as shown in the figure it can be seen that flow from A to F can by three paths, they be respectively A → B → C → E →
F and A → B → D → E → F and A → B → C → D → E → F has found that congestion occur in D → E sections of paths, institute after initial allocation
To need to adjust the weight setting of link, is successively decreased the requirement of concave function according to piecewise linearity, can be set as follows, specific function
Selection can determine according to traffic needs, such as:
Function f (x)=sin (x) is in section [0, π] and function f (x)=- x2WithDeng specifically
Link metric can make the following changes according to the link's congestion status, following Fig. 4, in D → E section chain of the crowded most serious of link
The weight on road reduces 1, and the link of medium congestion such as B → C, C → D reduce weight 2, and B → D that link is most unobstructed, C → E subtract
Few 3, it can be seen that function is one and successively decreases concave function according to the typical piecewise linearity of flow congestion degree by the weight of reduction.Weight
Flow is more shifted from D → E sections to C → E sections after new distribution, to realize flow equalization.
The foregoing is merely illustrative of the preferred embodiments of the present invention, is not intended to limit the invention.For the skill of this field
For art personnel, a variety of modifications of the invention will be apparent, all within the spirits and principles of the present invention, done
Any modification, equivalent substitution, improvement and etc., should be included within the scope of the present invention.
Detailed description of the invention
Fig. 1 is a simple network model being made of 5 nodes；
Fig. 2 is algorithm flow chart；
Fig. 3 is an example for carrying out the detailed description of scheme of the invention；
Fig. 4 is the network re-started after link bandwidth setting after modifying.
Claims (4)
1. a kind of method for realizing traffic engineering in optical-fiber network, establishes label switched path with new routing algorithm, and with this
Realize route assignment in path, which is characterized in that by the way that the weight of link is rationally arranged, link cost function is set to be segmented
Linear decrease concave function, comprises steps that:
A: next-hop routing node is determined according to the service bandwidth that is randomly generated, start node requirement, initializes assignment of traffic；
B: the setting of setting link cost upper limit, the upper limit must be adapted with the scale of network and the needs of flow, and according to
The development need timing adjustment link cost upper limit of network；
C: the cost function of link is defined, wherein this cost function is a kind of concave function that piecewise linearity is successively decreased；
Wherein, the cost function in the step C is that a kind of piecewise linearity is successively decreased concave function, when the Congestion Level SPCC of link is relatively high
When, the cost of this link needs to be arranged larger accordingly, so the cost of reduction is need to set from cost upper limit
It is small；Similarly, when the congestion level of the link is relatively low, what the cost of this link needed to be arranged accordingly is smaller, so from generation
The cost of reduction need to set big in the valence upper limit；
D: routing plan is determined according to new cost function, is assigned by the new route flow；
E: carrying out link congestion detection, and discovery congestion then changes cost function, otherwise, carries out the distribution of new flow.
2. the method for traffic engineering is realized in optical-fiber network as described in claim 1, it is characterised in that: in the step A,
Its total cost and minimum after using shortest path first or negative cost loop algorithm that can make assignment of traffic, think initial in this way
Flow distribution under state is relatively reasonable.
3. the method for traffic engineering is realized in optical-fiber network as described in claim 1, which is characterized in that cost upper limit needs
Network traffic demand according to network initial flow and in target zone, network topology structure and interstitial content come common true
It is fixed.
4. the method for traffic engineering is realized in optical-fiber network as described in claim 1, which is characterized in that traffic engineering is logical
Control routing is crossed to reduce network congestion while realizing that flow equalization improves the level of resources utilization, he is opened up by establishing network
The routing for modeling and being optimized with traffic matrix is flutterred to realize this flow equalization.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410659925.7A CN104579999B (en) | 2015-03-02 | 2015-03-02 | A kind of new routing algorithm solving optical network congestion |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410659925.7A CN104579999B (en) | 2015-03-02 | 2015-03-02 | A kind of new routing algorithm solving optical network congestion |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104579999A CN104579999A (en) | 2015-04-29 |
| CN104579999B true CN104579999B (en) | 2019-03-15 |
Family
ID=53095221
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410659925.7A Active CN104579999B (en) | 2015-03-02 | 2015-03-02 | A kind of new routing algorithm solving optical network congestion |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104579999B (en) |
Families Citing this family (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN111865810B (en) * | 2019-04-30 | 2022-08-09 | 华为技术有限公司 | Congestion information acquisition method, system, related equipment and computer storage medium |
Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104079496A (en) * | 2014-07-02 | 2014-10-01 | 南京邮电大学 | Double-deck satellite load balancing method based on link cost conversion |
-
2015
- 2015-03-02 CN CN201410659925.7A patent/CN104579999B/en active Active
Patent Citations (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104079496A (en) * | 2014-07-02 | 2014-10-01 | 南京邮电大学 | Double-deck satellite load balancing method based on link cost conversion |
Non-Patent Citations (3)
| Title |
|---|
| A New Traffic Engineering Algorithm To Simplify Network In Optical Switching Network;Mingsong Shi.etc;《Applied Mechanics and Materials》;20141127;全文 |
| 基于MPLS网络的约束路由及故障恢复研究;王新华;《中国博士学位论文电子期刊网》;20080815;正文第4章 |
| 基于动态流量的多拓扑链路权值优化算法;陈铎龙等;《计算机科学》;20130415;正文第2章 |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104579999A (en) | 2015-04-29 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN102075437B (en) | Communication method, gateway and network | |
| CN106533960A (en) | Data center network routing method based on Fat-Tree structure | |
| CN102594664A (en) | Flow forwarding method and device | |
| US11005763B2 (en) | Data packet transmission method and border routing bridge device | |
| CN107846706A (en) | A kind of coding cognitive radio mesh network multipaths footpath method for routing of Congestion Avoidance | |
| CN110351187A (en) | Data center network Road diameter switches the adaptive load-balancing method of granularity | |
| CN101986628B (en) | Method for realizing multisource multicast traffic balance based on ant colony algorithm | |
| CN102638404A (en) | Optical network protection resource allocation method based on service differentiation | |
| Phate et al. | Minimizing congestion and improved QoS of AODV using clustering in mobile ad hoc network | |
| CN106330710B (en) | Data stream scheduling method and device | |
| CN103067294B (en) | Based on the method for the data flow equilibrium treatment of stream order-preserving in multi-next-hop forwarding router | |
| CN104579999B (en) | A kind of new routing algorithm solving optical network congestion | |
| CN100496023C (en) | Method for transmitting link-state information | |
| CN110300426A (en) | Route selection method and device in a kind of wireless self-networking | |
| CN102098594B (en) | A kind of connection establishment signaling conflict avoiding based on information diffusion optical-fiber network | |
| CN102480377A (en) | Management method and system of aggregation link | |
| Patel et al. | Distance-adaptive virtual network embedding in software-defined optical networks | |
| CN105072046A (en) | Delay tolerant network congestion prevention method based on data concurrence and forwarding by token control node | |
| CN110891020B (en) | Flow table quantity optimization method of SDN in-band control network | |
| Hwang et al. | Link stability, loading balance and power control based multi-path routing (SBPMR) algorithm in ad hoc wireless networks | |
| CN103248568B (en) | Router and realization thereof support that redundancy is without the data forwarding method of numbering link | |
| CN106789712B (en) | A kind of heuristic network load balancing method | |
| JP6281347B2 (en) | Packet switching apparatus and packet switching method | |
| Garg | Congestion prevention for reliable OBS | |
| Wang et al. | Improvement and optimization of a mobile multi-agent AODV routing protocol |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |