JP2001256157A - Network system, communication terminal equipment and repeater connection destination decision method for communication terminal equipment - Google Patents

Abstract

PROBLEM TO BE SOLVED: To surely connect respectively communication terminal means to a repeater for almost equalizing load balance with excellent processing efficiency. SOLUTION: A priority information generation processing part 5 decides the priority order of the repeater 1 to be a connection destination for each communication terminal equipment 2 and generates a priority chart 6. At the time, the connection number of each communication terminal equipment 2 to the repeater 1 during an operation is set to be almost equal. The connection destination repeater decision processing part 9 of the communication terminal equipment 2 decides the repeater 1 to be the connection destination by referring to the priority chart 8 storing the priority information delivered by a priority information delivery processing part 7 at the time of connecting the repeater 1. When the connected repeater 1 becomes unusable, the repeater 1 of the next priority order set in the priority chart 8 is reconnected.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

The present invention relates to a network system having a plurality of repeaters and communication terminals.
The present invention relates to an improved method of determining a connection destination repeater of each communication terminal device, which can substantially equalize a load applied to each relay device when the communication terminal device is connected.

[0002]

2. Description of the Related Art In a network system provided with a plurality of repeaters, each communication terminal device communicates with an information processing device or another communication terminal device connected to a network via one of the repeaters. Can be. If a repeater connected during network access fails, the communication terminal device can continue to access the network by autonomously reconnecting to another repeater that has not failed. At this time, when there are a plurality of repeaters that are candidates for the reconnection destination, the communication terminal device connects to any one of the repeaters once, and receives an instruction from the central control device monitoring the load of each repeater. Receive and reconnect to a repeater with less load. In this way, by determining the reconnection destination of each communication terminal device, the load balance between the repeaters constituting the system is maintained.

[0003]

However, as in the prior art, the communication terminal device is connected to one of the remaining repeaters, grasps the load of the repeater, and then determines the reconnection destination. Then, if the load on the repeater once connected is large, the communication terminal device will reconnect to another repeater with a smaller load. In such a case, as a result, an extra processing load is applied to the communication terminal device and the repeater. Further, if the communication terminal device is a mobile phone or the like, a fee will be charged each time the terminal is reconnected to the repeater.

SUMMARY OF THE INVENTION The present invention has been made to solve the above problems, and an object of the present invention is to connect each communication terminal means to a repeater having a substantially equal load balance with certainty and processing efficiency. It is an object of the present invention to provide a network system and a method of determining a relay terminal connection destination of a communication terminal device.

Another object of the present invention is to provide a communication terminal device which can be reliably connected to a repeater having a substantially equal load balance without being connected to any repeater.

[0006]

In order to achieve the above object, a network system according to the present invention comprises a plurality of repeaters and a known number of network devices connected to one of the repeaters for network access. In the network system having the communication terminal means, the priority order of connection of each communication terminal means to the repeater is displayed so that the number of connections of the communication terminal means to each of the active repeaters is substantially equal. Priority information generation processing means for generating priority information, and priority information delivery processing means for delivering the priority information set to each of the communication terminal means to each of the communication terminal means; Means for deciding a connection destination to the repeater in accordance with the delivered priority information on the own communication terminal means.

[0007] Further, each of the communication terminal means includes a priority information storage means for storing at least priority information on the own communication terminal means generated by the priority information generation processing means, and a priority information storage means. Connection destination repeater determination processing means for determining the repeater to be a connection destination in accordance with the given priority information.

[0008] The priority information generation processing means may include N
(N is a natural number of 2 or more) The communication terminal means are divided into groups for each number m of the repeaters (m is a natural number of 2 or more) to form one or more repeater priority sequences; The m repeaters are arranged in order to form a basic permutation, and the arrangement of the repeaters forming the basic permutation is rotated one by one to form a total of m permutations. Priority information is generated by assigning one of the formed permutations to each repeater priority sequence.

Further, according to the present invention, there is provided a communication terminal apparatus for performing network access by connecting to any one of a plurality of repeaters included in a network system. Priority information storage means for storing priority information indicating a predetermined priority order of connection to the repeater, so that the number of connections of the communication terminal means to the relays is substantially equal, and the priority information storage And a connection repeater determination processing means for determining the repeater to be a connection destination according to the priority information stored in the means.

