JPH09146759A - Information compressing method and information processor - Google Patents

Abstract

PROBLEM TO BE SOLVED: To easily restore compressed information in respect to an information compressing method for compressing and storing management information or the like and an information processor. SOLUTION: In the information compressing method, respective items of original information of plural items 1, 2, 3,... consisting of plural sorts A, B, C,... are mutually compared in each same sort, the same contents are stored in the same address area to prepare a library 11 and a pointer list 12 indicating the correspondence relation to the original information about the items 1, 2, 3,... and the sorts A, B, C,... is prepared.

Description

Detailed Description of the Invention

[0001]

BACKGROUND OF THE INVENTION 1. Field of the Invention The present invention relates to an information compression method and information processing apparatus for compressing and storing management information and the like.
In various communication systems, the flexibility of communication equipment,
In order to deal with multi-vendor, etc., it tends to be subdivided according to functions, etc., and unitized or modularized. In that case, management information (PI; Physical Inventory) indicating the attributes of each unit and each module
Is stored, and the management information can be used by a monitoring control device or the like to perform configuration management, failure management, version number management, and the like. Therefore, as the number of units and the number of modules increase, the amount of management information becomes enormous, and there is a problem that a large-capacity memory is required, and there is a demand for reduction of this memory capacity.

[0002]

2. Description of the Related Art The management information described above is stored in a nonvolatile memory such as an EEPROM (electrically rewritable read-only memory) or a flash memory for each unit or module. It includes the month, warranty period, warranty year, version number indicating design changes, functions of modulators and amplifiers, manufacturers, etc. The non-volatile memory storing the management information is directly allocated to the memory space of the processor, and the management information is referred to and updated by the processor.

Various information compression methods have already been proposed. For example, in the case of information in which the same word repeatedly appears, an information compression code is known in which the word is expressed by a shortening code and is replaced with a shortening code shorter than the word length of the first word. In the case of decompressing (restoring), the reverse will replace the word with the abbreviation.

[0004]

The amount of management information increases as the number of units and modules constituting an information processing device such as a communication device increases, and most of the memory space of the processor is managed by each unit or module. Is occupied, and there is a problem that the memory space that can be used as a work area decreases. In such a case, it may be possible to apply the memory bank configuration, but there is a problem that the cost increases.

Therefore, it is possible to compress and store the management information (PI). However, there is a problem that decompression processing is required every time the compressed management information is referenced, the processing load on the processor increases, and high-speed processing becomes difficult. An object of the present invention is to compress and store original information, and to restore the original information immediately when referring to the compressed information.

[0006]

The information compression method of the present invention will be described with reference to FIG.
In the compression method of the original information of plural items 1, 2, ... Consisting of B, C, ..., Each item of the original information is compared for each same item and stored in the same address area with the same content. It includes a process of creating the library 11 and creating a pointer 12 indicating a correspondence relationship between the library 11, the items 1, 2, ... Of the original information and the items A, B, C ,.

(2) A functional unit having a memory storing management information of plural types A, B, C, ..., A processor and a memory capable of directly accessing the memory of this unit. In a method for compressing information in an information processing apparatus including a main unit having, a processor collects management information from a memory of a unit corresponding to the function as original information, and an item corresponding to each unit of the original information. 1, 2, ... are compared for each same type, the same contents are stored in the same address area of the memory of the main unit to create the library 11, and items and items of this library 11 and management information of original information Is included in the memory of the main unit.

(3) Further, the library 11 compares each item of original information for each same item, stores the same contents in the same address area, and a blank area (null) at the end of each item.
It includes the process of forming.

(4) Further, the information processing apparatus of the present invention collects the management information from a plurality of function-corresponding units each having a memory storing the management information of a plurality of types and the memories of the units, and stores this memory A processor that can be used as a work area and has a processing function of compressing and decompressing the collected management information, a library that stores the collected management information in the same address area for the same content, and this library. A main unit including a memory for compressing and holding by a pointer list showing a correspondence relationship with the collected management information.

(5) Further, the management information is restored based on the library and pointer list, and the period during which the library and the pointer are created and compressed based on the management information collected by the control of the processor. It is possible to provide a display unit for displaying the prohibition of insertion / removal of the unit corresponding to the function during the restoration process which is stored in the memory.

