JP4444214B2 - Resource management method and apparatus - Google Patents

Description

  The present invention relates to a resource management method and apparatus for managing resources in a communication network.

  When content such as audio and video is provided using a communication network, particularly an IP (Internet Protocol) network, if congestion occurs due to a usage request exceeding the capacity of the communication path, the communication quality is reduced due to packet loss and the like. It will deteriorate. Resource management in the network layer has been studied for the purpose of preventing such degradation of communication quality. One of these types of resource management is to use a resource management device (resource management server) that is independent of the routers that make up the communication network, to manage the resource amount and usage of links between routers, and to use user terminals There is a method of paying out a resource with an appropriate capacity in response to a resource securing request. A conventional example will be described below.

  Before starting operation of a communication network, first, routing information in the communication network is collected. This routing information includes the resource amount and connection information of each link in the communication network. Next, a route through which the packet passes is calculated based on the connection information of each link, and a route information table is created based on the calculation result. Also, a link information table is created from the resource amount of each link. This link information table manages the total resource amount of each link and the available remaining resource amount.

After starting the operation of the communication network, when the resource management server accepts a resource securing request, the resource securing process is started in the order of acceptance. Specifically, the following processing is performed.
First, a link required for the communication is specified from the route information table based on the requested IP address of the communication. Then, referring to the link information table, it is checked whether or not the capacity necessary for the communication is available for each identified link.
As a result, when sufficient capacity is available for all the specified links, it is determined that the resources can be secured. Then, a permission response is made to the resource securing request, and the capacity allocated to the communication is subtracted from the remaining resource amount of the identified link in the link information table. On the other hand, when the available capacity is insufficient for any of the links, it is determined that the resource cannot be secured, and a rejection response is made to the resource securing request (for example, Patent Document 1 and Non-Patent Document 1). See).

The communication quality is guaranteed by starting the communication upon receiving a permission response to the resource securing request.
After that, at the end of communication, the resources secured up to that point are released immediately.

JP 2003-258855 A Yaguchi et al., "A Proposal and Specific Example of Resource Management Method Using Management Server in Large IP Network", IEICE General Conference, B-6-31 (2002)

  The conventional resource management server can cope with various services. For example, it is possible to deal with CDN (Contents Delivery Service), IMM (Internet Messaging Service), file transfer service, and the like. CDN is a video and audio distribution service such as VOD (Video On Demand) and multicast, and performs communication between a content distribution server and a user terminal. In IMM, users communicate with each other at two or more points using voice or moving images. The present invention can also be applied to VoIP (Voice over IP). The file transfer server performs file transfer between the server and the user terminal using a protocol such as FTP (File Transfer Protocol) or WebDAV (Web Distributed Authoring and Versioning) or a specific port. The present invention can also be applied to a service that realizes a PC environment anywhere such as a remote desktop.

  One of the differences between these services is that the resources to be secured are different in response to the resource securing request. For example, in the unicast method, resources corresponding to the amount of bandwidth are secured for each content from the content distribution server to the user terminal, whereas in the multicast method, which is a typical content distribution method of the CDN service, the content distribution server and the edge In the overlapping route with the router, only one route resource is secured for the same content.

  In addition, 5 tuple (destination IP address (including IP prefix)), destination port number, transmission source IP address (including IP prefix), transmission source port number, and protocol type) are different. Alternatively, in one resource securing request from an application server interposed between the user terminal and the resource management server, the tuple is different (for example, two resources are secured on the same route by changing the destination port number). is there). Furthermore, in response to one resource securing request from the application server, whether to secure resources in one direction or to secure resources bidirectionally differs.

  Services that can be handled by a conventional resource management server include services that need to control devices (hereinafter referred to as “NW devices”) that make up a communication network, and services that do not need to be controlled. As a service that does not need to control the NW device, for example, there is a CDN service provided by a reliable communication carrier. In the CDN service, content such as a video stream is sent to a communication network according to a predetermined rule. Specifically, a video stream packet to a user who has paid a predetermined fee is marked with a high priority and sent to the communication network. In this case, it is assumed that negotiation has been established between the resource management server and the NW device from the beginning, and the inflow of packets to the communication network is permitted. Therefore, since the resource management server does not set the NW device, resource reservation is completed in a so-called sequence.

  On the other hand, as a service that needs to control the NW device, for example, there is an IMM service. When two-way communication is performed between an unspecified number of users as in the IMM service, the traffic is given to the communication network with the user's priority being raised arbitrarily or with an incorrect priority even if not intentionally. Sometimes In this case, it is necessary to control the NW device at the entrance of the communication network or the like and to control the inflow of the user's traffic. The inflow control here includes rule-based control, transfer with different priorities based on the DSCP value, restriction at an upper limit speed, and the like. In addition to the resource reservation determination by the resource management server, the success or failure of the inflow control can be determined, so both may be processed as separate sequences. In this case, although resources (bandwidth) can be secured, it is inquired in the second-stage sequence whether or not the desired inflow control can be performed.

  As described above, services that can be handled by the resource management server include a one-stage service and a two-stage service, and the processing load on the resource management server and the time required for securing resources differ depending on the service type. It was. In addition, the processing load and the time required to secure resources differ depending on the type of provider providing different services and the type of resource management server (priority is determined using the correspondence table between application server IP and priority). was there.

  However, conventionally, the resource securing process is simply started in the order in which the resource securing requests are received regardless of the service type, the provider type, and the resource management server type. For this reason, for example, when requests for services having a large processing load are concentrated, only a small number of requests can be processed, and many other requests have to be rejected. Also, when a two-step sequence service request and a one-step sequence service request are received, resources are not provided for a one-step sequence service request that ends in a short time even if processing is started in this order. As a result, the request for the service of the two-step sequence accepted earlier may be rejected, and the fairness may be lost.

  The present invention has been made to solve such a problem, and an object of the present invention is to be able to process requests to the resource management server in an order corresponding to the nature thereof.

  In order to achieve such an object, a resource management method according to the present invention includes a step of obtaining information added to a request message when a request message requesting processing related to a resource of a communication network is received; A step of reading the priority corresponding to the acquired information from the priority storage means for storing the priority according to the information related to the information, and the processing according to the request message received in order based on the read priority And performing.

  This resource management method manages the queue of request messages to which reception numbers are assigned, and adds the read priority value to the final reception number that is the reception number of the last request message belonging to this queue. A step of determining the received value as a reception number of the received request message may be further provided, and the step of performing the processing may be performed according to the received request messages in the order of the reception number.

  Here, in the step of reading out the priority, when a plurality of pieces of information are acquired from the received request message, the step of reading out the priority for each piece of acquired information and determining the reception number is a queue for each piece of information. The sum of values obtained by adding the final reception number of each queue of information acquired and the priority corresponding to each of the information may be determined as the reception number of the received request message.

