JP4430573B2 - Resource securing determination method, apparatus and program - Google Patents

Description

  The present invention relates to a resource management method and apparatus for managing resources in a communication network, and more particularly to a method and apparatus for determining whether or not a resource having a requested capacity can be secured.

  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, 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) independent of the routers that make up the communication network, and to determine the amount of resources (links) between the nodes that make up the communication network and how they are used. There is a method of paying out appropriate resources in response to a resource securing request from a user terminal or the like while managing. 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 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 link constituting the communication route is specified from the route table based on the requested communication IP address. 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 processing for subtracting the capacity allocated to the communication from the remaining resource amount of the identified link in the link information table is performed. 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 user terminal that has received the permission response for the resource securing request pays a preset service fee and uses the communication service, so that the resource is secured and the communication quality is guaranteed.
After that, when the use of the communication service ends, 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)

  However, in the conventional technology, the first-come-first-served basis is adopted, and when the capacity of the link constituting the route is insufficient, another user secures the resource until all or a part of the already secured resource is released. There was a problem that the service could not be received. For this reason, a user who wants to receive the resource securing service at a certain time needs to keep securing the resource before that time. Further, in order to provide a resource securing service equally to many users, the resource management server side must limit the service providing time per user.

  The present invention has been made to solve such a problem, and its purpose is not to wait for the active release of resources already secured even when the capacity of the link constituting the path is insufficient. In addition, another user can secure resources.

  In order to achieve such an object, according to the resource management method of the present invention, a resource having a requested capacity can be secured for a predetermined time from a certain time with respect to an arbitrary ground path including one or more links and nodes. A resource reservation determination method for determining whether or not it is possible, a step of obtaining an evaluation value from each resource reservation request for requesting resource reservation for a route, a step of identifying a link constituting the route, and each of the links In this step, within the range that does not exceed the total resource amount of the link, it is determined that the resource can be secured for the resource securing request with a high evaluation value, and the resource is secured for the route that is determined that the resource can be secured on all the links. And a step of determining that it is possible.

This resource securing determination method may further include a step of securing a resource having a requested capacity in a link determined to be capable of securing the resource.
In addition, the method may further include a step of releasing the secured resource when it is determined that the resource cannot be secured by the newly received resource securing request after the resource is secured in the link.

Further, the resource reservation determination method described above further includes a step of recalculating the evaluation value by multiplying the acquired evaluation value by a predetermined coefficient, and the step of determining that the resource can be reserved in the link is recalculated. You may make it determine using an evaluation value.
Here, a value proportional to the inverse of the requested capacity can be used as the coefficient. Further, as the coefficient, a value that changes according to the remaining resource amount available in the link can be used.

Further, the resource reservation determination method described above includes a step of acquiring a resource having a requested capacity in a link that is determined to be able to secure a resource for a route that includes a link that has not been determined to be secure. to nodes at both ends of the link reserved, Ru Bei Etei and a step of instructing a change of the priority set for the packet to pass through the route.

Moreover, the amount of money per unit time paid by securing resources can be used as an evaluation value.
In addition, the resource reservation determination method described above may further include a step of returning a fee paid for the newly received resource reservation request to the user who has requested the reservation of the released resource.

  In addition, the resource reservation determination apparatus according to the present invention determines whether or not a resource having a requested capacity can be secured for a predetermined time from a certain time with respect to an arbitrary ground path composed of one or more links and nodes. In each of the resource securing determination device, an evaluation value acquiring unit that acquires an evaluation value from an individual resource securing request that requests resource securing for a route, a link specifying unit that identifies a link constituting the route, and a link, Within the range that does not exceed the total resource amount of links, link-specific resource securing determination means that determines that resources can be secured in response to a resource securing request with a high evaluation value, and a path that is determined to be able to secure resources on all links And a path resource securing determination unit that determines that the resource can be secured.

The resource reservation determination apparatus may further include a resource reservation unit that secures a resource having a requested capacity in a link that is determined to be capable of resource reservation.
Further, it may further comprise resource releasing means for releasing the secured resources when it is determined that the resources cannot be secured by the newly received resource securing request after the resources are secured in the link. .

The resource reservation determination apparatus described above further includes evaluation value calculation means for multiplying the acquired evaluation value by a predetermined coefficient to recalculate the evaluation value, and the link-specific resource reservation determination means includes the recalculated evaluation value. You may make it determine using a value.
Here, a value proportional to the inverse of the requested capacity can be used as the coefficient. Further, as the coefficient, a value that changes according to the remaining resource amount available in the link can be used.

Further, the resource reservation determination apparatus described above includes a resource reservation unit that secures a resource having a requested capacity in a link that is determined to be able to secure a resource for a route that includes a link that has not been determined to be secure. resources to nodes at both ends of the link reserved, Ru Bei Etei a priority change instruction means for instructing a change of the priority set for the packet to pass through the route.

Moreover, the amount of money per unit time paid by securing resources can be used as an evaluation value.
In addition, the resource reservation determination apparatus described above may further include a charge return unit that returns a fee paid for a newly received resource reservation request to a user who has requested to secure a released resource.

  A program according to the present invention causes a computer to execute each step of the resource securing determination method described above.

