JP2000250746A - Data conversion system for exchange - Google Patents

Abstract

PROBLEM TO BE SOLVED: To provide a data conversion system for an exchange capable of continuously using data with a new program without discarding the data when an old program is operated when the old program is replaced with the new program about a data conversion system for an exchange. SOLUTION: This system contains memories 10 and 11 which are provided in respective systems and have a prescribed data configuration, a copying means 12 which copies inheritance data of an old current system onto a new current system memory before switching programs and a converting means which converts data which is copied into the new current system and is the one when the old program is operated into a memory map and a data configuration in a new program on the basis of memory map information and data configuration information in the old program when an old program operation is replaced with a new program operation.

Description

DETAILED DESCRIPTION OF THE INVENTION

[0001]

The present invention relates to a data conversion system for an exchange, and more particularly to a data conversion system for updating a program.

2. Description of the Related Art In recent years, a microprocessor is mounted on each device constituting an exchange, and its operation program is mainly downloaded from a host of the exchange. Since the program of each device realizes some functions of the exchange, it is stipulated by customer's request and international recommendation, and addition or change of function is required. There is a need.

According to the present invention, when the operation program of each device is updated and switched to the new program operation, each device has data (call processing operation for continuing the exchange operation, billing data, line quality data, etc.) at the time of the old program operation. Without discarding the data), the new program operation is continued, and the operation before the program update is continued.

[0004]

2. Description of the Related Art In a switching system, each of the devices constituting the switching system has a device having a program. In recent years, it has become common to download the programs of these devices from the host exchange to the respective devices and operate them.

FIG. 13 is a diagram showing a configuration example of a program. In the figure, application A (call processing program)
1 and application B (transmission channel quality statistical program) 2 are shown. Reference numeral 3 denotes data of the application A, and the call state 3a of the subscriber A and the call state 3b of the subscriber B
And so on. Reference numeral 4 denotes data of the application B. The PM counter 4a of the subscriber A and the P
It comprises an M (performance) counter 4b and the like.

[0006]

Heretofore, when the programs of these devices have been changed, it has been difficult to transfer the data at the time of the operation of the old program before updating the program after updating the program. That is, in the subscriber control device and the like, there is a problem that the connected call before the program switching is disconnected or the billing data disappears in the actual service operation state.

The reason why it is difficult to take over data is that the data to be taken over between the old program and the new program is not always compatible. Specifically, if the address and data structure of the data handled by the old program on the memory are changed, the new program takes over the old data because the address position and data structure of the same data handled by the new program are different. Can not.

FIG. 14 is a diagram showing a configuration example of memory data. (A) is the memory data in the old program, (b)
Is the memory data in the new program. In the old program, data A1 is stored from address 1000, whereas in the new program, data A1 is stored from address 0FFFC. In addition, in the new program, new data A6 is added, the address of the memory data in the old program is not compatible with the address of the memory data in the new program, and the old data cannot be taken over. .

For this reason, in the conventional system, when the operation with the new program is started, all the operations are started from the initialization state. Therefore, when the operation is switched to the new program operation, the call processing data, the billing data, the line quality, and the switching operation are continued. There is a problem that data and the like are lost.

SUMMARY OF THE INVENTION The present invention has been made in view of such a problem, and when switching from an old program to a new program, it is possible to continue using the old program without discarding the data at the time of operation of the old program. It is an object of the present invention to provide a data conversion system for an exchange which can be used.

[0011]

(1) FIG. 1 is a principle block diagram of the first invention. In the figure, 10 is an old working memory, and 11 is a new working memory. The old active memory 10 includes data A to D, a program 13 and the like, and the new active memory 11 stores data A ′ to D ′,
It is composed of a program 14 and the like. The data in the old working memory 10 corresponds to the data in the new working memory 11. That is, A and A ', B and B', C and C ',
D and D 'correspond. In the present invention, a memory copy unit 12 for copying data from the old working memory 10 to the new working memory 11 is provided. Although not shown, the old active memory 10 and the new active memory 1
There is also provided an inter-system communication means for connecting the two.

In the present invention, the data memory configuration is limited between the new and old programs in advance, and
2 copies the old data from the old working memory 10 to the new working memory 11, and the conversion means (not shown) stores the old data in the new data area on the new working memory. I have. Therefore, by converting all inherited data before the operation of the new program, the data at the time of the operation of the old program is inherited, so that the exchange operation can be continued even when updating the program.

(2) In this case, in the address map of the takeover data, the start address of the takeover data in the old program is set to the same address value in the new program,
The address is converted from a data group of the oldest address.

According to the present invention, the start address value of the takeover data is made the same value in the old and new programs, and the address is converted from the data group of the oldest address.
The old data can be moved to the new data without losing the takeover data.

(3) Further, in the address map of the takeover data, the last address of the takeover data in the old program is set to the same address value in the new program, and the address is converted from the data group of the youngest address.

According to the present invention, the last address value of the takeover data is made the same in the new and old programs, and the address is converted from the data group of the youngest address.
The old data can be moved to the new data without losing the takeover data.

(4) The size of the takeover data composed of a plurality of data groups in the new program is made larger than the size of the old program.
According to the present invention, the original data is not lost when data of the old program is transferred to data of the new program.

(5) FIG. 2 is a diagram illustrating the principle of the second invention. 1 are denoted by the same reference numerals. In the figure, 10 is an old working memory, and 11 is a new working memory. The old active memory 10 includes data A to D, a program 13, a work area 15, and the like. The new active memory 11 includes data A ′ to D ′, a program 14, a work area 16, and the like. ing. Data A to D and A 'to D' correspond to each other. In the present invention, the old active memory 10 is replaced with the new active memory 11
Is provided with a memory copy means 12 for copying data. Although not shown, inter-system communication means for connecting the old active memory 10 and the new active memory 11 is also provided.

According to the present invention, in transferring the data in the old active memory 10 to the data in the new active memory 11, the data is transferred via the work area 15 and the work area 16. Each data temporarily stored in the work area 16 in the new active memory 11 is allocated to a predetermined position on the memory map as new data by a conversion means (not shown) for allocating data.

According to the present invention, the exchange operation can be continued even in the program update by inheriting the data at the time of the operation of the old program without being restricted by the start address position of the inherited data or the data conversion order. it can.

[0021]

Embodiments of the present invention will be described below in detail with reference to the drawings. FIG. 3 is a diagram showing an example of a system configuration to which the present invention is applied. In the figure, 30 is an exchange, and 31 is a host computer (hereinafter abbreviated as host) connected to the exchange 30. Here, a case where the subscriber control device 20 is connected to the exchange 30 is shown. The subscriber control device 20 includes a duplicated subscriber control device (active system) 21 and a subscriber control device (standby system) 2
2 between the two subscriber control devices 21 and 22, communication between systems is performed. A plurality of subscriber cards 23 are accommodated under each of the subscriber control devices 21 and 22, and each subscriber card 23 and a subscriber line are controlled, and various types of call connection information and transmission quality of a subscriber line are provided. It has a (PM) counter.

The control program is downloaded from the host 31 via the exchange 30. Each of the active system and the standby system of the subscriber control devices 21 and 22 is controlled by the host 31 via the exchange 30. As described above, the active system and the standby system are provided with respective means having an inter-system communication function and an inter-system memory copy function.

FIG. 4 is a diagram showing an embodiment of a program update control sequence according to the first invention, FIG. 5 is an explanatory diagram relating to restrictions on data arrangement and an explanatory diagram of a data conversion procedure, and FIG. 6 realizes the present invention. FIG. 6 is a diagram showing an example of an embodiment of a data conversion flowchart for performing the above.

1. First, the standby system is OUS from the host 31
(Out Of Service) (S1). 2. A new program is downloaded from the host 31 to the OUS-based standby system (S2).

