CN100553200C - The group search method of adjustable group in the communication network system - Google Patents

The group search method of adjustable group in the communication network system Download PDF

Info

Publication number
CN100553200C
CN100553200C CNB031010237A CN03101023A CN100553200C CN 100553200 C CN100553200 C CN 100553200C CN B031010237 A CNB031010237 A CN B031010237A CN 03101023 A CN03101023 A CN 03101023A CN 100553200 C CN100553200 C CN 100553200C
Authority
CN
China
Prior art keywords
group
user
request rate
terminal
services
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Expired - Fee Related
Application number
CNB031010237A
Other languages
Chinese (zh)
Other versions
CN1516390A (en
Inventor
吕沐锜
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Industrial Technology Research Institute ITRI
Original Assignee
Industrial Technology Research Institute ITRI
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by Industrial Technology Research Institute ITRI filed Critical Industrial Technology Research Institute ITRI
Priority to CNB031010237A priority Critical patent/CN100553200C/en
Publication of CN1516390A publication Critical patent/CN1516390A/en
Application granted granted Critical
Publication of CN100553200C publication Critical patent/CN100553200C/en
Anticipated expiration legal-status Critical
Expired - Fee Related legal-status Critical Current

Links

Images

Abstract

The invention relates to the group search method of adjustable group in a kind of communication network system, it is when carrying out group search, be an above group search gained actual request rate and with the difference of preceding twice request rate request rate as this group search, to obtain the number that hives off, and the number that hives off according to this is divided into a plurality of groups with the user termination environment, by the request rate of user's terminal of dynamic decision network,, can carry out best hiving off and group search to adjust the number that hives off adaptively.

Description

The group search method of adjustable group in the communication network system
Technical field
The present invention relates to network communications technology, is about a kind of group search method, refers to a kind of group search method that is applicable to adjustable group in the communication network system especially.
Background technology
Inquiry (GroupPolling) method of searching has been widely used in the service control (StationServiceControl) in terminal station of cable TV (CableTV) network for example or wireless telecommunications (WirelessCommunication) network, and to search by inquiry and find out user's terminal (UserTerminal) with demand for services by head end (HeadEnd) management system, for example, prepare to send requirement (Request) or upload user's terminal of information (Up-StreamTransmission).Fig. 1 shows 13 user's terminal u1 ~ u13 in the cable TV network, wherein, u2, u4, u6, u7 and u12 are the user's terminal with demand for services, significantly, head end management system 11 must be ask to each user's terminal and be searched, and amounts to carry out altogether asking to search for 13 times just guaranteeing correctly to find out user's terminal that all have demand for services.
Yet, in the application of reality, user's terminal in the network numerous, so aforementioned simple inquiry search method will be too consuming time and unrealistic, therefore, user's terminal hived off just becomes a feasible mode to ask group search (GroupPolling) method of searching, it mainly is that the user termination environment in the communication network is divided into several groups, and the head end management system is to ask to each group to search, when a group is searched out by inquiry, one user's terminal of group just can obtain required service, yet, expectedly be, when having two or more user's terminals to have demand for services in the group simultaneously, to produce collision (Collision), search and must further ask again, that is need (DichotomyPartition) cut with dichotomy in the group of collision, ask again and search, (Recursive) execution of so pulling over is all searched by inquiry up to all user's terminals with demand for services, so the generation of collision will cause the great added burden of system as can be known, therefore, how reducing the number of times of collision in the group search method, is an epochmaking problem then.
Summary of the invention
Main purpose of the present invention is that a kind of group search method is being provided, and can carry out best hiving off and group search, and with the chance that effective reduction bumps, makes to ask and search the number of times minimization.
For reaching above-mentioned purpose, group search method of the present invention is to search the user's terminal that has demand for services in the communication network system in order to inquiry, and it comprises the steps:
(A) the user termination environment with communication network system is divided into a plurality of groups, and each group has at least one user's terminal; (B) group is carried out the group search of starting stage, finding out user's terminal number that all have demand for services, and obtain the request rate of demand for services; (C) with the request rate before obtained request rate, obtain the number that hives off, and the number that hives off according to this is divided into a plurality of groups with the user termination environment as this group search; (D) group is carried out group search, finding out user's terminal number that all have demand for services, and obtain actual request rate; (E) the actual request rate of an above group search gained and with the difference of preceding twice request rate request rate as this group search, obtain the number that hives off, and the number that hives off according to this is divided into a plurality of groups with the user termination environment; (F) these a plurality of groups are carried out group search, finding out user's terminal that all have demand for services, and obtain actual request rate; And (G) repeating step (E) and (F) to carry out group search.
Described group search method, it is in step (A), and user's terminal of communication network system is to divide into G 0Individual (the G of group 0Be positive integer), G 0Be an empirical value or a preset value.
Described group search method, wherein, G 0=1/2 * T, in the middle of, T is all user's terminal numbers (T is a positive integer) of communication network system.
Described group search method, it is in step (B), and the request rate of the demand for services of being obtained is R 0=M 0/ T, in the middle of, M 0Be the user's terminal number with demand for services, all user's terminal number (M that T is communication network system 0For nonnegative integer, T are positive integer).
Described group search method, it is in step (C), and the number of being obtained that hives off is G 1=R 0* T, and so that the user termination environment is divided into G 1Group.
Described group search method, its in step (D).The request rate of the reality of being obtained is R 1=M 1/ T, in the middle of, M 1User's terminal number (M with demand for services 1Be nonnegative integer).
Described group search method, it is in step (E), and the number that hives off of obtaining is G i=R i' * T, in the middle of, R i'=R I-1+ (M I-1-M I-2)/T, R I-1Be the actual request rate of last group search gained, (M I-1-M I-2)/T is the difference (M of preceding twice request rate I-1And M I-2Be nonnegative integer).Described group search method, it is in step (F), and the request rate of the reality of being obtained is R i=M i/ T, in the middle of, M iFor having user's terminal number (M of demand for services iBe nonnegative integer).
Description of drawings
Fig. 1: be in a cable TV network, user's terminal to be sought the schematic diagram of searching;
Fig. 2: the flow chart that is the group search method of adjustable group in the communication network system of the present invention;
Fig. 3: be to show the schematic diagram that carries out group search with method of the present invention in the starting stage;
Fig. 4: be to show with method of the present invention to carry out the schematic diagram of group search for the first time;
Fig. 5: be to show with method of the present invention to carry out the schematic diagram of group search for the second time.
Embodiment
Please refer to a flow chart shown in Figure 2 and an example network schematic diagram shown in Figure 3, preferred embodiment for the group search method of adjustable group in the communication network system of the present invention, wherein, be provided with T user's terminal in the network, and carry out group search to find out user's terminal that all have demand for services by head end management system 11, for convenience of description, in this embodiment, T=13, and these 13 user's terminals are to represent with u1~u13.
In the flow process of the inventive method as shown in Figure 2, in starting stage (i=0) (step S201), at first the user termination environment with network is divided into G 0Individual group, G 0Can be an empirical value or a preset value, for example G 0=1/2 * T, and by head end management system 11 to this G 0Individual group carries out group search (step S202), to find out user's terminal number M that all have demand for services 0, and learn actual request rate R 0=M 0/ T.
In step S203, be the actual request rate R of an above group search gained 0As the request rate of this (i=1) group search, and calculate the number that hives off (GroupCount) G 1=R 0* T, and so that the user termination environment is divided into G 1Individual group, and by head end management system 11 to this G 1Individual group carries out group search (step S204), to find out user's terminal number M that all have demand for services 1, and learn actual request rate R 1=M 1/ T.
In step S205, be the actual request rate R of an above group search gained I-1And with the difference of preceding twice request rate request rate, that is R as this (the i time) group search i'=R I-1+ (M I-1-M I-2)/T, and calculate the number G that hives off i=R i' * T, and so that the user termination environment is divided into G iIndividual group, and by head end management system 11 to this G iIndividual group carries out group search (step S206), to find out user's terminal M that all have demand for services i, and learn actual request rate R i=M i/ T.Afterwards, i=I+1, repeating step S205,206 owing to carry out the branch group time at every turn, is with R to carry out group search i'=R I-1+ (M I-1-M I-2)/T is as the request rate of group search, wherein, and R I-1, be resulting actual request rate behind the preceding group search, and (M I-1-M I-2) then represent preceding secondary between the preceding group search, amount of variability with user's terminal number of demand for services, the present invention can be according to the previous actual situation that takes place and the trend of change as can be known, and dynamically adjust the number that hives off of each group search, and, reduce the chance that group search bumps to reach best hiving off.
Fig. 3 to Fig. 5 shows an actual example of the group search method of adjustable group in the communication network system of the present invention, wherein, is provided with 13 user's terminals (T=13) in the network, and these 13 user's terminals are to represent with u1-u13.As shown in Figure 3, in the starting stage, the user termination environment of network is divided into 6 groups:
The 1:{u1 of group, U2,
The 2:{u3 of group, u4},
The 3:{ of group U5, U6,
The 4:{u7 of group, u8},
The 5:{u9 of group, u10},
The 6:{u11 of group, u12, U13,
And carry out group search six times by six groups of head end management system 11 contrasts, wherein, user's terminal u5 and u6 in the group 3 all have demand for services and produce collision, must cut with dichotomy, carry out twice inquiry again and search, finding out all the user's terminals with demand for services at last is u2, u5, u6, u13 (M 0=4), so learn actual request rate R 0=4/13.
Then, carry out the primary group search cycle, as shown in Figure 4, suppose that the user's terminal that has a demand for services this moment is u2, u4, u6, u7, u12, this time (i=1) group search its with R 0As request rate, the number G that hives off that is calculated 1=4/13 * 13=4, so the user termination environment is divided into 4 groups:
The 1:{u1 of group, U2, u3},
The 2:{ of group U4, u5, U6,
The 3:{ of group U7, u8, u9},
The 4:{u10 of group, u11, U12, u13},
Search and these four groups are carried out the inquiry of fourth order group group by head end management system 11, wherein, user's terminal u4 and u6 in the group 2 all have demand for services and produce collision, must be more further with the dichotomy cutting, carry out twice inquiry and search and find out all user's terminal u2, u4, u6, u7, u12 (M with demand for services 1=5), so learn actual request rate R 1=5/13.
Afterwards, carry out secondary group search cycle, as shown in Figure 5, suppose that the user's terminal that has a demand for services this moment is u1, u3, u5, u8, u9, u11, this time the request rate R of (i=1) group search 2'=R 1(M 1-M 0)/T=(5/13)+(1/13)=6/13, the number G that hives off that is calculated 2=(6/13) * 13 approximate 6, so the user termination environment is divided into 6 groups:
The 1:{ of group U1, u2},
The 2:{ of group U3, u4},
The 3:{ of group U5, u6},
The 4:{u7 of group, U8,
The 5:{ of group U9, u10},
The 6:{ of group U11, u12, u13},
And these six groups are carried out group search six times by head end management system 11, wherein also collisionless produces, so can find out all user's terminal u1, u3, u5, u8, u9, the u11 (M with demand for services 2=6), so learn actual request rate R 2=6/13.
By the flow chart of the group search method of adjustable group in the above communication network system of the present invention and example as can be known, the present invention is based on the request rate of user's terminal of dynamic decision network, (Adaptive) adjusts the number that hives off with adaptively, can carry out best hiving off and group search, make the number of the demand for services in each group almost have only one, that is ask that to search number of times few, the chance that bumps almost is a zero degree.
The foregoing description only is to give an example for convenience of description, and the interest field that the present invention advocated should be as the criterion so that claim is described certainly, but not only limits to the foregoing description.

Claims (3)

1. the group search method of adjustable group in the communication network system is searched the user's terminal that has demand for services in the communication network system in order to inquiry, it is characterized in that this method comprises the steps:
(A) the user termination environment with communication network system is divided into a plurality of groups, and each group has at least one user's terminal;
(B) group is carried out the group search of starting stage, finding out user's terminal number that all have demand for services, and obtain the request rate of demand for services, wherein the request rate of the demand for services of being obtained is R 0=M 0/ T, M 0Be the user's terminal number with demand for services, all user's terminal numbers that T is communication network system, and M 0For nonnegative integer, T are positive integer;
(C) with the request rate before the obtained request rate as this group search, obtain the number that hives off, and the number that hives off according to this is divided into a plurality of groups with the user termination environment, the number of wherein being obtained that hives off is G 1=R 0* T, and the user termination environment is divided into G 1Individual group;
(D) group is carried out group search, finding out user's terminal number that all have demand for services, and obtain actual request rate, wherein the request rate of the reality of being obtained is R 1=M 1/ T, M 1For having user's terminal number of demand for services, and M 1Be nonnegative integer;
(E) the actual request rate of an above group search gained and with the difference of preceding twice request rate request rate as this group search, obtain the number that this time hives off, and the number that hives off according to this is divided into a plurality of groups with the user termination environment; The number of being obtained that this time hives off is G i=R i' * T, in the middle of, variable i is a nonnegative integer, is to ask to search inferior code name, R i'=R I-1+ (M I-1-M I-2)/T, R I-1Be the actual request rate of last group search gained, (M I-1-M I-2)/T is the difference of preceding twice request rate, M I-1And M I-2Be nonnegative integer, be user's terminal number that last and last last time have demand for services, T is all user's terminal numbers of communication network system, and T is a positive integer;
(F) these a plurality of groups are carried out group search, finding out user's terminal that all have demand for services, and obtain this time actual request rate; The actual request rate of being obtained this time is R i=M i/ T, in the middle of, variable i is a nonnegative integer, is to ask to search inferior code name, M iFor this has user's terminal number of demand for services, M iBe nonnegative integer; And
(G) repeating step (E) reaches (F) to carry out group search.
2. group search method as claimed in claim 1 is characterized in that, in step (A), user's terminal of communication network system is to divide into G 0Individual group, G 0Be an empirical value or a preset value, and G 0Be positive integer.
3. group search method as claimed in claim 2 is characterized in that G 0=1/2 * T, in the middle of, T is all user's terminal numbers of communication network system, and T is a positive integer.
CNB031010237A 2003-01-08 2003-01-08 The group search method of adjustable group in the communication network system Expired - Fee Related CN100553200C (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CNB031010237A CN100553200C (en) 2003-01-08 2003-01-08 The group search method of adjustable group in the communication network system

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CNB031010237A CN100553200C (en) 2003-01-08 2003-01-08 The group search method of adjustable group in the communication network system

Publications (2)

Publication Number Publication Date
CN1516390A CN1516390A (en) 2004-07-28
CN100553200C true CN100553200C (en) 2009-10-21

Family

ID=34239029

Family Applications (1)

Application Number Title Priority Date Filing Date
CNB031010237A Expired - Fee Related CN100553200C (en) 2003-01-08 2003-01-08 The group search method of adjustable group in the communication network system

Country Status (1)

Country Link
CN (1) CN100553200C (en)

Also Published As

Publication number Publication date
CN1516390A (en) 2004-07-28

Similar Documents

Publication Publication Date Title
CN1227944C (en) System for uplink scheduling of packet data traffic in wireless system
CN1290372C (en) Class based bandwidth scheduling for CDMA air interfaces
US8094607B2 (en) Method and system for saving bandwidth during broadcasting/multicasting
CN105847148B (en) A kind of data frame transmission control method and system
CN1541463A (en) Managing burst profile characteristics in TDM systems
CN101622793A (en) Communication system, transmission device, reception device, and communication method
CN103686617A (en) Method and device for creating instant communication group
CN105611538A (en) Frequency point aggregation method and system for authorizing power wireless frequency bands
CN1409564A (en) Multiple partial news communication between honeyomb equipment using standard interface
CN102202229A (en) Method and device for real-time video gateway
CN100553200C (en) The group search method of adjustable group in the communication network system
CN102957631B (en) Preprocessing method
CN101039287A (en) Number receiving method for accessing gateway equipment
CN1773979A (en) Orthogonal frequency division multiplexing accurate time synchronizing, frame synchronizing and synchronous tracking method
CN117033498A (en) Integrated converged communication command method and system
CN112118411A (en) Data transmission method, device, terminal equipment and storage medium
WO2006034994A3 (en) Method for distributing software and configuration data with time supervision, and corresponding data network
CN115113821B (en) 5G big data power calculation service system based on quantum encryption
CN1283117C (en) Method of calling short dialing to client setup by cluster system
CN106685625A (en) Pilot frequency structure, pilot frequency transmitting method, and user channel estimation method
CN108111991B (en) D2D network building method based on scalable video streaming user experience quality
CN1309857A (en) Channel impulse response estimation using received signal variance
CN104618912A (en) Spectrum sensing-based heterogeneous cognitive wireless network resource distributing method
US20110299624A1 (en) Device and method for realizing prefix code construction
CN104254000A (en) Video data processing method and video data processing device

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
C14 Grant of patent or utility model
GR01 Patent grant
CF01 Termination of patent right due to non-payment of annual fee

Granted publication date: 20091021

Termination date: 20150108

EXPY Termination of patent right or utility model