Further, the step of determining the reception number may manage the queue for each condition based on the information content, and delete the request message from the queue when processing of the request message belonging to the queue is started. .
Also, the step of determining the reception number is to change the final reception number of an empty queue to the reception number of another request message that is the basis of the reception number of an unprocessed request message belonging to another queue. Also good.

In addition, the step of determining the reception number is when the received request message is given a reception number based on the final reception number of the queue in accordance with the information acquired from the request message and exceeds the capacity of the queue The acceptance of the request message may be rejected. Alternatively, select the largest final reception number among the final reception numbers in the queue of all conditions, and determine the reception number of the received request message by adding the read priority value to this final reception number. May be.
In the latter case, the step of determining the reception number may reject the reception of the request message when the reception number assigned to the received request message exceeds the total capacity of the queue.

Further, the step of reading out the priority reads out the priority from the priority storage means for each piece of acquired information when a plurality of pieces of information are acquired from the received request message, and sets a new priority from the read out priority. You may make it calculate.
In this case, the processing step may be performed in the order based on the new priority. Further, referring to the DSCP value storage means for storing the DSCP value corresponding to the priority, a step of determining the DSCP value corresponding to the new priority, and a step of setting the determined DSCP value in the nodes constituting the communication network May be provided.

  Further, the resource management device according to the present invention is added to the request message when the request message is received, and the priority storage means for storing the priority according to the information related to the request message for requesting the processing related to the communication network resource. Information acquisition means for acquiring information, priority read means for reading out the priority corresponding to the acquired information from the priority storage means, and processing according to the request message in order based on the read priority And processing means for performing the processing.

  This resource management device manages the queue of request messages to which reception numbers are assigned, and adds the read priority value to the final reception number that is the reception number of the last request message belonging to this queue. A reception number determination unit that determines the received value as the reception number of the received request message may be further provided, and the processing unit may perform processing according to the request messages received in the order of the reception number.

  In addition, when a plurality of pieces of information are acquired from the received request message, the priority reading unit reads the priority for each acquired information, and the reception number determining unit manages and acquires the queue for each information. The sum of values obtained by adding the final reception number of each queue of the received information and the priority corresponding to each of the information may be determined as the reception number of the received request message.

The reception number determination unit may manage the queue for each condition based on the content of the information, and delete the request message from the queue when processing of the request message belonging to the queue is started.
In addition, the reception number determination unit may change the final reception number of the empty queue to the reception number of another request message that is the basis of the reception number of an unprocessed request message belonging to another queue. .

In addition, the resource management device described above further includes individual capacity storage means for storing the capacity of each queue for each condition based on the content of information, and the reception number determination means uses the request message as the received request message. If a reception number based on the last reception number of a queue in a condition corresponding to the acquired information is given, the reception of the request message may be rejected when the capacity of the queue is exceeded. Alternatively, select the largest final reception number among the final reception numbers in the queue of all conditions, and determine the reception number of the received request message by adding the read priority value to this final reception number. May be.
In the latter case, the resource management device described above further includes an overall capacity storage unit that stores the total capacity of the queue, and the reception number determination unit assigns the reception number to the received request message. The request message may be rejected when the total capacity is exceeded.

In addition, when a plurality of pieces of information are acquired from the received request message, the priority reading unit reads the priority from the priority storage unit for each acquired information, and calculates a new priority from the read priority. Priority determining means may be provided.
In this case, the processing means may perform processing in order based on the new priority. Further, the DSCP value storage means for storing the DSCP value corresponding to the priority, the DSCP determination means for obtaining the DSCP value corresponding to the new priority by referring to the DSCP value storage means, and the obtained DSCP value for the communication network DSCP value notifying means for notifying the nodes constituting the system may be provided.

  In the present invention, the priority according to the information related to the request message is determined in advance, the information added to the received request message is acquired, and the processing according to the request message is performed in the order based on the priority corresponding to this information I do. As a result, the received request messages can be processed in the order according to their properties. For example, request rejection due to exceeding the processing capability of the resource management device can be reduced by adjusting the priority so that processing of request messages with a large processing load is distributed. Further, by adjusting the priority so that request messages having a long processing time are processed preferentially, unfairness between request messages due to the length of the processing time can be corrected. On the contrary, the request messages can be differentiated by adjusting the priority.

  In the present invention, the queue of request messages to which a reception number is assigned is managed, and the value obtained by adding the priority value to the final reception number of this queue is used as the reception number of the received request message. The process according to the request message is performed in the order of. In this case, the request message to which information having a high priority value is added has a large reception number, and the start of processing is delayed. On the other hand, a request message to which information having a low priority value is added has a smaller reception number, and the processing starts earlier. For example, the processing of this type of request message can be distributed by increasing the priority value of the information added to the request message with a large processing load. Also, by reducing the priority value of information added to a request message having a long processing time, this type of request message can be preferentially processed.

  In the present invention, when a plurality of pieces of information are acquired from the received request message, the total of the reception numbers obtained from the respective information is set as the reception number of the received request message. This makes it possible to determine the reception number based on a plurality of information.

  In the present invention, the queue is managed for each condition based on the content of information acquired from the request message, and the final reception number of the empty queue is changed to the reception number of the unprocessed request message belonging to another queue. Change to the receipt number of the other request message that became the basis of. This can prevent a request message that already belongs to another queue from being treated more disadvantageously than a request message that will be received later and belong to the empty queue.

