JPH0423655A - Inter-node line connection method in communication service system utilizing public line network - Google Patents

Abstract

PURPOSE:To utilize the line effectively by evaluating a traffic to be estimated by each node based on the past result from the standpoint of the line charge system and implementing the setting of a proper line or its revision dynamically. CONSTITUTION:Each of nodes 2-5 has a storage device 7, in which traffic information based on year, day and time zone estimated according to the past result for each area is provided in a form of a traffic information table 8. When the service offering party connects nodes with respect to an initial request from a relevant service subscriber utilizing this service between areas A and B at a time zone, each node evaluates relevant traffic information and a charge system of a public line network and realizes the result by utilizing a line having a certain large capacity. The function above is provided to each node to realize an optimum connection between nodes. Moreover, the inter-node connection is realized more efficiently by providing a voice compression function and a multiplexing function to each node.

Description

[Detailed Description of the Invention] [Field of Industrial Application] The present invention relates to a network in which a plurality of nodes (circuit switching equipment, packet switching equipment) are connected to a public line network (subscription telephone network, public telecommunications service such as L5DN), and a node The present invention relates to a line connection method between nodes in a communication service system using a public line network for communicating between nodes.

[Conventional technology]

Traditionally, multiple nodes are connected to a public network.

In a network system that transfers data between nodes, there is a storage type data transfer method such as that described in Japanese Patent Application Laid-Open No. 57-131148, for example. In this method, when data to be transferred is generated at the terminal device of the transfer source node, the generated transfer data is registered in the accumulated data file in the node as −-backed accumulated data. and,
The terminal device of the transfer destination node is notified that the transfer data has been registered and accumulated from the transfer source node. When the terminal device of the transfer destination node receives the notification, it instructs the data exchanger to transmit the self-targeted accumulated data registered in the accumulated data file, and the terminal device of the transfer destination node receives the transferred data. That's what I do.

[Problem to be solved by the invention]

In the above-mentioned conventional technology, each time transfer data is generated, the transfer data is registered in the accumulated data file in one node, and upon receiving a notification to the transfer source node and a transfer request for the transfer destination note, the node connects the line. is set, the data is transferred, and the line is disconnected when the data transfer is complete.

In this case, the charge system of the public line network is a pay-as-you-go charge system based on the charging unit time.1For example, if the data transfer time takes 3 minutes and 10 seconds, the charging unit time will be 3 minutes and 10 seconds.
minutes, so the cost is the same as if the line was held for 6 minutes and the data was transferred. In other words, even though the line can be put on hold for 2 minutes and 50 seconds out of 6 minutes,
No consideration is given to the effective use of the hold line during this time.

An object of the present invention is to provide a network system in which a plurality of nodes are connected to a public line network and communicate between nodes, in which each node reviews and evaluates expected traffic from the perspective of the communication line fee structure, A line between nodes in a communication service system using a public line network that allows a line with a capacity commensurate with expected traffic to be effectively used during line hold time without having to set up a new line each time transfer data is generated. The purpose is to provide a connection method.

[Means to solve the problem]

In order to achieve the above object, claim (1) provides a network system in which a plurality of nodes are connected to a public line network and communicate through the nodes, in which each note is predicted based on past performance. It is characterized by holding information representing the amount of traffic (hereinafter referred to as traffic information), evaluating the traffic information from the viewpoint of the fee structure of the communication line, and setting or changing the optimum line.

Further, in claim (2), the optimum line setting or changing operation is dynamically performed at fixed time intervals.

Furthermore, claim (3) is characterized in that a new line is set up whenever traffic exceeding the expected amount of traffic occurs.

[For production]

Each node has a table with traffic information expected between each node/monthly/daily/time period based on past performance, and evaluates this traffic information from the perspective of the communication line fee structure. Setting or changing a line that is considered to be optimal in terms of line capacity and line charges between certain nodes at a certain time on a certain day is dynamically performed, for example, every unit of time.

In addition, if all the lines currently being set up are in use and more traffic occurs, new lines are set up at any time, taking into consideration the time until the next switching and future increases or decreases in traffic volume.

〔Example〕

Hereinafter, one embodiment of the present invention will be described in detail with reference to the drawings.

FIG. 1 is a block diagram showing an example of the configuration of a communication service system using a public line network according to an embodiment of the present invention. In Figure 1, ■ is a public line network (subscriber telephone network,
5DN, etc.), 2 to 5 are notebooks (circuit switch, packet switch, etc.), 6 is public line network 1
7 is a storage device included in each of the notebooks 2 to 5, and 8 is a traffic information table held by each storage device 7. In the figure, the area inside the dotted line corresponds to the service provider, and the area outside the frame corresponds to the service subscriber.

