KR19990010971A - Channel Discovery Method in Switching Networks in Exchanges - Google Patents

Abstract

The present invention is characterized by dividing the highway capacity into a group of a certain size, to point to one search point among the groups divided into the groups, and to place a different point inside each group to simultaneously search for a plurality of channels. do.

Description

Channel Discovery Method in Switching Networks in Exchanges

The present invention relates to a channel search method in a switching system, and more particularly, to a channel search method of a switching network in an exchange that allows multiple search points to be searched at one time instead of one channel by setting several search points.

Electronic exchanges that are currently in development and use must be assigned channels on the switch network in order to configure the channel, but if the channel allocation takes a long time, the performance of the system can be degraded. Minimizing time by reducing costs is an important challenge.

In the conventional channel allocation method for configuring a call path, ANP, CIP, AIP, LRP, and OMP correspond to a main processor board, and ANDP, SNDP, and OMDP are device control processors in the system having the configuration as shown in FIG. Here, the channel is controlled by the SNS in order to assign the channel. If the channel assignment is requested in step (2a) of FIG. 2, the caller, the destination highway, the caller's blocking map is obtained, and the callpoint of the caller is obtained in step (2b). In step (2c), the 32 channels in which the search point is located are obtained and logically summed, and then in step 2d, the channel in which the search point is located is searched among the 32 channels. If it is checked in step 2e), it is treated as successful for channel assignment in step (2k); If the search point is not the same in step (2h), check whether the search point is the last of 32 channels before increasing in step (2i). If not, it returns to the above (2d) process, and when the last point of 32 channels is obtained, the next 32 channels are searched. The conventional method is to search one channel by one search point and one channel. However, since the conventional method does not know the state of the search point channel, it searches a channel one by one and it takes a lot of time to search. Therefore, the system overloads and provides real-time service. In addition, since all channels must be searched until blocking is recognized, For example, if the highway capacity is 1k, there is a problem that 1024 searches are required to know whether blocking occurs, and up to 1024 searches are required to find a valid channel.

Accordingly, an object of the present invention is to provide a method of improving system performance by enabling several channel search for one channel instead of one channel by setting several search points.

In order to accomplish the above object, the present invention divides the highway capacity into groups of a predetermined size, and allows one search point to be pointed out from the groups divided into the groups, and sets a different point inside each group to simultaneously establish a plurality of channels. Search for.

1 is a system diagram applied in an embodiment of the present invention

2 is a flow chart showing a conventional channel method

3 is a flowchart showing an example of channel allocation applied in an embodiment of the present invention.

4 is one search point is increased in the embodiment of the present invention in FIG.

Flowchart showing the search process

FIG. 5 illustrates a plurality of search points that are increased in the embodiment of the present invention in FIG. 4.

Flowchart showing the search process

DETAILED DESCRIPTION OF THE PREFERRED EMBODIMENT A detailed description of a preferred embodiment of the present invention will now be described with reference to the accompanying drawings. In the following, reference numerals are given to components of each drawing, even though the same components are shown in different drawings. Note that they have the same sign. In describing the present invention, when it is determined that a detailed description of related known functions or configurations may unnecessarily obscure the subject matter of the present invention, the detailed description thereof will be omitted. Terms to be described later are defined in consideration of functions in the present invention, which may vary according to the intention or custom of a user or a chip designer, and the definitions should be made based on the contents throughout the present specification.

3 is a first step of requesting channel allocation as a channel allocation flow diagram according to an embodiment of the present invention to obtain incoming and outgoing highways, blocking maps, and first and second search points of origination;

A second step of obtaining the sum of the sub-highway channels located at the first point obtained in the first step, adding the sub-highway channels, and comparing the values with the values occupied by the sub-highway;

A third step of increasing the first point indicating the sub highway when the second step is the same and comparing whether the current first point value is equal to the first point starting first, and treating the channel allocation as a failure when it is equal;

A fourth step of determining whether an idle channel is found by searching for a channel value in which a second point is located by searching for an idle channel in the corresponding subhighway when the sum totaled in the second step and the value occupied by the subhighway are not the same;

In the fourth step, when the channel is idle, the channel search is processed successfully. When the second point is equal to the subhighway capacity, the second point indicates the first channel of the subhighway. .

4 is a diagram illustrating a process of searching while one search point is increased according to an embodiment of the present invention.

5 is a diagram illustrating a process of searching while increasing a plurality of search points according to an embodiment of the present invention.

Therefore, a specific example of the present invention will be described in detail with reference to FIGS. 1 to 5.

In order to reduce the overall number of searches using a plurality of search points and a plurality of channel searches, the highway capacity is divided into a constant channel, and when a certain channel is referred to as a sub highway, it is a first point to indicate the group of the sub highways. Pointing to the internal channel of the sub highway is the second point. To display all channels of the highway, the first point X sub highway + the second point is indicated. Referring to FIG. After requesting channel assignment in step (3b), the first and second points of origin and destination highways and blocking maps and outgoing calls are obtained, and in step (3c), the sub highway channels where the first point is located are obtained and logically combined. Compared to the value obtained by the logical sum and the sub-highway occupied in the process (3d) and the same in the process (3f) When the same as in step (3f), the first point indicating the sub highway is increased in step (3g) to check whether the current first point value is the same as the first point starting at step (3h). In this case, the channel allocation failure is treated as the same. However, when it is not the same in the above (3f), the idle channel is found in the corresponding subhighway (3k). In the process (3k), if the channel search is successful when idle, the second point is increased to check whether the second point is equal to the sub-highway capacity. The second point points to the first channel of the sub-highway, so the maximum value of the first point is +1 until the block is recognized or not, and the maximum channel count is the maximum value of the first point +1. For example, if the highway capacity is 1k and the sub highway capacity is 32 channels, the maximum value of the first and second points is 31. Thus, whether or not blocking occurs At 32, the maximum channel number is 64.

As described above, by using the channel search method, the overall number of searches can be reduced, thereby reducing the overload of the system and improving the overall performance of the switching system that performs a real-time service.

Claims (1)

In the channel search method to the exchange, A first step of obtaining the first and second search points of an incoming / outgoing highway, a blocking map and an origin by requesting the channel allocation; A second step of obtaining the sum of the sub-highway channels located at the first point obtained in the first step, adding the sub-highway channels, and comparing the values with the values occupied by the sub-highway; A third step of increasing the first point indicating the sub highway when the second step is the same and comparing whether the current first point value is equal to the first point starting first, and treating the channel allocation as a failure when it is equal; A fourth step of determining whether an idle channel is found by searching for a channel value in which a second point is located by searching for an idle channel in the corresponding subhighway when the sum totaled in the second step and the value occupied by the subhighway are not the same; In the fourth step, when the channel is idle, the channel search is processed successfully. When the second point is equal to the subhighway capacity, the second point indicates the first channel of the subhighway. A channel search method for an exchange switch.