Further, in the present invention, when a reception number based on the final reception number of the queue according to the information according to the information acquired from the request message is given to the received request message, when the capacity of the queue is exceeded, Reject the reception. Thereby, when request messages having specific contents are concentrated, new acceptance of the request messages is rejected, and processing of other request messages can be prevented from being delayed.
Alternatively, the reception number of the received request message is a value obtained by adding the priority value to the largest final reception number among the final reception numbers of the queues of all conditions without rejecting the reception of the request message. . As a result, it is possible to prevent the processing of request messages belonging to queues of other conditions from being delayed while effectively utilizing the free capacity of the queues of other conditions.

  Further, according to the present invention, if a reception number is given to the received request message, the reception of the received request message is rejected when the total queue capacity is exceeded. Thereby, even if a large number of request messages arrive, congestion can be prevented.

Hereinafter, embodiments of the present invention will be described in detail with reference to the drawings.
1. First Embodiment FIG. 1 is a block diagram showing an overall configuration of a system to which a resource management server according to a first embodiment of the present invention is applied.
A resource management server 1 shown in FIG. 1 is a resource management device that manages resources of the communication network 2. The resource management server 1 can cope with various services such as CDN, IMM, and file transfer service.

  The communication network 2 to be managed is a communication network based on the Internet protocol (IP), and includes a plurality of nodes such as routers R (R1 to R7), exchanges (not shown), LAN switches (not shown), It consists of links that connect nodes. The resource of the communication network 2 refers to a capacity paid out for a predetermined time by billing on a link constituting a route between two terminals performing communication. Capacity can be paid out continuously.

  The application server 3 is a server that receives various requests from the terminal T (for example, the terminal T1) and transmits a message corresponding to the request to the resource management server 1. The request message includes a resource securing request message for requesting to secure a resource having a capacity necessary for communication between the terminal T and another terminal, a resource change request message for requesting a capacity change for the secured resource, and securing. There is a resource release request message for requesting release of the assigned resource.

  Each request message includes a service type such as user ID, application ID, CDN, IMM, and file transfer service, a type of request for the request message (request type), and flow identification information (IP address and port number of the calling terminal). Protocol type), a DSCP value (Differentiated Services Code Point) that defines the priority of packets sent between communicating terminals, and an identifier of the VLAN when any communicating terminal belongs to a VLAN (Virtual LAN) Information such as (VLANID) is added.

1-1. Configuration of Resource Management Server 1 Next, the configuration of the resource management server 1 will be described.
The resource management server 1 is composed of a computer having a communication function. Various functions of the resource management server 1 described below include computer hardware resources such as an arithmetic unit (MPU) and a storage device (including an internal memory such as a ROM and a RAM and an external storage device such as an HDD). This is realized by cooperation with a computer program (software) installed in the computer.

FIG. 2 is a functional block diagram of the resource management server 1.
The resource management server 1 includes a transmission / reception unit 11, a control unit 12, and a database unit 13.
Here, the transmission / reception unit 11 includes a communication interface, and transmits and receives various messages to and from the application server 3.

The control unit 12 performs processing related to the resources of the communication network 2 according to the request message received by the transmission / reception unit 11. Specifically, the request receiving unit 121, the resource processing unit 122, and the response processing unit 123 are included.
The request reception unit (information acquisition unit, priority reading unit, reception number determination unit) 121 acquires necessary information from the request message received by the transmission / reception unit 11, and sets a reception number for the request message based on the acquired information. Give. The request message reception number is determined by various conditions relating to the message. This condition is called a policy. The policy is set for each information added to the request message described above, for example. That is, the user ID, application ID, service type, request type, flow identification information, DSCP value, VLAN ID, etc. are set.
The resource processing unit 122 performs processing according to the request message in order from the one with the smallest reception number.
The response processing unit 123 creates a message to permit or reject the request related to the request message, and outputs the message to the transmission / reception unit 11.

  The database unit 13 stores various types of information necessary for processing by the control unit 12 described above. Specifically, a policy table and a receipt number table are stored in addition to the conventionally used route information table and link information table.

  The policy table is a table indicating the contents of the policy, and is provided, for example, for each information added to the request message described above. For example, the policy table 131 shown in FIG. 3 is a policy relating to service types such as CDN, IMM, and file transfer service, and includes “service type”, “priority”, “final receipt number”, “limit amount”, and “accumulated amount”. It consists of the item.

The “priority” is a priority set for each service. The lower the value, the higher the priority.
The “final reception number” is a final reception number of a queue (queue) of request messages for requesting each service. In principle, this is the receipt number of the last request message belonging to each queue. For example, when two request messages belong to the queue, the reception number of the second request message is the final reception number.
The “limit amount” is an individual capacity of a queue of request messages for requesting each service, and represents the number of request messages that can be accumulated in the queue.
The “accumulated amount” represents the number of request messages accumulated in the queue at that time.
If information such as the priority and the limit amount of the policy table 131 is recorded in the external storage device, these information can be read when the resource management server 1 is started or changed during reading after the start. You can also

The reception number table is a table indicating the reception number of the request message. For example, as shown in the reception number table 132 shown in FIG. 4, it includes items “request ID” and “reception number”.
The “request ID” is an identifier individually assigned to the request message.
The “reception number” is a reception number given to the request message represented by the request ID. When multiple information is extracted from the request message and multiple reception numbers are obtained according to the policy set for each information, the total of all the reception numbers is used as the reception number of the request message. Assigned and written in this field.

  The database unit 13 that stores the priority and the individual capacity (limit amount) of the queue functions as a priority storage unit and an individual capacity storage unit.

1-2. Next, with reference to FIG. 5 and FIG. 6, an algorithm for giving a reception number by the request receiving unit 121 will be described. Here, a policy relating to a service type will be described as an example. 5 and 6 are diagrams conceptually showing a queue of resource securing request messages for obtaining services A to D (hereinafter abbreviated as “queues for services A to D”).