[0011]

1 is a schematic explanatory view of information compression of an embodiment of the present invention, showing an outline of an information compression method of the present invention. Each item 1, 2, ... Of original information is an item A. , B, C, D,
Items A to E of item 1 are AA, CC
C, 001, WWWWW, $$$$, item 2 item A ~
E is AA, CCC, 002, XXX, $$$$, and items A to E of item 3 are BB, CCC, 001, ZZZZ,
$$$$, items A to E of item 4 are BB, DDD, 00
In the case of 3, XXX, and $$$$, the library 11 shown below is collated for each item 1 to 4 corresponding to each item A to E.
Create

That is, the same contents are overwritten in the same address area as compared with each other. Therefore, in the case of the same $$$$ like the item E of items 1 to 4, the address area corresponding to the item E of the library 11 is only $$$$. Therefore, the more the same contents correspond to the items, the smaller the area of the library 11 will be. Then, the head addresses corresponding to the items of the library 11 are set to 1 to 5, and the pointer list 12 indicating the correspondence with the original information is created.

That is, "11" in the pointer list 12 is
The first address "1" of the first line of the library 11 indicates "AA", and "23" indicates the second number "3" of the library 11 "002". It should be noted that the actual start addresses are not 1 to 7, but the number of bytes of each item is predetermined, so the start address of each item can be represented by a number.
When restoring the original information, the pointer list 12
It is only necessary to access the address indicated by. For example, looking at the third line, "21", "12", "1"
3 ”,“ 34 ”,“ 15 ”, the library 11
2nd row, 1st column, "BB", 1st row, 2nd column, "CC"
C ", 1st row and 3rd column" 001 ", 3rd row and 4th column" Z "
"ZZZ", "$$$$" in the first row, fifth column is read,
The third data of the original information can be decompressed (restored).

FIG. 2 is an explanatory diagram of work area expansion. As a memory space accessed by the processor, as shown in A, a read-only memory area (ROM area) (application area) in which various application programs are stored, When it consists of a random access memory area (RAM area) (work area) used in various processes and an electrically rewritable read-only memory area (EEPROM area) (PI area) in which management information is stored,
As described above, the management information (PI) is compressed and stored by the configuration of the library and the pointer list, so that the EEPROM area can be used as a part of the work area as shown in B. The work area can be expanded in the same memory space.

FIG. 3 is an explanatory diagram of an information processing apparatus according to an embodiment of the present invention, in which U1 to Un are units, and a unit U1.
Is a processor CPU and random access memory RAM
And a read-only memory ROM and an electrically rewritable read-only memory EEPROM. The other units U2 to Un are, for example, modulators, demodulators, transmitters, receivers, etc. in the case of a transmission device. It has a structure corresponding to various functions, and each has management information (PI).
Is stored in the EEPROM. Further, L indicates a display portion such as a light emitting diode for the insertion / removal prohibition display corresponding to the units U2 to Un. It should be noted that this display section can be provided for the device, the shelf, and the like.

Processor CPU of main unit U1
Is the EEP of each unit U2-Un via the bus BUS
The ROM is directly accessible, and the management information (PI) stored in the EEPROM is collected via the bus BUS to form a library 11 and a pointer list 12 as shown in FIG. It is then compressed and stored in the RAM or EEPROM of the main unit U1. Therefore, the EEPROM of each unit U1 to Un can be used as a work area of the processor CPU, and the processing function of the processor CPU can be enhanced. Further, in response to a request for sending management information from a higher-level device such as a management center, the original information can be restored based on the library 11 and the pointer list 12 as shown in FIG. 1, so the management information can be easily restored. Can be sent out.

When inserting / removing the units U2 to Un,
Since management information (PI) compression processing and decompression processing are required, for example, when a unit to be removed is specified, the display unit L of the specified unit is lit to display prohibition of insertion / removal, and by the control of the processor CPU, When the process of decompressing (decompressing) the compression management information (PI) and storing it in the EEPROM of that unit is completed, the display unit L is turned off. This can indicate that the unit can be removed. It is also possible to provide the display unit L on the front surface or the like as the information processing device and prohibit the insertion / removal of the unit during the lighting display period of the display unit L.