At this time, the working system continues the working operation. As for the download means, a usual existing technology is used. 3. Send a memory copy request from the host to the active system (S
3) The data (takeover data) operated by the old program of the active system is copied to the new active system by the memory copying means 12 (see FIG. 1) (S4). in this case,
On the new active memory 11, the data of the old active operation is copied to the same memory address as in the old program operation. The active system notifies the host 31 of the completion of the memory copy (S5).

4. Host device (here, exchange host 3
From 1), a system switching request is issued to the new active system (S6). As a result, a standby system switching request is issued from the standby system (new active system) to the active system (old active system) (S
7). In response to this, a system switching response is issued from the old active system to the new active system (S8), and the active system and the standby system are switched.

5. In the new active system, the operation is switched to the new program operation (S9). In the new program of the new active system, before starting the active system operation at the time of program initialization, data conversion is performed on the old data in the new active system memory in the following procedure (S10). Thereafter, a notification of the completion of system switching is issued from the new active system to the host (S11).

FIG. 5 is a diagram showing a data structure at the time of operation of the old program and an example of a data structure at the time of operation of the new program. (A) is a takeover data configuration at the time of operation of the old program, and (b) is a data configuration at the time of operation of the new program.
In this embodiment, the data inherited by the new program is an example in which two types of data groups A and B are inherited.

The head address of the data is 10000, which is the same value in the address map in the new program. The data sizes of A and B are increasing, but not decreasing. This prevents the original data from being lost when the data of the old program is transferred to the new program. That is, the start address of the application data must not be changed, and the total size of the application data is not reduced.

In the new working system, data A6 is added by the application program, and data B6 is added by the application program. The new active memory 11 has a data conversion work area 14a used to convert old data into new data.

The data conversion starts from B whose address is the oldest. The data conversion means firstly outputs the data of B (B
1, B2, B3, B4, B5) are copied to the data conversion work area 14a. The data conversion means returns the data to B1, B2, B3, B4, and B5 on the new memory map. Since B6 is an area added by the new program, it is initialized.

Next, the data conversion means copies the data of A1, A2, A3, A4, and A5 to the data conversion work area 14a in the same procedure as the data of A. Next, A1, A2, A in the data conversion work area 1a
3, A4 and A5 are replaced with new memory maps A1, A2 and A
3. Return to the address of A4, A5. Since the data of A6 is additional data in the new program, it is initialized.

In this way, all data is converted to new memory data in the new active memory 11. When the data conversion is completed, the new active system program notifies the host device of the completion of system switching (FIG. 4).
S11), the operation is started as a new active system.

According to this embodiment, the start address value of the takeover data is set to the same value in the new and old programs, and the address is converted from the data group of the oldest address. Data can be transferred to new data.

FIG. 6 is a diagram showing an embodiment of a data conversion flowchart according to the present invention, showing the operation of the data conversion means. At the start of the new program operation, the old address remains in the memory, and at the start of the new program operation, data conversion is performed according to the following flow.

First, the data of the application B is copied to the data conversion work area 14a (S1). Next, the old B1 data is moved to the new B1 data area (S
2) Next, move the old B2 data to the new B2 data area (S3), move the old B3 data to the new B3 data area (S4), and then move the old B4 data to the new B4 data area. Then, the old B5 data is moved to the new B5 data area (S6), and the B6 data area is initialized (S7).

Next, the data of the application A is copied to the data conversion work area 14a (S8). Next, the old A1 data is moved to the new A1 data area (S1).
9) Next, move the old A2 data to the new A2 data area (S10), move the old A3 data to the new A3 data area (S11), and move the old A4 data to the new A4 data area. (S12) Next, the old A5 data is replaced with the new A5 data.
Move to the data area (S13), and initialize the A6 data area (S14).