In the present invention, an evaluation value for a route is used as an index, and it is determined that resources can be secured in order from the route with the highest evaluation value. Therefore, even when the capacity of the link constituting the route is insufficient, the user can secure resources without waiting for active release of resources already secured by setting a high evaluation value for the route. It becomes possible. As a result, when it is desired to receive the resource securing service at a certain time, there is no need to keep securing the resource before that time.
For this reason, the user only has to pay a fee at the time when the user wants to receive the resource securing service. Further, the service providing side need not limit the service providing time per user. Furthermore, the value of resources can be increased and the profit on the service provider side can be increased by the user's competition principle.

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 resource management system to which a resource management server according to a first embodiment of a resource securing determination apparatus of the present invention is applied.
The resource management server 1 in FIG. 1 is a resource management device that manages resources of the communication network 2.

  The communication network 2 to be managed is a communication network based on the Internet protocol (IP), and includes a plurality of routers R (R1 to R7), terminals T (T1 to T6), and the like. These are collectively called a node. The nodes are connected by a communication line called a link. The resource of the communication network 2 refers to a capacity that is paid out for a predetermined time by charging on a link that forms a path between two terminals that perform communication. Capacity can be paid out continuously.

  The application server 3 is a server that relays message exchange between the terminal T and the resource management server 1. From the terminal T to the resource management server 1, a resource securing request message for requesting securing of resources necessary for communication between the terminal T and another terminal, a resource releasing request message for requesting release of the secured resource, etc. Is sent. From the resource management server 1 to the terminal T, a response message for permitting or rejecting the resource securing request is transmitted.

  Information such as a message number indicating the type of the request message, identifiers (eg, IP addresses) of two terminals that perform communication, and the amount of resources necessary for communication are added to each request message. In particular, an evaluation value for the route between terminals set by the user is added to the resource securing request message. In the present embodiment, an amount per unit time (payment amount) to be paid when securing resources can be set freely by the user, and this payment amount is used as an evaluation value.

1.1 Configuration of Resource Management Server The resource management server 1 includes 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.
As illustrated in FIG. 2, the resource management server 1 includes a transmission / reception unit 11, a message analysis unit 12, a resource management unit 13, a response processing unit 14, and a database 15.

  The transmission / reception unit 11 includes a communication interface and transmits / receives various messages to / from the application server 3. For example, a message such as a resource securing request and a release request sent from the application server 3 is received, and a response message is transmitted to the application server 3.

  The message analysis unit 12 extracts and analyzes various types of information from the message received by the transmission / reception unit 11, and outputs the analysis result to the resource management unit 13. Since the message analysis unit 12 extracts the evaluation value for the route from the resource securing request message, the message analysis unit 12 also functions as an evaluation value acquisition unit.

  The resource management unit 13 performs processing such as securing a resource having the requested capacity and releasing the secured resource. Specifically, the link specifying unit specifies a link constituting a route from the calling terminal to the called terminal. In addition, the link-specific resource securing determination unit determines that it is possible to secure resources for a resource securing request with a high evaluation value within a range that does not exceed the total resource amount of the link in each identified link. In addition, as a route resource securing determination unit, it is determined that resources can be secured for a route for which it is determined that resources can be secured in all links. In addition, as a resource securing unit, a resource having a requested capacity is secured in a link that is determined to be capable of securing the resource. Further, as a resource release unit, after the resource is secured, when it is determined that the resource cannot be secured by a new resource securing request, the secured resource is released.

  The response processing unit 14 creates a response message according to the processing result by the resource management unit 13 and outputs the response message to the transmission / reception unit 11. Specifically, a response message granting a resource securing request is created when resource securing succeeds, and a response message rejecting the resource securing request is created when failed.

  The database 15 stores various information necessary for resource management of the communication network 1. Specifically, an address list, a link information table, a route information table, a resource reservation determination table, and other information are stored. Hereinafter, these tables will be described.

  The address list is a list of IP addresses of the terminals T1 to T6 and routers R1 to R7 in the communication network 2. For example, as shown in FIG. 3, the address list includes the IP addresses “terminal addresses” of the terminals T1 to T6, and the identifier “accommodating edge node ID” of the edge node that accommodates each terminal (for example, the router R1 that accommodates the terminal T1). , And the IP address “accommodating edge node address” of the edge node.

  The link information table is a table indicating information on links in the communication network 2. For example, as illustrated in FIG. 4, the link information table includes an identifier “link ID” of all links in the communication network 2, a total resource amount of the link “total resource amount”, a remaining resource amount that can be used by the link “remaining resource amount”. It consists of the item.

  The route information table is a table indicating routes from one edge node to another edge node in the communication network 2. For example, as illustrated in FIG. 5, the route information table includes an identifier “route ID” of all routes in the communication network 2, an identifier “edge node ID” of an edge node that is a starting point of the route, and an edge that is an end point of the route It consists of items such as a node identifier “destination edge node ID” and an identifier “link ID list” of each link constituting the route.

  The resource securing determination table is a table used for determining whether or not the requested resource can be secured. For example, as shown in FIG. 6, an identifier “resource ID” uniquely assigned to the resource of the route for which the reservation is requested, and an evaluation value “evaluation value” set by the user for the route for which the reservation is requested , The requested resource amount “requested resource amount”, the result of determining whether the resource can be secured for each link constituting the route “individual determination”, it is determined whether the resource can be secured for the entire route As a result, it consists of an item “overall judgment”.