[0018] FIG. 4 is an explanatory diagram of a management system of an embodiment of the present invention, 1 is a management center, a network such as a two packet switching network, the 3 ₁ to 3 ₁₄ is a transmission device. The solid line shows the case of an optical transmission line or a wire transmission line, and the dotted line shows the case of a wireless transmission line. Further, although the transmission devices 3 ₂ , 3 ₆ , 3 ₁₀ and 3 ₁₁ are shown connected to the management center 1 via the network 2, other transmission devices may be connected to the management center 1. .

[0019] the transmission devices 3 ₁ to 3 ₁₄ has a configuration corresponding to the information processing apparatus shown in FIG. 3, respectively, the management information units corresponding to constitute the apparatus (PI) as shown in FIG. 1 library 11 And the pointer list 12 are compressed and held, and the management information (PI) is restored according to a request from the management center 1 and sent out via the network 2. The management center 1 regularly manages the management information (PI) of the desired transmission devices 3 _{1 to} 3 ₁₄ when a failure occurs.
And the status information can be collected, and for the transmission device not directly connected to the management center 1 via the network 2, the management information (PI) is transmitted via the directly connected transmission device. ) Is performed.

Further, the case where the transmission devices 3 _{4 to} 3 ₈ are connected to each other through a wireless transmission path is shown, and the transmission devices 3 ₄ to 4 are connected.
₈ may include a wireless relay device, and management information (PI) about the wireless relay device is connected to the management center 1 via the wireless relay device and the network 2 or becomes a wireless terminal device. Management information (P
The transfer of I) can be performed.

FIG. 5 is an explanatory diagram of PI information according to the embodiment of the present invention. The items of PI information (management information) for one device are a module name of 10 bytes, a module identification number of 20 bytes, and 4 Byte structure manufacturing date, 4 byte structure warranty date, 2 byte structure version number, 30 byte structure function, 10 byte structure manufacturer 8
The case of 0 byte configuration is shown. The PI in the present invention
The information is not limited to such items, and the number of items can be increased or decreased according to the configuration of the information processing device.

The items are the microprocessor MPU, modulator MOD, demodulator DEM, transmitter TX, receiver RX,
Since the case of 10 items in total including the auxiliary device RPS is shown, 80 × 10 = 800 bytes. This PI information is collected and used as original information, and as shown in FIG. 1, a library 11 and a pointer list 12 are formed and compressed.

FIG. 6 is an explanatory diagram of a library and a pointer list according to the embodiment of the present invention. The library 21 collects the same contents for each item. Therefore, there are 6 types of module names for 10 items and modules. There are also six types of identification numbers. The manufacturing dates are all the same, 1995 August
There is only one type because it indicates the month. The warranty date is 1999 1
There are two types, the month and June 1999, and the edition numbers are 1 and 2.
There are two types of editions. There are also two types of functions and manufacturers. Then, a blank is added to the end of each item. This null makes it possible to easily identify the end of each eye when referring to each eye.

This library 21 is blank.
Including, the module name of the item is 70 bytes, the module identification number is 140 bytes, the manufacturing date is 8 bytes, the warranty date is 12 bytes, the version number is 6 bytes, the function is 90 bytes, and the manufacturer is 30 bytes. , Totaling 356 bytes.

The pointer list 22 is the library 21.
The head address and the line address corresponding to each item are stored as a set corresponding to the item. For example, the pointers for the microprocessor MPU of the item are “11” and “2”.
1 ”,“ 31 ”,“ 41 ”,“ 51 ”,“ 63 ”,“ 7 ”
1 ". Therefore, referring to the library 22, the module name “11” = MPU, the module identification number “21” = A001, and the manufacturing date “31” = 950.
8, warranty year "41" = 9901, version number "51" =
01, function "63" = null, manufacturer "7"
1 ”= FUJITSU.

If each pointer has a 2-byte structure, 2 × 7 = 14 (bytes) corresponding to the items, and since there are 10 items, 14 × 10 = 140 bytes. Therefore, the total number of bytes of the library 21 and the pointer list 22 is 356 + 140 = 496 (bytes), and since the PI information of the original information is 800 bytes, it can be compressed to about 60%.