Further, according to the method for determining a repeater connection destination of a communication terminal apparatus according to the present invention, m (m is a natural number of 2 or more) repeaters and one of the repeaters is connected to perform network access. (N is a natural number of 2 or more) communication terminal devices, wherein each of the communication terminal devices is connected to the relay device according to a priority order for connecting to the repeater set for its own communication terminal device. In a network system for determining a repeater, one or more repeater priority sequences are formed by dividing the communication terminal device into groups of m units, and the m permutations are arranged in order to form a basic permutation. , And rotating the arrangement of the repeaters constituting the basic permutation one by one to form a total of m permutations, and for each priority, the communication terminal apparatus for each of the active repeaters As the number of connections is substantially uniform,
By assigning one of the formed permutations to each repeater priority sequence, the priority of connection of each communication terminal device to the repeater is determined.

[0011]

Preferred embodiments of the present invention will be described below with reference to the drawings.

FIG. 1 is an overall block diagram showing an embodiment of a network system according to the present invention.
As shown in FIG. 1, the network system according to the present embodiment has a plurality of repeaters 1, and each communication terminal device 2 communicates with a desired one such as a Web server 3 via any one of the repeaters 1. Communicates with the other party. As the communication terminal means, a computer or a mobile phone having a communication function can be assumed. The network management device 4 included in the network system controls and manages the entire network system, and keeps track of the number of repeaters 1 and communication terminal devices 2 that constitute the system. The priority information generation processing unit 5 generates a priority table 6 described later based on the number of repeaters 1 and the like. Priority information delivery processing unit 7
Distributes the priority information set to each of the communication terminal devices 2.

Each communication terminal device 2 has a priority table 8 for storing information relating to its own communication terminal device among the priority information included in the priority table 6 generated by the priority information generation processing section 5. And a connection destination repeater determination processing unit 9 for determining the relay 1 to be a connection destination according to the priority table 8.

FIG. 2 is a diagram showing an example of the contents of the priority table 6 generated by the priority information generation processing unit 5. In this example, there are four repeaters 1 of repeaters A to D, and the communication terminal device 2 has the terminal No. This is an example in the case where there are 20 units 1 to 20.
The contents of this priority table are interpreted as follows. For example,
Terminal No. The first priority of the first communication terminal device 2 is “A”, the second priority is “B”, the third priority is “C”, and the fourth priority is “D”. Therefore, terminal N
o. The first communication terminal device 2 is initially connected to the repeater A of the first priority, and accesses the network via the repeater A. When the repeater A becomes unreachable due to a failure or the like, the second priority repeater B
And reconnect. If the repeater B cannot be connected due to a failure or the like, the repeater C is reconnected to the repeater C.
If the connection is not possible, reconnect with the repeater D.
In the priority table 6 generated by the priority information generation processing unit 5, priority information indicating the order of connection of each communication terminal device 2 to the repeater 1 is set. Note that the priority table 8 of the communication terminal device 2 only needs to include at least information on the own communication terminal device in the priority table 6 generated by the priority information generation processing unit 5.

What is characteristic in the present embodiment is that the connection order of each communication terminal device 2 to the repeater 1 is indicated based on the number of repeaters 1 and communication terminal devices 2 in the system according to the rules described later. A priority table 6 is generated, and a priority table 8 including a connection order set for itself is stored in advance in each communication terminal device 2, and relaying is performed according to the set connection order at the time of network access. This is to connect to the vessel 1. Thereby, the communication terminal device 2 can maintain the load balance between the repeaters in the system only by connecting to the repeaters 1 in the order set in the priority table 8 in advance. Here, this priority table 8
The effect of using is described first.

In FIG. 2, when all the repeaters A to D are operating without failure, all the communication terminals 2
In each case, the repeater set to the first priority is selected.
At this time, for example, No. 1,5,9,
This means that five communication terminal devices 13 and 17 are connected. FIG. 3 shows a table specifically showing the communication terminal devices 2 connected to the respective repeaters A to D.
D, five communication terminal devices 2 are connected,
It can be seen that the load on each repeater 1 is evenly distributed. Here, if it is assumed that the repeater D has failed, the No. connected to the repeater D is no. 4,8,12,16,2
The five communication terminal devices 0 must be reconnected to another repeater 1. At this time, each corresponding communication terminal device 2 autonomously reconnects to each repeater 1 set to the second priority of its own communication terminal device. Repeater D
FIG. 4A shows a priority table 8 indicating that the communication terminal device 2 has failed, and FIG. 4A shows a connection destination of each communication terminal device 2 after the relay device D has failed and the corresponding communication terminal device 2 is reconnected. It is shown in b). Similarly, the connection destination of each communication terminal device 2 after the repeaters A to C fail and the target communication terminal device is reconnected is shown in FIG.
(C) to (e) respectively. As shown in FIG.
As is clear from the result of the reconnection, the priority table 8
, The load on each repeater 1 can be distributed almost equally.