Now, when a service subscriber in district A makes a call to a party in district B using this service, the service subscriber in district A first calls the nearest A node 2 using the telephone 6. At the same time, enter the number of the other party in Area B, who is the transfer destination. On the other hand, the A node 2 selects the B node 4 of the nearest node based on the transfer destination number, and connects the line between the A node 2 and the B node 4. This connection method will be described later. After receiving the forwarding number for B Note 4.

A call is made to the forwarding destination, and after the forwarding destination responds to the call, a conversation between the service subscriber and the forwarding destination is realized.

Below, the nearest note of the service subscriber is A node 2
(Tokyo) and the nearest linode to the transfer destination is B node 4 (Osaka), and an example of the operation between the nodes will be described.

Each of the nodes 2 to 5 stores, in the storage device 7, annual/daily/hourly traffic information predicted based on past results for each district (for example, between districts A and B, 1
Information that between 12:00 and 13:00 on October 10th, 115 communications with an average hold time of 180 seconds occurred)
It has as a traffic information table 8. A certain time period (for example, 12:00 to 13:00 on October 10th)
In response to the first request from a service subscriber who uses this service between District A and District B during the period of Each node evaluates the system and uses Daito's lines to some extent to achieve this. For example, as a result of this evaluation, if the node determines that the H, (384 kbps) line of the 15DN-next group service is optimal in terms of line capacity and line charges during this time period, it will use it. to connect nodes. Furthermore, if the traffic exceeds the line capacity, the B channel (64 kbps) of the 15DN basic service (2B+D) is newly used to connect the nodes. By equipping nodes with such functions, optimal connections between nodes can be realized. moreover,
If nodes have audio compression and multiplexing functions, connections between nodes can be realized more efficiently.

A specific example is shown below. Note that the line connecting nodes is Ho (384 kbps) of the IS'DN basic interface (INS Net 64) and the primary speed interface (INS Net 1500) provided by NTT.
), H, (1,5Mbps), B (64kbps
s) will be used. Furthermore, by using a voice compression function between nodes, the speed is compressed to 32 kbps in order to effectively utilize the line.

For example, a line that can transparently use a capacity of 1.5 Mbps can be used for 48 voice communications. 384kb
A PS line can be used for 12 voice communications, and a 64 kbps line can be used for 2 voice communications.

Here, A node 2 (Tokyo) - B node 4 (Osaka)
Assume that the traffic information between them is as shown in FIG.

Figure 2 shows the expected traffic conditions between Tokyo and Osaka on a given day based on past data, with time on the horizontal axis and number of calls on the vertical axis. The number of calls refers to the number of transfers that the notebook must expect at a certain time. The distance between Tokyo and Osaka is 408 km, and the holding time for one case is 3 minutes. The number of service providers is 0 in advance.
Decide on the type and number of lines to be used, anticipating the maximum amount of traffic at the point, and sign a contract with a Type 1 telecommunications carrier.

For example, if there is a first call at point A, the unit time (
For example, assuming the unit time is 1 hour), the peak traffic (point B) is expected, and in order to handle 48 calls, 1
, a line (H
1 channel). If there are more than 48 calls, a line that can be used at any time with a capacity of 64 kbps (for 2 calls) (B channel) or a line that can transparently use a capacity of 384 kbps (for 12 calls) (Ho channel)
Switch to

At point E, the peak traffic per unit time is less than 12 and is expected to decrease further, so it is 384 kb.
Switch the PS traffic to a line (Ho channel) that can be used transparently. If the number of calls exceeds 12 unexpectedly, set up a line that can transparently use 64 kbps capacity (B channel) or a line that can transparently use 384 kbps capacity (Ho channel). corresponds to If the last call ends at point F,
Disconnect all lines.

In the configuration shown in Figure 1, each node 2 to 5 evaluates the traffic volume as shown above, and dynamically sets the line type and number of lines (every unit time) according to the changes.
Provide a function that can be changed to

An example of traffic evaluation performed by a node and an example of the corresponding operation are shown below.

FIG. 3 is an enlarged view of two points B' and B' (unit time) in FIG. 2. This figure is 10:00 (
B') to 11:00 (B') every 3 minutes B,
-B2° point (holding time is 3 minutes), which means, for example, that there are a maximum of 60 calls that need to be processed between B and -B. Regarding the number of calls at each point, up to 60 calls are made by the INS of the first type carrier.
H1 channel in net 1500 (capacity t 1 , 5
Mbps) and Ho (capacity 384 kbps). Regarding the remaining calls, the case where one more H0 channel is set is represented by ■, and the case where the B channel (capacity 64 kbps) is set at any time is represented by ■. The number of calls and the number of lines set for the B channel (capacity 64 kbps) at each point are
As shown in the figure.