FIG. 7 is a flow chart of the library creating process according to the embodiment of the present invention. The PI information compressing process is performed by controlling the processor to control the P stored in the EEPROM.
Transfer I information to read-only memory (RAM), RA
This is executed by the process of creating a library using M and creating a pointer list based on the library. First, RAM
In the state where the PI information is transferred to (random access memory RAM under the control of the processor CPU of the main unit U1 in FIG. 3), the head addresses of various items of the original PI information are stored and the reference address is set to the first item. The start address is set (A1).

Next, the original PI information based on the reference address is read (A2), and it is determined whether the original PI information includes a character string (A3). Since no character string is a blank (null) case and indicates the end of the area corresponding to the item of the library, the reference address is incremented by one template (all items) (A10). That is, the process moves to the next item of the same type.

If there is a character string, it is determined whether or not the character string is already registered in the library. If it has already been registered, the reference address is incremented by one template (all types) (A11), and the process proceeds to the next item of the same type. If it has not been registered, it is stored in the library (A5). Then, the storage address is incremented by one template (all types) (A6), and it is determined whether or not there is reference data (A7). If there is reference data, that is, if the last item of the item has not been processed, the reference address is incremented by one template (A1
2) Move to the next item of the same type.

When there is no reference data, null is stored at the end of the first type, and the area after null is set as the start address of the next type (A8). Then, it is determined whether or not all items have ended (A9), and if not completed, the reference address is set as the start address of the next item, and step (A9)
The process moves to 2) (A13).

For example, in the case of the module identification number of the item in the PI information shown in FIG. 5, the starting address of the item of the module identification number of item 1 is used as a reference address, and the original PI is used in step (A2) by this reference address.
The information "A001" is read. Then, in the next step (A3), it is determined that the character string exists, and in the next step (A4), it is determined that the character string has not been registered. Therefore, the character string is stored in the library in the step (A5) and the step (A6) ), The storage address is incremented by one template, and it is determined in step (A7) that there is reference data. Therefore, the reference address is incremented by one template in step (A12), and step (A2). Move to.

Therefore, "A002" of the original PI information is read out, it is determined in step (A3) that there is a character string, in step (A4) it is determined that registration has not been completed, and in step (A5). It is stored in the library, its storage address is incremented by one template in step (A6), and it is determined in step (A7) that there is reference data. Therefore, in step (A12), the reference address is one template. The number is incremented by minutes, and the process proceeds to step (A2).

Since the reference address in this case indicates the head address of the module identification number of item 3, "A00"
2 ”is read out and it is determined that there is a character string.
Since "002" is registered in the library, it is determined to be registered, the reference address is incremented by one template, and the process proceeds to step (A2). Similarly, based on the original PI information of FIG. 5, the library 2 of FIG.
1 can be formed. Then, a blank null is added when the processing of each item is completed to indicate that it is the end of the item.

FIG. 8 is a flowchart for creating a pointer list according to the embodiment of the present invention. The starting address of PI information moved to RAM is the original PI reference address, the starting address of the library is the library reference address, and the original PI is the same.
The head address of the information is used as the storage address (B1).

Next, the data of the reference address of the original PI information is read (B1) and the data of the library reference address is read (B3), and the read PI information and the library character string are the same (PI = library character string?). It is determined whether or not (B4). If they are not the same, the library reference address is incremented by one item (B5), and the step (B
In step 3), the data of the same item of the next item is read from the PI information and the library, and it is determined in step (B5) whether or not they are the same character string.

In the case of the same character string, two pieces of information about what item and how many times the library reference address is incremented are stored in the address indicated by the storage address (B
6). Then, the original PI reference address is incremented by one template, the library reference address is returned to the start address of the same type, and the storage address is incremented by one pointer (B7).

Then, it is judged whether or not all the items for the first type have been completed (B8). If not completed, the process proceeds to step (2), and if completed, the original PI reference address is set. The start address of the next type is set, the library reference address is set as the start address of the next type, and the storage address is stored as the start address of each type in the pointer list (B9). Then, it is determined whether or not all the items for the original PI information have been completed (B10). If not completed, the process proceeds to step (B2), and if completed, the creation of the pointer list is completed.