As described above, according to the present embodiment, even if any of the repeaters 1 fails, the load balance between the repeaters can be maintained substantially evenly. It can be understood that the priority table 6 generated by the unit 5 is a very important element. Below, priority table 6
Will be described.

In the present embodiment, the repeater 1 to be set to each priority is determined for each communication terminal device 2 in order from the higher order. First, the process of determining a repeater to be assigned to the first priority in the priority table 6 will be described.

The number of communication terminals (hereinafter simply referred to as “terminals”) 2 is N (N is a natural number of 2 or more), and the number of repeaters is m (m is a natural number of 2 or more). Connect entire device
Divide into groups of m units. If the number of terminals is not divisible by m (N mod m ≠ 0), the number of terminals is corrected to an integral multiple of the number of repeaters by adding m−N mod m to N to generate a frame of the priority table 6. . The last one added to this priority table 6
Information about the terminal for m−N mod m is removed at the end of the priority table generation processing. Correction operation for this surplus is defined as correction operation 1.

Let C be the repeater priority sequence for a group of m consecutive terminals. Let C [1] be the repeater priority sequence for the first m terminals (that is, the repeater priority sequence for the mth terminal from the first terminal), and set the repeater priority for the next m terminals. The column (ie, the repeater priority sequence from the (m + 1) th terminal to the 2mth terminal) is C [2], and thereafter, the repeater priority sequence C [n] for each successive m terminals
Set. The repeater priority sequence C [n] is mn−m + 1
It can be defined as a repeater priority sequence for a group from the ith terminal to the mnth terminal (mn is the product of m and n). When the number of terminals is N, the number of elements of the repeater priority sequence C in consideration of the correction operation 1 is (N + m) / m-1. The repeater priority sequence C [n] includes repeaters from the first priority to the m-th priority. The repeater priority sequence in the i-th priority (or also referred to as “i-th priority”) of the repeater priority sequence C [n] is C
Expressed as [n] [i].

Here, when the number of repeaters is m, each repeater is M [k] (k = 1,..., M), and the permutation R [0] = {M [1],
M [2],..., M [m]}. This permutation R [0] is set as a basic permutation. The permutation obtained by rotating the elements of the permutation R [0] leftward k times is R
[k]. R [m] = R
[0]. As a specific example, if the above (m =) four repeaters exist, M [1] = A, M [2] = B, M [3] = C, M [4] = D , R [0] = {A, B, C, D} and R [1] = {B, C, D, A}. Also, R
[2] = {C, D, A, B}, R [3] = {D, A, B, C} and R [4] = {A, B, C,
D}, R [m = 4] = R [0]. Therefore, m permutations starting from the repeaters A to D are formed.

Each repeater priority sequence C [n] [1] of the first priority
, The repeater assigned to the first priority of each terminal is determined by giving the circulation of R [0]. That is, assuming that the number of elements of the repeater priority sequence C in consideration of the correction operation 1 is S, S = (N + m) / m-1 (N is the number of terminals and m is the number of repeaters). Each repeater priority sequence C [n] [1] (n =
1 ... S) are given by the algorithm shown in FIG.

The (N =) 20 terminals shown in FIG.
=) If specifically explained based on the example of four repeaters, the number of elements S of the repeater priority sequence C is 5, so that the terminal No. 1 to
R [0] = {A, B, C, D} is set for each of five sets of 4, 5 to 8, 9 to 12, 13 to 16, and 17 to 20. Thus, when the number of terminals is an integral multiple of the number of repeaters, R [0] is assigned to the first priority of each of the N terminals in order from the repeater priority sequence C [1] [1]. By doing so, the number of terminals 2 connected to each repeater 1 becomes uniform when all the repeaters 1 are usable.

Next, the process of determining a repeater to be assigned to the second priority in the priority table 6 will be described.

