JP2005073148A - Method and apparatus for providing band-guaranteed vpn service - Google Patents

Abstract

<P>PROBLEM TO BE SOLVED: To provide a band-guaranteed service providing method with which a user who receives a VPN service, can set a path for securing a desired band. <P>SOLUTION: In a step 102, band and VPN communication ground information required for a group of users who participate in VPN, is read from a memory. In a step 103, a fiber table holding information relating to free bands and free wavelengths of optical fibers and cables is read from the memory. In a step 104, information of the fiber table is used to calculate path routing information containing pass fibers and necessary bands for a path, and stored in the memory. In a step 105, the calculated path routing information is summed up for each router to generate routing information and label information. In a step 106, the generated routing information and label information are reflected on the fiber table. <P>COPYRIGHT: (C)2005,JPO&NCIPI

Description

  The present invention relates to a method for providing a bandwidth guaranteed VPN service.

A path setting in a VPN (Virtual Private Network) is generally performed by a distance-based routing protocol such as IGP (OSPF, RIP, ISIS). However, in these routing protocols, the path for forwarding traffic is selected so that it can be reached from the source to the destination with the shortest distance. For this reason, in the case of route selection by the routing protocol, traffic from the source to the destination is transferred using a single route. However, since the route selection is performed based on the destination address information regardless of the transmission source, if the packet to the same destination is close to the destination, the same route is shared. In addition, if the resources for traffic transfer cannot be sufficiently supported on the route, it may cause a network bottleneck, so that stable traffic transfer becomes difficult. By utilizing existing Cos / QoS technologies such as DiffServ and RSVP, the priority when transferring data can be controlled, and high-priority data can also be transferred preferentially. The selected route is based on the shortest route for traffic.
Allied Telesis Co., Ltd. VPN Solution | Overview of VPN http: // www. allied-telesis. co. jp / solution / vpn / index. html O'Reilly Japan / Ohm "VPN 2nd Edition"

  An object of the present invention is to provide a bandwidth guarantee type VPN service providing method and apparatus capable of setting a path for securing a bandwidth desired by a user who receives a VPN service.

The quality assurance type VPN service providing method of the present invention includes:
A step of reading a bandwidth necessary for a user group entering the VPN and VPN communication ground information from the memory;
Reading from a memory a fiber table that holds information about optical fiber, cable bandwidth, and wavelength;
Using the information in the fiber table, calculating path information of a path including a passing fiber and a necessary bandwidth for the path, and storing the path information in a memory;
Calculating the calculated path route information for each router, generating routing information and label information; and
Reflecting the generated routing information and label information on the fiber table.

Here, main terms used in the present specification will be described.
-Optimization engine Optimum that minimizes (or maximizes) certain criteria such as distance and cost between any points in the network managed by the operator (between routers and routers, terminals and terminals, etc.) The algorithm for calculating the path is referred to as an “optimization engine” in the present invention.
-Fiber Table Information on the vacant bandwidths and vacant wavelengths of optical fibers and cables, etc., possessed by the operation system (OpS) that manages the network is called a fiber table in the present invention. This fiber table describes “capacity” indicating the capacity band and the number of wavelengths that can be stored in each fiber, “cost” required for passing through the fiber, and “passing” indicating a path table passing through the fiber. However, although the name and the format of the table differ depending on the OpS and the optimization engine, if they are functionally the same, they are regarded as the same as the fiber table in the present invention. Note that the present invention includes a case where the fiber is replaced with a link.
Route table This is route information of a path in VPN, which describes the termination router number, passing fiber number, passing router number, and path number of each path. For the explanation of the present invention, it is assumed that the path information calculated by the optimization engine is a route table. The notation indicates a: router number, b: fiber number, and c: path number in the format a- (b / c). For example, when 5- (7/1) → 4- (8/1) → 7, the path number 1 passes through the number 7 fiber from the number 5 router, passes through the number 4 router, and the number 8 fiber. Is read as a path to the router of number 7. For convenience of the optimization engine using the description of the present invention, “Router No. 5” is referred to as a start point, and “Router No. 7” is referred to as an end point. And bidirectional communication between the routers numbered 7. However, the name and the format of the table differ depending on the OpS and the optimization engine, but if they are functionally the same, they are regarded as the same as the route table in the present invention.
Router table The router table is a table showing how paths are accommodated in each router. In the description of the present invention, in the path information calculated by the optimization engine, the router table indicates whether each router is the end of the path or the path. The number of terminations indicates the number of routers that terminate the path, and the passage indicates the number of passages through the router. However, the name and the format of the table differ depending on the OpS and the optimization engine, but if they are functionally the same, they are regarded as the same as the router table in the present invention. Note that the present invention includes a case where a router is replaced with a node.

  According to the present invention, it is possible to set a path that secures a bandwidth desired by a user who receives a VPN service. Unlike the conventional best effort type that does not guarantee the bandwidth or quality, it is possible to realize a “bandwidth guaranteed VPN service” that guarantees the bandwidth. In addition, it can be said that the “quality assurance type VPN service” is realized in the sense that the band desired by the user is always provided.

  Furthermore, in the management target network of the own VPN operator, it is possible to grasp what kind of band (wavelength) the VPN user under contract is communicating with, so that the user management There is also an effect that becomes simple.

  Next, embodiments of the present invention will be described with reference to the drawings.

  FIG. 1 is a flowchart showing a quality assurance type VPN service providing method according to an embodiment of the present invention.

  Suppose that the management target network providing the VPN service is FIG. 4 and there is a user group entering the VPN. It is assumed that the communication ground for performing VPN is routers 0, 5, and 6, and the necessary bandwidth is a unit bandwidth (for one wavelength).

  In step 101, it is determined whether there is a user group entering the VPN. In this case, since there is a user group to be included in the VPN, in step 102, the bandwidth and VPN communication ground information necessary for the user group to be included in the VPN are read from the memory. In this case, the VPN communication ground is the routers 0, 5, and 6, and the necessary bandwidth is for one wavelength. Next, in step 103, the fiber table is read. Assume that the fiber table is Table 1 in this case.

