JPS58170262A - Communication network management system - Google Patents

Abstract

PURPOSE:To improve the communication of an important call and calls of the entire communication network, by comparing the traffic processing ability of the communication network with the amount of traffic generated in the communication network. CONSTITUTION:Exchange stations S1-S5 are connected with communication lines shown in Li,j to form distributed communication network. A managing device K managing the entire communication network is connected to each exchange station via signal lines shown in dotted lines. The device K receives the generated traffic estimated amount among opposing stations via the communication lines connected to the stations S1-S5 and the number of calls generated in the unit time from the stations, the rate of the number of callings is operated from them and the traffic processing ability of the entire network, decides the range of detour to be applied and informs the detour restriction to each exchange station. The restriction of the detour is applied to each group by grouping the lines into a line group reached with the minimum relay link at each opposing station, and a line group having one or two relay links more.

Description

[Detailed Description of the Invention] The present invention is superior in its ability to maintain communication networks against failures, etc., so it can be used in distributed communication networks used for special purposes such as defense communications, depending on the amount of traffic added to the network. The present invention relates to a communication network control method for effectively utilizing this by taking appropriate detour control measures.

1 Generally, commercial communication networks have a hierarchy of switching stations S as shown in Figure 1, and between each switching station S there are trunk lines 1tLt~L1, diagonal lines, and ~Lyo. . The oscillation continues. In this case, in response to an overflow call from a diagonal line, lines are selected sequentially using the near-far rotation method, from a low-level station in the other party's band to a high-level station, and then to the backbone line, thereby improving communication call communication. There is a plan. On the other hand, if the number of overflow calls increases significantly, detour regulations will be implemented to restrict the selection of diagonal lines and backbone lines to higher stations, prevent abnormal traffic from spreading due to traffic concentration, and reduce communication communication. We are working to improve this and make effective use of lines.

However, in a distributed communication network, the stations and lines that make up the communication network are all equal, so not only are there no hierarchies between stations, but there is also no fixed distinction between lines, such as backbone lines or diagonal lines. For this reason, conventionally, each station assigns serial numbers to the lines that can reach the switching center (opposite station) to which the other party's terminal belongs with the least number of relay links. Priority is given to the connected adjacent station with the lowest station number and a serial number is assigned.) When selecting a route to the game, each relay station selects the relay line in numerical order. Note that the 10th line in order is the main line to the game, and all the others are detour lines, which causes the problem that even lines that can reach the game with the same number of relay links as the main line become detour lines. Furthermore, a problem arises in that what is the main line in one game cannot be determined to be a detour in another game.

The present invention solves the above-mentioned problems in distributed communication networks, and copes with increases and decreases in traffic added to the communication network. It is an object of the present invention to provide a communication network control system that aims not only to improve the communication of important communication calls, but also to improve the communication call communication of the communication network as a whole.

According to the present invention, since the restriction stage is determined by comparing the traffic processing capacity of the communication network and the amount of traffic generated within the communication network, there is no need to know about overflow calls on the line in order to determine detour restriction measures. In addition, the lines are divided into the F line group, which can reach each game with the minimum number of relay links, the E line group, which has one more relay link than two lines, and the other B line group, and regulatory measures are taken for each group.
To avoid the problem that there are lines subject to regulation and lines not subject to regulation among lines having the same number of relay links. Furthermore, communication calls are graded according to their importance, and measures are taken to match the grade to the regulatory level, so important communication calls are rarely subject to regulatory measures, and many lines are can be selected as the route, it is expected that communication of important communication calls will be improved.

Hereinafter, details of the communication network control system of the present invention will be explained using the drawings.

Figure 2 shows the relationship between the call volume rate and the rate at which communication calls could not be communicated (hereinafter referred to as blockage rate) in a distributed communication network as F, E,
Characteristics when all B@ lines are selectable as routes (
Curves ■) and F shown by dashed-dotted lines.

This is an example of measuring and showing the characteristics when 8 lines can be selected as a route (curve ■ shown by a solid line) and the characteristics when only 2 lines can be selected as a route (curve ■ shown by a broken line). . As can be seen from this figure, when the call volume rate is 88 or more, only 2 lines are used, when it is less than &2 and greater than 't, F and E lines are used, and when it is less than &1, F and E lines are used. .

When all E and B lines are selected, the blockage rate can be reduced and communication call communication can be improved compared to other cases. Therefore, if the applicable range of the line in route selection is changed in accordance with the traffic capacity of the communication network and the amount of added traffic, the communication network can be used effectively and communication can be improved.

