CN108400936A - Information Network method for routing based on MPLS - Google Patents
Information Network method for routing based on MPLS Download PDFInfo
- Publication number
- CN108400936A CN108400936A CN201810177888.4A CN201810177888A CN108400936A CN 108400936 A CN108400936 A CN 108400936A CN 201810177888 A CN201810177888 A CN 201810177888A CN 108400936 A CN108400936 A CN 108400936A
- Authority
- CN
- China
- Prior art keywords
- label
- path
- node
- mpls
- forwarding
- 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
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/50—Routing or path finding of packets in data switching networks using label swapping, e.g. multi-protocol label switch [MPLS]
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L45/00—Routing or path finding of packets in data switching networks
- H04L45/12—Shortest path evaluation
- H04L45/122—Shortest path evaluation by minimising distances, e.g. by selecting a route with minimum of number of hops
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L47/00—Traffic control in data switching networks
- H04L47/10—Flow control; Congestion control
- H04L47/12—Avoiding congestion; Recovering from congestion
- H04L47/125—Avoiding congestion; Recovering from congestion by balancing the load, e.g. traffic engineering
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The invention discloses the Information Network method for routing based on MPLS, belong to Information Network field.Specifically：The strategy is packaged IP data packets and ATM cell using unified MPLS formats, two different technical systems are merged, in order to reasonably select transmission path in fusion process, it proposes a kind of routing algorithm based on hop count and bandwidth availability ratio, and is verified by OPNET emulation platforms.The strategy can solve the problems, such as fusion intercommunication of two kinds of different technologies systems on star compared with OSPF satellite network routing policies, while can effectively reduce the propagation delay time of network.
Description
Technical field
The invention belongs to Information Network field, specifically a kind of Information Network routing side based on MPLS
Method.
Background technology
As various countries are in the continuous expansion of the domain requirements such as space exploration, ocean expedition, build Incorporate network at
For an important engineering of China.In the process for building Incorporate network, satellite network is the heat studied at present
Point field.The technical system that existing satellite system uses has atm technology system, IP technical systems etc..ATM is using connection-oriented
Mode, it is safe, time delay is small, but its agreement is complicated, and network cost is high, and traffic management problem is relatively more prominent when network size is larger
Go out.IP technologies based on routing are towards connectionless, and scalability is strong, operating cost is low, but it is in quality of service guarantee, peace
Full property etc. is not so good as ATM.Between two kinds of technical systems independently of each other, it cannot achieve and interconnect, be in Information Network
Mutual fusion between each sub-network brings challenge.
MPLS syncretizing mechanisms are applied in ULISS projects, the separation of different function layer are realized, efficiently in satellite network
Upper any data of transmission.But its complicated protocol conversion increases overhead.Hu Shibin etc. is constructed based on MPLS technology
Multibusiness network fusion topology, can on a MPLS bearer network bearing multiple service system.But it also needs in practical applications
Will deeper into theory analysis and technical support.MPLS technology is applied on GEO satellite network by Truchly P etc., but point
The data transmission of IP and ATM is not realized in link layer and network layer.Lee JW etc. propose a kind of multilayer satellite based on OSPF
Network router strategy based thereon, the hop count passed through by reducing path, significantly reduces communication overhead, but be not implemented spatial network with mutually
The efficient fusion of networking.Although MPLS technology is suitable for satellite network, currently the grinding on satellite MPLS about heterogeneous network
Study carefully very insufficient, therefore, the research to satellite MPLS is a key areas of current satellite network research.
Since MPLS Information Networks are resource-constrained, how efficiently to utilize Internet resources is a difficult point, existing
A variety of multi-path algorithms are researched and proposed.Han Laiquan etc. realizes single label from multipath shunting and traffic engineering aspect
The Parallel transmutation in more LSP (Label Switched Path) paths, reduces network congestion.But it is not suitable for satellite network
High dynamic, long delay characteristics.Document disclosure satisfy that the transmission long delay of satellite network, topology are high from the aspect of propagation delay time
Dynamic characteristic.But the algorithm computation complexity is bigger, and does not account for the life span of link.Yuan Tian etc. optimizes LSP, real
Communication overhead is now minimized, but is not applied in satellite MPLS load balancing.
Extension, IP (Internet Protocol) technologies and ATM when Information Network Satellite link networking
(Asynchronous Transfer Mode) technical system on star and is being deposited and is but difficult to merge and the problem of intercommunication.In satellite system
It is interconnected in system in order to realize, while avoiding using two kinds of technical systems again, it is therefore desirable to realized using unified technology
The fusion of the two.And satellite MPLS networkings the advantages of combining IP and ATM, it is a solution of present satellites networking.
Invention content
In view of the above problems, the application proposes a kind of Information Network method for routing based on MPLS, and this method is IP
Data packet and ATM cell are packaged using unified MPLS formats, two different technical systems are merged, in fusion process
In in order to reasonably select transmission path, propose a kind of routing algorithm based on hop count and bandwidth availability ratio, and pass through
OPNET emulation platforms are verified.
To achieve the above object, the technical proposal of the invention is realized in this way：Information Network road based on MPLS
By method, specifically：
Step 1：According to the multipath choosing method from source node to destination node, in Ingress node LER1 and Egress node
A plurality of optional path is found between LER2, finds out minimum hop count path, and records the hop count of each path；
Step 2：When having data flow request between Ingress node LER1 to Egress node LER2, inquire in satellite network
The remaining bandwidth of each link；According to the demand bandwidth b of each path i uplinks jijWith the remaining bandwidth c of link jij, calculate every
The bandwidth availability ratio δ of pathsi；
Step 3：According to the hop count N of optional each path in step 1iWith the bandwidth availability ratio δ calculated in step 2i, raw
The resource function R occupied at linki, Ri=δiNi；
Step 4：Select resource function RiMinimum path is as transmission path, to guide data flow to be transmitted；
Step 5：The transmission path selected according to step 4 carries out data transmission, and each satellite node is according to initial labels value
Respective label information is formed, and generates the forwarding table of oneself；
Step 6：Data flow carries out data forwarding according to forwarding table.
Further, the bandwidth availability ratio δ of each path is calculatedi, specially：
If topology diagram of the Information Network within some period is G (V, E, C), wherein V is set of node, and v ∈ V are
Scheme a node of G, E is the set of link；C is and the relevant bandwidth of V, E or constraints；Label switched path is indicated with U
The Extreme points set of LSP, K indicate that label switching path LSP set, i indicate the label switching path LSP in network, i ∈ K；S1,T1
Respectively Ingress node and Egress node；Indicate whether path i passes through link j, j ∈ E, niFor label switching path LSP i's
Hop count limits；
Each path is made of a plurality of small link, δijIt is the utilization rate for the link j that path is passed through, remembers the bandwidth in path
Utilization rate isAs the busy degrees of path i within a certain period of time；Wherein δij=bij/cij, j is minimum hop count road
The link that the i-th paths include in diameter, bijFor the demand bandwidth of path i uplinks j, and bij≤cij, cijFor the residue of link j
Bandwidth.
Further, the bandwidth availability ratio in the path is：
Optimization aim：
minδi (1)
Constraints：
Wherein (1) formula is object function, and formula (2)~(5) are constraints；Formula (2) is Ingress node to Egress node
Route jumping figure limits；Formula (3) is to be limited to single path；Formula (4)~(6) are the attribute constraints to label switching path LSP, respectively
Regulation：Each Ingress node LER certainly exists the label switching path LSP established by the node, and each outlet LER nodes are certain
In the presence of being the label switching path LSP terminated with it, and label switching path LSP is not terminated in arbitrary intermediate node.
Further, NiFor the hop count of each path i, then resource function RiIt is embodied as：
Further, generate forwarding table the specific steps are：
(1) satellite edge router LER1 judges the fixed-length data received as ATM cell, and random length data are IP packets,
The segmentation of IP packets is reassembled into the fixed-length data of 44 bytes by LER1, is loaded in the grouping transmitted to satellite MPLS network；LER1 is by institute
The data that have that treated are according to identical inlet/outlet edge router classifying and dividing forwarding equivalence class FEC (Forwarding
Equivalence Class), it is mapped to the MPLS label that initial (VPI/VCI) value is 1/32.Label value is 1/32 by LER1
VPI/VCI, exit port, next-hop forwarding entry NHLFE (Next Hop Label Forwarding Entry) are sent to satellite
LSR1, and these information are preserved in LER1, form LER1 Label Forwarding Information Base 1；
(2) after the ports satellite LSR1-1 receive the tag mapping information that LER1 is sent, label is changed to 1/33, and determine
Next-hop entrance is LSR2-1, and label, exit port, NHLFE at this time is saved in the Label Forwarding Information Base of LSR1.Then by this
Message is sent to satellite LSR2, and forms the forwarding table 2 of oneself；
(3) after the ports satellite LSR2-1 receive the tag mapping information that LSR1 is sent, label is changed to 1/34, and determine
Next-hop entrance is LER2-1, and label, exit port, NHLFE at this time is saved in the Label Forwarding Information Base of LSR2.Then by this
Message is sent to egress edge router LER2, and forms the forwarding table 3 of oneself；
(4) when the ports LER2-1 receive the label mapping message of LSR2 transmissions, exit port is changed to 2, since LER2 is
Egress edge router, therefore present packet label 1/34 is removed, grouping at this time becomes sky label, and forms turning for oneself
4 are delivered, other ports are then noticed.The Label Forwarding Information Base of each node is as follows：
The Label Forwarding Information Base of 1 LER1 of table
| Inbound port | Enter label VPI/VCI | Outgoing label VPI/VCI | Exit port | NHLFE |
| 1 | ———— | 1/32 | 2 | LSR1-1 |
The Label Forwarding Information Base of 2 LSR1 of table
| Inbound port | Enter label VPI/VCI | Outgoing label VPI/VCI | Exit port | NHLFE |
| 1 | 1/32 | 1/33 | 2 | LSR2-1 |
| 1 | 1/32 | 2/33 | 3 | LSR4-2 |
The Label Forwarding Information Base of 3 LSR2 of table
| Inbound port | Enter label VPI/VCI | Outgoing label VPI/VCI | Exit port | NHLFE |
| 1 | 1/33 | 1/34 | 2 | LER2-1 |
The Label Forwarding Information Base of 4 LER2 of table
| Inbound port | Enter label VPI/VCI | Outgoing label VPI/VCI | Exit port |
| 1 | 1/34 | ———— | 2 |
Further, data forwarding detailed process is：
(1) entrance LER1：Data enter the fringe node of satellite MPLS, and entrance LER1 reads packet group head, then
Label Forwarding Information Base 1 is searched to obtain, into label and exit port, exporting to specified port；
(2)LSR：LSR receives the packet with label, and label is extracted from grouping, is searched and is marked as pointer using label
Forwarding table table 2 and table 3 are signed, replaces extracted label with the outgoing label in table respectively, new grouping is according to signified in forwarding table
Output port be sent to next-hop；
(3) LER2 is exported：Outlet LER2 receive packet after, label is removed, become size be 44 bytes and
Two kinds of data of 48 bytes, by the data recombination of 44 bytes at IP packets, the data convert of 48 bytes is at ATM cell；After recombinating
IP packets and ATM cell exported respectively from corresponding port CE11 and CE21.
Beneficial effects of the present invention are：The present invention is based on the Information Network method for routing of MPLS can realize ATM and
The fusion of IP technologies, and the propagation delay time of data is reduced, meanwhile, the carried algorithm of this patent can be balanced well when selecting path
The load of each link increases handling capacity, optimization link utilization, the stability for improving network.
Description of the drawings
Fig. 1 is satellite MPLS networking plan figures；
Fig. 2 is satellite network simulation topological diagram；
Fig. 3 is network transfer delay figure；
Fig. 4 is spirogram of handling up；
Fig. 5 propagation delay time figures；
Fig. 6 bandwidth availability ratio figures.
Specific implementation mode
To make the objectives, technical solutions, and advantages of the present invention clearer, right in the following with reference to the drawings and specific embodiments
The present invention is described in detail.
Information Network networking plan based on MPLS is Information Network networking plan in order to illustrate MPLS technology
Optimal selection, table 1 is compared the networking performance of IP, ATM and MPLS technology in the satel-lite.
The comparison of IP, ATM and MPLS technology in 1 satellite system of table
As shown in Figure 1, the framework includes three layers, user 1-8 is outermost layer, i.e., various to pass through satellite network phase intercommunication
Terminal node of letter, including IP network, ATM business, mobile terminal etc.；R1-R4 is middle layer, i.e. edge router LER
(Label Edge Router)；Innermost layer is core layer, including satellite node and network control center NCC.The framework level point
It is bright, divide the work between each layer more clear, largely ensure that the stability of network connection.
Embodiment 1
Extension, IP (Internet Protocol) skill when the present embodiment is directed to Information Network Satellite link networking
Art and ATM (Asynchronous Transfer Mode) technical systems on star and are being deposited and are but difficult to merge and the problem of intercommunication,
On satellite MPLS networking foundations, it is proposed that a kind of Information Network method for routing based on MPLS, the strategy can be realized
The fusion of two kinds of different technologies systems；And then the routing algorithm based on hop count and link utilization is proposed, which can
The path for avoiding selection meeting congestion, optimizes network transmission performance.Based on routing algorithm routing policy, build with satellite
Incorporate network based on MPLS must just have the high usage route strategy based on ISL (inter-satellite link).Based on MPLS's
Information Network method for routing needs to know remaining bandwidth and the traffic in each of the links, reasonably selects optimal transmission road
Diameter.
The mathematical description of bandwidth constraint, if topology diagram of the Information Network within some period is G (V, E, C),
Wherein V is set of node, and v ∈ V are a node for scheming G, and E is the set of link.C be and the relevant bandwidth of V, E or other constraint
Condition.Indicate that the Extreme points set of LSP, K indicate that LSP set, i indicate the path LSP, i ∈ K in network with U.S1,T1Be respectively into
Mouth node and Egress node.Indicate whether path i passes through link j, j ∈ E, niIt is limited for the hop count of LSPi.
Optimization aim is to minimize link utilization, that is, maximize the remaining bandwidth of link.Network route optimization is asked
The mathematical model of topic is described as follows：Remember that the bandwidth availability ratio in path isAs the busy of path i within a certain period of time
Degree.Wherein δij=bij/cij, j is the link that the i-th paths include in minimum hop count path, bijFor the need of path i uplinks j
Ask bandwidth, and bij≤cij, cijFor the remaining bandwidth of link j.
Optimization aim：
minδi (1)
Constraints：
Wherein (1) formula is object function, and formula (2)~(5) are constraints.Formula (2) is Ingress node to Egress node
Route jumping figure limits；Formula (3) is to be limited to single path；Formula (4)~(6) are the attribute constraints to LSP, are respectively provided：Each enter
Mouth LER certainly exists the LSP established by the node, and each LER that exports is certainly existed with the LSP that it is end, and LSP will not
Terminate at arbitrary intermediate node.
The present invention has considered the routing algorithm of hop count and bandwidth availability ratio, and hop count reflects that the occupancy of resource is general
Condition, the hop count that data flow passes through is more, resource consumption it is bigger.It all cannot be fine using single bandwidth availability ratio or hop count
Weigh the occupation condition of link in ground.Therefore, bandwidth availability ratio and hop count the two parametric synthesis are considered as by the application
The benchmark of resource occupation.Enable link occupy resource function be：
Ri=δiNi (7)
NiFor the hop count of path i.It can be expressed as
Assuming that data packet is before down hop forwarding, node has obtained the status information of next-hop node, including next
Jump the link bandwidth of selection.As shown in Figure 1 by taking edge router LER1 to LER2 as an example, LSP routing processes are as follows：
1. any display LSP is once establish, then the hop count on the LSP is exactly fixed.According in the prosperous texts of Deng De
Method finds a plurality of optional path between Ingress node LER1 and Egress node LER2, finds out minimum hop count path, and records every
The hop count of paths.
2. when there is data flow request between LER1 to LER2, the remaining bandwidth of each link in satellite network is inquired, is deleted
Except remaining bandwidth is less than the link of demand bandwidth in satellite network.
3. according to formula (1)~(6) to step 1. in optional path computation bandwidth utilization rate δi, and selected in these paths
Select the path of bandwidth availability ratio minimum.
4. calculating the resource function of each path, resource function R is selectediMinimum path is as transmission path, to draw
Leading data flow selects rational path to be transmitted.
5. update link remaining bandwidth, and recovering step 2. in the link deleted, prepare for link requirements next time.
Can be seen that from above-mentioned algorithm when the hop count of all LSP is identical, the benchmark of the algorithm be exactly bandwidth availability ratio most
It is small.It is computed the resource function R for acquiring path LSP1iMinimum, so selecting path LSP1 as transmission path.
Embodiment 2
Please refer to table 2, table 3, table 4, shown in table 5, the realization based on routing algorithm is as follows：
The data transmission procedure in MPLS network is realized according to above-mentioned Routing Algorithm.The application uses VPI/VCI (VPI generations
Table path, VCI represent link nodes value.Provide the VPI=1, the VPI=3 of the VPI=2 of LSP2, LSP3 of LSP1) it is used as satellite
Two kinds of networks of ATM and IP are included in a unified system by MPLS label, realize that process is as shown in Figure 1.Satellite MPLS work
Process can be divided into forwarding table and generate and two stages of data forwarding.
Forwarding table generation phase
(1) satellite edge router LER1 judges the fixed-length data received as ATM cell, and random length data are IP packets,
The segmentation of IP packets is reassembled into the fixed-length data of 44 bytes by LER1, is loaded in the grouping transmitted to satellite MPLS network.LER1 is by institute
The data that have that treated are according to identical inlet/outlet edge router classifying and dividing forwarding equivalence class FEC (Forwarding
Equivalence Class), it is mapped to the MPLS label that initial (VPI/VCI) value is 1/32.Label value is 1/32 by LER1
VPI/VCI, exit port, next-hop forwarding entry NHLFE (Next Hop Label Forwarding Entry) are sent to satellite
LSR1, and these information are preserved in LER1, form LER1 Label Forwarding Information Base 2.
(2) after the ports satellite LSR1-1 receive the tag mapping information that LER1 is sent, label is changed to 1/33, and determine
Next-hop entrance is LSR2-1, and label, exit port, NHLFE at this time is saved in the Label Forwarding Information Base of LSR1.Then by this
Message is sent to satellite LSR2.Satellite LSR2 carries out identical processing, the label 1/33 received is updated to 1/34, and formed certainly
Oneself forwarding table.
(3) when the ports LER2-1 receive the label mapping message of LSR2 transmissions, exit port is changed to 2, since LER2 is
Egress edge router, therefore present packet label 1/34 is removed, grouping at this time becomes sky label, then notices other termination
Mouthful.
The Label Forwarding Information Base of each node is as follows：
The Label Forwarding Information Base of 2 LER1 of table
| Inbound port | Enter label VPI/VCI | Outgoing label VPI/VCI | Exit port | NHLFE |
| 1 | ———— | 1/32 | 2 | LSR1-1 |
The Label Forwarding Information Base of 3 LSR1 of table
| Inbound port | Enter label VPI/VCI | Outgoing label VPI/VCI | Exit port | NHLFE |
| 1 | 1/32 | 1/33 | 2 | LSR2-1 |
| 1 | 1/32 | 2/33 | 3 | LSR4-2 |
The Label Forwarding Information Base of 4 LSR2 of table
| Inbound port | Enter label VPI/VCI | Outgoing label VPI/VCI | Exit port | NHLFE |
| 1 | 1/33 | 1/34 | 2 | LER2-1 |
The Label Forwarding Information Base of 5 LER2 of table
| Inbound port | Enter label VPI/VCI | Outgoing label VPI/VCI | Exit port |
| 1 | 1/34 | ———— | 2 |
Data transfer phae
(1) entrance LER1：Data enter the fringe node of satellite MPLS, and entrance LER1 reads packet group head, then
Label Forwarding Information Base 1 is searched to obtain, into label and exit port, exporting to specified port.
(2)LSR：LSR receives the packet with label, and label is extracted from grouping, is searched and is marked as pointer using label
Forwarding table table 2 and table 3 are signed, replaces extracted label with the outgoing label in table respectively, new grouping is according to signified in forwarding table
Output port be sent to next-hop.
(3) LER2 is exported：Outlet LER2 receive packet after, label is removed, become size be 44 bytes and
Two kinds of data of 48 bytes, by the data recombination of 44 bytes at IP packets, the data convert of 48 bytes is at ATM cell.After recombinating
IP packets and ATM cell exported respectively from corresponding port CE11 and CE21.
Embodiment 3
Please refer to table 6, Fig. 2, Fig. 3, Fig. 4, Fig. 5, Fig. 6, shown in table 7, the Information Network method for routing based on MPLS,
It verifies and is analyzed as follows：
The application merges net using Iridium satellite constellation topologys, using OPNET Network Simulation Softwares emulation satellite MPLS
The performance of network is compared with NO-MPLS (use conventional interior gateway protocol IGP), and by the application algorithm and OSPF algorithms
It is compared.Satellite MPLS network model structure is as shown in Figure 2, wherein node 0 sends IP and is grouped into node 10, and node 1 is sent
ATM is grouped into node 11.Establish two LSP, respectively LSP1：LER1—>LSR1—>LSR2—LER2；LSP2：LER1—>
LSR1—>LSR4—>LER2。
Experiment parameter is set：Core link use PPP_SONET_OC3 modules, edge link use DS3 modules, every
The total bandwidth in path is 30Mb, other link bandwidths are set as 10Mb/s.Transmission rate is set as 8Mbps, data packet length is
4000bits, simulation time 30min.
6 LEO satellite orbit parameter of table
What the application proposed is shown based on MPLS Information Network routing policy network transfer delays such as Fig. 3, in order to verify
MPLS network merges the validity of ATM/IP, and the propagation delay time of MPLS network and NO-MPLS networks is compared.Since IP exists
Each jump will first search routing table when transmission, determine next-hop, cause its propagation delay time larger.And ATM is connection-oriented, is built
Road only carries out data transmission later, without time loss in transmission process, can be gathered around when only data volume is prodigious
Plug, to generate time delay.Therefore, the size of IP and ATM data volumes proportion can have an impact time delay.By MPLS in Fig. 3
The NO-MPLS different from IP accountings is compared respectively.In figure 3, when IP packets account for 40%, time delay is smaller, on the left sides 0.54ms
The right side, with the increase of IP packet proportions, time delay will be bigger, when IP accountings 80%, time delay ratio MPLS about 13.7%.And
In Fig. 3 after 25min, with the increase of data volume, NO-MPLS time delays have the tendency that becoming larger, and MPLS time delays are protected substantially
It holds constant.
The application algorithm and OSPF algorithms are carried out at four handling capacity, propagation delay time, stability, bandwidth availability ratio aspects
Compare.Fig. 4 compares for handling capacity, and abscissa is simulation time, unit minute；Ordinate is handling capacity, unit kbps.From figure
As can be seen that with the variation of time, handling capacity is continually changing, and when just having started transmitting data stream, handling capacity is smaller,
Handling capacity starts to tend towards stability when 2min or so.Due to being caused to the selection underaction of forward-path using OSPF algorithms
Handling capacity cannot be optimal value, and network throughput mean value is 4300kbps, and rate fluctuation is bigger.And pass through the application
Algorithm can accurately guide data flow, around the path of congestion is likely to occur, handling capacity be made to be optimal, handling capacity mean value
About 5500kbps.
Fig. 5 is the comparison of the application algorithm and OSPF algorithms in terms of propagation delay time.It can be seen from the figure that OSPF time delays
It is larger, and OSPF delay variations are more violent, and OSPF only selects the shortest path of hop count, it is not intended that the load of link,
When data all focus on a certain paths, the path congestion is may result in, data cannot arrive next-hop quickly, cause larger
Time delay, in 0.95ms or so.The application algorithm considers bandwidth availability ratio on the basis of OSPF algorithms, therefrom selects bandwidth profit
With the small path of rate, high speed forward is realized.
The stability of network delay in Fig. 5 is analyzed, 100 sampled points are equidistantly sampled first, in order to analyze stabilization
Property asks variance, stability contrast as shown in table 7 this 100 sampled points.The variation of OSPF is more violent as can be seen from Table 7,
The variance of the variance ratio OSPF of the application algorithm is much smaller, and the maximum delay difference of the application algorithm is also smaller.To table
The stability of bright the carried algorithm of the application will be apparently higher than OSPF.
7 stability of table compares
Fig. 6 compares the bandwidth availability ratio of OSPF and the application algorithm.Bandwidth availability ratio size herein is by demand band
The wide ratio with remaining bandwidth is weighed, that is to say, that in Fig. 6, the value of ordinate is smaller, and algorithm performance is better.Identical
Under Internet resources environment, just start that data volume is smaller, and the bandwidth availability ratio of the two is not much different and all relatively low, with data volume
Growth, the bandwidth availability ratio of network gradually rises, and the Amplitude Ratio MPLS that NO-MPLS rises is big, it can be seen that MPLS is in band
It is better than NO-MPLS in terms of wide utilization rate.This is because NO-MPLS networks lack the understanding to link load situation, network money
Source cannot rationally utilize, and the MPLS network based on routing algorithm can avoid LSP that congestion occurs as possible, rationally utilize
Link circuit resource optimizes the utilization of resources.
Compared to the prior art, the present invention is based on the Information Network method for routing of MPLS can realize ATM and IP skills
The fusion of art, and the propagation delay time of data is reduced, meanwhile, the carried algorithm of the application can be balanced each well when selecting path
The load of link increases handling capacity, optimization link utilization, the stability for improving network.
The preferable specific implementation mode of the above, only the invention, but the protection domain of the invention is not
It is confined to this, any one skilled in the art is in the technical scope that the invention discloses, according to the present invention
The technical solution of creation and its inventive concept are subject to equivalent substitution or change, should all cover the invention protection domain it
It is interior.
Claims (6)
1. the Information Network method for routing based on MPLS, which is characterized in that comprise the concrete steps that：
Step 1：According to the multipath choosing method from source node to destination node, in Ingress node LER1 and Egress node LER2
Between find a plurality of optional path, find out minimum hop count path, and record the hop count of each path；
Step 2：When having data flow request between Ingress node LER1 to Egress node LER2, each chain in satellite network is inquired
The remaining bandwidth on road；According to the demand bandwidth b of each path i uplinks jijWith the remaining bandwidth c of link jij, calculate every road
The bandwidth availability ratio δ of diameteri；
Step 3：According to the hop count N of optional each path in step 1iWith the bandwidth availability ratio δ calculated in step 2i, generate chain
The resource function R that road occupiesi, Ri=δiNi；
Step 4：Select resource function RiMinimum path is as transmission path, to guide data flow to be transmitted；
Step 5：The transmission path selected according to step 4 carries out data transmission, and each satellite node is formed according to initial labels value
Respective label information, and generate the forwarding table of oneself；
Step 6：Data flow carries out data forwarding according to forwarding table.
2. the Information Network method for routing based on MPLS according to claim 1, which is characterized in that calculate each path
Bandwidth availability ratio δi, specially：
If topology diagram of the Information Network within some period is G (V, E, C), wherein V is set of node, and v ∈ V are figure G
A node, E is the set of link；C is and the relevant bandwidth of V, E or constraints；Label switching path LSP is indicated with U
Extreme points set, K indicate label switching path LSP set, i indicate network in label switching path LSP, i ∈ K；S1,T1Point
It Wei not Ingress node and Egress node；Indicate whether path i passes through link j, j ∈ E, niFor the jump of label switching path LSP i
Number limitation；
Each path is made of multilink, δijIt is the utilization rate for the link j that path is passed through, remembers that the bandwidth availability ratio in path isAs the busy degrees of path i within a certain period of time；Wherein δij=bij/cij, j is i-th in minimum hop count path
The link that path includes, bijFor the demand bandwidth of path i uplinks j, and bij≤cij, cijFor the remaining bandwidth of link j.
3. the Information Network method for routing based on MPLS according to claim 1, which is characterized in that the band in the path
Wide utilization rate is：
Optimization aim：
minδi (1)
Constraints：
Wherein (1) formula is object function, and formula (2)~(5) are constraints；Formula (2) is Ingress node to the path of Egress node
Hop count limits；Formula (3) is to be limited to single path；Formula (4)~(6) are advised respectively to the attribute constraint of label switching path LSP
It is fixed：Each Ingress node LER certainly exists the label switching path LSP established by the node, and each LER nodes that export centainly are deposited
It is being the label switching path LSP terminated with it, and label switching path LSP is not terminated in arbitrary intermediate node.
4. the Information Network method for routing based on MPLS according to claim 1, which is characterized in that NiFor each path i
Hop count, then resource function RiIt is embodied as：
5. the Information Network method for routing based on MPLS according to claim 1, which is characterized in that generate forwarding table
The specific steps are：
(1) satellite edge router LER1 judges the fixed-length data received as ATM cell, and random length data are IP packets, LER1
The fixed-length data that the segmentation of IP packets is reassembled into 44 bytes, loads in the grouping transmitted to satellite MPLS network；LER1 is by all places
For data after reason according to identical inlet/outlet edge router classifying and dividing forwarding equivalence class FEC, it is 1/ to be mapped to initial value
32 MPLS label.The VPI/VCI that label value is 1/32, exit port, next-hop forwarding entry NHLFE are sent to satellite by LER1
LSR1, and these information are preserved in LER1, form LER1 Label Forwarding Information Base 1；
(2) after the ports satellite LSR1-1 receive the tag mapping information that LER1 is sent, label is changed to 1/33, and determination is next
It is LSR2-1 to jump into mouth, and label, exit port, NHLFE at this time is saved in the Label Forwarding Information Base of LSR1；Then by this message
It is sent to satellite LSR2, and forms the forwarding table 2 of oneself；
(3) after the ports satellite LSR2-1 receive the tag mapping information that LSR1 is sent, label is changed to 1/34, and determination is next
It is LER2-1 to jump into mouth, and label, exit port, NHLFE at this time is saved in the Label Forwarding Information Base of LSR2；Then by this message
It is sent to egress edge router LER2, and forms the forwarding table 3 of oneself；
(4) when the ports LER2-1 receive the label mapping message of LSR2 transmissions, exit port is changed to 2, since LER2 is outlet
Edge router, therefore present packet label 1/34 is removed, grouping becomes sky label at this time, and forms the forwarding table of oneself
4, then notice other ports；The Label Forwarding Information Base of each node is as follows：
The Label Forwarding Information Base of 1 LER1 of table
The Label Forwarding Information Base of 2 LSR1 of table
The Label Forwarding Information Base of 3 LSR2 of table
The Label Forwarding Information Base of 4 LER2 of table
6. the Information Network method for routing based on MPLS according to claim 5, which is characterized in that data forwarding is specific
Flow is：
(1) entrance LER1：Data enter the fringe node of satellite MPLS, and entrance LER1 reads packet group head, then searches
Label Forwarding Information Base 1 obtains, into label and exit port, exporting to specified port；
(2)LSR：LSR receives the packet with label, and label is extracted from grouping, and searching label as pointer using label turns
Table 2 and table 3 are delivered, replaces extracted label with the outgoing label in table respectively, new grouping is according to signified defeated in forwarding table
Exit port is sent to next-hop；
(3) LER2 is exported：After outlet LER2 receives packet, label is removed, it is 44 bytes and 48 words to become size
Two kinds of data of section, by the data recombination of 44 bytes at IP packets, the data convert of 48 bytes is at ATM cell；By the IP after recombination
Packet and ATM cell are exported from corresponding port CE11 and CE21 respectively.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810177888.4A CN108400936B (en) | 2018-03-05 | 2018-03-05 | MPLS-based spatial information network routing method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810177888.4A CN108400936B (en) | 2018-03-05 | 2018-03-05 | MPLS-based spatial information network routing method |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108400936A true CN108400936A (en) | 2018-08-14 |
| CN108400936B CN108400936B (en) | 2020-09-22 |
Family
ID=63092166
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810177888.4A Active CN108400936B (en) | 2018-03-05 | 2018-03-05 | MPLS-based spatial information network routing method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108400936B (en) |
Cited By (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110601975A (en) * | 2019-08-05 | 2019-12-20 | 中国人民解放军陆军工程大学 | Label distribution method suitable for multi-satellite and multi-beam satellite communication system |
| WO2020057533A1 (en) * | 2018-09-20 | 2020-03-26 | 中国移动通信有限公司研究院 | Method and device for calculating bandwidth utilization |
| CN111641567A (en) * | 2019-03-01 | 2020-09-08 | 瞻博网络公司 | Dynamic network bandwidth allocation and management based on centralized controller |
| CN112272142A (en) * | 2020-09-24 | 2021-01-26 | 中国空间技术研究院 | Improved OSPF routing method and device of satellite constellation network |
| CN113067775A (en) * | 2021-03-12 | 2021-07-02 | 鹏城实验室 | Protocol-independent heuristic source route discovery method |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1738288A (en) * | 2004-08-17 | 2006-02-22 | 华为技术有限公司 | Method for renewing route in multi protocol label exchanging network |
| CN101127703A (en) * | 2007-08-06 | 2008-02-20 | 北京航空航天大学 | Start carried routing switching system for broadband satellite communication |
| WO2010121220A1 (en) * | 2009-04-17 | 2010-10-21 | Viasat, Inc. | Packet acceleration through a network tunnel |
| CN104065576A (en) * | 2014-07-07 | 2014-09-24 | 武汉大学 | Label switching method in dynamic MPLS satellite network |
-
2018
- 2018-03-05 CN CN201810177888.4A patent/CN108400936B/en active Active
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN1738288A (en) * | 2004-08-17 | 2006-02-22 | 华为技术有限公司 | Method for renewing route in multi protocol label exchanging network |
| CN101127703A (en) * | 2007-08-06 | 2008-02-20 | 北京航空航天大学 | Start carried routing switching system for broadband satellite communication |
| WO2010121220A1 (en) * | 2009-04-17 | 2010-10-21 | Viasat, Inc. | Packet acceleration through a network tunnel |
| CN104065576A (en) * | 2014-07-07 | 2014-09-24 | 武汉大学 | Label switching method in dynamic MPLS satellite network |
Non-Patent Citations (3)
| Title |
|---|
| LIJUN ZHAI: "A N ovel Method of LSP’s P rotection and Restoration in Ka-Band Satellite MPLS Network", 《2009 15TH ASIA-PACIFIC CONFERENCE ON COMMUNICATIONS》 * |
| 李芳: "基于DiffServ over MPLS的深空通信网络QOS控制方法", 《中国科学院研究生院学报》 * |
| 翟立君: "卫星MPLS网络关键技术研究", 《中国博士学位论文电子期刊网》 * |
Cited By (8)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| WO2020057533A1 (en) * | 2018-09-20 | 2020-03-26 | 中国移动通信有限公司研究院 | Method and device for calculating bandwidth utilization |
| US11973677B2 (en) | 2018-09-20 | 2024-04-30 | China Mobile Communication Co., Ltd Research Institute | Method and device for calculating bandwidth utilization ratio |
| CN111641567A (en) * | 2019-03-01 | 2020-09-08 | 瞻博网络公司 | Dynamic network bandwidth allocation and management based on centralized controller |
| US11374820B2 (en) | 2019-03-01 | 2022-06-28 | Juniper Networks, Inc. | Centralized controller-based dynamic network bandwidth allocation and management |
| CN110601975A (en) * | 2019-08-05 | 2019-12-20 | 中国人民解放军陆军工程大学 | Label distribution method suitable for multi-satellite and multi-beam satellite communication system |
| CN112272142A (en) * | 2020-09-24 | 2021-01-26 | 中国空间技术研究院 | Improved OSPF routing method and device of satellite constellation network |
| CN112272142B (en) * | 2020-09-24 | 2022-07-29 | 中国空间技术研究院 | Improved OSPF routing method and device of satellite constellation network |
| CN113067775A (en) * | 2021-03-12 | 2021-07-02 | 鹏城实验室 | Protocol-independent heuristic source route discovery method |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108400936B (en) | 2020-09-22 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| Li et al. | Routing bandwidth guaranteed paths with local restoration in label switched networks | |
| CN108400936A (en) | Information Network method for routing based on MPLS | |
| EP1579716B1 (en) | Routing scheme based on virtual space representation | |
| EP2911348B1 (en) | Control device discovery in networks having separate control and forwarding devices | |
| US9015299B1 (en) | Link grouping for route optimization | |
| CN103746931B (en) | A kind of method for computer network, the network equipment and service card | |
| EP1601143A1 (en) | Efficient and robust routing independent of traffic pattern variability | |
| US9807035B1 (en) | Using available bandwidths of an IP fabric to intelligently distribute data | |
| US9401868B2 (en) | Method of traffic engineering for provisioning routing and storage in content-oriented networks | |
| CN112350949B (en) | Rerouting congestion control method and system based on flow scheduling in software defined network | |
| CN107070794A (en) | A kind of low rail information network optimal network benefit delay constraint method for routing | |
| Lei et al. | Multipath routing in SDN-based data center networks | |
| Seok et al. | Explicit multicast routing algorithms for constrained traffic engineering | |
| CN109286563B (en) | Data transmission control method and device | |
| US11070472B1 (en) | Dynamically mapping hash indices to member interfaces | |
| Cheocherngngarn et al. | Depth-first worst-fit search based multipath routing for data center networks | |
| Kulkarni et al. | New QoS routing algorithm for MPLS networks using delay and bandwidth constraints | |
| Mirjalily et al. | Best multiple spanning tree in metro ethernet networks | |
| RU2678470C1 (en) | Data blocks in the switched network multi-routing method | |
| Lee et al. | Traffic engineering with constrained multipath routing in MPLS networks | |
| El-Darieby et al. | A Hierarchical Distributed Protocol for MPLS path creation | |
| Aweya | Designing Switch/routers: Fundamental Concepts and Design Methods | |
| Ben Hadj Said et al. | Energy-efficient routing in sdn-based access networks | |
| Lui et al. | Link layer multi-priority frame forwarding | |
| Sati et al. | Comparative performance of multipath routing protocols in wireless mesh network |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |