KR100708588B1 - Method for forwarding preference-based in network and its system - Google Patents

Abstract

The present invention is to select the optimal route to the destination by using the routing table information set the optimal route in the IPv6 network, and to forward the packet arrived through the selected optimal route, the present invention for this purpose, priority Selecting a route of an active route among a plurality of routes stored in a routing table having a code and setting the priority route, and selecting and switching a route of the set active route when an IP packet arrives through the network. If a limitation occurs on the route of the active route during forwarding of the IP packet and forwarding the IP packet, the priority value of the next active route is selected and reset to the priority value. And forwarding the IP packet through the reset route of the active route. Therefore, when the transmission path is disconnected, the next priority value may be adjusted and set from "0" to "1" to smoothly forward the path through the reliability.

Routing, Forwarding, IPv6, IP Packets, Interfaces

Description

Priority-based forwarding method and system in the network {METHOD FOR FORWARDING PREFERENCE-BASED IN NETWORK AND ITS SYSTEM}

1 is a block diagram for a priority-based forwarding system in a network according to the present invention;

2 is a detailed flowchart of a priority-based forwarding method in a network according to the present invention.

<Description of the symbols for the main parts of the drawings>

101: routing control means 103: fabric switch

1031: priority-based forwarding engine

1033: routing table with priority code

1035, 1037: Line Card

The present invention relates to a priority-based forwarding method and a system thereof in a network. More specifically, in an Internet Protocol version 6 (IPv6) network, an optimal path to a corresponding destination using routing table information having an optimal path is set. After selecting, the present invention relates to a method and a system capable of forwarding packets arriving through a selected optimal path.

As is well known, the network protocol currently widely used and used based on the Internet is the Internet Protocol (IP). These IPs play a crucial role in connecting thousands of networks and users to a single, large network called the Internet in a short time.

In other words, IP has been developed through a number of design changes, and the current widely used version through the Internet is IPv4, but the biggest disadvantage of this relatively simple and flexible version is the lack of available IP addresses, IP packets. The inefficiency of the routing process and the complexity of the various configuration processes required for the IP node to operate. To minimize these shortcomings mentioned earlier, IPv6 was introduced as a new version.

Recently, new IPv6-based networks are gradually emerging, and existing networks are gradually replaced by IPv6. The IPv6 is a next-generation Internet address system that standardizes the address length of 32-bit IPv4 by four times and standardizes it to 128 bits. It is a network capable of generating approximately 3.4 × 1038 addresses. The addressing system of 128-bit IPv6 network can fundamentally solve the problem of lack of IP address, and it is evaluated as a key element of the next generation Internet implementation considering the quality control, security, various protocols, and convenient network configuration functions from the development stage. It is becoming.

IP packet routing using an IPv6 network is one of the main functions of a router, and the IP packet is forwarded from the source to the destination through the hops by the router.

However, most of the forwarding time is spent during the look up operation of the router using a long prefix matching algorithm, which decreases the reliability of the forwarding path. When using an address matching algorithm, many limitations (eg, a broken network path or a collision caused by a change in network environment) cannot be solved.

Accordingly, an object of the present invention is to solve the above-mentioned problems, and an object thereof is to select an optimal route to a corresponding destination using routing table information in which an optimal route is set in an IPv6 network, and then arrive through the selected optimal route. The present invention provides a method and system for priority-based forwarding in a network capable of forwarding packets.

In order to achieve the above object, a priority-based forwarding method in a network includes selecting a path of an active route among a plurality of paths stored in a routing table having a priority code, and setting the priority value as a priority value; When the IP packet arrives through the network, the process of forwarding the IP packet by selecting and switching the route of the set active route, and when the restriction of the route of the active route occurs while forwarding the IP packet, And re-adjusting the priority value to select a path of the next active route and resetting it to a priority value, and forwarding an IP packet through the reset active route.

In addition, in the present invention for achieving the above object, a priority-based forwarding system in a network selects a route of an active route among a plurality of routes, sets the priority value, and sets the route of the set active route. Priority-based forwarding engine means to readjust the set priority value when the restriction occurs, to select and reset the path of the next active route to the priority value, and to set the active route once the IP packet arrives through the network. Forwarding of IP packets by selecting and switching the paths of the paths, and if limitations occur during forwarding, routing control means for forwarding the IP packets through the reset paths of active routes, and the priority of the paths of the active paths being set and stored. And a routing table having a rank code.