FIG. 3 shows an example of a distributed communication network to which the present invention is applied. st l S! in Figure 3! +...tSS is the switching center, L 1 yl + I7m+ shown by the solid line
lr...

Lt,j, ”・I LaI3 is the communication line name, (L
l, jThe line name seen from Sj from Fi station S11.
Lj.'' indicates the line name seen from station Sj to S, and is the same line. ) , (JM*..., C1,j,...+
C4*5 indicates the channel capacity of the line, and C4*5 indicates the channel capacity of the line.
i, J are the channel capacities of lines Li, J and Lj, i. K is a control device that controls this communication network, and the control device and the switching center S1 are connected by a network management signal line as shown by the broken line in the figure. However, L1 This connection is a line group (Li, j)
Even if you create a side line and use a non-compatible network configuration,
A corresponding network configuration using the line group (Ll,j) may also be used.

FIG. 4 shows the configuration of each part of a control device implementing the present invention.

The control transmitting/receiving unit 1 connects stations S1 to S1 constituting a communication network.
The station group (Sj) adjacent to , and the line Li,j connecting therebetween
The channel capacity C1.5% and the estimated amount of generated traffic between each game 'f1. k and transmits it to the network capacity estimating unit 2, and also transmits the inter-office connection configuration table of the communication network created by the network capacity estimating unit 2 to each station. Furthermore, each station Si receives the number of communication calls F1 that occurred within a unit time, and transmits this to the regulation stage determination unit 3, and at the same time, transmits the regulation stage M determined by the regulation stage determination unit 3 to each station. Send.

The network configuration capacity estimating unit 2 creates an inter-station connection configuration table of the communication network based on the station S1 and the station group (SJ) connected thereto, and transmits this to the control transmitting/receiving unit 1.

Table 1 Table 1 shows the inter-station connection W configuration table of the communication network shown in FIG. The intersection point of the horizontal axis of station S1 and the vertical axis of station Sj in the table represents the presence or absence of the circuit [1tLi,j] between station S1 and station Sj, where 0 means that Li,j does not exist, and 1 means that Li,j does not exist. ,
, indicates the existence of i. Further, the network configuration capacity estimating unit 2 estimates the traffic capacity t Nc of the communication network using equation (1) from the channel capacity C1,j of each line and the average number of relay links ψ, and transmits this to the regulation stage determining unit 3.

(However, N: number of stations, 1) Note that the average number of relay links ψ is the shortest relay link between each station WkDi obtained from the inter-station connection configuration table, and the estimated amount of inter-station traffic sent from each station. Estimation is performed using equation (2) based on l'i and k.

......(2) (However, N: number of stations t'';, k) The restriction stage determination unit 3 totals the number of calls Fi that occurred within a unit time at each station s1, and combines this value with the average pending call count. The traffic volume Qc generated in the communication network within a unit time from time H is estimated using the following equation (3), and the traffic rate P is calculated from Gc and the network traffic capacity NO estimated by the network component capacity estimator 2. It is obtained from the following equation (4), and the regulation step #M is determined based on this value.

P = Gc / Na - (4
) Restriction level M is grade G depending on the importance of the communication call.
If it is divided into stages O to W, it is divided into stages W+2. In this regulation stage M, the threshold value of the traffic rate P is αl.

G1. ..., G1. ...,α,,, (However, G1
By setting G3<G3...α, <...α, Ya3), the call volume rate P is determined as follows depending on the range. When the call volume rate P is greater than or equal to α□ and α1 is smaller than α□≦P<α11□, the regulation stage M is set to 1. (However, 1≦1≦W+1) When P〈αt, M20 is set, and when α1+snow≦P, M=W+2 is determined as the restriction stage f#M, and the control stage f#M is determined and transmitted to all stations through the control transmitting/receiving unit 1. and enforce regulations on all communication calls. It is assumed that the value of the grade level G of a communication call indicates a large call volume and a high importance call, and the grading of the communication call and its level are determined in advance. On the other hand, the value of the threshold α□ and the average holding time H can be changed as appropriate depending on the form of the communication network, channel capacity, nature of the communication call, etc.

FIG. 5 shows a device 5 to be added to the station SZ exchange 4 in order to implement the present invention and the configuration of each part thereof.

The counting unit 6 calculates the data from the terminal joining the local station S1 to the station Sj outside the local station.
When a connection request call is made to the station, the number of outgoing calls F1 per unit time and the number of calls to the SL station Ti,j are measured and sent to the control device through network management signal transmission/reception s7 for each unit time. Send.

Network management signal transmitting/receiving unit 7Vi not only the number of outgoing calls F and the number of calls Ti and j for each station, but also the number of stations adjacent to station S1 (S
1) and the line group (Li,!) connecting between them and their channel capacity C1j are known from the exchange 4, and are transmitted to the control device every unit time, and the detour regulation stage M sent by the control device and the inter-office The connection configuration table is received and notified to the line selection section 9 and the route table creation section 8, respectively.

The route table creation unit 8 creates @L1. each time based on the inter-station connection configuration table.
Lines that can be reached with a small number of relay links even if each game has t are classified into 2 line groups, lines that require more than 1 relay link deposit are classified into 8 line groups, and other lines are classified into 8 line groups. , create a route table. Third
Considering the case of game S2 for station S3 in the distributed communication network shown in the figure, if Ls, 1 is selected, station S2 can be reached with 1 relay link, but if Ls, 5, the number of relay links is 2, Ls,
In the case of 4, it takes 3 relay links, so Ls,1 becomes 1 line, Ls,sHE line, and Ls,4 becomes 8 lines.

Table 2 Table 2 shows the routes for station S3 of the distributed communication network in Figure 3, which are classified into F, E, and 8 line groups for each game based on the inter-station connection configuration table in Table 1. It is a table.

The line selection unit 9 functions to select and find, in the order of F, E, and B@line groups, a relay line that can serve as a route to the game Sj to which the partner terminal has joined. The line selection request is received from the exchange 4 together with information regarding whether the requested call is a grade G1 relay/originating call and the transit station.

FIG. 6 is a flowchart showing the processing operation of the line selection section 9. Decision 10 determines whether there is a line selection request. If there is a request, in process 11, the exchange 4 sends the call grade necessary for line selection \ Grade G 1 The game station Sj 1 to which the other party's terminal has joined, whether it is a relay/outgoing call, and the progress so far in the case of a relay call Get information about stations. Judgment 1
Step 2 determines whether the call is a relay call or an outgoing call. In the case of an originating call, the process goes to step 14, and in the case of a relay call, in decision 13, it is determined based on the past station information whether or not the call to the local station S1 has already passed. If it has already passed, the route will form a loop, so in step 31, the subsequent line selection is canceled and the lines that have been connected so far are released through the entire exchange 4. Processing 1
4, the two line groups to the game Sj are known from the route table and stored. In process 15, one line is randomly selected from the FiF line group and it is checked whether there is an empty channel on that line. Decision 16 determines whether there is an empty channel. If there is an empty channel, the line is determined to be a relay line in step 32, the own station Si is entered in the passing station information, and the exchange 4 is made to connect the line after 1.

If all channels are occupied, in step 17 the selected line is deleted from the stored two-line group. In decision 18, it is determined whether there are any lines stored in the two-line group. If it is stored, the process goes to step 15 and the same process is performed. If it is not stored, in judgment 19, the regulation stage M is compared with the communication call grade G, and M≦(G+
1) Determine whether or not. If M≦(G+1), the call is considered to be regulated and subsequent line selection is canceled in process 31. If M≦(G+1), process 20
Then, the 8-line group to the game Sj is known from the route table, and this information is memorized. In decision 21, it is determined whether there are any lines stored in the 8-line group. If it is not stored, go to judgment 25.

If it is stored, in process 22 one line is selected at random from the 8 line group (□) and checked to see if there is an empty channel on that line. In judgment 23, it is determined whether the channel of that line is empty or blocked. If there is an empty channel, the line is determined to be a relay line in process 32, and subsequent line connections are made by the exchange 4. If all channels are occupied, process 24
Delete the memory of that line from the 8 line group with 1 judgment 2
1 and performs the same judgment process. In judgment 25, the restriction level M is compared with the grade G of the communication call, and it is determined whether the grade is 02M or not. If it is not 02M, this call is treated as a restricted call and subsequent line selection is canceled in process 31. On the other hand, if it is 02M, in step 26, the 8-line group to the game Sj is learned from the route table and stored. Judgment 27
It is determined whether there is a line stored as a ViB line group. If not stored, process 31
to cancel further line selection. If the memory is full, one line stored in the eight line group is randomly selected in step 28, and it is checked whether there is an empty channel on that line. Decision 29 determines whether there is an empty channel. If there is an empty channel, that line is determined to be a trunk line,
The exchange 4 is made to perform subsequent line connections. If all channels are occupied, the line is deleted from the 8-line group stored in step 30, and the process returns to decision 27, where the same processing decision is made again. In process 32, a line to be a relay line is determined, the own station S1 is added to the transit stations, the exchange 4 is made to connect the next station Sj to the game station Sj, and the stored line group is deleted. Return to In process 31, the line selection is canceled, the lines that have been connected so far are released through the exchange 4, the memory regarding the line group is erased, and the process returns to decision 10 to wait for a line selection request.

In this embodiment, the larger the call grade value is, the more important the call is.As the value of the control level M becomes larger, the restriction range is sequentially expanded to calls with a larger call grade G value. In contrast, the lower the grade value of a call, the more important the call is, and as the restriction level increases, the restriction range is expanded to those with lower grade values. As described above, according to the present invention, even in a distributed communication network where it is not possible to determine the application range of detour restrictions based on overflow calls, it is possible to determine the scope of application of detour restrictions based on the number of calls that occur at each exchange and the number of calls that can be processed by the communication network. The application range of detour regulation can be determined from the call volume rate obtained from the ratio of the estimated generated traffic volume. Therefore, even in a distributed communication network, when the amount of traffic added to the communication network increases, the selection of detour lines is restricted,
Configure routes with the minimum number of intermediate links to allow as many communication calls as possible to use the communication network, and when traffic volume decreases, expand the scope of detour application and allow the selection of as many lines as possible. This enables the establishment of a communication route, making effective use of the communication network possible. Furthermore, communication calls are graded according to their importance,
By grading the detour control measures, it is possible to sequentially apply measures to communication calls of a lower grade as the call volume rate increases, thereby improving the communication of important communication calls.

[Brief explanation of drawings]

Figure 1 is a configuration diagram of a commonly used hierarchical communication network, Figure 2 is a graph showing the relationship between call volume rate and blockage rate in a distributed communication network, and Figure 3 is a distributed communication network to which the present invention is applied. FIG. 4 is a configuration diagram showing the configuration of each part of the control device for implementing the present invention. FIG. FIG. 6 is an explanatory diagram showing a processing operation flowchart of the line selection section 9. 01... Control transmitting/receiving section, 2... Network configuration capacity estimating section,
3... Regulation stage determining unit, 4... Exchange, 5... Device to be added to exchange 4, 6... Counting unit, 7'...
Network management transmitting/receiving unit, 8... Route table creation unit, 9... Line selection unit. Patent applicant Director of the Technical Research Headquarters, Agency of Defense Yukie Omori Patent attorney Takashi Murai Figure 1 al al 0051Ω 1°1 quantity Figure 2

Claims (3)

[Claims] (1) In a distributed communication network, a line that connects exchanges in a communication network becomes an optimal line or a detour line depending on the exchange station (hereinafter referred to as the other station) K to which the other party's terminal belongs, and can be added to that communication network. A detour line can be selected as a route according to the ratio between the estimated traffic capacity and the traffic volume estimated based on the number of communication calls actually occurring within the communication network (hereinafter referred to as the call volume rate). Determine the scope of application, notify all exchanges that make up the communication network, and allow each exchange to select a circuit as a route, and only select a detour line up to the scope of application for which it was decided. From TotoK, a communications network control system designed to improve communications. (2) Among each line, the line that can reach each game station at each exchange with the minimum number of relay links is called F line (optimal line) K.
The lines that can be reached with the minimum number of relay links + 1 and the other lines are respectively 8 lines and B times I.
ii! (Detour line), and in selecting the route line, the call volume rate P is smaller than a certain threshold (P<α
When υ, all F, E, and B lines are selected, but when the call volume rate P is greater than or equal to the threshold α1 and smaller than the other threshold α (α1≦P<α,), the J8 line is selected. target, and the call volume rate P exceeds the threshold α3 (false ≦
2. The communication network control system according to claim 1, wherein in case P), only the F line is selected, thereby making more effective use of the line. (3) Grading communication calls from 0 to W according to their weight [L nature (however, if no grading is done, W = 0)
) and W + 2 stages of threshold αi (1≦i
≦W+2), and the call volume rate P is smaller than the threshold α (
P<αI), the regulation stage M is set to 0, and when the threshold value α1 or more is smaller than αl+1, the regulation stage M is set to i (1≦i≦
W+1), the threshold αw+! In the above case, the restriction level M is determined to be W+2, this restriction level M is notified to each switching center, and each switching center selects the route route. G≦W) Regulation stage M at that time
When M is 2 or more larger than G (M≧G+2), K selects only 2 lines, and when M is 1 larger than G (M=G+1), F selects 8 lines. However, when M is less than or equal to G (M≦G), F,
E, From K to select all BIJ lines,
Claim #! characterized by improving communication of important communication calls and making effective use of lines! The communication network control method described in paragraph 1 or paragraph 2.