Data such as the requested resource amount corresponding to the resource ID is arranged in order from the highest evaluation value.
The determination result for each link is “OK” in a range where the total amount of requested resources from the top does not exceed the total resource amount of the link, and “NG” when the total resource amount is exceeded. In the example of FIG. 6, for example, the sum of the requested resource amounts from the uppermost resource ID # 1 to resource ID # 4 does not exceed the total resource amount of the link L1, becomes “OK”, and further the requested resource amount of the resource ID # 5 Is added to the total resource amount of the link L1, and becomes “NG”.
The determination result of the entire route is “OK” when the determination results of all the links constituting the route are “OK”, and “NG” when any one of them is “NG”. In the example of FIG. 6, for the resource ID # 4, for example, the link L1 is “OK”, but the link L3 is “NG”, so the overall determination is “NG”.

  The tables shown in FIGS. 4 to 6 are created assuming a network in which resource securing is requested as shown in FIG. The number in the belt represents the evaluation value.

1.2 Terminal Configuration The terminal T includes a computer such as a general-purpose personal computer having a communication function. Various functions of the terminal T 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) and the computer. This is realized by cooperation with an installed computer program (software).

FIG. 8 is a block diagram illustrating a configuration example of the terminal T.
A terminal T illustrated in FIG. 8 includes a control unit 41, an operation unit 42, a transmission / reception unit 43, and a display unit 44.

The control unit 41 controls the operation of each unit of the terminal T.
The operation unit 42 is used for operation of the terminal T by the user. For example, a remote controller can be used in addition to a keyboard and a pointing device such as a mouse. Using the operation unit 42, a resource securing request, a payment amount for securing the resource, and the like are input.
The transmission / reception unit 43 includes a communication interface and transmits / receives various messages to / from the application server 3. For example, a resource securing request message is transmitted to the application server 3 and a response message is received from the application server 3.
The display unit 44 displays an input screen for various requests, a response to the request, and other information. For example, a monitor of a general-purpose personal computer can be used. If the resolution is good, the display screen of the remote controller can be used instead.

FIG. 9 is a diagram illustrating an appearance of a remote controller used as the operation unit 42.
The remote controller 5 includes a display screen 51, various operation keys 52 to 56, and a speaker 57.
The display screen 51 displays, for example, the current rank of the resource securing service provided by the resource management server 1, the total payment amount for use of the service, the latest payment amount per unit time, and the like.

The operation keys 52 include channel keys, playback keys, fast forward keys, rewind keys, volume keys, direction keys, and the like. It is possible to set the amount of payment at the time of request for securing resources and automation of subsequent additional payment (including the amount of increase in payment amount and the payment limit). In addition, payment can be made. A link can be selected using a direction key or a numeric key.
The operation key 53 is an additional payment key, the operation key 54 is a payment reduction key, the operation key 55 is a reservation request key for requesting resource reservation, and the operation key 56 is an information update key.

The speaker 57 generates an alarm sound when a state change occurs during viewing of the distribution video, and notifies that effect. For example, when it becomes resource reservation NG during viewing, it can be notified to the user. Notification may be made in conjunction with the vibrator or only with the vibrator. Notification may be performed in conjunction with the LED lamp.
The remote controller 5 can be displayed on a GUI on the display unit 44 of the terminal T and can be operated using a pointing device.

1.3 Operation of Resource Management Server 1.3.1 Securing Resources First, referring to FIG. 10, when a terminal T4 uses a video distribution service by a terminal (hereinafter referred to as “distribution server”) T1, a resource management server An operation in which 1 secures necessary resources in the communication network 2 will be described.

  When the user uses the video distribution service by the distribution server T1, the user sets a payment amount for resource reservation using the operation key 52 of the remote controller 5 and presses the reservation request key 55, so that the resource reservation request is sent from the terminal T4 to the application 3. A message is sent. The resource reservation message includes a message number indicating that this message is a resource reservation request, the IP address of the distribution server T1 as a source terminal that performs video distribution, the IP address of the terminal T4 as a destination terminal that receives video distribution, and video A resource amount (requested resource amount) necessary for distribution is added. Further, the payment amount set by the user is added as an evaluation value for the route between the distribution server T1 and the terminal T4. Here, the evaluation value is “250”.

  The application server 3 transfers this resource securing request message to the resource management server 1.

  In the resource management server 1 that has received the resource securing request message by the transmission / reception unit 11 (step S1, YES in FIG. 10), the message analysis unit 12 first determines that this message is “from the message number added to the received message. It is determined that it is a “resource securing request” (step S2, YES in FIG. 10). Further, the IP address, the requested resource amount, and the evaluation value for the route of the distribution server T1 and terminal T4 added to the message are extracted (step S3 in FIG. 10).

  Since the resource reservation request message does not include the resource ID (step S4 in FIG. 10, YES), the resource management unit 13 assigns the resource ID “# 10” to the resource of the route for which the reservation is requested ( Step S5 in FIG. Then, together with the resource ID “# 10”, the extracted requested resource amount and evaluation value are written in the resource securing determination table shown in FIG. Since the data corresponding to the resource IDs are arranged in order from the highest evaluation value, the resource ID “# 10” is written above “# 9” below “# 3” as shown in FIG.

  Subsequently, the resource management unit 13 refers to the address list shown in FIG. 3 and uses the IP addresses of the distribution server T1 and the terminal T4 extracted from the message as keys, and the edge nodes that accommodate the distribution server T1 and the terminal T4, respectively. To know that the originating edge node is router R1 and the terminating edge node is router R3. Next, referring to the route table shown in FIG. 5, the route between the router R1 and the router R3 is searched, and the route has the ID “P2” and is known to be composed of the link L1 and the link L3. (Step S6 in FIG. 10).

