JP2002009829A - Data transfer method, data transfer device and storage medium recorded with program - Google Patents

Abstract

PROBLEM TO BE SOLVED: To recognize a transfer destination without the need for referencing the contents of a packet. SOLUTION: When transferring data from a label switch area D101 to a label switch area D103 via a non-label switch area D102, the label switch area D101 adds a 1st label recording a transfer destination address to data and transmits the resulting data, a data transmission destination address R105 is designated on the basis of transfer destination address information recorded on the 1st label at a border area R103 between the label switch area D101 and the non-label switch area D102, the transmission destination address information is recorded on a 2nd label recognized by the non-label switch area D102 without the need for referencing contents of the data, the 2nd label is attached to the data and the resulting data are sent to the non-label switch area D102, which transmits the data to the label switch area D103 on the basis of the transmission destination address information recorded on the 2nd label, and a border area R105 between the non-label switch area D102 and the label switch area D103 transfers the data on the basis of the transfer destination address information attached to the transmission data.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to a data transfer method and a data transfer apparatus, and a recording medium on which a program is recorded. More specifically, the present invention relates to a label switch area from a label switch area via a non-label switch area. The present invention relates to a data transfer method and a data transfer device for transferring data to a computer, and a recording medium on which a program is recorded.

[0002]

2. Description of the Related Art Conventionally, when packet data is transferred via the Internet, a node existing during transfer is
A data transfer method is applied in which the destination is recognized by reading the destination address written in the packet data, and the packet data is transferred based on the written destination address.

However, in such a data transfer method, there is a problem that the packet data is opened by a node in the middle of the transfer and the contents are seen.

[0004] Here, a node is a type of router, and is a router having not only a function of transferring packet data but also a function of transmitting and receiving packet data.

In order to solve this problem, a label switching technique is used in which a label is attached to a packet so that a destination address can be recognized without opening the contents of the packet.

In the label switching area to which the label switching technology is applied, when a node receives such a labeled packet, the node refers to the value written in the label without opening the contents of the packet. It recognizes the destination and forwards the packet to that destination.

In a label switch area to which such a label switch technique is applied, a packet can be transferred to a designated transfer destination node without referring to the contents of the packet at a node in the middle of transfer. .

[0008]

However, such a conventional data transfer method has the following problems.

That is, in the non-label switch area to which the label switch technology as described above is not applied, the label cannot be recognized, and the node in the non-label switch area receives the labeled packet. In such a case, the label is separated from the packet, and the destination address is referred to by referring to the contents of the packet.

Therefore, when packet data is transferred in a network in which a label switch area and a non-label switch area coexist, a label is added in the label switch area to refer to the next packet without referring to the contents of the packet. Although the packet data can be transferred to the node at the stage, there is a problem that the label is removed at the node in the non-label switch area and the contents of the packet are referred to.

The present invention has been made in view of such circumstances, and even in a network in which a label switch area and a non-label switch area coexist, each node during transfer can refer to the contents of a packet without referring to the contents of the packet. An object of the present invention is to provide a data transfer method and a data transfer device capable of further improving information security by recognizing the transfer destination, and a recording medium on which a program is recorded.

[0012]

Means for Solving the Problems In order to achieve the above object, the present invention takes the following measures.

That is, according to the first aspect of the present invention, the destination address information of the data recorded on the label attached to the data to be transferred can be recognized without referring to the contents of the data. A data transfer method in a network including at least one non-label switch area in which transfer destination address information recorded on a label cannot be recognized, the method comprising: When data is transferred to the switch area, the source label switch area attaches a label recording destination address information in the destination label switch area to the data to be transferred, and adds the label to the source label switch area and the destination label. Sent to the non-label switch area between the switch area and the source label switch. In the boundary area between the area and the non-label switch area, based on the transfer destination address information recorded in the label attached to the transmitted data, the destination address of the data in the non-label switch area is specified, The designated destination address information is recorded in a packet header that can be recognized in the non-label switch area without referring to the contents of this data, and this packet header is further added to the labeled data. In the non-label switch area, the non-label switch area receives the transmitted data, and based on the destination address information recorded in the packet header attached to the received data, transfers the data to the destination. Sent to the label switch area, the boundary area between the non-label switch area and the destination label switch area Based on the recorded transfer destination address information on a label attached to the transmitted data, and transfers the transmitted data to the destination address specified by the destination address information.

Therefore, in the data transfer method according to the first aspect of the present invention, the data is stored by referring to the transfer destination address stored in the label in the label switch area and in the packet header in the non-label switch area. The destination of the data can be recognized by referring to the destination address information.

As a result, even in the non-label switch area, since the contents of the data are not referred to, high information security can be realized.

According to a second aspect of the present invention, in the data transfer method of the first aspect, a transmission path of data to be transferred in the label switch area based on the destination address information, and a non-label based on the destination address information. The transmission path of the data to be transferred in the switch area is determined in advance before the transfer of the transferred data, and the data is transferred from the source label switch area based on the determined transmission path.

Therefore, in the data transfer method according to the second aspect of the present invention, not only the data transfer destination but also the data transfer path can be determined in advance, so that stable transfer is realized while realizing stable transfer. The effect obtained in item 1 can be achieved.

According to the third aspect of the present invention, the destination address information of the data recorded on the label attached to the data to be transferred can be recognized between the label switch areas which can be recognized without referring to the contents of the data. A data transfer device in a network including at least one non-label switch area that cannot recognize transfer destination address information recorded on a label, wherein the data transfer apparatus is provided in a source label switch area, and includes a non-label from a source label switch area. When data is transferred to the transfer destination label switch area via the switch area, a label attaching means for creating a label recording the address information in the transfer destination label switch area and attaching the data to be transferred; The data that is provided and labeled by the labeling means is the transfer source label. First data transmission means for transmitting data to the non-label switch area between the switch area and the destination label switch area; and a first data transmission means provided in a boundary area between the source label switch area and the non-label switch area. Based on the destination address information recorded on the label attached to the data transmitted by the data transmitting means, specify the destination address in the non-label switch area of this data, and specify the specified destination address information, Packet header attaching means for recording the packet header in a packet header recognizable in the non-label switch area without referring to the contents of the data, and further attaching the packet header to the labeled data; Provided in the boundary area between the area and the non-label switch area. A second data transmitting unit for transmitting the data to the non-label switch area based on the destination address information, and receiving the data transmitted by the second data transmitting unit provided in the non-label switch area A third data transmitting means for transmitting the data to the destination label switch area based on the destination address information recorded in the packet header attached to the received data; and a destination label switch area. And transmitting the transmitted data to the transfer destination address specified by the transfer destination address information based on the transfer destination address information recorded on the label attached to the data transmitted by the third data transmission means. Data transfer means.