Hereinafter, a plurality of embodiments of the present invention may exist, and a preferred embodiment will be described in detail with reference to the accompanying drawings. Those skilled in the art will appreciate the objects, features and advantages of the present invention through this embodiment.

1 is a block diagram for a priority-based forwarding system in a network according to the present invention, including routing control means 101 and fabric switch 103.

The routing control unit 101 periodically monitors the fabric switch 103 and, when the IP packet arrives at the line card 1035, allows the fabric switch 103 to forward the IP packet to its final destination via the priority optimal path. ), And then control the line card 1037 so that the IP packet is sent out through the optimal forwarding path. Here, the optimal forwarding is performed by the autonomous system or the outside of the routing domain, and the forwarding path setting is performed by an interior gateway protocol (IGP) (eg, a routing information protocol (RIP) or an open shortest path) in the autonomous system. It is determined by factors such as OoS, reliability, load balancing, and priority.

The fabric switch 103 internally has a priority-based forwarding engine 1031 and a routing table 1033 with a priority code, and further includes line cards 1035 and 1037 for sending and receiving IP packets. .

Priority-based forwarding engine 1031 selects the most optimal route, called an active route, from among a plurality of routes to one destination stored in routing table 1033 having a priority code, and sets the priority value to " 1. " Control to set to "0", control to set priority value to "0" for other paths, and control to set priority value to "-1" for unsuitable paths (eg, broken paths) At the same time, ignore this path.

In addition, the priority based forwarding engine 1031 retrieves the routing table 1033 having the priority code according to the forwarding control of the routing control unit 101, and then multiple paths for transmission to the next hop interface (e.g., one destination). During the selection of an interface with the most optimal route, called the active route, set to "1" and forwarding IP packets through the selected next hop interface, many restrictions (for example, the network route is broken or If the next hop interface being forwarded is not available and the current forwarding interface is not available, set the interface with the priority value set to "0" to "1" and then set it. Forward IP packets over the hop interface.

The routing table 1033 having a priority code is referred to as the next hop interface stored under the control of the setting of the priority-based forwarding engine 1031, namely an active route of a plurality of routes to be transmitted to one destination. Select only one of the most optimal paths, set the priority value to "1", set the priority value to "0" for other paths, and prioritize for unsuitable paths (eg, broken paths). Set the value to "-1".

Therefore, in the IPv6 network, by selecting the optimal route to the corresponding destination by using the routing table information with the optimal route set, forwarding the packets arriving through the selected optimal route, the next priority in case the transmission route is lost By adjusting and setting the value from "0" to "1", you can smoothly forward through a reliable path.

Next, the priority-based forwarding process in the network in the present embodiment having the above-described configuration will be described.

2 is a flowchart sequentially illustrating a priority based forwarding process in a network according to an exemplary embodiment of the present invention.

First, the priority-based forwarding engine 1031 in the fabric switch 103 is the next hop interface stored in the routing table 1033 with the priority code, that is, the active route among the multiple paths for transmission to one destination. select only one of the most optimal routes, called routes), to control the priority value to be set to "1", and to set the priority value to "0" for all other routes, , To set the priority value to "-1" for the broken path (S201).

Then, the routing table 1033 having the priority code is the next hop interface stored according to the setting control of the priority based forwarding engine 1031, that is, the active route among the plurality of paths to be transmitted to one destination. Select only one of the most optimal routes, called "1", set the priority value to "1" for the other routes, and set the priority value to "0" for the other routes, and for unsuitable routes (eg, broken routes). The priority value is set to "-1" (S203).

Thereafter, the routing control means 101 determines whether the IP packet arrives at the line card 1035 while periodically monitoring the fabric switch 103 (S205).

As a result of the determination (S205), if the IP packet does not arrive at the line card 1035, the determination process of arrival or not continues. On the other hand, when the IP packet arrives at the line card 1035 as a result of the determination (S205), the fabric switch 103 is controlled to forward the IP packet to the final destination through the priority optimal path (S207).