Subsequently, the resource management unit 13 determines whether or not resources can be secured for the link L1 (steps S7 and S8 in FIG. 10). The specific method will be described with reference to FIG.
First, the total resource amount of the link L1 is read from the link information table shown in FIG. 4 and compared with the requested resource amount. When the requested resource amount is larger than the total resource amount (step S21 in FIG. 12, NO), it is determined that the resource cannot be secured for the link L1 (step S25 in FIG. 12). Write “NG” in the column of the link L1 corresponding to # 10.

  If the requested resource amount is less than or equal to the total resource amount (step S21 in FIG. 12, YES), the current remaining resource amount of the link L1 is read from the link information table shown in FIG. 4 and compared with the requested resource amount. If the requested resource amount is equal to or less than the remaining resource amount (step S22 in FIG. 12, YES), it is determined that the resource can be secured for the link L1 (step S23 in FIG. 12). "OK" is written in the column of the link L1 corresponding to

  When the requested resource amount is larger than the remaining resource amount (step S22 in FIG. 12, NO), the following processing is performed. As described above, in the resource reservation determination table, data corresponding to resource IDs are arranged in descending order of evaluation value. Referring to this table, the requested resource amounts for the resource securing requests (# 1, # 2, # 3, # 10, # 4, # 5, # 6) for the route including the link L1 are added in order from the top. Go. Then, it is determined that the resource can be secured in response to the resource securing request in the range where the added value does not exceed the total resource amount of the link L1 (step S24, YES, step S23 in FIG. 12), and the added value is the total resource amount of the link L1. Is determined to be impossible for a resource securing request exceeding 1 (step S24 in FIG. 12, NO, step S25).

For example, it is assumed that the requested resource amount in resource ID # 10 is equal to or less than the requested resource amount in resource ID # 4 that is currently determined to be able to secure resources (OK). In this case, since the evaluation value in the resource ID # 10 is higher than the evaluation value in the resource ID # 4, the resource securing determination result for the link L1 becomes impossible (NG) in the resource ID # 4, and instead the resource ID ## 10 is possible (OK).
In the case where resources are actually reserved for a route in which the result of the resource reservation determination is changed from possible (OK) to impossible (NG), the secured resources are released.

If the minimum evaluation value within the range where the added value of the requested resource amount does not exceed the total resource amount of the link L and the maximum evaluation value where the added value exceeds the total resource amount are the same, both resources It may be impossible to secure a reservation request, or it may be impossible to secure only a later resource securing request.
Alternatively, a column may be added to the resource reservation determination table, a line reaching the total resource amount of each link may be set, and the determination may be redone when the line is exceeded. Those exceeding the line are clearly OK, and those not exceeding are NG.
Further, the process of reading the total resource amount of the link L in step S21 of FIG. 12 and comparing it with the requested resource amount can be omitted.

When the resource reservation determination process for the link L1 is completed, the resource management unit 13 similarly performs the resource reservation determination process for the link L3 (step S9, NO, step S10, and step S8 in FIG. 10).
In the example illustrated in FIG. 11, for example, if the requested resource amount in resource ID # 10 is equal to or less than the requested resource amount in resource ID # 9 that is currently determined to be available (OK), the evaluation value in resource ID # 10 Is higher than the evaluation value in the resource ID # 9, the resource securing determination result for the link L3 becomes impossible (NG) at the resource ID # 9, and instead possible (OK) at the resource ID # 10.

  As a result of the resource reservation determination for each link, when it is determined that the resource reservation is possible for both the links L1 and L3, that is, “OK” is displayed in both the columns of the links L1 and L3 as in the resource ID # 10 in FIG. If written (step S11 in FIG. 10, YES), the resource management unit 13 determines that resources can be secured for the route between the distribution server T1 and the terminal T4 (step S12 in FIG. 10). Then, “OK” is written in the comprehensive determination column corresponding to the resource ID # 10 in the resource securing determination table. Then, by subtracting the requested resource amount from the current remaining resource amount of the links L1 and L3 in the link information table, resources are secured for the route formed by the link L1 and the link L3 (step S13 in FIG. 10).

  Further, the response processing unit 14 creates a response message for permitting resource reservation, and transmits the response message from the transmission / reception unit 11 to the terminal T4 via the application server 3 (step S14 in FIG. 10). To this response message, the IP address of the terminal T4 that has made a resource securing request, the IP address of the distribution server T1 that is the calling terminal, and the resource ID are added.

  The application server 3 that has received the response message for permitting the resource reservation gives the priority set in the packet passing through the route from the distribution server T1 to the terminal T4 with respect to the originating edge router R1 accommodating the distribution server T1. Is given, that is, the priority is set to “High (priority)”. A packet set with a high priority by the router R1 is handled with a high priority when passing through a node on the route. Therefore, the user of the terminal T4 can receive high-quality video distribution even when traffic on the route is congested.

On the other hand, when it is determined that the resource cannot be secured for at least one of the links L1 and L3, and “NG” is written in at least one column of the links L1 and L3 (step S11 in FIG. 10). NO), the resource management unit 13 determines that the resource cannot be secured for the route between the distribution server T1 and the terminal T4 (step S15 in FIG. 10), and corresponds to the resource ID in the resource securing determination table. Write “NG” in the comprehensive judgment column.
In this case, the response processing unit 14 creates a response message indicating that the resource reservation is rejected, and transmits the response message from the transmission / reception unit 11 to the terminal T4 via the application server 3 (step S16 in FIG. 10). To this response message, the IP address and resource ID of the terminal T4 that has made the resource securing request are added.

  The application server 3 that has received the response message to reject resource reservation does not give the above-described instruction to the calling edge router R1. Therefore, the priority setting in the packet passing through the route from the distribution server T1 to the terminal T4 remains “Low (non-priority)”. For this reason, this packet is treated with a low priority (for example, Best Effort) when passing through a node on the route. Therefore, the user of the terminal T4 can receive video distribution when the traffic on the route is busy, but if the traffic is congested, the video quality may be deteriorated due to packet loss or the like.

  Even when resources cannot be secured in the entire route, if there is a section in which resources can be secured, it is also possible to recognize resource securing for that section. In this case, after it is determined in step S15 in FIG. 10 that resources cannot be secured for the route, resources are secured only for the links that are determined to be able to secure resources in step S8, and resource reservation is permitted for some sections. A response message to the effect is transmitted to the terminal T4 via the application server 3. To this response message, the IP address, resource ID, and identifier of the link for which the resource has been secured are added.

