JPH04207346A - Time designation connection management system - Google Patents

Abstract

(57) [Summary] This bulletin contains application data before electronic filing, so abstract data is not recorded.

Description

DETAILED DESCRIPTION OF THE INVENTION [Field of Industrial Application] The present invention relates to a time-specified connection service in circuit switching.

[Conventional technology]

A typical example of conventional time-specified connection services is a wake-up service, which is described as an automatic scheduled call system in Japanese Patent Laid-Open No. 58-391-55.

The wake-up service referred to here is a dial operation GTS using a special number of the calling subscriber, which memorizes the desired call time or message notification time and the connection information of the called subscriber number, and when the desired time is reached. This is a service that automatically calls the calling subscriber and the called subscriber, or the called subscriber and the message notification device.

[Problem to be Solved by the Invention 1] The above prior art does not take into account call times and calls at designated times every day, and if a service requesting subscriber wants to receive service at the same time every day, the same registration is required every day. It was necessary to In addition, unless there is a row without changing the specified time, the calling time will be delayed each time a retry occurs.

An object of the present invention is to realize calling at a designated time every day and to perform retry processing without changing the designated time.

[Means for solving the problem] In order to achieve the above purpose, 1.
Allows you to specify daily or daily registration,
The service type is memorized so that when the call is completed or when the service is completed, the registration data is not erased if it is a daily registration.

121-, the retry call can be given priority over other time-specified calls, and the designated time for daily registration is not shifted when retrying.

[Operation] The registered data has a call necessity indication, and when the specified time is reached, the call necessity indications for all the data registered at that time are set to "call required", and the call is completed or Set to "call not allowed" at the end of the trial. As a result, when a call is executed, only those that are "required to call" are called, thereby making it possible to execute an I-retry without changing the specified time.

Further, when executing a call, the retry call can be given priority over other calls at a specified time by executing the call starting from the earliest specified time.

Embodiment Hereinafter, an embodiment of the present invention will be explained with reference to the drawings. FIG. 1 shows the basic configuration of an exchange when making a time-specified connection. 10 is a switch, 20 is a processing device. , 30 is a memory, 40 to 42 are subscriber terminals, 50 is a call trunk, and 60 is a sound source.The call that has arrived at the specified time is processed by the processing unit 20 by operating the TL and LO switches.
40 to 42 subscriber terminals, 50 call trunks, 60 sound sources,
30 are connected according to the time designation registration data retrieved from the memory. FIG. 2 shows the configuration of time specified registration data, 31 is a table of headers of registration chains for each time, 32 to 34 are areas for storing registration data registered at the corresponding time, and 31 is used as a header. Configure a bidirectional chain. 35 is information necessary to execute each service. 36 are pointers indicating the beginning and end of the chain to be currently processed. Every week, the end pointer of period 31 is copied to the end pointer of period 36, and if there are no attempts left until the previous period (3
If the value of the start pointer of No. 6 is "0"), the start pointer of No. 31 is copied to the start pointer of No. 36. At this time, "call required"' is set for all registered information registered in the chain between the start pointer and the end pointer 31.

Figure 2 shows the case where retry is not included, and the start and end pointers of 36 point to 32 and 34, and the chain is traced in order from 32 to 34.
Execute the connection process for the connection information of "Call Required". When the connection is completed, if the registration is for one day, it will be removed from the chain 32 to 34 according to the g record information. If the registration is specified every day, it will not be removed from the chain. , set the registration information to ``No call required.''

FIG. 3 shows a case where there is a retry. In Figure 2, if 32 and any other call connections registered in the chain are not completed, the head pointer of 36 is not updated and points to 32, and the end pointer of 36 is updated and registered at the current time. This refers to the end 34' of the chain 32' to 34'. Similarly to FIG. 2, connection processing is executed for the connection information of "Call Required 1" in order from 32 pointed to by the head pointer 36 up to the end 34 of the chain, and when the processing of one chain is completed, the next chain L- The process moves to step 1 and repeats until 34', which is pointed to by the end pointer of 36.

The connection process for 32 pointed to by the start pointer 36 is complete! If so, the connection information for the next "call 7 required" is searched for and the head pointer is updated. If there is no "call, required" connection information between the first pointer and the last pointer of 36, then 3
Set the value of the start pointer of No. 6 to "O".

[Effects of the Invention] According to the present invention, not only one time-specified connection but also
Connections specified at a specified time every day can be managed using the same method.

Further, when retrying, the retry call can be given priority over other time-specified connection registration calls.

[Brief explanation of the drawing]

Figure 1 is a diagram showing the basic configuration of an exchange when making time-specified connections, and Figures 2 and 3 are diagrams showing the configuration of time-specified registration data. 1.0... Switch, 20... Processing device, 30. Memory, 31-36... Time specification registration data, 40-42.
Subscription terminal, 50...Call 1~Rank, 60, Sound source.

Claims (1)

[Scope of Claims] 1. Storage means for storing specified time paging time information and the number of the terminal that requested the service; control means for registering and canceling the paging time information by operating the subscribing terminal; A means to call back the terminal that requested the service, a means to tell whether the call was successful or not, and a reason in the case of failure, and a retry in the case of failure.
A time-specified connection management method that takes countermeasures such as issuing a message, and prioritizes call-backs over calls based on other time-specified registrations for retries. 2. In the time-specified connection management system according to claim 1, when a service is requested, a service type indicating whether only one call is made to the storage means for storing the terminal number or whether the call is made every day at a specified time. Add a storage means to store
By adding a control means for registering and canceling the call time information by operating the subscriber terminal, and a control means for registering the service type by operating the subscriber terminal, it is possible to select one of the calling methods by operating the subscriber terminal. A time-specific connection management method characterized by allowing selection.