First, a basic algorithm for assigning a receipt number will be described with reference to FIG.
When the request message 1 of the service type “A” is received, the request reception unit 121 distributes the request message 1 to the service A queue. At this time, since the queue of service A is empty, the final reception number of this queue is “0”. A value “50” obtained by adding the priority “50” of the service A to the final reception number “0” is set as the reception number of the request message 1.
Thereafter, when the request message 2 of the service type “B” and the request message 3 of the service type “C” are subsequently received, the reception numbers are similarly set to “30” and “10”.

  Thereafter, when the request message 4 of the service type “A” is received, the request reception unit 121 distributes the request message 4 to the service A queue again. At this time, the first request message 1 is accumulated in the queue of service A, and the reception number “50” of the request message 1 is the final reception number of the queue. Accordingly, the value “100” obtained by adding the priority “50” of the service A to the final reception number “50” of the queue is set as the reception number of the request message 4.

As a result, the “final reception number” in the policy table 131 and the “reception number” in the reception number table 132 are as shown in FIGS. 3 and 4, respectively.
Since the resource processing unit 122 performs processing in order from the message with the smallest reception number, the resource securing processing is performed in the order of request message 3 → request message 2 → request message 1 → request message 4.

Next, the change of the final reception number of the queue will be described with reference to FIG.
As described with reference to FIG. 5, after the acceptance numbers are assigned to the request messages 1 to 4, when the processing for the request messages 3, 2, and 1 is started, these request messages 1 to 3 Removed from the queue. As a result, all of the request messages 1 to 3 for which the reception numbers are determined based on the final reception number “0” are deleted. If the final reception number of the queues for services B to D is left as “0” and the determination of the reception number based on this final reception number is continued, the request message 4 whose reception number has already been determined is disadvantageous. May be treated.

  Therefore, in the present embodiment, when all the request messages 1 to 3 whose reception numbers are determined based on the final reception number “0” are deleted from the queue, as shown in FIG. The final reception number of the queue is changed to the reception number “50” of the request message 1 that is the reference for the reception number of the unprocessed request message 4.

When the request message 5 of the service type “D” is received as shown in FIG. 6 after the final reception number is changed, the request reception unit 121 places the request message 5 in the queue of the service D. The value “60” obtained by adding the priority “10” of the service D to the final reception number “50” of this queue is set as the reception number of the request message 5.
In this case, since the request message 5 has a smaller reception number than the request message 4, the resource securing process is performed before the request message 5.
When all the request messages are processed and all the queues become empty, the final reception numbers of all the queues are returned to “0”.

1-3. Operation of Resource Management Server 1 Next, the operation of the resource management server 1 will be described focusing on the operation of assigning a receipt number based on the above-described algorithm.

First, an overall processing flow in the resource management server 1 will be described with reference to FIG.
When the transmission / reception unit 11 receives the resource reservation request message (step S1, YES), the request reception unit 121 acquires information in which the reception number determination policy is set from the received resource reservation request message (step S2). . Here, it is assumed that n pieces of information (n is an integer of 1 or more) such as a service type have been acquired.
The request reception unit 121 that has acquired n pieces of information calculates information reception numbers No _i (i = 1, 2,..., n) for each piece of information according to the algorithm described above (steps S3 to S7). The detailed processing flow for calculating the individual information reception number No _i will be described later.

When the information reception number No _i can be calculated for all the n pieces of information, the request reception unit 121 obtains the sum (ΣNo _i ) of the n information reception numbers No _i and secures the resource using the value as the request reception number. It is given to the request message (step S8). Further, a request ID is given to the resource securing request message, and the request reception number is written in the reception number table 132 shown in FIG. 4 together with this request ID.
The resource processing unit 122 refers to the reception number table 132, and starts resource reservation processing in order from the resource reservation request message corresponding to the request ID having a small request reception number (step S9). Since the resource securing process is the same as the conventional process, the description thereof is omitted.

In the process of calculating the individual information reception number No _i , if it is determined that the resource securing request cannot be accepted as described later (step S5, YES), the response processing unit 123 rejects the resource securing request. A response message to that effect is created, and this response message is sent back from the transmission / reception unit 11 to the source of the resource securing request message (step S10).
As described above, a series of processes from receiving the resource securing request message to assigning an acceptance number to the message and securing the resource is completed.

Next, the processing for calculating the information reception number No _i for each piece of information for which a policy is set will be described with reference to FIG.
In step S2 of FIG. 7, for example, when information on the service type “A” is acquired from the received resource securing request message, the request reception unit 121 refers to the policy table 131 shown in FIG. It is checked whether or not there is a vacancy (step S21). When the accumulation amount of the queue of service A has not reached the limit amount, it can be determined that there is an empty space in this queue, and when the accumulation amount has reached the limit amount, it can be determined that there is no empty space.

If there is a vacancy in the service A queue (step S21, YES), the request reception unit 121 accumulates the received resource securing request message in the service A queue. Specifically, 1 may be added to the accumulated amount of the queue of service A in the policy table 131. Further, the priority “50” of the service A and the final reception number “100” of the queue of the service A are read from the policy table 131, and a value “150” obtained by adding both is set as the information reception number No _i for the service type ( Step S22). At this time, the final reception number of the queue of service A in the policy table 131 is rewritten from “100” to “150”.

On the other hand, when there is no space in the service A queue (step S21, NO), the request reception unit 121 determines that the resource reservation request message for service A cannot be received (step S23). In this case, a response to reject the resource securing request is made (step S10 in FIG. 7). By performing such processing, even when requests for the service A are concentrated, a part thereof is rejected, the processing capacity of the resource securing server 1 is distributed to the processing of the other services BD, and the services BD Processing can be prevented from being delayed.
This completes the process of calculating the information reception number No _i for the service type.
The calculation process of the information reception number No _i for other information is performed in the same manner.

  As described above, the priority according to the information related to the request message is determined in advance, the reception number is assigned based on the priority corresponding to the information added to the received request message, and the request messages in the order of the reception numbers. It is possible to process the received request messages in the order corresponding to the nature thereof. For example, request rejection due to exceeding the processing capability of the resource management server can be reduced by adjusting the priority so that processing of request messages with a large processing load is distributed. Further, by adjusting the priority so that request messages having a long processing time are processed preferentially, unfairness between request messages due to the length of the processing time can be corrected. On the contrary, the request messages can be differentiated by adjusting the priority.