Therefore, in the data transfer apparatus according to the third aspect of the present invention, in the label switch area, the transfer destination address stored in the label is referred to, and in the non-label switch area, the data is stored in the packet header. The destination of the data can be recognized by referring to the destination address information.

As a result, even in the non-label switch area, since the contents of the data are not referred to, high information security can be realized.

According to a fourth aspect of the present invention, in the data transfer apparatus according to the third aspect of the present invention, a transmission path of data to be transferred in the label switch area is determined based on the destination address information, and the determined transmission path information is stored in the second area. A first data transmission means, a second data transmission means, a first transmission path determination means to be stored in the data transfer means, and a transmission path of data to be transferred in the non-label switch area based on destination address information. Second transmission path determination means for storing the determined transmission path information in the third data transmission means, wherein the first data transmission means, the second data transmission means, the third data transmission means, and the data The transfer means
Data transfer is performed based on the stored transmission path information.

Therefore, in the data transfer apparatus according to the fourth aspect of the present invention, not only the data transfer destination but also the data transfer path can be determined in advance, so that stable transfer is realized while realizing stable transfer. The effect obtained in item 3 can be achieved.

According to the fifth aspect of the present invention, the destination address information of the data recorded on the label attached to the data to be transferred can be recognized between the label switch areas which can be recognized without referring to the contents of the data. A program for controlling data transfer in a network including at least one non-label switch area which cannot recognize transfer destination address information recorded on a label, wherein the program controls a data transfer from one label switch area to another via a non-label switch area. When transferring data to the label switch area, transmission path determining means for predetermining a transmission path of data to be transferred based on the transfer destination address information before transferring the data, transfer destination address information in the transfer destination label switch area Is attached to the data to be transferred, and then The first transmitting means for transmitting the data from the transfer source label switch area to the non-label switch area based on the transmission path determined by the determining means, and receiving the data transmitted by the first transmitting means. Based on the destination address information recorded on the label attached to the data, the destination address of the data in the non-label switch area is designated, and the designated destination address information is referred to the contents of the data. The packet header is recorded in a packet header that can be recognized in the non-labeled switch area without any change, and the packet header is further added to the labeled data.
A second transmission unit for transmitting the data to the non-label switch area based on the transmission path determined by the transmission path determination unit; receiving the data transmitted by the second transmission unit; Based on the destination address information recorded in the packet header and the transmission route determined by the transmission route determining means,
A third transmitting means for transmitting this data to the destination label switch area side, the destination address information recorded on the label attached to the data transmitted by the third transmitting means, and the transmission path determining means determining the destination address information. A computer-readable recording medium on which a program for causing a computer to function as data transfer means for transferring the transmitted data to a transfer destination address specified by the transfer destination address information based on the transmitted transmission path is recorded. .

Therefore, in the recording medium on which the program according to the fifth aspect of the present invention is recorded, the transmission path is determined in advance even when data is transferred between the label switch areas sandwiching the non-label switch area. Not only can it transfer data along its transmission path,
Since the contents of the data are not referred to during the transfer, high information security can be realized.

[0025]

Embodiments of the present invention will be described below with reference to the drawings.

(First Embodiment) A first embodiment of the present invention will be described with reference to FIGS.

FIG. 1 is a schematic diagram showing an example of a data transfer apparatus to which the data transfer method according to the first embodiment is applied.

FIG. 2 is a conceptual diagram for explaining the configuration of a packet used in a data transfer device to which the data transfer method according to the first embodiment is applied.

That is, as shown in FIG. 1, the data transfer apparatus to which the data transfer method according to the first embodiment is applied includes a label switch area D101 and a non-label switch area.
D102, label switch area D103, label switch path P101, packet transfer path P102, label switch path P103, and label switch nodes R101, R102, R106, R1
07, label switch boundary nodes R103 and R105, and a non-label switch node R104.

A data transfer apparatus to which the data transfer method according to the present embodiment is applied reads a program recorded on a recording medium such as a magnetic disk and uses a computer whose operation is controlled by the program. Can also be realized.

The label switch areas D101 and D103 are shown in FIG.
As shown in (a), packet 1 is an area to which label 2 is attached and transferred.

Label 2 is defined between adjacent label switch nodes (for example, between label switch node R101 and label switch node R102, between label switch node R102 and label switch node R103, between label switch node R105 and label switch node R105. This is data in which a label switch path which is a transfer path between the node R106 and the label switch node R106 and the label switch node R107) is defined as a label value.

The non-label switch area D102 is shown in FIG.
As shown in the figure, the packet 1 with the label 2 is an area to which the packet header 5 is further added and transferred. The packet header 5 will be described later.

The label switch paths P101 and P103 are transfer paths for transferring the packet 1 labeled 2 in the label switch areas D101 and D103.

The packet transfer path P102 is a transfer path for transferring the encapsulated packet 10 with the packet header 5 attached thereto in the non-label switch area D102.

The label switch node R101 transmits the packet 1
In FIG. 2, packet 1 is labeled with label 2 and
A labeled packet 3 as shown in (a) is generated, flow information and designated route information are set, and the information is notified to the next-stage node, the label switch node R102.

The flow information is information that defines a set of original packets 1 associated with a specific label value.

The role of the flow information in the present invention will be described below.