Here, from the fee structure of INS Net 64 and INS Net 15OO, A node 2 (Tokyo) - B node 4 (Osaka)
H channel (1,5Mbps) between.

H0 channel (384kbps), B channel (64kbps)
kbps) unit communication charge for 4.5 seconds.
Assuming 0 yen, 30 yen for 6 seconds, and 10 yen for 5.5 seconds, the communication fee from 10:00 to 11:00 is calculated as follows.

In case of ■ H1 channel 3600/4.5 x 60 yen x 1 line = 48000 yen H0 channel 3600/6 x 30
Yen x 2 times 4! = 36,000 yen Total 84,000 yen■ In the case of B channel, 65 lines are set in total, so 3x6015
．． 5xlO yen x 65 lines = 21450 yen H1 channel
3600/4.5 x 60 yen x 1 line = 48,000 yen H6 channel 3600/6 x 30 yen x 1 line =
18,000 yen and a total of 87,450 yen or more, it is cheaper to set up one H channel line and two H0 channel lines, so in this case, the node is
It operates to set up one E-channel line and two H0-channel lines.

FIG. 5 is an enlarged view of two different points c'c' (unit time) in FIG. This figure is at 15:00
(C') ~16:00 (C') is divided into 3 minute intervals CI, ~C2Il (holding time is 3 minutes), for example, the number of calls that need to be processed between C1 and 00 is This means that there are a maximum of 39 items. Regarding the number of calls at each point, H.

When setting 2 channels (capacity 384 kbps) and 1 channel (1.5 Mbps), H0
The case where the B channel (capacity 64 kbps) is used as needed for one channel line and one H1 channel line and the remaining calls is shown as ■.The case where the B channel is set as needed for one H4 channel line and the remaining calls is called ■.

Figure 6 shows the number of calls and B channel (capacity 6
4 kbps). The call charge in this case is calculated as follows.

■In the case of H1 channel 3600/4.5 x 60 yen x 1 line = 48000 yen H, fr channel 3600/6 60 yen x 1 line =
48000 yen H, channel/Lz 3600/6 X
30 yen x 1 time, 5I = 18ooo yen A total of 17 B channels are set, so 3 x 6015.5 x 10
If yen =17
490 yen, totaling 65,490 yen or more, it is cheaper to set up one H channel line and the B channel at any time for the remaining calls, so in this case, the node needs to set up one H channel line and the B channel at any time. Work like you do.

Next, disconnection and connection of the line will be explained. As explained using FIG. 2, each node switches lines based on the expected call volume every unit time. When disconnecting the currently connected line and connecting a new line, for the call occurring at that point, the node responds to the same message as it would during a normal call to the person requesting transfer.

Furthermore, for those who are currently on the phone, services are provided using, for example, the following types of line switching methods.

1. At the time of line switching, temporarily set up both the line to be disconnected and the line to be newly connected. To instantly switch lines so that both parties during a call do not feel disconnected or connected.

2. One minute before disconnection, a message will be sent to both parties on the call to inform them that the line will be temporarily disconnected, and while the line is being switched, both parties' phone numbers, billing information, etc. will be stored in the data storage file of each notebook, and a single line will be connected. At the same time as restarting, each node checks the stored files and calls both parties to urge them to restart the call.

The line will be disconnected for the service subscriber who is currently calling and the person being transferred to.
Calls will be temporarily unavailable until connection is established.

3. A message will be sent to both parties during the call to inform them that the line will be disconnected three minutes before disconnection, and the call will be forcibly terminated when the line is disconnected.