As described above, in the present embodiment, a value obtained by adding the priority value to the final reception number of the queue in accordance with the information acquired from the received request message is set as the reception number of the request message. In this case, the request message to which information having a high priority value is added has a large reception number, and the start of processing is delayed. On the other hand, a request message to which information having a low priority value is added has a smaller reception number, and the processing starts earlier. For example, the processing of this type of request message can be distributed by increasing the priority value of the information added to the request message with a large processing load. Also, by reducing the priority value of information added to a request message having a long processing time, this type of request message can be preferentially processed.
Further, when a plurality of pieces of information are acquired from the received request message, the total of information reception numbers obtained from the respective information is added to the request message as a request reception number. This makes it possible to determine the reception number based on a plurality of information.

In this embodiment, each queue is ranked. Therefore, request messages having the same reception number are processed first from request messages belonging to a queue having a higher rank. For example, if the queues of the services A, B, C, and D are 1, 2, 3, and 4, respectively, the processing is performed in order from the request message that belongs to the queue of the service A.
In the present embodiment, the priorities of the services C and D are set to the same value, but the priorities of all policies can be set to the same value.
Also, the priority of the policy can be set to “0”. As soon as the request message satisfying this policy is received by the transmission / reception unit 11 of the resource management server 1, the processing is started immediately. Therefore, this policy queue is treated as a priority queue.

2. Second Embodiment FIG. 9 is a functional block diagram of a resource management server according to a second embodiment of the present invention. In this figure, the same components as those shown in FIG. 2 are denoted by the same reference numerals as those in FIG.
In the resource management server 1A shown in this figure, the request receiving unit 121A of the control unit 12A has a function different from that of the request receiving unit 121 in the first embodiment. Further, the policy table 131A stored in the database unit 13A is partly different from the policy table 131 in the first embodiment.

The function of the request receiving unit 121A will be described with reference to FIG. Here, as in the first embodiment, a policy relating to a service type will be described as an example. FIG. 10 is a diagram conceptually illustrating the queues of services A to D.
When the accumulated amount of request messages in the queue of service A reaches the limit amount of the queue, processing of the accumulated request message 1 is started, and a new request message 9 is added to the queue unless the request message 1 is deleted from the queue. Cannot be accumulated.
In this case, in the present embodiment, the request message 9 is accumulated using the free capacity of the queues of the other services BD.

However, it is not preferable that the reception number of the request message 9 is smaller than the reception number of the request message belonging to another queue, the request message 9 is processed with priority, and the processing of the request message belonging to another queue is delayed. .
Therefore, in the present embodiment, the largest final reception number “120” is selected from the final reception numbers of the queues of all services A to D, and the priority “50” of service A is assigned to this final reception number “120”. "170" is added to the request message 9 as the receipt number. This makes it possible to effectively use the free capacity of other queues without disturbing the processing of request messages belonging to other queues.

In order to realize this processing, the policy table 131A includes a column of final reception numbers of the entire queues of services A to D as shown in FIG. The final reception number of the entire queue is the same value as the largest of the final reception numbers of the queues of services A to D.
The policy table 131A further includes columns of “limit amount” and “accumulated amount” for the entire queue. The “limit amount” of the entire queue is the total capacity of all the queues (the total of the individual capacities of each queue), and represents the number of request messages that can be accumulated in all the queues. The “accumulated amount” of the entire queue represents the number of request messages accumulated in all the queues at that time.
Note that the database unit 13A that stores the total capacity of all the queues functions as an overall capacity storage unit.

Next, the operation of the reception processing unit 121A that has reached the queue limit will be described with reference to FIG. In this figure, the same components as those shown in FIG. 8 are denoted by the same reference numerals as those in FIG. Hereinafter, similarly to the description of the first embodiment, a process for calculating the individual reception number No _i of the resource securing request message for requesting the service A will be described.
The processing when the queue for service A is empty is the same as in the first embodiment (steps S21 and S22).

  If there is no vacancy in the service A queue (step S21, NO), the request reception unit 121 refers to the policy table 131A again to check whether there is an vacancy in the entire service A to D queue (see FIG. Step S24). When the accumulation amount of the entire queue of services A to D has not reached the limit amount, it is determined that the entire queue is empty, and when the accumulation amount has reached the limit amount, the entire queue is also empty. It can be judged that there is no.

If there is a vacancy in the entire queue of services A to D (step S24, YES), the request reception unit 121 adds 1 to the accumulated amount of the entire queue of services A to D in the policy table 131A. Further, the priority “50” of the service A and the final reception number “120” of the entire queue of the services A to D are read from the policy table 131A, and a value “170” obtained by adding both is read as the information reception number No. for the service type. _i (step S25). At this time, the final reception number of the queue of service A in the policy table 131A is rewritten from “100” to “170”. In conjunction with this rewriting, the final reception number of the entire queue is also rewritten.

On the other hand, if there is no vacancy in the entire queue of services A to D (step S24, NO), it is determined that the resource securing request cannot be accepted (step S26). In this case, a response to reject the resource securing request is made (step S10 in FIG. 7). Thereby, even if a large amount of resource securing request messages that exceed the processing capability of the resource management server 1A arrive, congestion can be prevented.
Thus, the calculation process of the information reception number No _i ends.
If there is no space in the queue of the predetermined policy such as service A, the reception number is assigned using the free space of other queues as in this embodiment, or the queue of the first embodiment is used. In this way, it may be possible to select whether to reject acceptance of the resource securing request message.