In step 104, the optimization engine is utilized to calculate a path, a necessary bandwidth in each fiber, and the like. As the optimization engine, there are optical path setting algorithms proposed in Japanese Patent Application Nos. 2002-241466, 2003-069083, and 2003-104247. These patent applications assign a wavelength for each path. Therefore, if the “wavelength” handled in these patent applications is replaced with “(unit) band” and an arbitrary band is regarded as a multiple of this unit band, the above patent application is applied even in the concept of band, and the path The necessary bandwidth can be calculated every time. The combination of parameters that minimizes the objective function under constraints represents the optimized path and wavelength. As a band, one path (one wavelength) is a basic band, and an arbitrary band is calculated as a multiple of this basic band. Assume that the calculation results are in Table 2, and the route table is in FIG.

In step 105, the results of step 104 (path route information) are aggregated for each router to generate routing information and label information. Details of this step will be described later. The results are shown in Table 3.

In step 106, the fiber usage calculated in step 105 is reflected in the fiber table (Table 1). Table 4 shows the fiber table after reflecting the fiber usage.

If there is another VPN user group in step 107, the process returns to step 101, and the above-described processing is repeated.

  Next, an algorithm for totalizing route information for each router and generating routing information and label information will be described with reference to FIG. As a result of calculation by the optimization engine, it is assumed that the router table is Table 5 and the route table is FIG.

  In step 201, the router number i is initialized to 0. In step 202, the router i determines whether the number of terminations is 1 or more. In this case, since the number of terminal ends of router 0 is 1 or more, the process proceeds to step 203. In step 203, it is determined whether the router 0 is the starting point. Since router 0 is the starting point, the process proceeds to step 204. In step 204, the following is obtained from the router 0 information.

[1] 0- (0/0): Path (wavelength) number 0 is routed to fiber number 0 [2] 0- (0/2): Path (wavelength) number 2 is routed to fiber number 0 The process proceeds to step 206. Since router 0 does not pass, the process proceeds to step 208 and i = 1. In step 209, since the router 1 exists, the process returns to step 202, and the above process is repeated.

(Omitted)
When i = 4, the router 4 has 0 terminations in step 202, so the process proceeds to step 206. Since the router 4 has passed 1 or more, the process proceeds to step 207. In step 207, the following is obtained from the information of the router 4 and the information of the previous router.

[1] 1- (3/0) → 4- (8/0): Path (wavelength) number 0 routes fiber numbers 3 and 8 [2] 5- (7/1) → 4- (8 / 1): Path (wavelength) number 1 routes fiber numbers 7 and 8 [3] 1- (3/2) → 4- (7/2): Path (wavelength) number 2 is fiber numbers 3 and 7 Routing
(Omitted)
When i = 6, since the router 6 has one or more terminations in step 202, the process proceeds to step 203. In step 203, since the router 6 is the end point, the process proceeds to step 205. In step 205, the following is obtained from the information of the router 6.

