CN100553200C - Group searching method capable of adjusting group in communication network system - Google Patents

Abstract

The invention relates to a group searching method capable of adjusting groups in a communication network system, which takes the difference between the actual demand rate obtained by the last group searching and the previous two demand rates as the demand rate of the group searching to obtain the grouping number when performing the group searching, and divides the user terminal into a plurality of groups according to the grouping number, and the demand rate of the user terminal of the network is dynamically determined to adaptively adjust the grouping number, thereby performing the best grouping and group searching.

Description

Group Inquiry and Search Method for Adjustable Groups in Communication Network System

technical field

The invention relates to network communication technology, and relates to a group search method, especially a group search method suitable for adjustable groups in a communication network system.

Background technique

The group polling method has been widely used in the service control (Station Service Control) of the terminal station of the cable TV (CableTV) network or the wireless communication (Wireless Communication) network, and the head end (HeadEnd) management system can be polled to obtain Find out the user terminal (UserTerminal) that has the service requirement, for example, the user terminal that is ready to issue a request (Request) or upload information (Up-StreamTransmission). Fig. 1 shows thirteen user terminals u1~u13 in a cable TV network, wherein u2, u4, u6, u7 and u12 are user terminals with service requirements, obviously, the head-end management system 11 must provide each A user terminal performs an inquiry search, and a total of thirteen inquiries can be performed to ensure that all user terminals with service requirements can be correctly found.

However, in practical applications, the number of user terminals in the network is extremely large, so the aforementioned simple search method will be too time-consuming and impractical. The (GroupPolling) method has become a feasible method, which mainly divides the user terminals in the communication network into several groups, and the head-end management system searches each group. When a group is polled At that time, a user terminal in the group can obtain the required service. However, it is expected that when two or more user terminals in a group have service requirements at the same time, a collision will occur. (Collision), and further search and search must be carried out, that is, the collided groups need to be divided into dichotomy partitions (DichotomyPartition), and then search is performed, so that recursive (Recursive) execution until all user terminals with service requirements All have been searched, so it can be seen that the occurrence of collisions will cause a huge additional burden on the system. Therefore, how to reduce the number of collisions in the group search method is an extremely important issue.

Contents of the invention

The main purpose of the present invention is to provide a group search method, which can perform optimal grouping and group search, effectively reduce the chance of collision, and minimize the number of search times.

In order to achieve the above-mentioned purpose, the group search method of the present invention is used to search for user terminals with service requirements in the communication network system, which includes the following steps:

(A) Divide the user terminals of the communication network system into a plurality of groups, each group has at least one user terminal; (B) carry out a group search in the initial stage to find out all the groups with services The number of user terminals required, and obtain the request rate of the service demand; (C) use the previously obtained request rate as the request rate of this group query search, obtain the number of groups, and divide the users according to the number of groups The terminals are divided into multiple groups; (D) conduct a group search on the group to find out the number of all user terminals with service needs, and find out the actual request rate; (E) the last group search The difference between the obtained actual request rate and the previous two request rates is used as the request rate of this group inquiry search, and the number of groups is obtained, and the user terminal is divided into multiple groups according to the number of groups; (F) for Perform group inquiry search on these multiple groups to find out all user terminals with service requirements, and obtain the actual request rate; and (G) repeat steps (E) and (F) to perform group inquiry search .

In the group search method, in step (A), the user terminal of the communication network system is divided into G ₀ groups (G ₀ is a positive integer), and G ₀ is an experience value or a preset set value.

In the group search method, G ₀ =1/2×T, where T is the number of all user terminals in the communication network system (T is a positive integer).

In the group search method, in step (B), the obtained service demand request rate is R ₀ =M ₀ /T, where M ₀ is the number of user terminals with service demands, T is the number of all user terminals in the communication network system (M ₀ is a non-negative integer, T is a positive integer).

In the group search method, in step (C), the number of groups obtained is G ₁ =R ₀ ×T, and the user terminal is divided into G ₁ groups.

The group search method is in step (D). The obtained actual demand rate is R ₁ =M ₁ /T, where M ₁ is the number of user terminals with service demands (M ₁ is a non-negative integer).