A permutation R [1] is assigned as the second priority of the second priority repeater priority sequence C [n] [2] composed of the first m terminals. Also, for the next m units,
Assign permutation R [2]. Generally, the terminal is T [k] (k = 1, 2,
, n), the permutation R [N] is assigned to terminals from T [(N−1) m + 1] to T [Nm]. Where N = 1, 2, ... m-
Is one. By doing so, for example, M [2] = B and M [1] = A as the first priority repeater of the first terminal that assigned M [1] = A as the first priority repeater. M [3] as the second priority repeater of the next terminal assigned as the priority repeater,
Assign repeaters 1 other than M [1] in order. As a result, if the repeater M [1] becomes unusable, each terminal connected to M [1] as the first priority repeater becomes M
Since the distribution is evenly distributed to each repeater 1 from [2] to M [m], the number of terminals connected to each repeater 1 is substantially equal. Each repeater priority sequence C [n] [2] (n =
1... S) are given by the algorithm shown in FIG.

The (N =) 20 terminals shown in FIG.
=) More specifically, based on the example of four repeaters, the first repeater priority sequence C [1] [2] of the second priority, that is, the first terminal No. R [1] = {B, C, D, A} is set in the set of Nos. 1 to 4, and the repeater priority sequence C [2] [2] next to the second priority, that is, terminal No. R [2] = {C, D, A, B} for the set of Nos. 5 to 8, and the next repeater priority sequence C [3] [2], that is, the terminal No. R [3] = {D, A, B, C} is assigned to the set of 9 to 12. Then, the next repeater priority sequence C [4] [2], that is, the terminal No. 13-1
R [1] = {B, C, D, A} is assigned back to the set of 6. That is, in the example shown in FIG. 2, R [1] to R [3] other than R [0] assigned to each repeater priority sequence in the first priority are assigned while circulating.

Next, a process of determining a repeater to be assigned to the Kth (K ≧ 3) priority in the priority table 6 will be described.

If K = m (m is the number of repeaters), repeaters that do not appear in each repeater priority sequence up to the (K-1) th priority are assigned. In the case of K <m, one of the permutations R [n] (n = 1 to m−1) not allocated to each of the repeater priority sequences up to the K−1 priority is sequentially allocated. Become. For example, according to the example shown in FIG. 2, the repeater priority sequences C [1] [1] and C [1] [2] of the first and second priorities have R [0] and R [0] respectively.
Since [1] was assigned, the third-rank repeater priority sequence C [1]
Either R [2] or R [3], which has not been assigned yet, is assigned to [3]. However, here, not only the terminals to which the repeaters M [k1] and M [k2] are assigned as the first priority and the second priority repeaters, but also the terminals to which M [k2] and M [k1] are assigned. It needs to be considered. That is, for example, the first and second
It is not possible to assign the repeaters A and B to the terminals to which the repeaters A and B are assigned to the respective priorities and to the terminals to which the repeaters B and A are assigned respectively to the third and subsequent priorities. Can not. In order to consider such a combination, the property of the permutation R [k] generated by rotating the permutation R [0] to the left is used.

Here, the terms congruence and phase congruence used in the following description will be explained.

The combination of the repeaters (M [k1], M [k2]) and (M [k
2], M [k1]) are said to be congruent, and (M [k1], M [k2]) = (M [k
2], M [k1]). This corresponds to the relationship between the terminals to which the repeaters A and B and the repeaters B and A are assigned to the first and second priorities, respectively. Similarly, the permutation combination (R [k1], R [k2]) and (R [k2], R [k1]) are congruent,
(R [k1], R [k2]) = (R [k2], R [k1]). Furthermore, it can be said that two identical combinations (R [k1], R [k2]) and (R [k1], R [k2]) are also congruent. Similarly, congruence can be defined for combinations of three or more repeater permutations. For example, (R [k1], R [k2], R [k3]) = (R [k
1], R [k2], R [k3]), (R [k1], R [k2], R [k3]) = (R [k
1], R [k3], R [k2]) are also congruent. FIG. 7 shows a flowchart for determining whether or not the repeater priority sequences C [a] and C [b] including the repeaters up to the k-th priority are the same.

Next, phase congruence will be described.

Repeater 1 consisting of a combination of two permutations
Does not change even if each permutation is further rotated k times. For example,