FIG. 7 is a diagram showing the transition of the memory contents of the new working system. At the stage (a), the old working memory is copied as it is. The stage (b) shows a state in which the data B has been copied to the data conversion work area 14a. The stage (c) is the data conversion work area 14
The state in which the content of the data B copied to a is moved to the new data area is shown. At this time, B1 starts from address 10018, not from address 10014. Then, the data B6 added last enters and is initialized. B1 still remains at the original address 10014.

FIG. 5D shows a state in which the data A has been copied to the data conversion work area 14a. From this work area 14a to A1 and A from address 10000 of the memory area
2 and so on. Then, in (e), in the area where the old B1 remains, the added data A
Contains 6

In the above-described embodiment, the case where the head address is used as an example of aligning new and old data is described. However, the present invention is not limited to this, and it is also possible to align the last address. In this case, the data conversion is performed first from the A data.

According to this embodiment, the last address value of the takeover data is set to the same value in the old and new programs, and the address is converted from the data group of the youngest address. Data can be transferred to new data.

FIG. 8 is a diagram showing an embodiment of a program update control sequence according to the second invention. 1. First, the host 31 sets the backup system to OUS (Out Of
(S1).

2. A new program is downloaded from the host to the OUS-based standby system (S2). At this time, the working system continues the working operation. Existing download technology can be used.

A system switching request is issued from the higher-level device (here, the exchange host) to the standby system (S3). In response to this, the new active system switches to the new program operation (S4). In the new program of the new active system, before starting the active system operation at the time of program initialization, data conversion is performed for each application program in the following procedure.

3. The new active system issues a data request for application A to the old active system (S5). 4. When the old active system receives the application A data request from the new active system, the old data (data of application A) on the old active system is copied to the data conversion work area 15 (see FIG. 2) (S6). Is copied to the new active work area 16. When the memory copy is completed, the data response of the application A is returned to the new active system (S7).

5. On the new active side, application A
After receiving the data response of A, A2, A2, A2,... Based on the data structure in the new address map based on the data of the application A copied on the memory of the new active system (data conversion work area 16). A3, A4, and A5 are set, and A6 is initialized (S8).

After the data conversion of the application A is completed, next, in order to convert the data of the application B by the same procedure, the application B
(S9).

6 Upon receiving the data request of the application B, the old active system transfers the old data (data of the application B) on the old active system to the data conversion work area 15.
Is copied to the new active system by the memory copying means 12 (S10). When the memory copy is completed, the data response of the application B is returned to the new active system (S11).

7. Upon receiving the data response of the application B, the new active system uses the data B1 and B1 based on the data structure of the new address map based on the data of the application B copied on the memory of the new active system (data conversion work area 16). B2, B3, B4, and B5 are set, and B6 is initialized (S12).

8. When the data conversion is completed, the new active system program notifies the host device (host) of the completion of system switching (S13), and starts operating as the new active system.
As described above, the operation of the old program can be continued even when the data that has been operating in the old program is switched to the new program by transferring the data to the new program.

FIG. 9 is a diagram showing an embodiment of the data conversion flowchart of the second invention, showing the operation of the new active system. In this case, when the new program operation starts, nothing is done on the new active memory. At the start of the new program operation, data conversion is performed according to the following flow. Unlike the case of the first invention, the A data is converted, and then the B data is converted, but the order of the conversion does not matter. First, a data request of application A is made to the old active system (S
1). Next, a response waiting state for application A data is entered (S2). Application A from the old active system
When there is a data response (S3), these data enter the conversion work area 16. The data conversion means first moves the old A1 data in the conversion work area 16 to the new A1 data area (S4).

Next, the old A2 data in the conversion work area 16 is moved to the new A2 data area (S5). Next, the old A3 data in the conversion work area 16 is moved to the new A3 data area (S6). Next, the old A4 data of the conversion work area 16 is moved to the new A4 data area (S
7). Next, the old A5 data in the conversion work area 16 is moved to the new A5 data area (S8). When the movement of the old data is completed, the A6 data area which is new data is initialized (S9).

With the above, the conversion of the A data is completed. Then, the process proceeds to the conversion of the B data. In the conversion of B data,
First, an application B data request is made to the old working system (S10). Thereafter, a response to application B data is waited (S11). When there is a response of the application B data from the old active system (S12), these data enter the conversion work area 16. The data conversion means first moves the old B1 data in the conversion work area 16 to the new B1 data area (S13).

Next, the old B2 data in the conversion work area 16 is moved to the new B2 data area (S14). next,
The old B3 data in the conversion work area 16 is moved to the new B3 data area (S15). Next, conversion work area 1
6 is moved to the new B4 data area (S
16). Next, the old B5 data in the conversion work area 16 is moved to the new B5 data area (S17). When the transfer of the old data is completed, the new data A
The B data area is initialized (S18).

FIG. 10 is a diagram showing another embodiment of the data conversion flowchart of the second invention, showing the operation of the old working system. Upon receiving each application data request from the new active system, the old active system executes the following procedure. When the data is requested, each application copies the data to the conversion work area 15 so that the data can be transferred to the new active system by hardware, and returns a response to the data request to the new active system.

First, the process waits for an application data request from the new active system (S1). Here, when an application A data request comes from the new active system (S
2) Copy the old A1 data to the conversion work area 15 (S3), copy the old A2 data to the conversion work area 15 (S4), copy the old A3 data to the conversion work area 15 (S5), and copy the old A4 data. Convert data work area 1
5 (S6), and the old A5 data is copied to the conversion work area 15 (S7). When the copying is completed, the contents of the conversion work area 15 are returned as the application A data response (S8).

On the other hand, when an application B data request is received from the new active system (S9), the old B1 data is copied to the conversion work area 15 (S10), and the old B2 data is copied to the conversion work area 15 (S11). The old B3 data is copied to the conversion work area 15 (S12), and the old B4 data is copied.
Copy the data to the conversion work area 15 (S13),
Copy the old B5 data to the conversion work area 15 (S
14). When copying is completed, the contents of the conversion work area 15 are returned as an application B data response (S1).
5).