3. Third Embodiment Next, a third embodiment of the present invention will be described. The resource management server according to the present embodiment determines a new priority from a plurality of priorities when a plurality of pieces of information are added to the request message and priorities are set for each of the information. The processing according to the request message is performed in the order based on the priority.
FIG. 13 is a functional block diagram of the resource management server according to the present embodiment. In this figure, the same components as those shown in FIG. 2 are denoted by the same reference numerals as those in FIG.

  In addition to the policy table 131 and the reception number table 132 described above, the database unit 13B stores a priority correspondence table indicating priorities (including calculation methods) according to information added to the request message. 14 and 15 show examples of priority correspondence tables. Priorities corresponding to flows are set in the priority correspondence table 133A shown in FIG. A flow is distinguished by identification information called 5tuple that includes an IP address of a calling terminal, a calling port number, a protocol type, and the like. In the priority correspondence table 133B shown in FIG. 15A, priorities corresponding to IP residences are set. In the priority correspondence table 133C shown in FIG. 15B, the priority corresponding to the application server IP or its calculation method is set. In the priority correspondence table 133D shown in FIG. 15C, the priority corresponding to the DSCP value is set.

In the priority correspondence tables 133B and 133C, “any” means “other cases” and “n” means “request rejection”. For example, when the IP residence is “111”, the request related to the request message is rejected.
Further, if the condition that the priority is “0” is met, the process is performed with the highest priority.

  The request reception unit 121B in the control unit 12 includes a priority determination unit 124. The priority determination unit 124 refers to the priority correspondence table stored in the database unit 13B, and when there is a condition that matches the information added to the request message, determines a new priority according to the condition. To do. This will be specifically described below.

  Here, in addition to the policy table 131 shown in FIG. 3, the database unit 13B includes a priority correspondence table 133D shown in FIG. 15C and a priority correspondence table 133C shown in FIG. 15B. Assume that the table 133D is preferentially applied to the table 133C. Further, it is assumed that the DSCP value “001000” and the application server IP “192.168.100.1” are added to the request message 4 of the service type “A” described in the first embodiment. In this case, referring to the policy table 131, the priority of the service type “A” is “50”, and referring to the priority correspondence table 133D, the priority of the DSCP value “001000” is “−10”, and the priority correspondence table 133C. , Since the priority calculation method of the application server IP “192.168.100.1” is “* 0.8”, these coefficients are calculated in order (50−10) × 0.8 = A new priority of 32 is obtained.

In the first embodiment, the reception number of the request message 4 is “100” obtained by adding the priority “50” to the final reception number “50” of the queue of the service A, whereas in this embodiment, The value is “82” obtained by adding the new priority “32” to the final reception number “50”.
Since the resource processing unit 122 performs processing according to the request message in order from the smallest reception number, the resource processing unit 122 can perform processing in an order that includes not only the service type but also other information added to the request message. .

4). Fourth Embodiment Next, a fourth embodiment of the present invention will be described. As described in the third embodiment, the resource management server according to the present embodiment determines the priority according to the information related to the request message, and then obtains the DSCP value corresponding to this priority.
FIG. 16 is a functional block diagram of the resource management server according to the present embodiment. In this figure, the same components as those shown in FIG. 2 or FIG. 13 are denoted by the same reference numerals as those in FIG. 2 or FIG.

The database unit 13C stores a DSCP conversion table indicating the correspondence between the priority and the DSCP value in addition to the policy table 131, the reception number table 132, and the priority correspondence table 133 described above. FIG. 17 shows an example of the DSCP conversion table. Therefore, the database unit 13C functions as a DSCP value storage unit.
The DSCP determination unit 125 of the control unit 12C refers to the DSCP conversion table 134 stored in the database unit 13C to obtain a DSCP value corresponding to the new priority determined by the priority determination unit 124, and this DSCP value Is registered in the resource management table of the database unit 13C. In this embodiment, processing is performed in the order of reception without using priority in assigning reception numbers.

  When the response processing unit 123C receives the resource reservation request message and succeeds in resource reservation, the response processing unit 123C includes the DSCP notification including the flow identification information extracted from the resource reservation request message and the DSCP value obtained by the DSCP determination unit 125. A message is created and transmitted to the ingress node of the communication network 2. When communicating from the calling terminal to the called terminal, it transmits to the edge node that accommodates the calling terminal as the entry node. Therefore, the response processing unit 123C functions as a DSCP value notification unit.

  The edge router that has received the DSCP notification message from the resource management server 1C extracts information added to the DSCP notification message, and sets an access list table in which the flow identification information and the DSCP value are associated with each other in the memory of the communication interface. .

  After that, when a packet is transmitted from the calling terminal to the called terminal, the edge router that has received the packet extracts the flow identification information and the DSCP value from the IP header of the packet, and compares the extracted flow identification information with the access list table. To do. If there is matching flow identification information in the access list table, the DSCP value corresponding to the flow identification information is compared with the extracted DSCP value. If the two DSCP values are the same, the packet is transmitted to the next-hop router with priority control according to the DSCP value. For example, a packet corresponding to a DSCP value is allocated and transmitted. On the other hand, if the two DSCP values are different, the DSCP value of the access list table is overwritten in the ToS field of the IP header of the packet, and the packet is sent to the next hop router by priority control according to this DSCP value. Send.

As described above, in the present embodiment, in the resource management server 1C, the DSCP value corresponding to the priority determined according to the information related to the request message is obtained, and this DSCP value is set in the entry node of the communication network 2. be able to. Thereby, the packet can be transferred with the behavior defined by the DSCP value obtained by the resource management server 1C.
In addition, when performing two-way communication between two or more terminals, the response processing unit 123C of the resource management server 1C sends a DSCP notification message to an edge node that accommodates each terminal as an entry node of the communication network 2. Shall be sent. Not only these, but a DSCP notification message is sent to any node (home gateway HGW, switches such as policy switch (switch for setting policy) PSW, edge router, gateway router) on the route where resources are secured Also good.