Upon receiving this response message, the application server 3 instructs the routers at both ends of the link where the resource is secured to change the priority set in the packet passing through the route from the distribution server T1 to the terminal T4. For example, in the resource ID # 4 in FIG. 6, since the resource is secured for the link L1 and the resource is not secured for the link L3, the priority of the packet is set to “High (priority)” for the router R1. The router R6 is caused to set the packet priority to “Low (non-priority)”. Thereby, the packet is handled with high priority only for the section of the link L1.
Note that the resource management server 1 may have such a priority change instruction function of the application server 3.

1.3.2 Increase in payment amount The user of the terminal T4 who refuses or partially rejects resource reservation can increase the payment amount for resource reservation and request resource reservation again.
Specifically, the user uses the additional payment key 53 of the remote controller 5 to increase the payment amount. When the reservation request key 55 is pressed, a resource reservation request message to which the increased payment amount is added as an evaluation value is transmitted from the terminal T4 to the resource management server 1 via the application 3. In addition to the message number and the like described above, the resource ID extracted from the response message is also added to this message.

In the resource management server 1 that has received this resource securing request message (step S1, YES in FIG. 10), the message analysis unit 12 is the resource securing request in the same manner as when the resource securing request message was previously received from the terminal T4. (Step S2, YES in FIG. 10), and extracts various information added to the resource securing request message (step S3 in FIG. 10). The extracted information includes the resource ID given by the previous securing request from the terminal T4 (NO in step S4 in FIG. 10).
The resource management unit 13 searches the resource ID from the resource reservation determination table shown in FIG. 11 and rewrites the evaluation value corresponding to the resource ID with a new evaluation value based on the payment amount increase. Thereafter, resource reservation determination and response processing based on the determination result are performed for the same route as the previous time (steps S7 to S16 in FIG. 10).

  For example, as in the case of resource ID # 4 shown in FIG. 13A, the resource ID ## shown in FIG. As shown in FIG. 4, by increasing the payment amount and setting the evaluation value to “350”, the ranking is reversed from the evaluation value “300” of the resource ID # 3 that was initially reserved, and the resource ID # 4 Resources can be secured.

1.3.3 Release of Resources Next, referring to FIG. 10 and FIG. 14, after the video distribution from the distribution server T1 to the terminal T4 is completed, the resource management server 1 has secured the resources for video distribution. The operation of releasing the will be described.

  When video distribution by the distribution server T1 is completed and the terminal T4 transmits a resource release request message to the application server 3, the application server 3 transfers the received resource release request message to the resource management server 1. At least a message number indicating that this message is a resource release request and a resource ID extracted from the response message are added to the resource release request message.

  In the resource management server 1 that has received this resource release request message by the transmission / reception unit 11 (step S1, YES in FIG. 10), first, the message analysis unit 12 uses the message number added to the received message as “ It is determined that the request is “resource release request” (step S2, NO in FIG. 10, step S31, YES in FIG. 14). Further, the resource ID added to the message is extracted.

Next, the resource management unit 13 retrieves the resource ID from the resource reservation determination table shown in FIG. 11, and the resource reserved path is composed of the link L1 and the link L3, and the resource reserved for video distribution. Know the amount (requested resource amount).
Subsequently, the current remaining resource amount value of the link L1 is read from the link information table shown in FIG. The value of the resource amount secured for video distribution is added from this value, and the obtained value is written in the link information table as a new remaining resource amount of the link L1. Similar processing is performed for the link L3. As a result, resources reserved for video distribution are released (step S32 in FIG. 14).

  In this embodiment, an example in which an evaluation value for a route is added to a resource securing request message has been described. However, an evaluation value notification message is used separately from a normal resource securing request message, and an evaluation value is added to this message. Then, it can be transmitted from the terminal T4 to the resource management server 1.