FIG. 11 is a diagram showing the transition of the memory contents of the old working system. In the case of (a), the A data and the B data have not been copied to the data conversion work area 15 yet. In (b), the A data is the data conversion work area 1
5 is copied. In (c), the contents of the data conversion work area 15 are copied to the new working system by hardware.
In (d), the B data is copied to the data conversion work area 15. In (e), the data conversion work area 1
5 is copied to the new working system by hardware.

FIG. 12 is a diagram showing the transition of the memory contents of the new working system. In the state of (a), no data has been stored yet. In (b), data A is copied to the data conversion work area 16 from the old working side. In (c),
The contents of the data conversion work area 16 are copied to a predetermined address. New data A6 is initialized.
In (d), the data B is copied to the data conversion work area 16 from the old working side. In (e), the contents of the data conversion work area 16 are copied to a predetermined address. New data B6 is initialized.

As described above, according to the second invention, the data at the time of the operation of the old program is taken over without being restricted by the start address position of the taken-over data or the data conversion order, thereby exchanging even the program update. The operation can be continued.

In the above embodiment, data A is A1
A6 and data B are B1 to B6, but the present invention is not limited to this, and an arbitrary number of data can be used.

[0062]

As described in detail above, (1) According to the first invention, the data memory configuration is previously limited between the new and old programs, and the memory copying means replaces the old data with the old working system. The old program operation is performed by copying from the memory to the new active memory and converting the old data into the new data area on the new active memory, thereby converting all inherited data before the new program operation. By taking over the data at the time, the exchange operation can be continued even when updating the program.

(2) In this case, the head address of the new and old addresses is set to the same address value in the new program.
By converting the address from the data group of the old address, the leading address value of the inherited data is made the same value in the new and old programs, and the address is converted from the data group of the old address, so that the inherited data is not lost. The old data can be moved to the new data.