Referring to the label switch boundary nodes R103 and R105 as an example, as shown in FIG. 1, the label switch boundary node R103 is connected to the label switch path P101.
Label switch boundary node R105 is label switch path P1
Connected to 03.

However, the label switch boundary node
Each of R103 and R105 is not always connected to a single label switch path, but may be connected to a plurality of label switch paths as shown in FIG.

In this case, the label switch boundary node R103
Is connected to the label switch paths P101a and P101b, and the label switch boundary node R105 is connected to the label switch path P103.
a, connected to P103b.

In general, the node transfers packet 1 received from one label switch path to the other label switch path. However, as shown in FIG. 7, the node 1 also transfers the packet 1 to the label switch boundary node R103 on the receiving side. In the case where a plurality of label switch paths (P101a and P101b, P103a and P103b) also exist in the label switch boundary node R105 on the transmission side,
It must be ensured that the packet 1 reaches the final destination by the transfer by the correct combination of the label switch paths.

For this purpose, for example, a label switch node
To transfer packet 1 to R107, the address of label switch node R107, which is the address of the final destination of labeled packet 3, is specified as flow information.

Also, all packets 1 destined for the label switch node R107 are treated as belonging to one set of the original packets 1, and are sent out to a consistent label switch path.

Further, the flow information is associated with a label value to be assigned to the label switch path, and the correspondence is defined by the nodes R101, R102, R103, R105, R1 on the transmission path.
06, stored in R107. As a result, each node R101, R1
02, R103, R105, R106, and R107 can recognize the correct combination of the label switch paths for delivering the packet 1 to the label switch node R107 that is the final specific destination.

By using such flow information, the packet 1 is transferred to a desired transfer destination via the label switch path.

The designated route information is a list of address information indicating a designated route to which the packet 1 is transferred. Here, it is assumed that packet 1 is transferred to label switch node R107, which is the final destination node, via label switch boundary node R103 and label switch boundary node R105, and the address of label switch boundary node R103 and label switch The address of the boundary node R105 is designated as designated route information.

When the label switch node R101 designates such flow information and designated route information (S1), as shown in FIG. 3, the label switch node R101 sends them to the label switch boundary node R103 designated by the designated route information. (S
2).

The label switch node R102 transmits the packet 1
Is located between the label switch node R101 of the transmission source and the label switch boundary node R103 which is the designated route, receives the flow information and the designated route information notified from the label switch node R101, and receives the flow information and the designated In addition to storing the route information (S3), it also notifies the label switch boundary node R103 designated by the designated route information (S3).
4).

The label switch boundary node R103 receives the flow information and the designated route information notified from the label switch node R102, stores the flow information and the designated route information (S5), and designates the designated route information. The label switch boundary node R105 is notified (S6).

The label switch boundary node R105 receives the flow information and the designated path information notified from the label switch boundary node R103, stores the flow information and the designated path information (S7), and specifies the flow information and the designated path information. The notification is sent to the label switch node R107 side (S8).

The label switch node R106 is located between the label switch boundary node R105 which is the designated route and the label switch node R107 which is the final destination, and the flow information and the designated route information notified from the label switch boundary node R105. And stores the flow information and the designated route information (S9), and notifies the label switch node R107 designated by the flow information (S10).

Label switch node R107 which is the final destination
Stores the flow information and the designated route information notified from the label switch node R106 (S11). Then, a label switch path for receiving the labeled packet 3 from the label switch node R106 is selected, and the number of the selected label switch path is stored as a reception label 13 in the transfer table 12 as shown in FIG. 4 (S12). Then, the label value (here, P103) is notified to the label switch node R106, which is the preceding node (S13).

Upon receiving the notification of the label value from the label switch node R107, the label switch node R106 stores the value (here, P103) as the transmission label 14 in the transfer table 12 (S14). Further, the label switch node R106 selects a label switch path for receiving the labeled packet 3 from the label switch boundary node R105, and stores the number of the selected label switch path as the reception label 13 in the transfer table 12 (S14). , Label switch boundary node R105 which is the preceding node
Is notified of the label value (here, P103) (S15).

Upon receiving the notification of the label value from the label switch node R106, the label switch boundary node R105 stores the value (here, P103) as the transmission label 14 in the transfer table 12 (S16). Further, the label switch boundary node R105 selects a label switch path for receiving the encapsulated packet 10 from the label switch boundary node R103, and stores the number of the selected label switch path as the reception label 13 in the transfer table (S1).
Along with 6), the label value (here, P102) is notified to the label switch boundary node R103, which is the preceding node (S17).

Upon receiving the notification of the label value from the label switch boundary node R105, the label switch boundary node R103 transmits the value (here, P102) to the transmission label 14.
Is stored in the transfer table 12 (S18). Also,
The label switch boundary node R103 sends the labeled packet 3
Is selected from the label switch node R102, the number of the selected label switch path is stored in the transfer table 12 as the reception label 13 (S18), and the label switch node R102, which is the preceding node, is stored in the transfer table 12. The label value (here, P101)
Is notified (S19).

Upon receiving the notification of the label value from the label switch boundary node R103, the label switch node R102 stores the value (here, P101) in the transfer table 12 as the transmission label (S20). Further, the label switch node R102 selects a label switch path for receiving the labeled packet 3 from the label switch node R101, and stores the number of the selected label switch path in the transfer table 12 as the reception label 13 (S20).
Also, the label switch node R1 which is the preceding node
01 is notified of the label value (here, P101) (S21).

Upon receiving the notification of the label value from the label switch node R102, the label switch node R101 stores the value (here, P101) in the transfer table 12 as the transmission label 14 (S22).

As means for causing each of the nodes R101, R102, R103, R105, R106, and R107 to recognize the transmission label and the reception label, for example, CR-LDP (Constraint
-Based Routing Label Distribution Protocol) or the like. That is, the label switch node R101 executes CR-LDP in advance with the label switch node R102. Then, the label switch node R102 receiving the execution of the CR-LDP executes the CR-LDP with respect to the label switch boundary node R103.

As described above, the node that has received the CR-LDP executes the CR-LDP one after another with respect to the next node, so that the CR-LDP is executed up to the final destination.