1.4 Resource Map In this embodiment, the terminal T4 is notified of permission or refusal of resource reservation by a response message. However, a resource map as shown in FIG. Can also be provided. Here, the “resource map” is an object in which routers R, links L, and the like are represented by simple figures so as to represent actual connection relationships. The identifiers of router R and link L can be used in place of or with the object.

  In the resource map shown in FIG. 7, a branch is displayed in addition to a necessary route between the distribution server T1 and the terminal T4, but there is a pattern in which the branch is not displayed. In addition, the evaluation value set by you or other users is displayed, but the pattern that displays only the success or failure of resource reservation, the pattern that displays only your own priority, or the deadline that enables resource reservation or its vicinity There are also patterns that display that when there is, and patterns that display only the market price or average of the payment amount.

  Furthermore, a resource securing request with an increased payment can be made using the resource map. For example, by selecting a source terminal (ground P) and a destination terminal (ground Q), it is possible to make a resource securing request with an increased payment amount for the entire route from the source terminal to the destination terminal. Further, by selecting an object of a link on the route, it is possible to make a resource securing request with an increased payment amount for each link.

1.5 Billing Processing The payment amount set by the user is the amount per unit time paid by securing resources. “Unit time” includes various values such as “month”, “time”, and “second”. An amount obtained by multiplying the payment amount by the usage time of the resource securing service is charged.

  FIG. 15 is a diagram for explaining the billing process. The pear pattern in the band graph indicates the time when the resource was successfully secured and treated as a priority, and the hatched line indicates the time when the resource securing failed and became a non-priority treatment. The number in the band graph is the amount paid per unit time for securing resources.

User # 1 secured the resource at “500” for 4 unit times (0 to t ₄ ). Therefore, user # 1 pays 500 × 4 = 2000.
User # 2 secured the resource at “400” for 5.5 unit hours. If the time is rounded up, user # 2 pays 400 × 6 = 2400.
User # 3 sets the payment amount to “200” for the first two unit hours (0 to t ₂ ), but failed to secure the resource. However, after that, the amount of payment was increased to “350”, and resources were secured for 4 unit hours (t _{2 to} t ₆ ). Therefore, user # 3 pays 200 × 2 + 350 × 4 = 1800.

User # 4 sets the payment amount to “300” for 6 unit hours (0 to t ₆ ). In the first two unit times (0 to t ₂ ), the right to secure the resource is obtained, but in the next two unit times (t _{2 to} t ₄ ), the right is deprived by the increase in the payment amount by the user # 3. In the next two unit times (t _{4 to} t ₆ ), the right is obtained again by waiving the right of the user # 1. When the right to secure resources is deprived due to an increase in the payment amount of another person, the payment amount of the person can be multiplied by a coefficient α (0 ≦ α ≦ 1) to reduce billing. Here, assuming that α = 1, the user # 4 pays 300 × 2 + 300 × 2 × α + 300 × 2 = 1800.

The amount paid for securing resources can be reduced as well as increased. In this case, for example, the payment amount reduction key 54 of the remote controller 5 shown in FIG. 9 is used.
FIG. 16 is a diagram for explaining a charging process when the payment amount is reduced.
The user # 4 obtains the right to secure the resource by setting the payment amount to “300” for the first two unit times (0 to t ₂ ), but is subsequently deprived of the right by the increase of the payment amount by the user # 3. Therefore, the payment amount was reduced to “200” from time t ₃ . However, in the last two unit times (t _{4 to} t ₆ ), the right is obtained again by waiving the right of the user # 1. If calculation is performed with the coefficient α = 1 as in the case described above, the user # 4 pays 300 × 2 + 300 × 1 × α + 200 × 1 × α + 200 × 2 = 1500.
By setting the payment amount to be reduced in this way, it is possible to reduce the billing for user # 4 when resource reservation is not received.

  Further, automation of additional payment can be set in the terminal T. In this case, it is necessary for the user to preset the amount of increase in the payment amount and the payment limit amount in the terminal T by using the operation keys 52. By making such a setting, even if the right to secure resources is taken away by another person, the terminal T can automatically make an additional payment so that the right to secure resources can be obtained again. Such a function of the terminal T is called an “automatic competition function”.

FIG. 17 is a diagram for explaining a charging process when the automatic competition function is used.
Assume that the user # 3 sets the amount of increase in payment to “20” and the payment limit amount to “350”, and the user # 4 sets the amount of increase in payment to “20” and the amount of payment limit to “340”. When the user # 3 is in ON the automatic competition function in time t _2, the increased competition is the beginning of the payments, competition is repeated until the payment is more than any of the spending limit. If the calculation is performed with the coefficient α = 1 as in the case described above, the user # 3 pays 200 × 2 × α + 310 × 1 + 310 × 1 × α + 330 × 1 + 330 × 1 × α + 350 × 1 = 400 + 1500 + 130 = 2030. On the other hand, the user # 4 pays 300 × 2 + 300 × 1 × α + 320 × 1 + 320 × 1 × α + 340 × 1 + 340 × 1 × α = 2220.

  FIG. 18 shows message transmission / reception between the terminal of user # 3 and the resource management server 1 and message transmission / reception between the terminal of user # 4 and the resource management server 1 during automatic competition. When the rank of the evaluation value is reversed due to the increase in the payment amount, the resource management server 1 releases the resources that have been secured for the higher evaluation value so far and sends a release notification message to the terminal that has set the evaluation value To do. The terminal that has received this release notification message automatically increases the payment amount by the automatic competition function, and transmits an evaluation value notification message in which the increased payment amount is added as an evaluation value to the resource securing request message 1. In this figure, “M” represents a message.