(3) The last address of the new and old addresses is made the same address value in the new program, and the last address value of the takeover data is made the same value in the new and old programs by converting the data from the data group of the youngest address. In addition, by converting the data group whose address is the lowest address, the old data can be moved to the new data without losing the succeeding data.

(4) By making the size of the inherited data composed of a plurality of data groups in the new program larger than the size of the old program, the original data can be transferred to the data of the new program when the old program data is transferred. No data is lost.

(5) According to the second aspect of the invention, when data in the old working memory is transferred to data in the new working memory, data is transferred through a work area and a work area. Each data temporarily stored in the work area in the new active memory is allocated to a predetermined position on the memory map as new data by the conversion means for allocating data.

According to the present invention, the exchange operation can be continued even in the program update by inheriting the data at the time of the operation of the old program without being restricted by the start address position of the inherited data or the restriction of the data conversion order. it can.

As described above, according to the present invention, when the old program is switched to the new program, the data of the exchange can be continuously used by the new program without discarding the data at the time of the operation of the old program. A conversion system can be provided.

[Brief description of the drawings]

FIG. 1 is a diagram illustrating the principle of the first invention.

FIG. 2 is a diagram illustrating the principle of the second invention.

FIG. 3 is a diagram showing an example of a system configuration to which the present invention is applied.

FIG. 4 is a diagram showing one embodiment of a program update control sequence according to the first invention;

FIG. 5 is an explanatory diagram of a restriction on a memory data configuration.

FIG. 6 is a diagram showing an embodiment of a data conversion flowchart according to the first invention.

FIG. 7 is a diagram showing transition of memory contents on a new active system.

FIG. 8 is a diagram showing an embodiment of a program update control sequence according to the second invention.

FIG. 9 is a diagram showing one embodiment of a data conversion flowchart according to the second invention.

FIG. 10 is a diagram showing another embodiment of the data conversion flowchart of the second invention.

FIG. 11 is a diagram showing transition of memory contents of an old working system.

FIG. 12 is a diagram showing transition of memory contents of a new active system.

FIG. 13 is a diagram showing a configuration example of a program.

FIG. 14 is a diagram illustrating a configuration example of memory data.

[Explanation of symbols]

 DESCRIPTION OF SYMBOLS 10 Old working memory 11 New working memory 12 Memory copy means 13, 14 Program

 ──────────────────────────────────────────────────続 き Continued on the front page F term (reference) 5B076 EA17 5K026 AA23 FF16 GG27 KK03 5K051 AA09 DD07 EE01 KK05

Claims (5)

[Claims] An apparatus for downloading a program from a host exchange, comprising an inter-system communication means and a memory copy means between an old active system and a new active system, wherein a predetermined program provided for each system is provided. A memory with a data structure, copy means for copying the old active system's takeover data to the new active system memory before switching the program, and copying to the new active system when switching from the old program operation to the new program operation A data conversion system for converting a data at the time of operation of the old program into a memory map and a data configuration of the new program based on the memory map information and the data configuration information of the old program. . 2. The method according to claim 1, wherein the start address of the takeover data in the old program is set to the same address value in the new program in the address map of the takeover data, and the address is converted from the data group of the oldest address. Exchange data conversion system. 3. The data map according to claim 1, wherein in the address map of the takeover data, the last address of the takeover data in the old program is set to the same address value in the new program, and the address is converted from a data group with the lowest address. Exchange data conversion system. 4. The data conversion system for an exchange according to claim 1, wherein the size of the takeover data composed of a plurality of data groups in the new program is made larger than the size of the old program. 5. An apparatus for downloading a program from a host exchange, comprising an inter-system communication means and a memory copy means between an old working system and a new working system, wherein: A memory having a data structure, work areas provided for the old active system and the new active system, and copy means for copying the old active system takeover data to the old active system work area before switching programs. Transfer means for transferring the data of the work area to the work area of the new active system, and conversion means for allocating the data of the work area of the new active system to a predetermined address of the new active system. Exchange data conversion system.