A contract is made in advance with the service subscriber as to which method will be used. In that case, usage fees will be differentiated depending on the level of service. The contract details are stored in a database for each service subscriber (this may be provided on a storage device [8],
(or you may use another storage device).

Below, an example of an operation in which a node disconnects and connects a line using the above three types of methods every unit time will be explained using the flowchart of FIG. An example of the operation of the node when all the currently set lines are being used and additional traffic occurs, that is, when the traffic exceeds the traffic expected in advance, will be described later with reference to FIG.

Here, for example, the caller's nearest linode is A node 2,
The next time the callee's nearest linode disconnects H0 channel 1 line regarding the expected traffic of B node 4,
The operation of each node 2 and 4 when connecting one H0 channel line will be explained. The operation is performed every unit time.

First, the 5A node 2 searches the traffic information table 8 in the notebook (101). At the next switching time, it is checked whether a new line needs to be set or changed (102). If this is not necessary, the A node 2 ends the table search (200). If it is necessary to set up or change a new line, A node 2 evaluates the fee structure of the communication line, determines the type and number of lines to be connected, and checks whether the line currently being set up will be disconnected (
103), and as a result, it is evaluated that, for example, next time it would be optimal to disconnect one H1 channel line and newly connect one He channel line (104).

Next, Panode 2 searches the database (10
5) Check which service to use for switching for each service subscriber who is currently on a call (lO6). Furthermore, the B node 4 is notified of which method 1, 2.3 above will be used for each service subscriber, and the B node 4 confirms this (107).

If the PANOTE 2 determines that method 1 is to be used for a certain service subscriber, the A node 2 calls the B node 4 to set up a new H0 channel 1 line (108). B node 4, which received the call request, immediately accepts the call and returns it to A node 2 (109), H
The o channel setting is completed (110), and at the same time, the A node 2 issues a setting completion notification to the B node 4 (111).
).

Furthermore, A node 2 disconnects the H□ channel (11
2). At that time, the line between the A node 2 and the caller is put on hold (113). After the A node 2 disconnects from the H1 channel, it immediately connects to the H channel (114), and inversely sends a switching completion notification to the B node 4 (115). B node 4
similarly disconnects the H1 channel (116) and immediately connects it to the H0 channel (117). At that time, the line between the B node 4 and the called party is put on hold (118). After the switching is completed, the B node 4 issues a switching completion notification to the A node 2 (119). Here, A node 2-B node 4rW
The call using Hl and channel I is resumed (12
0). Next, A node 2 disconnects the line of the H1 channel (121) - sends a line disconnection request to B node 4 (12
2). In response, the B node 4 disconnects the line from the H1 channel (123) and transfers a disconnection completion notification to the A node 2 (124).

This completes the line switching operation using method 1 at nodes 2 and 4.

In step 106, if A node 2 determines to use line switching method 2, one minute before switching, A node 2 responds to the caller with a message to the effect that the line will be switched (e.g., "Call in 1 minute"). ``Please hang up the phone. I will call you back'' (131). Next, the sender's number, transfer destination 1 billing information, etc. are stored in the file 8 in the node (133). Similarly, the B node 4 also responds to the message to the recipient (132), and stores the recipient's number and forwarding destination in the file 8 within the node (134). Next, A node 2 disconnects the H1 channel (135),
The disconnection request is transferred to B Note 4 (136). B node 4 receives the disconnection request and disconnects the H ethannel (13
7) Sends a disconnection notification to A node 2 (138)
. Furthermore, A node 2 is H. A call is made to B node 4 to set up a channel (139). B node 4 receives the incoming call request from A node 2, immediately accepts the incoming call, and returns it to A node 2 (140).

In response, the A node 2 determines that the line setup between the B nodes 4 through the H0 channel has been completed (141), and sends a setup completion notification to the B node 4 (142). Here, A
Node 2 and B node 4 are each file 8 in 9 nodes.
Search for and check the calling party for each caller/caller (143
, 144). And A node 2 is H. A connection is made between the channel and the Panode 2 and the caller (145), and a line connection completion notification is sent to the B node 4 (147). The B node 4 also connects the H channel and the B node 4 to the called party (
146), sends a line connection completion notification to A node 2 (14
8). Thereafter, the A-note 2 calls the caller, and the B-node 4 calls the receiver (149.150). After confirming that both parties have responded (151, 152), A node 2, B
Nodes 4 forward caller/caller response acknowledgment notifications to each other (
153), where the call is resumed (154).

In step 106, if the A node 2 determines to switch the line using method 3, the A node 2
, B node 4 responds to each caller 1 callee with a message (for example, a buzzer sound) to inform that the call will be disconnected (16
1,162). Next, the A node 2 disconnects the H□ channel between the A node 2 and the B node 4 (163). Sends a disconnection request to B node 4 (164) = B node 4 disconnects the H1 channel (165) and sends a disconnection notification to A node 2
(166). The A node 2 determines that the H channel between the pan node 2 and the B node 4 has been disconnected.
67), sends a disconnection completion notification to B node 4 (168
). Next, A node 2 disconnects the line between A node 2 and the caller (169).