5). Fifth Embodiment A resource management system according to a fifth embodiment of the present invention manages a communication network by using a plurality of resource management servers.
FIG. 18 is a block diagram showing the overall configuration of the resource management system according to the present embodiment.
This resource management system has a plurality of resource management servers 201A, 201B, 201C. The resource management servers 201A, 201B, and 201C manage the resources of the communication networks 202A, 202B, and 202C that are connected to each other. Each of the communication networks 202A, 202B, and 202C is an autonomous system AS or a subsystem SubAS thereof.

  The resource management servers 201A, 201B, and 201C have a function of exchanging various messages between adjacent resource management servers in order to manage resources on a route across a plurality of communication networks. For example, in the case of securing a resource on a route extending over the communication networks 202A and 202B, the resource management server 201A that manages the communication network 202A manages the communication network 202B after completing the resource securing process within its management range. A resource securing request message is transmitted to the resource management server 201B.

  In addition to the information exemplified in the first embodiment, various request messages including a resource securing request message include a resource request source server IP, a resource request destination server IP, a MAC address, a resource request source server ID, Information such as the resource request destination server ID, the resource management server ID, the resource management server IP, the number of HOPs (number of linkages) of the resource management server, and the AS number or SubAS number of OSPF (Open Shortest Path First) is further added.

Here, the resource request source server IP is the IP address of the resource management server that manages the communication network to which the calling terminal belongs. For example, when the calling terminal belongs to the communication network 202A, the IP address of the resource management server 201A becomes the resource request source server IP.
The resource request destination server IP is an IP address of a resource management server that manages the communication network to which the called terminal belongs. For example, when the destination terminal belongs to the communication network 202C, the IP address of the resource management server 201C becomes the resource request destination server IP.

  The MAC address is the MAC address of the server that transmits the request message. For example, when securing resources of a series of routes managed by the resource management servers 201A, 201B, and 201C, a resource securing request transmitted from the resource management server 201B to 201C after the resource securing processing by the resource management servers 201A and 201B is completed The MAC address of the resource management server 201B is added to the message.

  The resource request source server ID is an identifier of a resource management server that manages the communication network to which the calling terminal belongs. The resource request destination server ID is an identifier of a resource management server that manages the communication network to which the called terminal belongs.

  The resource management server ID is an identifier of the resource management server that transmits the request message. The resource management server IP is an IP address of a resource management server that transmits a request message. For example, when securing resources of a series of routes managed by the resource management servers 201A, 201B, and 201C, a resource securing request transmitted from the resource management server 201B to 201C after the resource securing processing by the resource management servers 201A and 201B is completed In the message, the identifier or IP address of the resource management server 201B becomes the resource management server ID or the resource management server IP, respectively.

  The AS number or the SubAS number is a number of a communication network managed by a server that transmits a request message. For example, when securing resources of a series of routes managed by the resource management servers 201A, 201B, and 201C, a resource securing request transmitted from the resource management server 201B to 201C after the resource securing processing by the resource management servers 201A and 201B is completed The number of the communication network 202B is added to the message.

  Note that code numbers corresponding to all the information added to the request message can be added to the request message. For example, when a request message is transmitted for the first time, all information and a code number may be added, and thereafter only the code number may be added. In this case, it is not necessary to add all information every time.

  The resource management servers 201A, 201B, and 201C determine the reception numbers according to various policies related to the request message, and request them in the order of the reception numbers, as with the resource management servers 1 and 1A according to the first or second embodiment. It has a function to perform processing according to the message. The policy is set for each information added to the request message described above, for example. That is, in addition to the user ID, application ID, service type, request type, flow identification information, DSCP value, VLAN ID, resource request source server IP, resource request destination server IP, MAC address, resource request source server ID, resource request destination server ID, resource management server ID, resource management server IP, AS number or SubAS number are set.

  By setting the policy in this way, preferential processing can be performed according to the transmission source or transmission destination of the request message. For example, it is possible to preferentially process a request message transmitted from a resource management server that requests quick processing, and to shorten the processing time.

  In the present invention, the priority can be determined for the flow label field of the IPv6 header in the request message. Further, the priority can be determined by identifying an arbitrary byte position of the request message. For example, the priority can be determined by identifying from the mByte to the nByte of the IP header. Furthermore, all combinations of the source terminal IP address (including IP prefix), destination terminal IP address (including IP prefix), source port number, destination port number, and protocol number in the flow identification information added to the request message Can be prioritized. All of the information on which the above priorities are determined is information regarding the request message.

  The present invention can be used, for example, in the field of providing high-quality communication services.

It is a block diagram which shows the whole structure of the system by which the resource management server concerning the 1st Embodiment of this invention is applied. It is a functional block diagram of the resource management server concerning the 1st Embodiment of the present invention. It is a figure which shows an example of the data structure of a policy table. It is a figure which shows an example of the data structure of a receipt number table. It is a figure explaining the basic algorithm of reception number assignment. It is a figure explaining change of the last reception number of a queue. It is a flowchart which shows the flow of the whole process by a resource management server. It is a flowchart which shows the flow of a process of information reception number calculation. It is a functional block diagram of the resource management server concerning the 2nd Embodiment of this invention. It is a figure explaining the flow of a process when the accumulation | storage amount of the request message in a queue reaches the limit amount of the queue. It is a figure which shows the other example of the data structure of a policy table. It is a flowchart which shows the flow of a process of information reception number calculation. It is a functional block diagram of the resource management server concerning the 3rd Embodiment of this invention. It is a figure which shows an example of the data structure of a priority correspondence table. It is a figure which shows the other example of the data structure of a priority correspondence table. It is a functional block diagram of the resource management server concerning the 4th Embodiment of this invention. It is a figure which shows an example of the data structure of a DSCP conversion table. It is a block diagram which shows the whole structure of the resource management system concerning the 5th Embodiment of this invention.

Explanation of symbols

  DESCRIPTION OF SYMBOLS 1,1A-1C, 201A-201C ... Resource management server, 2,202A-202C ... Communication network, 3 ... Application server, 11 ... Transmission / reception part, 12, 12A-12C ... Control part, 13, 13A-13C ... Database part 121, 121A, 121B ... request accepting unit, 122 ... resource processing unit, 123, 123C ... response processing unit, 124 ... priority determining unit, 125 ... DSCP determining unit, 131, 131A ... policy table, 132 ... acceptance number table 133A to 113D ... priority correspondence table, 134 ... DSCP conversion table, R1 to R7 ... router, T1 to T6 ... terminal.