1.6 Reduction of Payment Amount Like the user # 4, it is possible to pay a consideration to a user who has been deprived of the right to secure resources by increasing the payment amount of another person (user # 3). For example, there are the following payment methods.
(1) Pay a certain amount.
(2) The amount obtained by multiplying the payment amount A of the other person who has increased the payment amount by the coefficient β (0 ≦ β ≦ 1) is equally returned to the users (number of people x) who have been deprived of the right to secure resources. The return amount per user is obtained by A × β ÷ x.
(3) The amount obtained by multiplying the payment amount A of the other person who has increased the payment amount by the coefficient γ (0 ≦ γ ≦ 1) is evenly returned to the user (number of people y) whose evaluation value rank has dropped. The amount of return per user is obtained by A × γ ÷ y.
(4) An amount obtained by multiplying the payment amount A of the other person who has increased the payment amount by a coefficient δ (0 ≦ δ ≦ 1) is evenly returned to the user (number of people z) even though the evaluation value rank has been overtaken by the other person. . The amount of reduction per user is obtained by A × δ ÷ z.
In addition, it is possible to prevent the user who has reduced the payment amount from being paid back.

2 Second Embodiment Next, a second embodiment of the resource securing determination apparatus according to the present invention will be described. This embodiment has a function of recalculating an evaluation value for a route for which resource reservation is requested.
More specifically, when the message analysis unit of the resource management server extracts various types of information from the received resource reservation request message, the evaluation value is recalculated by multiplying the extracted evaluation value by a predetermined coefficient. It functions as a calculation unit (step S61 in FIG. 19).
In the present embodiment, the recalculated evaluation value is written in the resource reservation determination table together with the resource ID and the like, and is used for determining whether the resource reservation is possible.
Examples of coefficients used for recalculation of evaluation values will be described below.

(1) Coefficient proportional to reciprocal of bandwidth occupancy The “bandwidth occupancy” is defined by (request resource amount) / (total resource amount). Therefore, “the reciprocal of the bandwidth occupancy rate” is (total resource amount) / (requested resource amount). Here, the “total resource amount” is the total resource amount allocated to the resource reservation type service (the same applies hereinafter).
By multiplying the evaluation value by the reciprocal of the bandwidth occupancy rate, priority is given to a resource securing request for a user having a large payment per unit resource.

  For example, when the user # 1 requests 10 MBytes with a payment amount (evaluation value) “300” for the total resource amount 40 MBytes, the recalculated evaluation value is 300 × (40/10) = 1200. On the other hand, when the user # 2 requests 30 MByte with the payment amount (evaluation value) “400”, the recalculated evaluation value is 400 × (40/30) = 533. The payment amount is larger for the user # 2, but since the evaluation value recalculated by the user # 1 is larger, the resource securing request for the user # 1 is given priority. Therefore, when the amount of remaining resources is small, resource reservation may be granted to user # 1, and resource reservation may be denied to user # 2.

(2) Coefficient determined according to use of resource reservation type service The longer the service continuous use time or the greater the number of times the service is used, the larger the value of the coefficient is, so that priority is given to resource reservation requests.
For example, if the service is continuously used for 2 hours, the evaluation value is 1.2 times. When the user # 1 requests 10 MBytes continuously for 2 hours with a payment amount (evaluation value) “150” for a total resource amount of 40 MBytes, the recalculated evaluation value is 150 × (40/10) × 1. 2 = 720. On the other hand, when the user # 2 requests 30 MByte with the payment amount (evaluation value) “500”, the recalculated evaluation value is 500 × (40/30) = 666. The payment amount is larger for the user # 2, but since the evaluation value recalculated by the user # 1 is larger, the resource securing request for the user # 1 is given priority.

(3) Coefficient determined according to the amount of remaining resources The smaller the amount of available remaining resources, the higher the value (or lower) is recognized, and the higher amount (or lower) of payment is required to secure resources. Decrease (increase) the value.
For example, when the user # 1 requests 10 MBytes with a payment amount (evaluation value) “150” for a total resource amount of 40 MBytes, the recalculated evaluation value is 150 × (40/10) = 600. Thereafter, when the user # 2 requests 30 MBytes with the payment amount (evaluation value) “500”, if the remaining resource amount is small and the payment amount is evaluated 0.8 times, the recalculated evaluation value is 500 ×. (40/30) × 0.8 = 533. The payment amount is larger for the user # 2, but since the evaluation value recalculated by the user # 1 is larger, the resource securing request for the user # 1 is given priority.

