JPH0236692A - Line 2-way operating system - Google Patents

Abstract

PURPOSE:To avoid double acquisition till remaining idle lines finally reaches one line without causing a potential partial wear or line fault by inserting an idle line after the use of line to a prescribed position in the intermediate of idle line string and acquiring a line from both ends of the idle line at both exchange points. CONSTITUTION:Two exchange points (a), (b) are connected by a line group (c) and when a call is directed from the exchange points (a), (b) to the opposite points each other, then an idle line is acquired from the line group (c) and used. In this case, when the line transited into the idle state from the busy state is added to an idle line, it is inserted in the vicinity of the middle point of the lines at all times, then the lines are acquired in the nearly same sequence as that of the transit to the idle state. Thus, no locarization is caused in the busy rate of the lines and no line fault is brought into a potential fault state and since idle lines are acquired from both ends of the lines, no collision (duplicate acquisition) is caused till the number of idle lines finally reaches one.

Description

[Detailed Description of the Invention] [Field of Industrial Application] The present invention relates to a communication line bidirectional operation system in which a communication line connecting two switching points can be captured from either switching point. In particular, the present invention relates to a line bidirectional operation system suitable for avoiding simultaneous acquisition of the same line by both switching points (hereinafter referred to as double acquisition).

[Conventional technology]

The conventional line bidirectional operation method for avoiding double capture is as described in Japanese Patent Application Laid-Open No. 59-221060, in which the line that has become trapped after being captured and used by Party A is used to The line that became stuck after being captured and used by Party B is added to the other end of the above line string. In addition, when renewing line 1, Party A will seize the fixed line from one end of the complete line string formed as described above, and Party B will seize it from the opposite end. By doing this, the line capture M& order of C, A, and B will be in exactly the opposite direction with respect to the above vacant line string, so the situation of double capture in which the same line is captured at the same time by both A and B exchange points can be avoided. It is said that Friend, the above-mentioned document also describes a technique for reducing the rate at which two parties simultaneously seize the same line by randomly picking out free lines.

[Problem to be solved by the invention]