In this way, when the recognition of the flow information and the designated route information for each of the nodes R101, R102, R103, R105, R106, and R107 to which the packet 1 is transferred is performed.
The label switch node R101 encapsulates the packet 1 with the label 2, generates a labeled packet 3 as shown in FIG. 2A, and transmits the generated labeled packet 3 to the transmission label stored in the label switch node R101. To the label switch path P101.

When the label switch node R102 receives the label packet 3 from the label switch node R101 via the label switch path P101, the label switch node R102 receives the label packet 3 and transfers it to the label packet 3. It is determined whether or not a label switch path exists.

When it is determined that there is a label switch path to be transferred, the label switch path P101
Send to

Receive label 13 in transfer table 12
Column is for searching the received label of the received labeled packet 3. Therefore, in the case of the label switch node R101 which is the transmission source node, this column is blank.

The transmission label 14 is for referring to a label value (transmission label) when the corresponding labeled packet 3 is transmitted to the next node by searching the column of the reception label 13. Therefore, in the case of the label switch node R107 that is the final destination node, this column is blank.

The transmission encapsulation information 15 is a column for describing the contents of the packet header 5 as shown in FIG. Therefore, only the label switch boundary node R103 that generates the encapsulated packet 10 by attaching the packet header 5 to the labeled packet 3 corresponds to this.

In the destination address 6, the address of the final destination node of the encapsulated packet 10 is written. Since the encapsulated packet 10 is transferred from the label switch boundary node R103 to the label switch boundary node R105, in this case, the destination address 6 includes the label switch boundary node R1.
Write 05 address.

In the upper layer information 7, identification information indicating the content protocol encapsulated in the packet 1 is written.

In the other information 8, any information may be entered. For example, if the packet header 5 is an IP header, items such as “source address” correspond to the packet header 5.

As described above, in the transfer table 12 as shown in FIG. 4, each node (R101, R102, R103, R105, R10
6, R107) write unique information.

The label switch boundary node R103 is connected to the labeled packet 3 transmitted from the label switch node R102.
And confirms that there is no label switch path to be transferred in the labeled packet 3 and that the final destination of the labeled packet 3 is not its own node.

After confirming the above, a labeled packet 3 as shown in FIG. 2A is attached with a packet header 5 and encapsulated, and an encapsulated packet 10 as shown in FIG. 2B is created. . Further, the created encapsulated packet 10 is stored in the transmission label 14 described in the transfer table 12.
To the label switch boundary node R105.

The non-label switch node R104 includes a label switch area node R103 and a label switch area node R104.
And has a function of performing normal packet transfer without setting a label switch path between them. Then, the non-label switch node R104 receives the encapsulated packet 10 transmitted from the label switch boundary node R103. Further, it confirms that the destination address 6 of the packet header 5 is not its own node, and sends this encapsulated packet 10 to the label switch boundary node R105, which is the next node, so that it can be delivered to the destination address 6 of the packet header 5. And transfer.

The label switch boundary node R105 receives the encapsulated packet 10 transmitted from the non-label switch node R104, further confirms that the destination address 6 of the packet header 5 is its own node, and checks the upper layer information 7
Indicates that the packet is a labeled packet.

Then, it is confirmed that the upper layer information 7 is the labeled packet 3 and the encapsulated packet 10
Is removed, and the labeled packet 3 is extracted.

Further, it is confirmed that there is a label switch path P103 to which the extracted labeled packet 3 is to be transmitted, and as a labeled packet 3 as shown in FIG. It is sent out on the label switch path P103 defined as 14.

In the data transfer process performed by the label switch node R106, the label switch node R101, which is the transmission source of the labeled packet 3 in the data transfer process of the label switch node R102, is replaced with the label switch boundary node R105. In this example, the label switch path P101 as the transmission destination is replaced with a label switch path P103.

The label switch node R107 receives the labeled packet 3 transmitted from the label switch node R106, and confirms that the labeled packet 3 has no label switch path to be transferred.

In the case of the label switch node Rl07, since the final destination of the labeled packet 3 is its own node, the label 2 of the received labeled packet 3 is removed.
The original packet 1 is taken out.

In the data transfer apparatus to which the data transfer method according to the present embodiment configured as described above is applied, a node existing on the label switch area D101 like the label switch node R101 is like the label switch node R107. To a node existing on another label switch area D103,
When packet 1 is transferred, label switch node Rl01
→ Label switch node R102 → Label switch boundary node R103 → Non-label switch node R104 → Label switch boundary node R105 → Label switch node R106 → Label switch node R107.

At this time, the original packet 1 is transferred to any of the nodes R101, R102, R103, R104, R105, R10 on the transfer route.
6. Transfer without reference to R107. By utilizing this function, this network system can be connected to, for example, a VPN.
(Virtual Private Network) service can be used as a backbone network.

Next, the configuration of a capsule that enables such packet transfer will be described in detail below.

In the label switch path P101 shown in FIG.
As shown in an example of FIG. 2A, a label 2 is attached to the original packet 1, and the packet is transferred to the packet transfer path P102 by referring to the destination address written in the label 2. . In the present invention, such a packet in which the label 2 is added to the original packet 1 is referred to as a labeled packet 3.

Next, the labeled packet 3 transferred to the label switch boundary node R103, which is the start end of the packet transfer path P102, is further provided with a packet header 5 as shown in FIG. I try to encapsulate it.

Then, in the non-label switch area D102,
Normal packet transfer is performed with reference to the destination address 6 of the packet header 5 in which the destination address in the non-label switch area D102 is written. In the present invention, a packet in which a new packet header 5 is added to a labeled packet 3 in this way is referred to as an encapsulated packet 10.

As shown in FIG. 2C, the encapsulated packet 10 transferred to the label switch boundary node R105 at the end of the non-label switch area D102 has the packet header 5 removed and the labeled packet It is to be returned to 3. And this labeled packet 3
The transfer is performed with reference to the address of the final destination node described in the label 2 of FIG.