[1] 7- (10/0) → 6: Path (wavelength) number 0 is routed to fiber number 10 [2] 7- (10/1) → 6: Path (wavelength) number 1 is fiber number 10 In the routing step 206, since the router 6 does not pass, the process proceeds to step 208.
As a result, Table 3 is finally obtained.

  Next, an algorithm for reflecting the amount of fiber used in an OpS (operation system) that manages the management target network will be described with reference to FIG. Assume that the fiber table is as shown in Table 6 as a result of calculation by the optimization engine.

  In step 301, the fiber number i is initialized to zero. In step 302, the passage of fiber number 0 in the fiber table (Table 6) is k = 2. In step 303, since k ≧ 1, the process proceeds to step 304, where capacity = 10−k = 10−2 = 8 in the fiber table. In step 305, i = 1. In step 306, since fiber number 1 exists, the process returns to step 302.

  By repeating the above, a fiber table (Table 4) after reflecting the fiber usage is obtained.

  FIG. 6 shows a configuration example of a VPN setting OpS for implementing the quality assurance type VPN service providing method of the present invention.

  The VPN setting OpS 1 includes a processing unit 2, an information management unit 5, a measurement request transmission unit 8, and a measurement information reception unit 9. The measurement request transmitting unit 8 periodically transmits a request for grasping information such as VPN users, network configurations, and bandwidths in real time to the IP-VPN network 10, and the measurement information receiving unit 9 transmits these information to the IP- Receive periodically from the VPN network 10. The information management unit 5 includes a memory 7 and a data management unit 6. The memory 7 manages information such as a fiber table. The data management unit 6 writes data in the memory 7 according to an instruction from the processing unit 2. Read data. The processing unit 2 includes a threshold determination unit 3 and an information analysis unit 4. The threshold value determination unit 3 compares the measured value with the threshold value to determine. The information analysis unit 4 performs detailed analysis such as path optimization.

It is a flowchart which shows the quality assurance type | mold VPN service provision method of one Embodiment of this invention. It is a flowchart which shows the detail of step 105 in FIG. It is a flowchart which shows the detail of step 106 in FIG. It is a figure which shows the example of a VPN provision network. FIG. 6 is a diagram showing a route table obtained by the process of step 104. It is a block diagram which shows an example of VPN setting OpS.

Explanation of symbols

101-107, 201-209, 301-306 Step 1 VPN setting OpS
DESCRIPTION OF SYMBOLS 2 Processing part 3 Threshold value determination part 4 Information analysis part 5 Information management part 6 Data management part 7 Memory 8 Measurement request transmission part 9 Measurement information reception part 10 IP-VPN network

Claims (6)

In a network that provides VPN services,
A step of reading a bandwidth necessary for a user group entering the VPN and VPN communication ground information from the memory;
Reading from a memory a fiber table that holds information about optical fiber, cable bandwidth, and wavelength;
Using the information in the fiber table, calculating path information of a path including a passing fiber and a necessary bandwidth for the path, and storing the path information in a memory;
Calculating the calculated path route information for each router, generating routing information and label information; and
A quality assurance type VPN service providing method comprising a step of reflecting the generated routing information and label information in the fiber table. The step of generating the routing information and label information includes
Determining whether the number of terminal ends of the router is 1 or more;
If the number of terminations is 1 or more, if the router is the starting point, record the fiber number and path number of the router, and if the router is not the starting point, record the fiber number and path number of the router before the router. Steps,
Determining whether the number of terminations of the router is 0, and whether the path passing through the router is 1 or more after the previous step;
The method according to claim 1, wherein if there are one or more paths passing through the router, the step of recording the fiber number and path number of the router and the path number of the router before the router is performed for each router. The step of reflecting the routing information and label information
Reading from a memory the number of paths passing through the fiber in the fiber table;
The method according to claim 1, further comprising a step of reducing the capacity of the fiber in the fiber table by the number when the number of the paths is 1 or more. In a network that provides VPN services,
Means for reading the bandwidth necessary for the user group entering the VPN, VPN communication ground information from the memory,
Means for reading from the memory a fiber table holding information about optical fiber, cable free bandwidth, and free wavelength;
Means for calculating path information of a path, including a passing fiber for a path and a necessary band, using the information of the fiber table, and storing the information in a memory;
A means for calculating the calculated path route information for each router and generating routing information and label information;
A quality assurance type VPN service providing apparatus comprising means for reflecting the generated routing information and label information in the fiber table. Means for generating the routing information and label information,
Means for determining whether the number of terminal ends of the router is 1 or more;
If the number of terminations is 1 or more, if the router is the starting point, record the fiber number and path number of the router, and if the router is not the starting point, record the fiber number and path number of the router before the router. Means,
Means for determining whether the number of terminations of the router is 0, and whether the path passing through the router is 1 or more after the previous step;
5. The apparatus according to claim 4, further comprising means for recording a fiber number and a path number of the router and a path number of a router in front of the router when the number of paths passing through the router is one or more. Means for reflecting the routing information and the label information,
Means for reading from a memory the number of paths passing through the fiber in the fiber table;
6. The apparatus according to claim 4, further comprising means for reducing the capacity of the fiber in the fiber table by the number of the paths when the number of paths is 1 or more.

Images