When the pointer list 22 is created based on the original PI information shown in FIG. 5 and the library 21 shown in FIG. 6, for example, the MPU of the module name of the starting address of the original PI information and the beginning of the library 21. Address MP
U and are read, and it is determined that they are the same character string in step (B4). Therefore, in step (B6), the first item and the number of increments are set as two pieces of information, which is the number of items and the number of increments. Because it is 0,
It is stored in the storage address as "11".

Next, in step (B7), the library reference address is returned to the beginning, and the original PI reference address is incremented by one template. Therefore, in step (B2), the MOD of the module name is read. Since the library reference address is still the first, the MPU of the module name is read out, and the step (B
By the judgment in 4), it means that they are not the same character string,
In this case, since the library reference address is incremented by one item in step (B5), the MOD is read from the library and the same character string is determined in step (B4).

In the next step (B6), since the library reference address is incremented once in the first item, "12" is stored in the storage address incremented by one pointer from the first storage address. Will be done. Similarly, the pointer is stored. That is, the original PI information is stored as a pointer indicating which row and column of the library 21 the character string corresponds to.

EE corresponding to each unit U2 to Un
As described above, the PI information stored in the PROM is collected in the main unit U1 and compressed under the control of the processor CPU, and the compressed PI information including the library 21 and the pointer list 22 is stored in the RAM or EEPROM of the main unit U1. Store. Therefore, each unit U2-
The storage area of the PI information of the Un EEPROM is free space and can be used as a work area of the processor CPU.

FIG. 9 is a flow chart of the compression information decompression process according to the embodiment of the present invention. As described above, it shows the case of decompressing (decompressing) the compressed PI information. Decompress under the control of the processor. That is, the head address of the pointer list moved to the RAM is used as the pointer list reference address, the library head address is used as the library reference address, and the head address of the EEPROM pointer list is used as the storage address (C1).

Next, the data of the pointer list is referred to, and the data of the library is stored in the area indicated by the storage address according to the item and item of the library indicated by the reference data (C2). Then, the pointer list reference address is incremented to the next item, the library reference address is returned to the head address of the library, and the storage address is incremented by one item (C3). Then, it is determined whether or not all the original PI items and all items have been completed (C4), and if not completed, step (C).
Go to 2).

When decompressing the compressed PI information by the library 21 and the pointer list 22 of FIG. 6 described above, for example, for item 2, "12", "22", from the start address corresponding to item 2 of the pointer list 22. "31",
The data of "41", "51", "61", and "71" are read out, and "12" of the second column, second row, "MOD" of the first column, second row of library 21 is read by "12". "A00
2 ”and“ 31 ”indicate“ 9508 ”in the third column, first row,
By "41", "9901", "51" in the 4th column, 1st row
By "01" in the 5th column, 1st row, "61" by the "6th column, 1st row," 256QAM ", by" 71 "
The line "FUJITSU" is read out and stored in the storage address incremented by one item for item 1. Similarly, the PI information shown in FIG. 5 can be restored from the library 21 and the pointer list 22 in the same manner.

FIG. 10 is a flow chart of PI information processing at the time of unit insertion / removal according to the embodiment of the present invention. As described above, since compressed PI information is stored in the main unit, the PI decompressed at the time of removal is extracted. Information is required. Therefore, when the unit is removed, the unit insertion / removal prohibition is lit up and displayed by the display section L (see FIG. 3) corresponding to the unit or provided on the front surface of the apparatus (D1).

Then, the processor uses the start address of the unit to be inserted / extracted as the pointer reference address, and the library start address as the library reference address,
The PI storage start address of the unit is set as the storage address (D2). Next, the data of the pointer list is referred to, and the data of the library indicated by the item and item of the library by the reference data is stored in the area indicated by the storage address (D3).

Then, the pointer list reference address is incremented so as to indicate the next item, the library reference address is returned to the library top address, the storage address is incremented by one item (D4), and it is determined whether or not all the original PI items have ended. Is determined (D5), if not completed, the process proceeds to step (D3), and if completed,
The lit display for prohibiting the unit insertion / removal on the display unit L is turned off (D6). Therefore, the EEPROM of the removed unit
In this case, the first PI information is restored and stored.