In the group search method, in step (E), the number of groups obtained is G _i =R _i '×T, where R _i '=R _i-1 +(M _i-1 -M _i-2 )/T, R _i-1 is the actual request rate obtained from the last group search, (M _i-1 -M _i-2 )/T is the difference between the previous two request rates (M _i-1 and M _i-2 are non-negative integers). In the group search method, in the step (F), the actual demand rate obtained is R _i =M _i /T, where M _i is the number of user terminals with service requirements (M _i is a non-negative integer).

Description of drawings

Figure 1: is a schematic diagram of searching for a user terminal in a cable TV network;

Fig. 2: is the flow chart of the group search method of the adjustable group in the communication network system of the present invention;

Fig. 3: is the schematic diagram that shows the group query search in the initial stage with the method of the present invention;

Fig. 4: It is a schematic diagram showing the first group search by the method of the present invention;

FIG. 5 : is a schematic diagram showing the second group search performed by the method of the present invention.

Detailed ways

Please refer to the flow chart shown in FIG. 2 and a schematic diagram of an exemplary network shown in FIG. 3, which is a preferred embodiment of the group search method for adjustable groups in the communication network system of the present invention, wherein the network is set There are T user terminals, and the head-end management system 11 conducts a group search to find out all user terminals with service requirements. For the convenience of description, in this embodiment, T=13, and these thirteen use Or terminals are represented by u1~u13.

In the process flow of the method of the present invention as shown in Figure 2, in the initial stage (i=0) (step S201), at first the user terminals of the network are divided into G ₀ groups, G ₀ can be an experience value or A preset value, such as G ₀ =1/2×T, and the head-end management system 11 conducts a group search for the G ₀ groups (step S202) to find out the number of all user terminals with service needs M ₀ , and know the actual request rate R ₀ =M ₀ /T.

In step S203, the actual request rate R ₀ obtained from the previous group search is used as the request rate of this (i=1) group search, and the number of groups (GroupCount) G ₁ =R ₀ ×T is calculated, And the user terminals are divided into _G1 groups, and the head-end management system 11 performs group search (step S204) on these _G1 groups to find out the number M of all user terminals with service requirements ₁ , and know the actual request rate R ₁ =M ₁ /T.

In step S205, the difference between the actual request rate R _i-1 obtained from the previous group search and the previous two request rates is used as the request rate of this (i-th) group search, that is, R _i '=R _i-1 +(M _i-1 -M _i-2 )/T, and calculate the number of groups G _i =R _i '×T, and divide the user terminal into G _i groups, and from the beginning The terminal management system 11 conducts a group search for the G _i groups (step S206 ) to find out all user terminals M _i with service requirements, and obtains the actual request rate R _i =M _i /T. After that, i=I+1, repeat steps S205 and 206 to perform group search, because each time grouping is performed, R _i '=R _i-1 +(M _i-1 -M _i-2 )/ T is the request rate of group search, where R _i-1 is the actual request rate obtained after the previous group search, and (M _i-1 -M _i-2 ) represents the The amount of variation in the number of user terminals with service requirements between the previous group search and search shows that the present invention can dynamically adjust the number of groups for each group search and search according to the actual situation and change trend in the past, and In order to achieve the best grouping, reduce the chance of collision in group search.

Fig. 3 to Fig. 5 show a practical example of the group inquiry search method of the adjustable group in the communication network system of the present invention, wherein, be provided with 13 user terminals (T=13) in the network, and these thirteen The user terminals are represented by u1-u13. As shown in Figure 3, at the initial stage, the user terminals of the network are divided into 6 groups:

Group 1: {u1, u2 },

Group 2: {u3, u4},

Group 3: { u5 , u6 },

Group 4: {u7, u8},

Group 5: {u9, u10},

Group 6: {u11, u12, u13 },

The head-end management system 11 compares the six groups and conducts six group search searches. Among them, the user terminals u5 and u6 in the group 3 both have service requirements and have collisions, which must be cut by dichotomy, and then performed twice Inquiry and search, and finally find out that all user terminals with service requirements are u2, u5, u6, u13 (M ₀ =4), so it is known that the actual request rate R ₀ =4/13.

Then, carry out the first group query search cycle, as shown in Figure 4, assuming that the user terminals with service needs are u2, u4, u6, u7, u12 at this time, this time (i=1) group query Taking R ₀ as the request rate, the calculated number of groups G ₁ =4/13×13=4, so the user terminals are divided into 4 groups:

Group 1: {u1, u2 , u3},

Group 2: { u4 , u5 , u6 },