Claims (20)

Obtaining additional information including a service type added to the request message when a request message requesting processing related to a resource of a communication network is received;
Reading the priority corresponding to the acquired additional information from the priority storage means for storing the priority according to the additional information regarding the request message;
Manages the queue of request messages to which a reception number is assigned, and adds a value obtained by adding the read priority value to the final reception number that is the reception number of the last request message belonging to this queue, Determining the receipt number of the received request message;
Performing a process according to the received request message in the order of the receipt number;
A resource management method comprising: The resource management method according to claim 1,
Step of reading the priority, when the additional information from the received request message is a plurality acquired reads the priority for each acquired the additional information,
Determining the reception number manages the queues for each of the additional information, and said priority corresponding to each of the final acceptance number and the additional information for each queue of the acquired additional information A resource management method comprising: determining a sum of the added values as a reception number of the received request message. The resource management method according to claim 1,
The step of determining the receipt number manages the queue for each condition based on the content of the additional information, and when processing of the request message belonging to the queue is started, the request message is removed from the queue. A resource management method characterized by deleting. The resource management method according to claim 3,
The step of determining the reception number is to change the final reception number of an empty queue to the reception number of another request message that is the basis of the reception number of an unprocessed request message belonging to another queue. A featured resource management method. The resource management method according to claim 2 or 3,
The step of determining the reception number is when the received request message is given a reception number based on a final reception number of a queue according to information obtained from the request message and exceeds the capacity of the queue And rejecting acceptance of the request message. The resource management method according to claim 2 or 3,
The step of determining the reception number exceeds the capacity of the queue if a reception number based on a final reception number of a queue in a condition corresponding to additional information acquired from the request message is given to the received request message. When selecting the largest final reception number among the final reception numbers of the queue of all conditions, the value obtained by adding the read priority value to the final reception number is the reception number of the received request message. A resource management method characterized by: The resource management method according to claim 6, wherein
The step of determining the reception number rejects the reception of the request message when the reception number is given to the received request message and the total capacity of the queue is exceeded. Obtaining additional information including flow information added to the request message when a request message requesting processing related to a resource of a communication network is received;
When a plurality of pieces of additional information are acquired from the received request message, the priority is read from the priority storage unit for each acquired additional information, and a new priority is calculated from the read priority. Steps,
A resource management method comprising: performing processing according to the received request message in order based on the read priority. The resource management method according to claim 8, wherein
The resource management method, wherein the step of performing the process performs the process in an order based on the new priority. The resource management method according to claim 8, wherein
Referring to a DSCP value storage means for storing a DSCP value corresponding to a priority, and obtaining a DSCP value corresponding to the new priority;
The resource management method further comprising: setting the determined DSCP value in a node constituting the communication network. Priority storage means for storing a priority according to additional information including a service type added to a request message for requesting processing related to a resource of a communication network;
Information acquisition means for acquiring the additional information added to the request message when the request message is received;
Priority reading means for reading out the priority corresponding to the acquired additional information from the priority storage means;
Manages the queue of request messages to which a reception number is assigned, and adds a value obtained by adding the read priority value to the final reception number that is the reception number of the last request message belonging to this queue, A reception number determination means for determining the reception number of the received request message;
Processing means for performing processing according to the received request message in the order of the reception number;
A resource management apparatus comprising: The resource management device according to claim 11, wherein
The priority reading means, when the additional information from the received request message is a plurality acquired reads the priority for each acquired the additional information,
The receipt number determining unit manages the queues for each of the additional information, and adding the said priority corresponding to each of the final acceptance number and the additional information for each queue of the acquired additional information A resource management device, wherein a sum of values is determined as an acceptance number of the received request message. The resource management device according to claim 11, wherein
The reception number determination unit manages the queue for each condition based on the content of the additional information, and deletes the request message from the queue when processing of the request message belonging to the queue is started. A resource management device. The resource management device according to claim 13, wherein
The reception number determining means changes the final reception number of an empty queue to the reception number of another request message that is the basis of the reception number of an unprocessed request message belonging to another queue. Resource management device. The resource management device according to claim 13 or 14,
Further comprising individual capacity storage means for storing each capacity of the queue for each condition based on the content of the information,
When the receipt number determining means gives the receipt number based on the last receipt number of the queue according to the additional information acquired from the request message to the received request message, the capacity of the queue is exceeded. And rejecting acceptance of the request message. The resource management device according to claim 13 or 14,
Further comprising individual capacity storage means for storing each capacity of the queue for each condition based on the content of the information,
When the receipt number determining means gives the receipt number based on the last receipt number of the queue according to the additional information acquired from the request message to the received request message, the capacity of the queue is exceeded. , Selecting the largest final reception number among the final reception numbers in the queue of all conditions, and determining the reception number of the received request message by adding the read priority value to the final reception number A resource management device characterized by: The resource management device according to claim 16, wherein
A total capacity storage means for storing the total capacity of the queue;
The resource management device according to claim 1, wherein the reception number determination unit rejects reception of the request message when a reception number is given to the received request message and the total capacity of the queue is exceeded. Priority storage means for storing a priority according to information related to a request message for requesting processing related to a resource of a communication network;
Information acquisition means for acquiring additional information including flow information added to the request message when the request message is received;
Priority reading means for reading out the priority from the priority storage means for each of the additional information acquired when a plurality of the additional information is acquired from the received request message;
Priority determining means for calculating a new priority from the read priority;
A resource management device comprising: processing means for performing processing according to the request message in order based on the read priority. The resource management device according to claim 18,
The resource management apparatus, wherein the processing means performs processing in an order based on the new priority. The resource management device according to claim 18,
DSCP value storage means for storing a DSCP value corresponding to the priority;
DSCP determination means for obtaining a DSCP value corresponding to the new priority with reference to the DSCP value storage means;
A resource management apparatus, further comprising: a DSCP value notification means for notifying the determined DSCP value to a node constituting the communication network.

Images