When a unit is inserted, the PI information of that unit is collected under the control of the processor of the main unit, and the library 21 and pointer list 22 already created are updated. Therefore, even during such a compression processing period, the prohibition of insertion / removal of the unit can be displayed on the display unit L.

The present invention is not limited to the above-described embodiments, but can be variously added and changed. For example, the place where the PI information is compressed and held is the main component of the information processing apparatus. The PI information is not limited to the unit U1 and may be collected in a higher-level device, compressed, and held. PI information, which is stored and held in a non-volatile memory, is
A rewritable non-volatile memory other than the OM may be used as a memory having another configuration.

[0050]

As described above, according to the present invention, regarding items such as units and modules, the management information including a plurality of items such as name, function, manufacturing date, manufacturer, etc. is used as the original information and the same item is selected. For each comparison, the same contents are stored in the same address area to create the libraries 11 and 21, and pointer lists 12 and 22 showing the correspondence between the items and items of the libraries 11 and 21 and the original information.
By reducing the redundancy, the original information can be compressed and retained. Decompression (decompression) of compressed information
Can be executed easily and at high speed by accessing the libraries 11 and 21 using the pointers corresponding to the items in the pointer lists 12 and 22.

Therefore, in an information processing apparatus composed of a plurality of units or modules, or a system composed of a plurality of these information processing apparatuses, the management information is compressed and held to make a memory. It is possible to reduce the capacity and cost. In addition, the memory area storing the management information can be used as a free space and can be used as a work area by the processor, which has the advantage of enhancing the processing function of the information processing apparatus or system.

[Brief description of the drawings]

FIG. 1 is a schematic explanatory diagram of information compression according to an embodiment of the present invention.

FIG. 2 is an explanatory diagram of work area expansion.

FIG. 3 is an explanatory diagram of an information processing apparatus according to the embodiment of this invention.

FIG. 4 is an explanatory diagram of a management system according to the embodiment of this invention.

FIG. 5 is an explanatory diagram of PI information according to the embodiment of this invention.

FIG. 6 is an explanatory diagram of a library and a pointer list according to the embodiment of this invention.

FIG. 7 is a flowchart of a library creating process according to the embodiment of this invention.

FIG. 8 is a flowchart for creating a pointer list according to the embodiment of this invention.

FIG. 9 is a flowchart of a compression information decompression process according to the embodiment of this invention.

FIG. 10 is a flowchart of PI information processing when a unit is inserted / removed according to the embodiment of this invention.

[Explanation of symbols]

 11 library 12 pointer list

Claims (5)

[Claims] 1. A method for compressing original information of a plurality of items of a plurality of items, wherein each item of the original information is compared for each same item, and the same contents are stored in the same address area to create a library. An information compression method comprising a step of creating a pointer indicating a correspondence relationship between the library and the original information regarding the item and the item. 2. Information processing including a functional unit having a memory storing management information of a plurality of types, and a main unit having a processor and a memory capable of directly accessing the memory of the unit. In the information compression method in the device, the processor collects the management information from the memory of the unit corresponding to the function as original information, and compares the items corresponding to each unit of the original information for each same item, The same contents are stored in the same address area of the memory of the main unit to create a library, and a pointer indicating the correspondence between the library and the management information of the original information for the item and item is set to the memory of the main unit. An information compression method, characterized by including the step of creating. 3. The library includes a step of comparing each item of the original information for each same item, storing the same content in the same address area, and forming a blank area at the end of each item. The information compression method according to claim 1 or 2. 4. A plurality of units corresponding to functions having a memory storing management information of a plurality of types, and collecting the management information from the memory of the unit,
A library in which the memory can be used as a work area, and a processor having a processing function of compression and decompression of the collected management information and the collected management information are stored in the same address area for the same content for the same type. An information processing apparatus, comprising: a main unit including a memory for compressing and holding the library and a pointer list indicating a correspondence relationship between the collected management information. 5. A period during which the library and the pointer are created and compressed based on the management information collected under the control of the processor, and the management information is restored based on the library and the pointer list. 5. The information processing apparatus according to claim 4, further comprising a display unit for displaying prohibition of insertion / removal of the unit corresponding to the function during a restoration process for storing the unit in the function corresponding unit.