In the above-mentioned conventional technology, the end point of the line string to be captured is the same as the end point to which the line that becomes idle after being used is added.
The most recently added line will be captured! 0(
(LIFO queue), the line that was added to the queue as a subordinate line the oldest is rarely used, and the usage rate is uneven depending on the line, and in exchanges that use electromagnetic switches, the switch that accommodates the line is uneven. This will cause wear.

Furthermore, even in switchboards that do not suffer from uneven wear, there may be lines that are not used for the first time even if there is a line failure.
There is a possibility that line failure may become latent.

Furthermore, in the case of random acquisition, the above-mentioned problems may be reduced, but the situation of double acquisition due to A-B and C-C exchange points cannot be completely avoided.

An object of the present invention is to provide a line in both directions that can capture lines evenly and avoid double capture until there is only one remaining free line, without causing uneven wear or latent line failure. The aim is to provide all operational methods.

[Means to solve the problem]

The above object is achieved by inserting a line that has become idle after the line is used into a predetermined position in the middle of a line of idle lines, and by having both switching points seize lines from both ends of the idle line.

[Effect]

Instead of adding a line that has become stuck after being used, add it to a predetermined position in the middle of the free line, instead of adding it to the end point of the stuck line, and when capturing the line, capture it from the end point of the free line (
(FIFO key), there is no imbalance in the line usage rate and there is no risk of line failure. Furthermore, since the captured lines are captured from both ends, there will be no collision (double capture) until the last blocked line is reached.

〔Example〕

Hereinafter, one embodiment of the present invention will be described with reference to the meat side.

FIG. 1 is a configuration diagram of a line network to which a line bidirectional operation system according to an embodiment of the present invention is applied. two exchange points a, b
are connected by line group C, and when exchange points a and b send a call to each other's exchange point, a vacant line from line group C is captured and used.

FIG. 2 is an explanatory diagram of an idle line string in which only idle lines are lined up among the line group C shown in FIG. 1.

Assume that there are n complete lines in line group C, and these are a series of numbers 1, 2, . ..., n-1, n are attached. When a line is acquired from this rough line string, the line is acquired from the side of the dependent line 1 of the exchange point aid, and the line is acquired from the side of the dependent line n of the exchange point AID.

FIG. 3(a) shows a case where the number of vacant lines is n and 4. The numbers 1 to 4 assigned to each line indicate the number of nine times each line goes from a busy state to an idle state. From this state, a new t [If the line 5 changes from the in-use state to the stuck state, it is inserted near the center of the lines included in the above-mentioned stuck line string. Accordingly, line 5 is inserted between line 3 and line 4 as shown in the fifth factor @). From this state, one more circuit @ 6 becomes stuck, and since the center of this circuit array in Fig. 5 (b) is circuit 5, either side of it (here, it is defined as the right side) Insert into. As a result, the line string shifts to the state shown in FIG. 3(c). Here, the exchange point α
If exchange point b (first cause) captures all circuits in order to use circuit a, then exchange point α acquires the leftmost circuit $2, and switching point b (first cause) captures the rightmost circuit 1. Therefore, after both exchange points α and b acquire
The state shifts to the state shown in Figure (d). ζ When the new line 7 changes from being in use to being stuck, it is inserted into the center of the 72 lines of the idle line as shown in FIG. 3(e).

When adding lines that have transitioned from busy to stuck state to the free line string as described above, if you always insert them near the center, they will be stored in almost the same order as the lines that transitioned to free state (FIFO).
You can grab the line and go. Also, both exchange points α
, b will seize the same line, which is a double capture situation, which will not occur until the remaining nine lines become the last one. In the above-described example, it is assumed that the switching points α and b have almost the same frequency of catching a dead line.

Next, a case will be described in which the capture frequency of one of the exchange points is higher than the other. For example, if the frequency at which exchange point α makes calls to b is twice the frequency at which b makes calls to α, then α's line acquisition frequency is also twice as high as that of b. In this case, as shown in Fig. 4, the insertion position 21 of the new fixed line in the fixed line row is the distance from the end point X on the side where α is captured: The distance from the end point Y on the side where b is captured Set it so that the ratio is 2:1. This is it, 9FIF
The acquisition order of O can be almost maintained. In addition, by making this insertion position variable depending on the situation, even more FIFO
It becomes possible to strictly enforce compliance with the rules.

The above-mentioned formation and rearrangement of the next line array can be easily realized in an exchange equipped with a rewritable memory. FIG. 5 shows the memory configuration corresponding to the empty line strings shown in FIGS. 3(a) to (c), in which each empty line 1. ．． 5.
4.2 corresponds to the memory 21.23.24.22 (hereinafter referred to as line memory) and are connected to each other like a chain (hereinafter referred to as idle chain).Line memory 21 corresponds to line 1,
Line memory 22 corresponds to line 2, line memory 25 corresponds to line 3, and line memory 24 corresponds to line 4. 211 in the line memory 21 is a line identifier (
LD), and is associated with line 1. The forward pointer (FP) 212 is a pointer that stores the start address of the line memory on the right. In the case shown, since the line memory on the right is 23, its start address is stored therein. Backward pointer (BP) 21
3 is a pointer for storing the start address of the line memory on the left; in the case shown, 101 is set because there is no line memory on the left. Similarly, line memory 26
The 0 backward pointer 233 stores the address of the line memory 21 on the left. In the illustrated case, the forward pointer 222 of the line memory 22 is set to 01 because there is no line memory on the right side.

The head pointer (HP) 11 is a memory that stores the address of the line memory 21, which is the end point on the side of the exchange point α, and the tail pointer TP13 is a memory that stores the address of the line memory 22, which is the end point on the side of the exchange point α. be.

Counter (c) 14 is a memory that stores the number of idle lines, that is, the number of line memories in the idle chain.

In FIG. 5, there are four line memories, numbered 4'. An intermediate pointer (MP) 12 is a memory that stores an address that points to an intermediate point at which a line that changes from "in use" to "end" is inserted into the idle chain. In this example, the middle point of the idle chain is the center position from both sides. In this case, the [ of the intermediate pointer 12 is the ! of the counter 14 . It is found by dividing by 2'.

In the case of FIG. 5, the address of the second line memory 23 from the left is set in the intermediate pointer 12. If the line memory 25 is definitely empty, the address of the line memory 23 is obtained by referring to the intermediate pointer 12, and the backward pointer 253 is filled with the line memory 23.
The address of the line memory 24 determined by referring to the forward pointer 232 is set in the forward pointer 252, and the address of the line memory 24 determined by referring to the forward pointer 232 is set in the forward pointer 252.
43 and forward pointer 252 have line memory 2.
Set the address of 5.

On the other hand, the counter 14t/'i adds +1 to its own content, making it 51. The intermediate pointer 12 divides the value ``5'' of the counter 14 by 12'' and the answer is 12'' with a remainder of 1'', so the intermediate pointer 12 updates the value and moves the line memory to the next position, second from the left. In this way, the idle chain shown in Fig. 6 is formed.When inserting a new line memory 26 into the idle chain from this state, add it to the right side of the line memory 25 in the same manner as above. , the counter 14 is incremented by +1 and updated to 161, and the intermediate pointer 12 is divided by 6' by 12', and the answer is 3''.
There is no remainder, so no update is performed. In this way, the idle chain shown in FIG. 7 is formed.

When inserting a line memory next time, it is added to the right side of the line memory 25. By updating the idle chain in this way, a new line memory can always be inserted almost at the center. If the exchange point α performs a rough line capture from the state shown in FIG. 7, the address of the line memory 21 can be immediately known from the head pointer 11.

When removing the line memory 21 from the idle chain, the value of the head pointer 11 is updated to the address of the line memory 23 obtained by referring to the pointer 212. 111 is subtracted from ``61'' to the nitride line counter 14, which is 15'.
Set. Dividing the value of this counter 14 by ``5''i''2', the answer is 121, with a remainder of 11, but since it is a subtraction, we do not update the second line.When capturing the line in this way, can change the idle chain m by performing the reverse process of inserting a dead line.

According to this example, by rearranging the memory contents on the storage device, exchange points α and b can acquire the line in opposite directions, without double acquisition, and in FIFO order. It becomes possible. Here, we have described the case where the insertion position of the idle line is at the center of the idle chain, but even if it is biased toward either end point, the insertion position can be easily calculated from the circular kakunta. Furthermore, although an embodiment using memory operations has been described here, it is also possible to implement the same logic using only hardware.

[Effects of the Invention] According to the present invention, opposing exchange points acquire lines in reverse order, starting from the oldest line (FI
(in the order of FO), it is possible to equalize the usage efficiency of each line, and prevent uneven wear and potential line failures.

[Brief explanation of the drawing]

FIG. 1 is a configuration diagram of a line group to which an embodiment of the present invention is applied;
Figure 2 is an explanatory diagram of an empty line string that combines all the lines in the MA group, and Figures 5 (a), (b), (c),
(d). (e) is an explanatory diagram of adding a dead line according to an embodiment of the present invention, FIG. 4 is an explanatory diagram of a vacant line insertion position, and the fifth figure is an explanatory diagram of the idle line insertion position. Figures 6 and 7 are shown in Figure 6 (a), (b), (c
) is an explanatory diagram illustrating an example of a memory update showing the entire method of adding a free line explained in 2. a, b...switching point, C...line group, X, Y...
・End point, Z...insertion position, 1 to n, (1-digit number)
...Free line, 11...Head pointer, 12...
Intermediate pointer, 13...Tail pointer, 14...Counter, 21.22.23.24.25°26...Line memory, 211.221.231.241.251.
2<51...Line identifier, 212.222.232
, 242.252.262 ,...forward pointer, 213.223.233.245.255.265
...backward pointer. Island f, 2nd ward＼ ・Rino

Claims (1)

[Claims] 1. It is equipped with a means for storing the order in which the lines connecting two exchange points become idle after being used, and the memory means regularly arranges the idle lines to form a line array, and when capturing the idle lines, In a line bidirectional operation system in which one switching point acquires the line from one end point of the line string and the other exchange point seizes the line from the opposite end point of the line string, the line becomes vacant after being used, A line bidirectional operation system characterized in that lines are inserted at predetermined positions in the middle of the line string according to the number of vacant lines included in the line string.