According to the packet transfer described above, a node (in this case, label switch node R10) between the source node (in this case, label switch node R101) and the final destination node (in this case, label switch node R107)
2. The contents of the packet 1 are sent to the final destination without being referred to by the label switch boundary node R103, the non-label switch node R104, the label switch boundary node R105, and the label switch node R106).

Next, the operation of the data transfer apparatus to which the data transfer method according to the present embodiment configured as described above is applied will be described.

First, the label switch node R101, which is the source of the packet 1, attaches the label 2 to the packet 1 and generates a labeled packet 3 as shown in FIG.

Further, as shown in step S1 of FIG. 3, flow information and designated route information are set. Then, the flow information and the designated route information are notified to the downstream node as shown in steps S2 to S11 shown in FIG. 3 and stored in the node.

When the flow information and the designated route information are stored in the downstream node in this manner, the process proceeds to step S in FIG.
As shown in step S22 from step S12, the reception label 13 and the transmission label 14 are determined in order from the downstream node, and are stored in the transfer table 12.

In this way, each node R101, R102, R10
When R105, R106, and R107 recognize the information on the transmission of the packet 1, the labeled packet 3 is transmitted from the label switch node R101 according to the transmission label 14 described in the transfer table 12 of the label switch node R101. Sent to P101.

In this case, the address of the label switch node R107 which is the final destination of the labeled packet 3 is written in the label 2.

Next, a processing procedure when the label switch node R102 receives the labeled packet 3 will be described with reference to the flowchart shown in FIG.

Note that the flowchart shown in FIG.
As shown in the figure, when a node existing on the label switching area D101 like the label switching node R102 receives a labeled packet 3 from a node existing on the same label switching area D101 like the label switching node R101. It shows the flow of processing.

When the labeling packet 3 transmitted from the label switch node R101 is received by the label switch node R102 (S41), the label switch node R1
02, it is determined whether the labeled packet 3 has a label switch path to be transferred (S).
42).

In the case of the label switch node R102, since the label switch path P101 exists (S42: YES),
The labeled packet 3 is transmitted to the label switch path P101 according to the contents described in the transfer table 12 (S43).

Next, the processing procedure when the label switch boundary node R103 receives the labeled packet 3 will be described.
This will be described with reference to the flowchart shown in FIG.

Note that the flowchart shown in FIG.
As shown in the figure, the nodes existing on the label switch area D101 as in the label switch boundary node R103 and the same label switch area D1 as in the label switch node R102.
It shows the flow of processing when a labeled packet 3 is received from a node existing on 01.

The labeling packet 3 transmitted from the label switch node R102 is transmitted to the label switch boundary node R103.
(S41), the label switch boundary node R103 determines whether or not the labeled packet 3 has a label switch path to be transferred (S42).

No such label switch path exists in the label switch boundary node R103 (S42: N
O) Then, it is determined whether or not the final destination of the labeled packet 3 is its own node (S44).

In the case of the label switch boundary node R103, since this is not its own node (S44: NO), the labeled packet 3 is encapsulated with a new packet header 5 as shown in FIG. 2B (S45). ), And transmitted to the label switch boundary node R105 side designated as the destination address 6 of the new packet header 5 (S46).

These operations are performed by referring to a transfer table 12 created in advance as shown in FIG.

Next, a processing procedure when the non-label switch node R104 receives the encapsulated packet 10 will be described with reference to the flowchart shown in FIG.

Note that the flowchart shown in FIG.
As shown in the figure, a node existing on the non-label switch area D102, such as the non-label switch node R104, is transferred from a node existing on the same non-label switch area D102, such as the label switch boundary node R103, to the encapsulated packet 1.
It shows the flow of processing when 0 is received.

The encapsulated packet 10 transmitted from the label switch boundary node R103 is received by the non-label switch node R104 (S51), and it is further determined whether or not the destination address 6 of the packet header 5 is its own node. (S52).

In the case of the non-label switch node R104, the destination address 6 of the encapsulated packet 10 is the label switch boundary node R105 and is not its own node (S52: N
O), the encapsulated packet 10 is transferred to the label switch boundary node R105 which is the destination address 6 of the packet header 5 (S53).

Next, a processing procedure when the label switch boundary node R105 receives the encapsulated packet 10 will be described with reference to the flowchart shown in FIG.

Note that the flowchart shown in FIG.
As shown in the figure, a node existing on the non-label switch area D102 as in the label switch boundary node R105, and an encapsulated packet 1 from a node existing on the same non-label switch area D102 as in the non-label switch node R104.
It shows the flow of processing when 0 is received.

The encapsulated packet 10 transmitted from the non-label switch node R104 is received by the label switch boundary node R105 (S51), and it is further determined whether or not the destination address 6 of the packet header 5 is its own node. (S52).

In the case of the label switch boundary node R105, the destination address 6 of the encapsulated packet 10 is the label switch boundary node R105 and matches the own node (S52:
Then, it is determined whether or not the upper layer information 7 indicates that the packet is a labeled packet 3 (S5).
Four).

If the upper layer information 7 indicates that the packet is a labeled packet 3 (S54: YES), the packet header 5 of the encapsulated packet 10 is removed (S5).
5) If not (S54: NO), layer processing other than the labeled packet 3 is performed (S56).

The layer processing other than the labeled packet 3 includes, for example, TCP (Transmission Control).
Protocol) processing and UDP (User Datagram Protocol)
There is processing.

In the case of the label switch boundary node R105, since information indicating that the packet is a labeled packet 3 is written in the upper layer information 7, the packet header 5 of the encapsulated packet 10 is removed (S55). The labeled packet 3 is extracted.

Then, the extracted labeled packet 3
It is determined whether or not there is a label switch path to which is sent (S57).

When there is a label switch path to which the extracted labeled packet 3 is to be transmitted (S57: YE)
S) includes a labeled packet 3 as shown in FIG.
Is transmitted on the label switch path P103 defined by the transmission label 14 of the transfer table 12 (S5).
8).

On the other hand, if there is no label switch path to which the extracted labeled packet 3 should be sent (S5)
7: NO), the sending process of the labeled packet 3 is stopped (S59).