(Equation 1) Then (R [1], R [2])

(Equation 2) In any combination of (R [0], R [1]) and (R [1], R [2]), the combination of repeaters (A, B), (B, C),
(C, D) and (D, A) are included. Thus, the permutation combinations R [k1], R [k2] and R [k1 +
d] and R [k2 + d] are said to be congruent, (R [k1], R [k2])
≡ (R [k1 + d], R [k2 + d]). Also, d at this time is called a phase difference. A congruent combination is
This is a combination of 0 phase difference. Similarly, in a combination of three or more repeater permutations, (R [k1], R [k2], R [k3]) ≡
(R [k1 + d], R [k2 + d], R [k3 + d]).

The phase congruence in a combination of three or more repeater permutations can be considered as follows. Repeater
Whether or not the combination of the two repeater permutations when there are m pieces is phase congruent can be determined based on whether or not the polygons formed by connecting some vertices of the regular m polygon are congruent graphically. This concept is shown in FIG. FIG. 8 shows a regular hexagon representing a case including six repeaters. FIG.
In (a), following each vertex clockwise, R [0]
It can be seen that a triangle is generated by R [2] sandwiching one permutation from R [0] and R [3] adjacent to R [2].
In FIG. 8B, although the permutations located at the vertices generating the triangle are different, R [2], R [4] sandwiching one permutation from R [2], and R [4] are adjacent to each other. It can be seen that a triangle is generated by the obtained R [5], and a triangle is generated by vertices having the same positional relationship as FIG. 8A. Such a permutation is called phase congruence. This relationship applies not only to hexagons but also to other polygons. FIG. 9 shows a flowchart for determining whether or not the repeater priority sequences C [a] and C [b] including the repeaters up to the k-th priority are in phase.

The process of determining a repeater to be assigned to the first third priority among k ≧ 3 will be described below. In addition,
The relay priority of the K-th priority can be determined by the algorithm shown in FIG.

With respect to a combination of two repeater permutations having a phase congruency, if any two units become unusable, terminals can be connected to the other remaining repeaters by approximately the same number. The third repeater permutation must be such that adding this repeater permutation does not result in phase congruence with other repeater permutations.

Here, in the repeater permutation, (R [0], R [mk]) ≡ (R [0], R [k]) (k = 1, 2,..., M
-1) holds. Further, the phase difference of these combinations is k. Because (R [0], R [mk]) = (R [mk], R [0]), and (R [mk], R [0]) ≡ (R [m-k + k], R [0 + k]).

Since (R [m−k + k], R [0 + k]) = (R [m], R [k]) = (R [0], R [k]), (R [0], R [mk]) ≡ (R [0], R [k]) holds. It should be noted that, when illustrated by using a polygon as shown in FIG. 8, it can be easily grasped that the above equations hold.

Therefore, for example, when the repeater permutation as shown in FIG. 11 is assigned, (R [0], R [1]) and (R [0]) located at both ends of the table shown in FIG. ], R [m-1]) are the phase congruence of the phase difference 1, and therefore, it is necessary to assign a repeater permutation having a combination other than the phase difference 1 to the third priority repeaters corresponding thereto. For example, (R [2], R [1]) has a phase difference of 1. Therefore, R [2] on the left end and R on the corresponding right end
When [1] is assigned, (R [0], R [1], R [2]) and (R [0], R [m-
1] and R [1]) are congruent, and if two repeaters become unusable, the number of terminals connected to each of the remaining repeaters will not be uniform. Therefore, different permutations must be assigned. This will be specifically described with an example.

For example, in the case of four repeaters A to D, R
[0] = {A, B, C, D}, R [1] = {B, C, D, A}, R [2] = {C, D, A,
B}, R [3] = {D, A, B, C}, and the first and second priorities are as shown in FIG. 12A according to the above-described processing.