B node 4 also disconnects the line between B node 4 and the called party (170), and forwards the disconnection notification to A node 2 (171).
). At this point, the call between the caller and the communicating party ends (17
2). After that, for the first call, A node 2 uses a new H
Make a call to B note 4 to set up the Q channel (1
73). Upon receiving the incoming call request, the B node 4 accepts the incoming call and sends an incoming call acceptance notification to the A note 2 (174).

A node 2 is H. It is determined that the line setup between the PANOTE 2 and the B node 4 using the channel is completed (175), and a setup completion notification is transferred to the B node 4 (176).

The B node 4 evaluates the forwarding destination number and performs a call for the forwarding destination (177). Check the forwarding destination's response (178), and the B node 4 sends a forwarding destination response notification to the A node 2 (179).
), the call is established (180).

With the above, the line switching operation by method 3 at node 2.4 is completed.

Next, an example of the operation of the notebook when the expected traffic is exceeded will be explained using the flowchart of FIG. The operation shown in FIG. 8 is performed by a node when all currently on-hold lines are in use and additional traffic occurs. Here, the nearest node to one sender is A node 21, and the nearest node to the recipient is B node 4, and when A node 2 determines that it is optimal to newly connect one B channel line, The operations of the A node 2 and the B node 4 will be explained.

First, the panode 2 confirms that a call has occurred (201').

The A node 2 searches whether the line between the A node 2 and the B node 4, which is currently on hold, is free (202).

If there is free space, that capacity can be used, so the operation of the A node 2 ends (300). If there is no free capacity, the A node 2 selects an appropriate type and number of lines, taking into consideration the time until the next switching and future increases and decreases in traffic volume (203). As a result, if the A node 2 determines that it is appropriate to newly connect the first B channel line, it notifies the B node 4 that the first B channel line will be connected (204). B node 4 accepts the notification and sends it to A node 2 (205).

Next, the A note 2 calls the B node 4 to set up the B channel 1 line (206). B node 4 accepts the incoming call and transfers it to A node 2 (207)
. The A node 2 determines that the B channel setting is complete (208), and sends a setting completion notification to the B node (20
9). B node 4 evaluates the forwarding destination number, calls the forwarding destination (210), confirms that the forwarding destination responds (210), and confirms that the forwarding destination responds (210).
12), the B node 4 forwards the forwarding destination response notification to the A node 2 (212). Now the call is established 213), A
Node 2 stores information that one B channel line has been newly connected in file 8 in the notebook (214).
Finish the operation.

〔Effect of the invention〕

As explained above, according to the present invention, in a network system in which a plurality of nodes are connected to a public line network and communicate through the nodes, each node calculates the expected traffic volume of the line based on past performance. It has a function that evaluates the fee structure and dynamically sets or changes the appropriate line, making it possible to make effective use of the line. Furthermore, when traffic exceeding the expected amount of traffic occurs, by setting up a new line at any time, it is possible to immediately deal with an increase or decrease in the amount of traffic that exceeds the expected amount.

[Brief explanation of the drawing]

FIG. 1 is a block diagram of a communication service system using a public line network according to an embodiment of the present invention, FIG. 2 is a diagram showing a specific example of expected traffic conditions between nodes, and FIG. Figure 4 is an enlarged view of the area between two points B'B' in Figure 3, and Figure 4 is a diagram showing the number of calls and the number of B channel settings at each point in Figure 3. Figure 5 is the diagram shown in Figure 2. Another two points C
Figure 6 shows the number of calls and the number of lines set for the B channel at each point in Figure 5. Figure 7 shows line switching at each node per unit time. Flowchart showing an example of operation. FIG. 8 is a flowchart showing an example of a notebook line setting operation when traffic exceeding the expected amount occurs. 1...Public line, 2-5...Node, 6...
Telephone, 7...Storage device, 8...Traffic information table. i2 Figure 3 1Q Go 0 Or-Ari Figure 4-

Claims (3)

[Claims] (1) In a network system in which multiple nodes are connected to a public line network and communicate through the nodes,
Each node holds information representing the expected traffic volume based on past performance (hereinafter referred to as traffic information), and evaluates the traffic information from the perspective of the communication line fee structure to set the optimal line. or a line connection method between nodes in a communication service system using a public line network, which is characterized by making changes. (2) Line connection of nodes in the communication service system using a public line network according to claim (1), wherein each node dynamically sets or changes the optimum line at regular intervals. method. (3) A communication service using a public line network according to claim (1) or (2), characterized in that a new line is set up whenever traffic exceeding the expected traffic volume occurs. A line connection method between nodes in a system.