In the case of the label switch boundary node R105, since the label switch path P103 exists on the side of the label switch area D103, the label packet 3
2 is sent to the label switch path Pl03 defined by the send label 14 of No. 2.

The processing procedure at the time of receiving the labeled packet 3 in the label switch node R106 is the same as that in the processing procedure of the label switch node R102.
Is replaced with a label switch boundary node R105, and the label switch path P101, which is the destination of the labeled packet 3, is replaced with a label switch path P103.

Finally, a processing procedure when the label switch node R107 receives the labeled packet 3 will be described with reference to the flowchart shown in FIG.

Note that the flowchart shown in FIG.
As shown in the figure, a node existing on the label switch area D103 like the label switch boundary node Rl07 is the same label switch area D1 as the label switch node R106.
It shows the flow of processing when a labeled packet 3 is received from a node on 03.

When the labeling packet 3 transmitted from the label switch node R106 is received by the label switch node R107 (S41), the label switch node R1
07, it is determined whether or not the labeled packet 3 has a label switch path to be transferred (S).
42).

Since no such label switch path exists in the label switch node R107 (S42: NO), it is next determined whether or not the final destination of the labeled packet 3 is its own node (S44).

In the case of the label switch node R07, the final destination of the labeled packet 3 is its own node (S44: Y
ES), so the label value 2 of the received labeled packet 3
Is removed (S47), and the original packet 1 is extracted and received (S48).

The apparatus described in the present embodiment can be realized by causing a computer to read a program stored in a recording medium.

Here, as the recording medium in the present invention,
Magnetic disk, floppy (registered trademark) disk, hard disk, optical disk (CD-ROM, DVD, etc.),
As long as the program can be recorded and a computer-readable recording medium such as a magneto-optical disk (MO or the like) or a semiconductor memory can be used, the recording format thereof may be any.

Further, an OS (Operating System) running on the computer based on instructions of a program installed in the computer from the recording medium,
MW for database management software, network software, etc.
(Middleware) or the like may execute a part of each process for implementing the present embodiment.

Further, the recording medium in the present invention is not limited to a medium independent of a computer, but also includes a recording medium in which a program transmitted via a LAN, the Internet or the like is downloaded and recorded or temporarily recorded.

Further, the number of recording media is not limited to one, and the case where the processing in the present embodiment is executed from a plurality of media is also included in the recording media of the present invention, and the medium may have any configuration. .

The computer according to the present invention executes each processing in the present embodiment based on a program recorded on a recording medium.
Any configuration such as a single device, a system in which a plurality of devices are connected to a network, or the like may be used.

Further, the computer in the present invention is:
It is not limited to a personal computer, but also includes a processing device, a microcomputer, and the like included in an information processing device, and generically refers to a device and a device capable of implementing the functions of the present invention by a program.

As described above, the data transfer method described above uses a network composed of various combinations in addition to a network composed of a combination of nodes, label switch areas, and non-label switch areas as shown in FIG. Can be applied to

For example, the example shown in FIG. 1 shows a case where one label switch node R102, R106 exists on the section of the label switch paths P101, P103. Switch path P101, P1
The present invention can also be applied to a case where a plurality of label switch nodes exist on the section 03 and a case where no node exists on the section of the label switch paths P101 and P103.

In the example shown in FIG. 1, there is shown a case where one non-label switch node R104 exists on the section of the packet transfer path P102. However, the data transfer method as described above uses the packet transfer path P102. Can be applied even when a plurality of nodes exist on the section of the packet transfer path, or when no nodes exist on the section of the packet transfer path P102.

Further, in the example shown in FIG. 1, a label switch area D101, a non-label switch area D102, a label switch area D102 are provided between a label switch node R101 as a source node and a label switch node R107 as a final destination node. Although the case where the switch areas D103 exist in the order is shown, in the data transfer method as described above, a plurality of label switch areas and non-label switch areas exist in order between the source node and the final destination node. It can also be applied to the case.

Furthermore, the example shown in FIG. 1 shows a case where one label switch path P101 and one label switch path P103 exist in the label switch areas D101 and D103 respectively. However, the present invention is not limited to this. As shown in FIG. 7, the configuration is such that a plurality of label switch paths P101a and P101b (in the case of the label switch area D103, a plurality of label switch paths P103a and P103b) exist in the same label switch area D101. May be.

As described above, in the data transfer apparatus to which the data transfer method according to the present embodiment is applied, the label switch areas D101 and D103 are operated by the above-described operation.
And in a network in which the non-label switch area D102 is mixed, the label switch area D101 attaches the label 2 to the labeled packet 3, and
In the non-label switch area D102, the packet R3 is added with the packet header 5 to form the encapsulated packet 10, so that the nodes R101 and R1 in the middle of the transfer are transferred.
02, R103, R105, R106, and R107 can transfer the packet 1 to the transfer destination without referring to the contents of the packet 1.

That is, data transfer can be performed easily and reliably, and data security can be further improved.

Therefore, the data transfer apparatus to which the data transfer method according to the present embodiment is applied has the VPN
(Virtual Private Network) can be applied as a backbone.

(Second Embodiment) A second embodiment of the present invention will be described with reference to FIG.

FIG. 8 is a schematic configuration diagram showing an example of a data transfer apparatus to which the data transfer method according to the second embodiment is applied. The same parts as those in FIG. The description is omitted, and only different portions are described here.

That is, as shown in FIG. 8A, the data transfer apparatus to which the data transfer method according to the present embodiment is applied has another network D10 in the label switch area D103.
4, D105 is connected.

Even in such a case, it is possible to transfer the packet 1 to a desired network by designating any one of the networks D104 and D105 as flow information.

In this case, the label switch node R107 is
Since it is no longer the final transfer destination and becomes a label switch node on the way along the same route as the label switch node R106,
The label switch node R107 stores not only the reception label but also the transmission label in the transfer table 12.