Here, {R [0], R [1]} and {R [0], R [3]} located at both ends of the table in FIG. Because of the relationship, as the repeater permutation of the second priority, R
Combinations such as [2], R [1] and R [3], R [2] cannot be selected. If any other repeater permutation, the remaining repeater 1
, The number of connected terminals can be made uniform.
For example, a combination of R [2] and R [2] may be used. Also,
In the second position (R [0], R [2]) in FIG. 12 (a), there is no repeater permutation to be a set for determining whether or not the phase is congruent, so that R [0], R [0] Repeater permutation other than [2] (R [1], R [3], etc.)
Can be assigned. As a result of this processing, the repeater permutation including the third priority is as shown in FIG. FIG. 12C shows a priority table in which the repeater names are specifically written in FIG. 12B. FIG. 13 shows the connection status of each terminal when any two repeaters become unavailable according to this priority table. As is clear from FIG. 13, even when one or two repeaters become unusable, the load balance for the remaining repeaters is maintained evenly. 2 according to the priority table 6 shown in FIG.
FIGS. 14A and 14B show communication terminal devices connected to each of the repeaters A and D when the repeaters become unusable. Further, FIGS. 14 (c) to 14 (g) show communication terminal devices when two repeaters in other combinations become unusable.

As described above, the priority information generation processing section 5 in the present embodiment arranges and rotates a known number of m repeaters 1 in order, and performs m permutations R [0] to R [m. -1], and by dividing a known number of N communication terminals 2 into groups for each number of repeaters 1, S (= (N + m)
/ m-1) number of repeater priority sequences, and assigning one of the formed permutations to each repeater priority sequence for each priority according to the above-described process. Has been generated. This means that the priority of connection of each communication terminal device 2 to the repeater 1 is determined for each repeater priority sequence.

The priority information generated as described above is sent to each communication terminal 2 by the priority information delivery processing unit 7.
Delivered to The priority information delivery processing unit 7 extracts the corresponding priority information from the priority table 6 and delivers it to each communication terminal device 2. Of course, the priority table 6 may be delivered as it is.

Each communication terminal device 2 stores the transmitted priority information as a priority table 8. When communicating with a desired destination, the connection destination repeater determination processing unit 9 determines a relay destination to be connected according to the priority order set for the own terminal. That is, if the repeater 1 set to the first priority is in a usable state, the communication is performed by connecting to the repeater 1. Then, when the repeater 1 becomes unusable due to a failure or the like, it is reconnected to the repeater set to the second priority. When reconnecting, the communication terminal device 2
Only refers to the priority table 8 stored therein, so that the processing load for determining the reconnection destination is almost negligible. And, as described above, if the connection to the repeater 1 determined according to the priority table 8 is made again, the load balance between the repeaters is maintained. Also, when the failed repeater 1 is restored and incorporated into the network, each communication terminal device 2 again determines the connection destination in order from the first priority.

According to the present embodiment, the repeater 1 can maintain the load balance only by following the priority information set in advance based on the known numbers of the repeaters 1 and the communication terminals 2.
Can be connected to

In the above description, R [0] is assigned to each repeater priority sequence of the first priority, but another permutation may be assigned. Also in this case, if the processing is performed according to the flowcharts shown in FIGS. 6 and 10, the repeaters of each priority can be determined.

The above-described load balancing algorithm has a known number of first and second means other than the relationship between the communication terminal device 2 and the repeater 1 in the network system shown in the present embodiment. The present invention can be applied to an algorithm in a case where the first means is substantially equally divided into any of the second means.

[0047]

According to the present invention, priority information is generated in advance based on a known number of repeaters and communication terminal means so that the number of communication terminal means connected to each of the active repeaters becomes substantially equal. To the communication terminal means, so that the communication terminal means in which the connected repeater becomes unusable due to a failure or the like can be reliably reconnected to a repeater capable of maintaining a load balance between the repeaters. be able to.

Further, the connection destination of the repeater can be determined based on the priority information set in advance so that the number of communication terminal devices connected to each of the active repeaters becomes substantially equal. Even without connecting and acquiring information, it is possible to reliably reconnect to a repeater that can reliably maintain the load balance between the repeaters.

[Brief description of the drawings]

FIG. 1 is an overall block configuration diagram showing an embodiment of a network system according to the present invention.

FIG. 2 is a diagram illustrating an example of the contents of a priority table generated by a priority information generation processing unit according to the present embodiment;

FIG. 3 is a diagram specifically showing a communication terminal device connected to each repeater in the present embodiment.

FIG. 4 is a diagram showing a reconnection destination of the communication terminal device after being reconnected due to a failure of any of the repeaters in the present embodiment.

FIG. 5 is a flowchart illustrating a process of determining a first-priority repeater for each communication terminal device in the present embodiment.

FIG. 6 is a flowchart illustrating a process of determining a second-priority repeater for each communication terminal device in the present embodiment.

