JP3581056B2 - Traffic observing device, traffic monitoring device, datagram transfer device, and datagram transfer system - Google Patents

Description

[0001]
TECHNICAL FIELD OF THE INVENTION
The present invention relates to a public communication network providing high-speed computer-to-computer communication, and more particularly, to a method for providing a best-effort data communication service and an apparatus for implementing the method.
[0002]
[Prior art]
Data units whose delivery is not guaranteed by the communication network, such as IP (Internet Protocol) packets used in the Internet, are called datagrams. A communication network that realizes a data communication service by transferring such datagrams is called a datagram transfer network. In a datagram transfer network, a datagram transfer device in the network (for example, a device called a router in the Internet) relays a datagram having an arbitrary size toward a destination address described in a header of the datagram. A communication service is realized.
[0003]
When a datagram exceeding its own processing capacity arrives in a concentrated manner in a very short period (this is called a congestion state), the datagram transfer device appropriately discards the arrived datagram. Therefore, in the datagram transfer network, a best-effort data communication service is provided in which the network transfers the individual datagrams to their destinations as much as possible with the capability of the transfer device in the network. .
[0004]
FIG. 1 is a diagram for explaining a general configuration of a datagram transfer device constituting a datagram transfer network as described above. The datagram transfer device has a configuration in which some input interface units 11 and some output interface units 12 are connected to one pack plane switch unit 13. The pack plane switch unit 13 has a function of transferring a datagram from an arbitrary input interface unit 11 to an arbitrary output interface unit 12 without any internal conflict.
[0005]
FIG. 2 is a diagram illustrating the configuration of the input interface unit 11 in FIG. The input interface unit 11 includes an input line interface unit 21, a datagram transfer processing unit 22 having a transfer destination table 23, and a datagram transmission unit 24. When a datagram is received by the input line interface unit 21 from the input link, the datagram transfer processing unit 22 determines the desired output interface unit 12 from the destination address with reference to the transfer destination table 23, and the pack plane switch unit 13 To the appropriate datagram transmitter 24 for transfer to the desired output interface 12.
[0006]
FIG. 3 is a diagram illustrating the configuration of the output interface unit 12 in FIG. The output interface unit 12 includes a datagram receiving unit 31, a buffer memory control unit 32 having a buffer memory, and an output line interface unit 33. The datagram received by the datagram receiving unit 31 from the pack plane switch unit 13 is temporarily stored in a buffer memory according to the processing method of the buffer memory control unit, then transferred to the output line interface unit 33, and transmitted to the output link. You. In a conventional datagram device, as a buffer memory control method in the output interface unit 12, a FIFO (First-In First-Out) that writes datagrams in the order in which they arrive and reads in the order in which they were written as long as the buffer memory is available. The method is used.
[0007]
On the other hand, there is FQ (Fair Queuing) as another buffer memory control method in the output interface unit. This is because when a flow (a datagram sequence that passes through one path from one transmitting datagram transmitting device to one receiving datagram transmitting device) is identified with a predetermined granularity, each flow has the same throughput on the output link. Thus, the order of reading from the buffer memory is controlled. There is also a WFQ (Weighted Fair Queuing) that can be divided into throughputs proportional to the weights in consideration of the weights of the flows (A. Demers, S. Keshav, S. Shenker, "Analysis and Simulation of Fair Failure"). Queuing Algorithm ", Proceedings of ACM SIGCOMM, pp. 1-12, Sept. 1989).
[0008]
FIG. 4 is a diagram illustrating the configuration of the buffer memory control unit 32. Here, a plurality of queues 42 each having a weight set are provided in the buffer memory. When a datagram is sent from the datagram receiving unit 31, the classifier 41 determines a queue 42 for storing the datagram, and the scheduler 43 sets the queue so that the output throughput is proportional to the weight value of each queue. The selected datagram is transferred to the output line interface unit 33. FQ corresponds to a special case where the weight values of the WFQ are all the same.
[0009]
If more datagrams than the link bandwidth arrive at the output link connected to one output interface unit, the link is called a bottleneck link. In this bottleneck link, the user's flow in the flowchart shares a resource called a link band. In this case, for example, it is considered that a user who connects to the Internet expects to differentiate by contract. Specifically, a user who has contracted for a 20M access line is expected to be able to obtain more throughput than a user who has contracted for a 10M access line. Therefore, it is desirable to differentiate the throughput at the bottleneck link taking into account the contract.
[0010]
However, in a transfer network using a conventional datagram transfer device using a FIFO for an output interface unit, all congestion rate control is left to a TCP (transmission control protocol) mounted on a user terminal. This TCP congestion rate control is a control to lower the rate when the datagram is discarded by the buffer memory read control unit because the buffer memory is full in the FIFO, and the throughput of each TCP flow becomes equal. According to this, there is a problem that a user who has performed a large number of flows at the same time irrespective of the user's contract can obtain a high total throughput, and such a user can obtain a benefit.
[0011]
FIG. 5 is a diagram illustrating an example. In this example, when user A flows two flows 51 and 52 and user B flows one flow 53 through access lines 54 and 55 having the same bandwidth, respectively, these three flows It is assumed that the output link 57 of, for example, 30 Mbps shared by a certain datagram transfer device 56 is in a congested state. In this case, the throughput of each of the three flows 51, 52, and 53 in this bottleneck link 57 is equal to 10 Mbps, so the total throughput obtained by user A is 20 Mbps, which is two flows, whereas The throughput obtained by B is 10 Mbps for one flow, and the user A obtains.
[0012]
Further, when the FQ is used for the buffer memory control unit of the output interface unit of the datagram transfer device, it is possible to equalize the throughput for each flow at a predetermined granularity in a congested link, but one user sets a plurality of flows. If this is the case, as in the case of the FIFO, this results in an unfairness in terms of the total throughput using the link at the user level. For example, when a flow is identified by an IP address, a user having a plurality of IP addresses obtains an advantage. This problem is called a multiple flow problem. This multi-flow problem cannot be solved only by information such as an IP address or a port number stored in a header of a normal IP datagram, and therefore, realization of throughput differentiation taking into account a contract in a bottleneck link. It is difficult.
[0013]
For example, when WFQ is used as a means for solving the multiple flow problem, the classifier can identify the user to which the arriving datagram belongs at the output interface unit of the datagram transfer device, know the weight to be set in the queue, and It is necessary to be able to assign each user to a queue. Therefore, the datagram transfer device holds a database describing the correspondence between the IP address of the datagram and the user ID, and the weight for each user, that is, the weight to be set in the queue, is stored in advance in the WFQ of the datagram transfer device. It is necessary to set the weight or to set the weight using a signaling protocol such as RSVP (Resource Reservation Setup Protocol).
[0014]
However, in a communication network with a large number of users, it is necessary that all datagram transfer apparatuses in which congestion occurs in the network hold all user ID databases and statically set the WFQ. There is a big problem that it is necessary to perform the signaling process every time a new flow occurs or disappears.
[0015]
[Problems to be solved by the invention]
The present invention has been made in view of the above points, and an object of the present invention is to provide a datagram transfer method capable of solving a multiple flow problem without each datagram transfer device holding all user ID databases. It is to provide an apparatus and a system.
[0016]
[Means for Solving the Problems]
In order to achieve the above object, the datagram transfer method of the present invention, which is shown as a reference example, strengthens the right to use the communication network resources possessed by the flow to which the datagram belongs in the header of the datagram flowing into the communication network. A weight value indicating the weight and limited by a rule predetermined for each user is written, and weighted priority transfer processing is performed for each flow according to the weight value written in the header of the datagram.
[0017]
In such a datagram transfer method of the present invention, one method operates as follows. That is,
(1a) A weight value is written in the header of the datagram flowing into the transfer network in the transfer network equipment. This weight value indicates the strength of the datagram's right to use the resources of the transport network.
(1b) A predetermined rule is provided for the weight value to be written in each datagram. This rule is differentiated by a contract with the user.
(1c) In the datagram transfer device in the transfer network, it is determined that the datagram to be processed by the device having the larger weight value has the stronger right to use the band, and the weighting priority for increasing the transfer rate is determined. Perform transfer processing. At that time, the processing is dynamically performed by the weight value written in the header of the transferred datagram.
[0018]
In the datagram transfer method of the present invention, another method operates as follows. That is,
(2a) The weight value is written in the header of the datagram flowing into the transfer network in the user equipment. This weight value indicates the strength of the datagram's right to use the resources of the transport network.
(2b) A predetermined rule is set for the weight value to be written in each datagram. This rule is differentiated by a contract with the user.
(2c) When a datagram whose weight value is already written in the header flows into the transfer network, the datagram traffic is monitored by the equipment in the transfer network, and the datagram that violates the rule of (2b) is Violation processing is performed so that only non-violating datagrams enter the transfer network.
(2d) In the datagram transfer device in the transfer network, it is determined that the larger the weight value among the datagrams to be processed by the device at present, the stronger the right to use the bandwidth, and the weighting priority for increasing the transfer rate is given. Perform transfer processing. At that time, the processing is dynamically performed by the weight value written in the header of the transferred datagram.
[0019]
Therefore, in the present invention, the traffic observation device used to write the weight value in the header field in the network observes the traffic information on the datagram that the user transmits to the communication network or receives from the communication network within a certain time. A traffic observation function, a weight value calculation function of calculating a weight value representing the strength of the right to use the communication network included in the datagram from observation results obtained by the traffic observation function so as to conform to a predetermined rule, and a calculation And a weight value inserting function for writing the weight value into the header of the datagram.
[0020]
In such a traffic observation device of the present invention, the predetermined rule is such that the sum of the weight values of the flows identified by the predetermined method does not exceed the weight value collectively given to the user in advance. It is characterized by the following rule. In this case, the weight value of each flow is a value obtained by dividing the weight value given to the user in advance collectively by the number of flows identified by a predetermined method from the observation result obtained by the traffic observation function. Alternatively, the weight value of each flow, the weight value previously given to the user collectively, between flows identified by a predetermined method from the observation result obtained by the traffic observation function, The value may be divided according to the throughput ratio of each flow.
[0021]
In addition, a traffic monitoring device used when a user specifies a weight value has a traffic observing function for observing traffic information relating to datagrams transmitted to or received from a communication network within a certain period of time by a user. A function to check that a rule predetermined between the user and the communication network is adhered to for the datagram in which the weight value is written, and that the rule is not observed as a result of the check It is provided with a violation processing function that performs violation processing in cases.
[0022]
In such a traffic monitoring device of the present invention, the violation process when the weight value specified by the user does not comply with the rule may be a process of discarding a datagram, or a process of discarding the traffic of the user. Calculate a weight value that matches a rule predetermined between the user and the communication network from the result obtained from the observation function, and replace the weight value written in the header of the datagram with the calculated weight value. May be performed. According to the present invention, a rule determined in advance between a user and a communication network is such that the sum of the weight values of the flows identified by a predetermined method does not exceed the weight value given to the user collectively in advance. It is characterized by the following rule.
[0023]
In order to determine the weight value of the datagram by itself and to write the weight value in the header of the datagram flowing into the communication network, a header field insertion device is provided in the user facility. The header field insertion device has a function of determining a weight value indicating the strength of the right to use the communication network possessed by the datagram, and writing the weight value in the header of the datagram flowing into the communication network. It is characterized.
[0024]
Further, the datagram transfer device used in the present invention obtains a weight value from a backplane unit that transfers a datagram without conflicting from any input interface unit to any output interface unit, and a header of the datagram. And an output interface unit having a weighted priority transfer function for performing priority transfer control based on the weight value.
[0025]
Such a datagram transfer device of the present invention further includes a flow management function for managing the state of the flow based on the weight value of the datagram obtained at the output interface, and the weighted priority transfer function manages the flow management function. Priority transfer control may be performed based on the information. The flow management function may manage flow information on datagrams stored in the buffer memory of the output interface unit, or may manage flow information on datagrams transferred within a predetermined time in the past. Is also good.
[0026]
According to such a datagram transfer apparatus of the present invention, the header field including the weight value written in the header of the datagram, the IP address of the transmitting side and the receiving side, the port number, etc. is taken out, and the order of the weight value is increased. Priority transfer is performed to transfer datagrams at a higher priority.
[0027]
In such weighted priority transfer, a flow to be processed by an output interface is identified based on information extracted from a header field, the state is managed together with the weight value, and the WFQ weight is set by the data. . Since the flow management only needs to be performed on the active flow to be processed by the output interface unit of the datagram transfer device at that time, the load is lower than in the conventional method in which a database of all user IDs must be held. Is extremely light. The flow management target can be flow information relating to datagrams currently stored in the output interface, flow information relating to datagrams transferred within a predetermined time in the past, and the like.
[0028]
BEST MODE FOR CARRYING OUT THE INVENTION
Next, examples of the present invention will be described.
[0029]
FIG. 6 is a diagram showing a configuration example of a datagram transfer system according to the present invention. In the figure, 1a, 1b and 1c are datagram transfer devices, 2 is a traffic observation device, 3 and 4 are line termination devices, 5 is a user terminal, and 6 is an access network. The traffic observation device 2 is installed between the line termination device 3 that terminates the access network 6 and the first datagram transfer device 1c in the transfer network.
[0030]
The datagram transmitted from the user terminal 5 via the access network 6 is observed by the traffic observation device 2 installed at the inlet of the transfer network, and the weight value of the flow to which the datagram belongs is determined according to a predetermined rule. , And writes the calculation result in the header of the datagram, and the datagram transfer devices 1a, 1b, and 1c in the network perform weighted priority transfer control for each flow according to the weight value.
[0031]
FIG. 7 is a diagram showing a configuration example of the traffic observation device according to the present invention. The traffic observation device 2 includes a traffic observation function 61, a weight value calculation function 62, and a weight value insertion function 63. The traffic observing function 61 observes and saves traffic information on datagrams transmitted to or received from a communication network by a user within a predetermined time. The weight value calculation function 62 calculates, from the traffic information obtained by the traffic observation function, a weight value representing the strength of the right to use the communication network belonging to the flow to which the datagram belongs within the range of a predetermined rule. . The weight value insertion function 63 writes the weight value calculated by the weight value calculation function 62 in the header of the transmitted datagram.
[0032]
In this case, by applying a rule that the sum of the weight values of each flow does not exceed the weight value given to the user in advance, the total value of the flow weight values for each user is limited, and the total Values can be differentiated by contract. Conversely, it can be said that the weight value given to the user collectively in advance is the limit value, which is divided and given to each datagram.
[0033]
An example of calculating the weight value will be described below. In the following, Wi is the weight value given to the user i at a time, Ni is the number of flows that the user i is simultaneously setting, and Wij, j are the weights to set the j-th flow j in those flows. Let the throughput of the second flow be Fij.
[0034]
Each Wij is assumed to be the same, and when Wij is calculated using Ni and Wi,
Wij = Wi / Ni
In this case, each flow of the same user is treated equally. When Wij is calculated using Wi and Fij,
Wij = Wi × Fij / ΣFij
It is. In this case, the weight value increases as the throughput increases.
[0035]
FIG. 8 is a diagram showing another configuration example of the datagram transfer system according to the present invention. In the figure, 1a, 1b and 1c are datagram transfer devices, 3 and 4 are line termination devices, 5 is a user terminal, 6 is an access network, 7 is a header field insertion device, and 8 is a traffic monitoring device. The header field insertion device 7 is installed in the user facility, and the traffic monitoring device 8 is installed between the line terminating device 3 that terminates the access network 6 and the first datagram transfer device 1c in the transfer network.
[0036]
In this system, the header field insertion device 7 writes a weight value in the header of a datagram reflecting the user's own intention in the user facility, transmits the datagram to the transfer network via the access network 6, and transfers the datagram. The network monitors the traffic at the inflow port and checks whether the weight value of the flow to which the datagram belongs conforms to a predetermined rule. If the rule is violated, a violation process is performed so that only datagrams that conform to the rule flow into the transfer network. The datagram transfer device in the transfer network performs weighted priority transfer control for each flow according to the weight value.
[0037]
In this system, the header field insertion device 7 makes it possible to assign a large weight value to a datagram of a flow that the user considers important. For example, by specifying that all weights assigned to the user himself are given to traffic such as voice-over IP or video streams, even when the transport network is congested, their throughput is unlikely to decrease. Can be.
[0038]
FIG. 9 is a diagram showing a configuration example of the header field insertion device 7. The header field insertion device 7 includes a weight value designation function 71 and a weight value insertion function 72. The weight value specifying function 71 determines a weight value based on the user's weight specification, and the weight value inserting function 72 writes the weight value in the header.
[0039]
FIG. 10 is a diagram illustrating a configuration example of the traffic monitoring device 8. The traffic monitoring device 8 includes a traffic observation function 75, a monitoring function 76, and a violation processing function 77. The traffic observing function 75 observes and saves traffic information on datagrams transmitted to or received from a communication network by a user within a predetermined time. The monitoring function 76 checks from the traffic information observed by the traffic observing function 75 whether the traffic conforms to a predetermined rule. If the rule is violated, the violation processing function 77 performs violation processing.
[0040]
One example of violation processing performed by the violation processing function 77 of the traffic monitoring device 8 is to discard the violated datagram. FIG. 11 is a flowchart of the discarding process. The traffic observation function 75 observes traffic (step 101), and the monitoring function 76 checks whether the rule is violated (step 102). If the rule is violated, the datagram is discarded (step 103).
[0041]
Another example of the violation processing performed by the violation processing function 77 of the traffic monitoring device 8 is to rewrite the weight value of the violated datagram to one that matches the rule. FIG. 12 is a flowchart of the process. The traffic observation function 75 observes traffic (step 111), and the monitoring function 76 checks whether the rule is violated (step 112). If the rule is violated, a weight value that does not violate is calculated as violation processing. (Step 113), the weight value written in the header of the datagram is rewritten (step 114).
[0042]
If a rule that the sum of the weight values of each flow does not exceed the weight value given to the user in advance is applied as a reference rule when the traffic monitoring device 8 performs a check, The total value of the flow weight values is limited, and the total value can be differentiated by contract.
[0043]
According to the present invention, the weight value written in the datagram is given by the transport network in the traffic observation device by observing the traffic of the user, or is assigned by the user and checked by the transport network. Therefore, the total value of the weight values of the datagrams flowing into the transfer network for each user is limited. Even if the user sends multiple flows, the traffic observation device or traffic monitoring device will give a small weight value to those datagrams, and when congestion occurs on the output link of the datagram transfer device, A datagram to which a smaller weight value is assigned is transmitted at a lower rate than a datagram having a larger weight value. That is, when a plurality of flows are flowed, the throughput of each flow becomes small, so that the problem of the plurality of flows obtained in the congested link obtained by the user is solved, and the flow is represented by a weight value given to the user. Resource allocation can take into account resource usage rights.
[0044]
FIG. 13 is a diagram illustrating such a situation. The user A and the user B are given the same contract and the same collective weight value 20, and the user A receives the two flows of the flows 81 and 82, the user B receives only the flow 83, and the access lines 84 and 85, respectively. Assuming that the flow is flowing to the datagram transfer device 86, the user A makes the sum of the weights assigned to the flows 81 and 82 equal to or less than 20, and in this case, the weights of the flows 81 and 82 are 10 and 10, respectively. The weight value assigned to the flow 83 of the user B is 20. These weight values are written in the header of the datagram of each flow. In this case, in the bottleneck link 87 of 30 Mbps, the flows 81, 82 and 83 divide the output link of 30 Mbps at a rate proportional to the weight value, so that the throughput becomes 7.5 Mbps, 7.5 Mbps and 15 Mbps, respectively. The total throughput of each user is 15 Mbps.
[0045]
Further, in the present invention, since each datagram transfer device dynamically performs weighted priority transfer processing using the weight value written in the header of the datagram, it is not necessary to have a database for all users, and There is no need to set values or set weight values by signaling processing.
[0046]
The datagram transfer device extracts a weight value and other header fields described in the header of the datagram, and performs a transfer process (weighted priority transfer process) with a higher priority on the datagram with the larger weight value.
[0047]
FIG. 14 is a diagram showing a configuration example of the buffer memory control unit 90 in the output interface unit (corresponding to the output interface unit 12 in FIGS. 1 and 3) of the datagram transfer device 1 (see FIGS. 6 and 8) according to the present invention. is there. The buffer memory control unit 90 includes a header field acquisition function 91 and a weighted priority transfer function 92. The header field acquisition function 91 extracts a weight value and other fields from the header of the datagram arriving from the datagram receiving unit, and passes the header information to the weighted priority transfer function 92. The weighted priority transfer function 92 uses the information obtained from the header field acquisition function 91 to perform weighted priority transfer processing for transferring datagrams having a large weight value to the output line interface so as to occupy a high proportion.
[0048]
FIG. 15 is a diagram showing another configuration example of the buffer memory control unit 90 in which the weighted priority transfer function 92 has a flow management function 93 by itself. In this configuration, the information from the header field acquisition function 91 is passed to the flow management function 93, which identifies the active flow, manages the flow state together with its weight value, and uses it for WFQ The weighted priority transfer process is performed in which datagrams having a large weight value occupy a high ratio and are transferred to the output line interface.
[0049]
FIG. 16 is a flowchart showing a process performed by the flow management function 93 when a datagram arrives at the buffer memory control unit 90. In this case, as a criterion for identifying an active flow in the flow management function 93, a criterion for setting a flow in which a datagram processed by the output interface unit in the past within a predetermined time period as an active flow is applied.
[0050]
When the datagram arrives at the buffer memory control unit 90, the information is transmitted from the header field acquisition function 91 to the flow management function 93 (step 121). The flow management function 93 has an active flow list for managing information such as the IP address and port number of the transmitting side and the receiving side necessary for identifying the active flow, a weight value, and a final processing time. When the information is transmitted from, it is checked whether or not the flow to which the datagram belongs is present in the active flow list (step 122).
[0051]
If the flow to which the transmitted datagram belongs does not exist in the active flow list, the weight value and the final processing time, which is the current time, are newly registered as a new active flow (step 123). A flow is set (step 124). If the flow exists in the active flow list, it is checked whether or not the weight value is the same as a registered value (step 125). Is rewritten, the final processing time is updated to the current time (step 126), and the flow is set in the weighted priority transfer function 92 with the rewritten weight value (step 127). If the weight value of the flow is the same as the registered value, the last processing time is updated to the current time (step 128).
[0052]
After these processes, it is checked whether or not there is a flow that has passed a predetermined time or more from the last processing time to the current time among the flows registered in the active flow list (step 129). Since the flow that has passed above indicates that the datagram has not arrived for a predetermined time, it is regarded as an inactive flow, and is deleted from the active flow list (step 130), and is also deleted from the setting of the weighted priority transfer function 92 (step 131). ).
[0053]
FIGS. 17 and 18 are flowcharts showing processing by another method in the buffer memory control unit 90 having the configuration shown in FIG. In the case of FIG. 17, as a criterion for identification of an active flow in the flow management function 93, a criterion for setting a flow having a datagram currently stored in the buffer memory of the output interface unit as an active flow is applied. .
[0054]
FIG. 17 is a flowchart showing processing when a datagram arrives at the buffer memory control unit 90. When a datagram arrives at the buffer memory control unit 90 and its information is transmitted from the header field acquisition function 91 to the flow management function 93 (step 141), the flow management function 93 sends the information necessary for identifying the active flow. And an active flow list that manages information such as the IP address and port number of the receiving side, a weight value, and a datagram counter that counts the number of datagrams. When information is transmitted from the header field acquisition function 91, the It is checked whether or not the flow to which the datagram belongs is in the active flow list (step 142).
[0055]
If the flow to which the transmitted datagram belongs does not exist in the active flow list, the datagram counter of the flow is incremented, and the flow is newly registered together with the weight value (step 143). A flow is set (step 144). If the flow exists in the active flow list, it is checked whether or not the weight value is the same as a registered value (step 145). Is rewritten, the datagram counter of the flow is incremented (step 146), and the flow is set in the weighted priority transfer function 92 with the rewritten weight value (step 147). If the weight value of the flow is the same as the registered value, the datagram counter of the flow is incremented (step 148).
[0056]
FIG. 18 is a flowchart showing processing when the weighted priority transfer function 92 sends out a datagram. When the weighted priority transfer function 92 transmits a datagram, the datagram counter of the flow in the active flow list is decremented (step 151), and it is checked whether the datagram counter of the flow is 0 (step 152). When the value becomes 0, it is regarded as an inactive flow and is deleted from the flow list (step 153), and is also deleted from the setting of the weighted priority transfer function 92 (step 154).
[0057]
【The invention's effect】
As described above, according to the present invention, according to the datagram transfer method using the weight value, each datagram transfer device is able to communicate between the user and the telecommunications carrier without any database or pre-configuration or signaling processing for all users. A great effect is obtained that it is possible to provide a throughput differentiation in the bottleneck link taking into account the contract with the system.
[Brief description of the drawings]
FIG. 1 is a diagram illustrating a general configuration of a datagram transfer device.
FIG. 2 is a diagram illustrating a configuration of an input interface unit in FIG. 1;
FIG. 3 is a diagram illustrating a configuration of an output interface unit in FIG. 1;
FIG. 4 is a diagram illustrating a configuration of a buffer memory control unit.
FIG. 5 is a diagram illustrating a multiple flow problem.
FIG. 6 is a diagram showing a configuration example of a datagram transfer system of the present invention.
FIG. 7 is a diagram showing a configuration example of a traffic observation device of the present invention.
FIG. 8 is a diagram showing another configuration example of the datagram transfer system of the present invention.
FIG. 9 is a diagram showing a configuration example of a header field insertion device 7 of the present invention.
FIG. 10 is a diagram showing a configuration example of a traffic monitoring device according to the present invention.
FIG. 11 is a flowchart of a datagram discarding process.
FIG. 12 is a flowchart of a process of rewriting a weight value of a datagram.
FIG. 13 is a diagram for explaining the solution of the multiple flow problem.
FIG. 14 is a diagram illustrating a configuration example of a buffer memory control unit according to the present invention.
FIG. 15 is a diagram illustrating a configuration example of a buffer memory control unit having a flow management function according to the present invention.
FIG. 16 is a flowchart illustrating a process performed by a flow management function when a datagram arrives at a buffer memory control unit.
FIG. 17 is a flowchart showing another process performed by the flow management function when a datagram arrives at the buffer memory control unit.
FIG. 18 is a flowchart showing processing when the weighted priority transfer function sends out a datagram.
[Explanation of symbols]
1 Datagram transfer device
2 Traffic observation device
3, 4 line termination equipment
5 User terminal
6 access network
7 Header field insertion device
8 Traffic monitoring device
11 Input interface
12 Output interface
13 Pack plane switch
21 Input line interface
22 Datagram transfer processing unit
23 Transfer destination table
24 Datagram transmission unit
31 Datagram receiving unit
32 buffer memory control unit
33 Output line interface
42 queues
41 Classifier
43 Scheduler
51, 52, 53 flow
54, 55 access line
56 Datagram transfer device
57 Output Link
61 Traffic observation function
62 Weight value calculation function
63 Weight value insertion function
71 Weight specification function
72 Weight value insertion function
75 Traffic Observation Function
76 Monitoring function
77 Violation handling function
81, 82, 83 flow
84, 85 Access line
86 Datagram transfer device
87 Bottleneck Link
90 Buffer memory control unit
91 Header field acquisition function
92 Priority transfer function
93 Flow management function