3 Third Embodiment Next, a third embodiment of the resource securing determination apparatus according to the present invention will be described. The resource management system to which this embodiment is applied is one that manages a communication network by using a plurality of resource management servers.
FIG. 20 is a block diagram showing an overall configuration of a resource management system to which this exemplary embodiment is applied.
This resource management system has a plurality of resource management servers A1, B1, and C1. The resource management servers A1, B1, and C1 manage the resources of the communication networks A2, B2, and C2 that are connected to each other.

  The resource management servers A1, B1, and C1 have the same functions as the resource management server 1 in the first embodiment. Furthermore, since it is necessary to manage the resources of the route over a plurality of communication networks, it also has a function of exchanging various messages between adjacent resource management servers. For example, in the case of securing a resource for a route extending over the communication networks A2 and B2, the resource management server A1 that manages the communication network A2 manages the communication network B2 after the resource securing process within its management range is completed. A resource securing request message is transmitted to the resource management server B1.

  When each of the resource management servers A1 to C1 has the evaluation value recalculation function described in the second embodiment, the transmission source server of the resource securing request message uses the payment amount set by the user as the evaluation value to send a message Or an evaluation value uniquely recalculated by this server may be added to the message.

  Note that the method for determining resource reservation using the evaluation value in the above-described embodiment is not only when requesting resource reservation in real time when performing communication, but also when resource reservation is reserved by specifying a time in advance. Can also be used.

  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 resource management system with which the resource management server concerning the 1st Embodiment of this invention is applied. It is a functional block diagram of a resource management server. It is a figure which shows an example of the data structure of an address list. It is a figure which shows an example of the data structure of a link information table. It is a figure which shows an example of the data structure of a path | route information table. It is a figure which shows an example of the data structure of a resource securing determination table. It is a figure which shows an example of the resource map showing the resource securing condition in a communication network. It is a block diagram which shows one structural example of a terminal. It is a figure which shows the external appearance of the remote controller used as an operation part. It is a flowchart which shows the flow of the process which ensures the resource required for communication. It is a figure which shows the resource reservation determination table for demonstrating a resource reservation determination process. It is a flowchart which shows the flow of the source reservation determination process for every link. It is a figure which shows notionally the change of the resource securing condition by having increased the payment amount. It is a flowchart which shows the flow of the process which releases the secured resource. It is a figure for demonstrating an accounting process. It is a figure for demonstrating the billing process at the time of reducing payment amount. It is a figure for demonstrating the accounting process at the time of utilizing an automatic competition function. It is a sequence diagram which shows transmission / reception of the message between the terminal and resource management server during automatic competition in time series. 9 is a flowchart showing a flow of processing for securing resources necessary for communication in the second embodiment of the present invention. It is a block diagram which shows the whole structure of the resource management system with which the resource management server concerning the 3rd Embodiment of this invention is applied.

Explanation of symbols

DESCRIPTION OF SYMBOLS 1, A1-C1 ... Resource management server, 2, A2-C2 ... Communication network, 3 ... Application server, 11 ... Transmission / reception part, 12 ... Message analysis part, 13 ... Resource management part, 14 ... Response processing part, 15 ... Database , 41 ... control section, 42 ... operation section, 43 ... transmission / reception section, 44 ... display section, 5 ... remote controller, 51 ... display screen, 52 ... operation key, 57 ... speaker, L ... link, R ... router, T ... Terminal (T1... Distribution server).

Claims (11)

A resource reservation determination method for determining whether or not a resource having a requested capacity can be secured for a predetermined time from a certain time with respect to an arbitrary ground path composed of one or more links and nodes,
Obtaining an evaluation value from each resource securing request that requests resource securing for the path;
Identifying links comprising the path;
In each of the links, a step of determining that resources can be secured in response to a resource securing request having a high evaluation value within a range not exceeding the total resource amount of the link;
A step of determining that resources can be secured for a path determined to be able to secure resources in all links;
Securing a resource of the requested capacity in a link that is determined to be able to secure a resource for a route that includes a link that has not been determined to be secure; and
And a step of instructing nodes at both ends of the link where the resources are reserved to change the priority set in the packet passing through the route . In the resource assurance determination method according to claim 1 Symbol placement,
Further comprising the step of multiplying the obtained evaluation value by a predetermined coefficient to recalculate the evaluation value,
The step of determining that the resource can be secured in the link is determined by using the recalculated evaluation value. In the resource securing determination method according to claim 2 ,
The resource securing determination method according to claim 1, wherein the coefficient is a value proportional to an inverse of the requested capacity. In the resource securing determination method according to claim 2 or 3 ,
The resource reservation determination method, wherein the coefficient is a value that changes in accordance with a remaining resource amount available in the link. In the resource securing determination method according to any one of claims 1 to 4 ,
The evaluation value is an amount per unit time paid for resource reservation. A resource reservation determination apparatus for determining whether or not a resource having a requested capacity can be secured for a predetermined time from a certain time with respect to an arbitrary ground path composed of one or more links and nodes,
Evaluation value acquisition means for acquiring an evaluation value from each resource reservation request for requesting resource reservation for the route;
Link specifying means for specifying links constituting the route;
In each of the links, within a range that does not exceed the total resource amount of the link, a resource-by-link resource determination unit that determines that resources can be secured in response to a resource securing request with a high evaluation value;
A route resource securing determination means for determining that a resource can be secured for a route determined to be able to secure a resource in all links;
Resource securing means for securing a resource of the requested capacity in a link that is determined to be able to secure a resource for a route that includes a link that has not been determined to be secured;
A resource reservation determination apparatus comprising: priority change instruction means for instructing nodes at both ends of the link where resources have been reserved to change the priority set in a packet passing through the route . In the resource assurance determination apparatus according to claim 6 Symbol mounting,
Evaluation value calculation means for multiplying the acquired evaluation value by a predetermined coefficient to recalculate the evaluation value;
The resource reservation determining unit for each link determines using the recalculated evaluation value. In the resource securing determination device according to claim 7 ,
The resource reservation determining apparatus according to claim 1, wherein the coefficient is a value proportional to an inverse of the requested capacity. In the resource securing determination device according to claim 6 or 7 ,
The resource reservation determining apparatus according to claim 1, wherein the coefficient is a value that changes according to a remaining resource amount available in the link. In the resource securing determination device according to any one of claims 6 to 9 ,
The evaluation value is an amount per unit time paid for resource reservation. The program for making a computer perform each step of the resource securing determination method of any one of Claims 1-5 .

Images