Method and system for search group calling

Abstract

The system comprises: setting a call control module array, a call control node array, a Harsh queue array and an idle node array; getting the call reference in relevant message, and making Harsh operation for the call reference to generate a H1 value; according to the array element in the Harsh queue array whose subscript value is H1, getting the opposite linked table; sequentially looking up, and comparing the reference value, until finding the call control module opposite to t he call reference value.

Description

technical field [0001] The invention relates to the technical field of trunking communication, in particular to a search method and system for a call control block in a trunking. Background technique [0002] In the trunking communication system, when a mobile station (Mobile Station, referred to as MS) initiates a call, the base station controller (referred to as BSC) allocates a call control block (Call Control Block, referred to as CCB) saves call-related information, including call reference and other configuration information for managing the call channel. Therefore, the call control block is the core data structure part of call processing. All call-related update data needs to be written into the call control block, and all call-related data is also read from the call control block, that is, the information in the call control block needs to be real-time as the call status changes. Write, update, read and delete, etc. Therefore, it is particularly important to quickly...

AI Technical Summary

Problems solved by technology

[0015] The core of the hash search method is to convert all the sequences in the sequential search method into partial sequences, so as to improve the search speed. Although it has the advantage of fast speed, due to the inherent problems in the hash operation, different call references cannot be guaranteed. After the hash operation has different H values, it is necessary to use the linked list to link the call control blocks with the same H value after the hash operation, resulting in a large number of pointers, and considering the storage method of the linked list, so the search process needs Continuously dynamically allocate memory, which is easy to cause memory leaks

[0016] To sum up, since the call reference is a string of long bytes, if a simple sequential search method is used to search, the efficiency is low, which is not conducive to improving the call efficiency of the communication system; if the hash search method is used to search, but Due to the extensive use of linked list pointers, the system needs to continuously allocate memory dynamically, so it is not suitable for calling software

Images