FIG. 7 is a flowchart illustrating a process for determining whether or not a repeater priority sequence including repeaters up to a k-th priority is congruent in the present embodiment;

FIG. 8 is a conceptual diagram showing a phase congruency relationship defined in the present embodiment.

FIG. 9 is a flowchart showing a process for determining whether or not a repeater priority sequence including repeaters up to a k-th priority is in phase in the present embodiment;

FIG. 10 is a flowchart illustrating a process of determining a k-th (k ≧ 3) priority order repeater for each communication terminal device in the present embodiment.

FIG. 11 is a diagram showing a set of repeater permutations to be determined for a phase congruency relationship in the present embodiment.

FIG. 12 is a diagram used to explain a process of determining a third-priority repeater for each communication terminal device in the present embodiment.

13 is a diagram illustrating communication terminal devices connected to each of the repeaters when one of the repeaters becomes unavailable according to the priority table illustrated in FIG. 12;

14 is a diagram showing communication terminal devices connected to each of the repeaters when any of the repeaters becomes unavailable according to the priority table shown in FIG. 2;

[Explanation of symbols]

1 repeater, 2 communication terminal device, 3 Web server, 4
Network management device, 5 priority information generation processing unit,
6, 8 Priority table, 7 Priority information delivery processing unit, 9 Connection destination repeater determination processing unit.

Continued on the front page F term (reference) 5B089 GA04 GA21 GA33 KA06 KC15 KC39 MA03 5K030 GA12 HA04 HB04 HC01 HD03 LA03 LB02 LB11 LE03 LE05 MA06 MB01 MD01 5K034 AA05 AA07 FF01 FF11 FF13 JJ15 LL01 MM21 TT01 CC BB BB BB BB BB KK56 LL09

Claims (5)

[Claims] 1. A network system comprising: a plurality of repeaters; and a known number of communication terminal means for connecting to any one of the repeaters to access a network, wherein the communication terminal for each of the active repeaters is provided. Priority information generation processing means for generating priority information indicating priority of connection of each of the communication terminal means to the repeater so that the number of connections of the means is substantially equal; and setting for each of the communication terminal means Priority information delivery processing means for delivering the given priority information to each of the communication terminal means, and a connection to the repeater in accordance with the delivered priority information relating to the delivered own communication terminal means. A network system characterized in that a destination is determined. 2. Each of the communication terminal units includes: a priority information storage unit configured to store at least priority information related to the own communication terminal unit generated by the priority information generation processing unit; 2. The network system according to claim 1, further comprising: a connection destination repeater determination processing unit configured to determine the connection destination relay device according to the priority information. 3. The priority information generation processing means divides N (N is a natural number of 2 or more) communication terminal means into groups for each of the number m of repeaters (m is a natural number of 2 or more). Thus, one or a plurality of repeater priority sequences are formed, and the m repeaters are arranged in order to form a basic permutation, and the arrangement of the repeaters constituting the basic permutation is 1
A total of m permutations are formed by rotating one by one, and priority information is generated by assigning one of the formed permutations to each repeater priority sequence for each priority. The network system according to claim 1, wherein 4. A communication terminal device for performing network access by connecting to any one of a plurality of repeaters included in a network system, the number of connections of said communication terminal means to each of said active repeaters. Priority information storage means for storing priority information indicating a predetermined priority order of connection to the repeater, so that the priority information is substantially equal, and according to the priority information stored in the priority information storage means. A communication terminal device, comprising: a connection destination repeater determination processing means for determining the relay device to be a connection destination. 5. m (m is a natural number of 2 or more) repeaters; N (N is a natural number of 2 or more) communication terminal devices connected to any of the repeaters to perform network access; In the network system, wherein each communication terminal device determines the relay device to be connected according to the priority order for connecting to the relay device set for its own communication terminal device, wherein the communication terminal device is m One or a plurality of repeater priority sequences are formed by dividing each repeater into groups, and m repeaters are arranged in order to form a basic permutation, and the repeaters constituting the basic permutation 1 row
A total of m permutations are formed by rotating each of them, and one of the permutations formed so that the number of connections of the communication terminal device to each of the active repeaters is substantially equal for each priority. Is assigned to each repeater priority sequence, thereby determining the priority of connection of each of the communication terminal devices to the repeater.