Therefore, flow information, designated route information,
FIGS. 8B and 8C are data flow diagrams for explaining the method of setting the reception label and the transmission label. These are data flow diagrams when the network D104 is selected as the final transfer destination. FIG. 8B shows the data flow when the network D104 is a label switch area.
(C) is a case where the network D104 is a non-label switch area.

When the network D104 is a label switch area, in the setting of the flow information and the designated path information shown in FIG. 8B, the step from the label switch node R101 to the label switch node R106 is performed.
From step 1 to step S10, and in the storage of the reception label and the transmission label, the contents from step S13 to step S22, which are the steps from the label switch node R101 to the label switch node R106, are the same as those described in FIG. is there.

The label switch node R107 receives the flow information and the designated path information notified from the label switch node R106, stores the flow information and the designated path information (S10a), and stores the flow information and the designated path information specified by the flow information. The network D104 is notified (S10b).

The network D104, which is the final destination, stores the flow information and the designated path information notified from the label switch node R107 (S11a). Then, a label switch path for receiving the labeled packet 3 from the label switch node R107 is selected, and the number of the selected label switch path is stored as a reception label 13 in the transfer table 12 as shown in FIG. 4 (S12a). Then, the label value (here, P103) is notified to the label switch node R107, which is the preceding node (S12b).

Upon receiving the notification of the label value from the network D104, the label switch node R107 stores the value (here, P103) in the transfer table 12 as the transmission label 14 (S12c). Further, the label switch node R107 selects a label switch path for receiving the labeled packet 3 from the label switch boundary node R106,
The number of the selected label switch path is stored in the transfer table 12 as the reception label 13 (S12c), and
The label value (here, P103) is notified to the label switch node R106, which is the preceding node (S1).
3).

As a means for making each node recognize the sending label and the receiving label, as in the first embodiment, a CR-LDP (Constraint-Based Routing Label) is used.
A protocol such as a Distribution Protocol may be used.

As described above, when the work of recognizing the flow information and the designated route information for each of the nodes R101, R102, R103, R105, R106, R107 and the network D104 to which the packet 1 is transferred is performed, the label switch node R101 Encapsulates packet 1 with label 2, generates labeled packet 3 as shown in FIG. 2 (a), and converts the generated labeled packet 3 into a label switch, which is a label transmitted from label switch node R101. Send to path P101.

The functions of the label switch node R102, label switch boundary nodes R103, R105, and label switch node R106 after the labeling packet 3 is transmitted are the same as those described in the first embodiment. The description is omitted.

The label switch node R107 receives the labeled packet 3 transmitted from the label switch node R106, checks the contents of the original packet 1, and checks the contents of the packet D104.
Performs processing for transferring. This is the network D1
Processing corresponding to various existing network protocols depending on 04 may be applied.