Group 3: { u7 , u8, u9},

Group 4: {u10, u11, u12 , u13},

The head-end management system 11 conducts four group search searches on these four groups. Among them, the user terminals u4 and u6 in the group 2 both have service requirements and have collisions, which must be further divided by dichotomy. Search twice to find out all user terminals u2, u4, u6, u7, u12 (M ₁ =5) with service demands, so the actual request rate R ₁ =5/13.

Afterwards, the second group search cycle is carried out, as shown in Figure 5, assuming that the user terminals with service requirements are u1, u3, u5, u8, u9, u11, this time (i=1) group The request rate of group inquiry R ₂ '=R ₁ (M ₁ -M ₀ )/T=(5/13)+(1/13)=6/13, the calculated number of groups G ₂ =(6/13 )×13, approximately equal to 6, so the user terminals are divided into 6 groups:

Group 1: { u1 , u2},

Group 2: { u3 , u4},

Group 3: { u5 , u6},

Group 4: {u7, u8 },

Group 5: { u9 , u10},

Group 6: { u11 , u12, u13},

The head-end management system 11 conducts six group searches on these six groups, and there is no collision, so all user terminals u1, u3, u5, u8, u9, u11 ( M ₂ =6), so it is known that the actual request rate R ₂ =6/13.

As can be seen from the above flow chart and examples of the group search method for adjustable groups in the communication network system of the present invention, the present invention is based on dynamically determining the request rate of network user terminals to adaptively adjust the number of groups , the best grouping and group search can be carried out, so that the number of service needs in each group is almost only one, that is, the number of search searches is extremely small, and the chance of collision is almost zero.

The above-mentioned embodiments are only examples for convenience of description, and the scope of rights claimed by the present invention should be based on the scope of the patent application, rather than limited to the above-mentioned embodiments.

Claims (3)

1. A group search method for adjustable groups in a communication network system, which is used to search for user terminals with service requirements in the communication network system, characterized in that the method includes the following steps: (A) dividing the user terminals of the communication network system into a plurality of groups, each group having at least one user terminal; (B) Carry out a group search in the initial stage of the group to find out the number of all user terminals with service needs, and obtain the request rate of the service demand, wherein the obtained service demand request rate is R ₀ =M ₀ /T, M ₀ is the number of user terminals with service requirements, T is the number of all user terminals in the communication network system, and M ₀ is a non-negative integer, and T is a positive integer; (C) Use the previously obtained request rate as the request rate of this group query search to obtain the number of groups, and divide the user terminal into multiple groups according to the number of groups, wherein the obtained number of groups is G ₁ =R ₀ ×T, and divide the user terminals into G ₁ groups; (D) Carry out a group query search on the group to find out the number of all user terminals with service needs, and calculate the actual request rate, wherein the obtained actual request rate is R ₁ =M ₁ /T , M ₁ is the number of user terminals with service requirements, and M ₁ is a non-negative integer; (E) The actual request rate obtained from the previous group search and the difference between the request rate and the previous two request rates are used as the request rate of this group search, and the number of groups is calculated, and the user terminal is divided according to the number of groups Divided into multiple groups; the calculated number of groups this time is G _i =R _i '×T, among them, the variable i is a non-negative integer, which is the code of the search time, R _i '=R _i-1 + (M _i-1 -M _i-2 )/T, R _i-1 is the actual request rate obtained from the last group search, (M _i-1 -M _i-2 )/T is the request rate of the previous two The difference between , M _i-1 and M _i-2 are both non-negative integers, which are the number of user terminals with service requirements last time and last time, T is the number of all user terminals in the communication network system, and T is a positive integer ; (F) Carry out group query search on these multiple groups to find out all user terminals with service requirements, and obtain the actual request rate for this time; the obtained actual request rate for this time is R _i = M _i /T, wherein, the variable i is a non-negative integer, which is the code of the query search time, M _i is the number of user terminals with service requirements this time, and M _i is a non-negative integer; and (G) Repeat steps (E) and (F) to perform group query. 2. The group search method as claimed in claim 1, wherein in step (A), the user terminals of the communication network system are divided into G ₀ groups, G ₀ being an experience value or A preset value, and G ₀ is a positive integer. 3 . The group search method according to claim 2 , wherein G ₀ =1/2×T, where T is the number of all user terminals in the communication network system, and T is a positive integer.

Images