Then, the priority based forwarding engine 1031 in the fabric switch 103 searches the routing table 1033 having the priority code according to the forwarding control of the routing control means 101 to the next hop interface (eg, one destination). Select the interface with the most optimal route, called the active route, among the multiple paths to be transmitted) and switch the line card 1037 to forward the IP packet through the selected next hop interface. (S209).

At this time, while the priority-based forwarding engine 1031 forwards the IP packet through the selected next hop interface, a restriction (eg, a network path is broken or a collision due to a change in the network environment) on the next hop interface that is currently forwarded. Is generated) is checked (S211).

As a result of the check (S211), if a restriction is not generated on the next hop interface that is currently forwarded, the next hop interface that is currently forwarded is continuously used (S213), while the next hop that is currently forwarded as a result of the check (S211). If a restriction is generated on the interface and cannot be used, the interface having the priority value set to "0" is readjusted to "1" and set (S215), and then the IP packet is forwarded through the next hop interface that is set ( S217).

Therefore, in the IPv6 network, by selecting the optimal route to the corresponding destination by using the routing table information with the optimal route set, forwarding the packets arriving through the selected optimal route, the next priority in case the transmission route is lost By adjusting and setting the value from "0" to "1", you can smoothly forward through a reliable path.

In addition, since the present invention is disclosed as a right within the spirit and claims of the present invention, the present invention may include any modification, use and / or adaptation using general principles, and the present invention as a matter deviating from the description herein It includes everything that falls within the scope of known or customary practice in the art to which it belongs and falls within the scope of the appended claims.

As described above, the present invention selects an optimal route to a corresponding destination by using routing table information in which an optimal route is set in an IPv6 network, and then forwards packets arriving through the selected optimal route, so that if the route being transmitted is disconnected. In this case, the priority value is then adjusted and set from "0" to "1", so that there is an effect of smoothly forwarding the path through the reliability.

Claims (8)

Priority-based forwarding method in a network, Selecting a route of an active route among a plurality of routes stored in a routing table having a priority code and setting the route as a priority value; When the IP packet arrives through the network, forwarding the IP packet by selecting and switching a path of the set active route; When forwarding the IP packet, if a limitation occurs in the path of the active route, re-adjusting the set priority value, selecting a path of the next active route, and resetting the path to the priority value; Forwarding an IP packet through the reset active route path Priority-based forwarding method in a network comprising a. The method of claim 1, The path of the active route is a priority-based forwarding method in a network, characterized in that the next hop interface that is the most optimal of the plurality of paths for transmission to one destination. The method of claim 2, The next hop interface selects only one of the most optimal paths, sets the priority value to "1", sets the priority value to "0" for the other paths, and gives priority to unsuitable paths. A priority-based forwarding method in a network, characterized in that the value is set to "-1". The method of claim 1, The limitation is a priority-based forwarding method in the network, characterized in that when the network path is broken, or a collision occurs on the network to perform forwarding. A priority-based forwarding system in a network, Select a route of an active route among a plurality of routes and set the priority route. If a limitation occurs in the route of the set active route, the set priority value is readjusted to route the next active route. Priority-based forwarding engine means for selecting and resetting to a priority value; When an IP packet arrives through the network, the IP packet is forwarded by selecting and switching a path of the set active route, and when a restriction occurs during forwarding, an IP packet is set through the path of the reset active route. Routing control means for forwarding a; Routing table having a priority code in which the path of the active route is set and stored Priority-based forwarding system in the network comprising a. The method of claim 5, The route of the active route is a priority-based forwarding system in the network, characterized in that the next hop interface that is the most optimal of the plurality of paths for transmission to one destination. The method of claim 6, The next hop interface selects only one of the most optimal paths, sets the priority value to "1", sets the priority value to "0" for the other paths, and gives priority to unsuitable paths. A priority-based forwarding system in a network, wherein the value is set to "-1". The method of claim 5, The limitation is a priority-based forwarding system in the network, characterized in that when the network path is broken or a collision occurs on the network to perform forwarding.

Images