For example, if the network D104 is an IP (Inte
In the case of a label switch area that conforms to the rnet protocol, since the original packet 1 contains a label, the value of the label is referred to, and a label switch node (not shown) in the network D104 is connected to the next label switch node. A label corresponding to the label value is selected from the set label switch path (not shown), and the original packet 1 is transferred on the label switch path.

The network D104, which is the final transfer destination, receives the packet 1 transferred from the label switch node R107 in this way.

On the other hand, when the network D104 is a non-label switch area, in the setting of the flow information and the designated path information shown in FIG. 8C, the contents from step S1 to step S22 are the same as those described in FIG. Is the same as

That is, the final transfer destination network D104
Is a non-label switch, it loops back to the boundary node of the label switch area closest to the final transfer destination network D104.

For example, if the network D104 is an IP (Inte
In the case of a non-label switch area conforming to the Rnet Protocol, since the original packet 1 includes a packet header, the destination address written in the packet header is referred to and the packet is present in the network D104 (not shown). The packet 1 is transferred to the next node or the destination node existing in the network D104.

Further, in the network D104, the contents of the original packet 1 are referred to. This is applied when the final transfer destination network D104 is, for example, a VPN. In the case of a VPN, there is no problem at all even if the contents of the original packet 1 are referred to.

As described above, in the data transfer apparatus to which the data transfer method according to the present embodiment configured as described above is applied, even if the final transfer destination is another network D104, the flow information and The designated route information is appropriately designated, and each node R101, R102, R103, R10 on the designated route is designated.
5, R106 and R107, and transfer table 12
Can be handled by defining a transmission label value and a reception label value, and the same operation and effect as in the first embodiment can be obtained.

As described above, the preferred embodiments of the present invention have been described with reference to the accompanying drawings, but the present invention is not limited to such configurations. Within the scope of the technical idea described in the claims, those skilled in the art can come up with various modified examples and modified examples, and these modified examples and modified examples are also within the technical scope of the present invention. It is understood that it belongs to.

[0162]

As described above, according to the present invention,
Even in a network in which a label switch area and a non-label switch area coexist, each node during transfer can recognize the transfer destination without referring to the contents of the packet.

As described above, a data transfer method and a data transfer device capable of further enhancing information security,
In addition, it is possible to realize a recording medium on which a program is recorded.

[Brief description of the drawings]

FIG. 1 is a schematic configuration diagram showing an example of a data transfer device to which a data transfer method according to a first embodiment is applied.

FIG. 2 is a conceptual diagram illustrating a configuration of a packet used in a data transfer device to which the data transfer method according to the first embodiment is applied.

FIG. 3 is a data flow diagram for explaining a method of setting flow information, designated route information, a reception label, and a transmission label.

FIG. 4 is a schematic diagram showing an example of a transfer table.

FIG. 5 is a flowchart showing a processing procedure at the time of receiving a labeled packet.

FIG. 6 is a flowchart showing a processing procedure when receiving an encapsulated packet;

FIG. 7 is a schematic configuration diagram showing a modification of the data transfer device to which the data transfer method according to the first embodiment is applied;

FIG. 8 is a schematic configuration diagram illustrating an example of a data transfer device to which a data transfer method according to a second embodiment is applied.

[Explanation of symbols]

 D101, D103: Label switch area D102: Non-label switch area D104, D105: Network P101, P103: Label switch path P102: Packet transfer path R101, R102, R106, R107: Label switch node R103, R105: Label switch boundary node R104 ... Non-labeled switch node Pl01. Label switch path 1. Packet 2. Label 3. Labeled packet 5. Packet header 6. Destination address 7. Upper layer information 8. Other information 10. Encapsulated packet 12. Transfer table 13. Received label 14 ... Sent out label 15 ... Sent out encapsulation information

Continued on the front page (72) Inventor Kotaro Ise 1 Toshiba-cho, Fuchu-shi, Tokyo Inside the Fuchu Office, Toshiba Corporation (72) Inventor Shigeo Matsuzawa 1-Toshiba-cho, Fuchu-shi, Tokyo Inside the Fuchu Office, Toshiba F-term (Reference) 5K030 GA15 HA08 HB11 HD03 KA05 KA15 LB19

Claims (5)

[Claims] 1. A method according to claim 1, wherein the destination address information of the data recorded on the label attached to the data to be transferred is located between label switch areas which can be recognized without referring to the contents of the data. What is claimed is: 1. A data transfer method in a network including at least one non-label switch area in which recorded destination address information cannot be recognized, wherein: from one label switch area to another label switch area via the non-label switch area When transferring the data, the transfer source label switch area attaches the label recording the transfer destination address information in the transfer destination label switch area to the data to be transferred, and transfers the label to the transfer source label switch area. Sent to the non-label switch area between the destination label switch area and the transfer source In the boundary region of the bell switch region and the non-label switching region, based on the recorded transfer destination address information on a label attached to the transmitted data,
A destination address of the data in the non-label switch area is specified, and the specified destination address information is included in a packet header that can be recognized in the non-label switch area without referring to the contents of the data. Recording the packet header, and further transmitting the packet header to the labeled data, to the non-label switch area. In the non-label switch area, receiving the transmitted data, Based on the destination address information recorded in the attached packet header, the data is transmitted to the destination label switch area side, and in the boundary area between the non-label switch area and the destination label switch area, Based on the transfer destination address information recorded on the label attached to the transmitted data, Data transfer method is characterized in that so as to transfer to the transmitted destination address of the data designated by the transfer destination address information. 2. The data transfer method according to claim 1, wherein a transmission path of the transferred data in the label switch area based on the destination address information, and the non-label based on the destination address information. The transmission path of the data to be transferred in the switch area is determined in advance before the transfer of the transferred data,
A data transfer method, wherein data is transferred from the transfer source label switch area based on the determined transmission path. 3. A method according to claim 1, further comprising the step of recognizing the transfer destination address information of the data recorded on the label attached to the data to be transferred without referring to the contents of the data. A data transfer device in a network including at least one non-label switch area that cannot recognize recorded transfer destination address information, wherein the data transfer apparatus is provided in a transfer source label switch area, and includes the non-label from the transfer source label switch area. When transferring the data to the transfer destination label switch area via the switch area, a label assigning unit that creates the label recording the address information in the transfer destination label switch area and attaches the label to the transferred data; The label is provided in the original label switch area, and the label First data transmission means for transmitting attached data to a non-label switch area between the source label switch area and the destination label switch area; and the source label switch area and the non-label switch area. Based on transfer destination address information recorded on a label attached to the data transmitted by the first data transmitting means, the destination address of the data in the non-label switch area. At the same time, the designated destination address information is recorded in a packet header that can be recognized in the non-label switch area without referring to the contents of the data, and the packet header is labeled with the label. Packet header attaching means for further attaching to the data, the source label switch area, and the non-label switch. A second data transmitting unit that is provided in a boundary region with the switch region and that transmits data to which a packet header has been added by the packet header providing unit to the non-label switch region based on the destination address information. Provided in the non-label switch area, receiving the data transmitted by the second data transmission means, based on destination address information recorded in a packet header attached to the received data, Third data transmitting means for transmitting data to the destination label switch area; and recording on the label provided in the destination label switch area and attached to the data transmitted by the third data transmitting means. Based on the transfer destination address information
A data transfer unit for transferring the transmitted data to a destination address specified by the destination address information. 4. The data transfer device according to claim 3, wherein a transmission route of the transferred data in the label switch area is determined based on the transfer destination address information,
Transmitting the determined transmission path information to the first data transmission means;
The second data transmission means, first transmission path determination means to be stored in the data transfer means, and a transmission path of the transferred data in the non-label switch area based on the destination address information; A second transmission path determining means for storing the determined transmission path information in the third data transmission means, wherein the first data transmission means, the second data transmission means, and the third data transmission are provided. And a data transfer unit configured to transfer data based on the transmission path information stored therein. 5. A method according to claim 1, wherein the transfer destination address information of the data recorded on the label attached to the data to be transferred can be recognized without referring to the contents of the data. What is claimed is: 1. A program for controlling data transfer in a network including at least one non-label switch area in which recorded destination address information cannot be recognized. When transferring the data to the switch area, transmission path determining means for predetermining a transmission path of the transferred data based on the transfer destination address information before transferring the data, the transfer in the transfer destination label switch area. The label recording the destination address information is attached to the data to be transferred, Thereafter, based on the transmission path determined by the transmission path determining means, a first transmitting means for transmitting the data from the source label switch area to the non-label switch area side, wherein the first transmitting means Receiving the transmitted data, based on the destination address information recorded on the label attached to this data, and specify the destination address in the non-label switch area of this data,
The designated destination address information is recorded in a packet header that can be recognized in the non-label switch area without referring to the contents of the data, and the packet header is further added to the labeled data. Let me
Thereafter, based on the transmission path determined by the transmission path determining means, a second transmitting means for transmitting the data to the non-label switch area, and receiving the data transmitted by the second transmitting means. Transmitting the data to the destination label switch area based on the destination address information recorded in the packet header attached to the received data and the transmission path determined by the transmission path determining means. A third transmitting unit, based on transfer destination address information recorded on the label attached to the data transmitted by the third transmitting unit and the transmission path determined by the transmission path determining unit, The data transfer means transfers the transmitted data to the transfer destination address specified by the transfer destination address information. A computer-readable recording medium storing a program for causing a Yuta.