Claims (10)

A traffic monitoring function for observing the traffic information about the datagrams user within a predetermined time to receive from and send to the communication network or communication network, a communication network utilizing the flow of the datagram from the observation results obtained belongs by traffic monitoring function has traffic observation comprising the a weight value calculation function of calculating to fit a predetermined rule weighting value representing the intensity of rights, and a header writing weight value insertion function datagram the calculated weight value A device ,
The rule in the weight value calculation function is a rule that a sum of weight values of respective flows identified by a predetermined method does not exceed a weight value collectively given to a user in advance. Traffic observation device. 2. The traffic observation device according to claim 1 , wherein the weight value of each flow is such that a weight value given to a user in advance is identified by a predetermined method from the observation result obtained by the traffic observation function. A traffic observation device, wherein the value is a value obtained by dividing by a given number of flows. 2. The traffic observation device according to claim 1 , wherein the weight value of each flow is such that a weight value given to a user in advance is identified by a predetermined method from the observation result obtained by the traffic observation function. A traffic observation apparatus characterized in that values obtained by dividing the flows by the ratio of the throughput of each flow are divided. A traffic monitoring function for observing the traffic information about the datagrams user within a predetermined time to receive from and send to the communication network or communication network, with respect to datagram already weighted value in the header is written, and advance the user there in the traffic monitoring device comprising a function of checking that the rules stipulated by the communication network is avoided, and a violation processing function for violation processing if the check result the rules are not complied And
The rule that the rule determined in advance between the user and the communication network is such that the sum of the weight values of each flow identified by a predetermined method does not exceed the weight value given to the user in advance. traffic monitoring device, characterized in that the the. 5. The traffic monitoring device according to claim 4 , wherein the violation process when the rule is not observed is a process of discarding the datagram. 6. The traffic monitoring device according to claim 5 , wherein the violation processing in the case where the rule is not complied with is based on a rule determined in advance between the user and the communication network from a result obtained from the user's traffic observation function. A traffic monitoring apparatus comprising: calculating a matching weight value; and rewriting a weight value written in a header of the datagram with the calculated weight value. A datagram transfer device for transferring a datagram to a destination of a header thereof, comprising: a backplane unit for transferring a datagram from any input interface unit to any output interface unit without conflict; and a backplane. receiving a datagram transferred from parts, obtains the weight value from the received datagram, the datagram transmission device comprising an output interface unit for performing priority transfer control based on the acquired weighting value,
The output interface unit includes a weight value obtaining unit configured to obtain a weight value of the datagram transferred from the backplane unit; a buffer memory that temporarily stores the datagram transferred from the backplane unit; It receives a weight value from the value obtaining means, comprising a flow management means for managing flow information relating to datagrams that are accumulated in the buffer memory on the basis of the accepted took weight value,
A datagram transfer device, wherein priority transfer control is performed based on management information of the flow management means . 8. The datagram transfer device according to claim 7, wherein said flow management means manages flow information on datagrams transferred within a predetermined time in the past. A datagram transfer system, wherein a datagram output from the traffic observation device according to any one of claims 1 to 6 is transferred by the datagram transfer device according to claim 7 or 8. . In order for the user to transmit the datagram to the communication network, the user himself / herself determines a weight value indicating the strength of the right to use the communication network possessed by the datagram, and the weight value is added to the header of the datagram flowing into the communication network. Transferring a datagram by means of a header field insertion device comprising means for writing the data, a traffic monitoring device according to any one of claims 4 to 6, and a datagram transfer device according to claim 7 or 8. A datagram transfer system.

Images