CN104378740B - A kind of intellectual property network cluster calling system - Google Patents
A kind of intellectual property network cluster calling system Download PDFInfo
- Publication number
- CN104378740B CN104378740B CN201410618975.0A CN201410618975A CN104378740B CN 104378740 B CN104378740 B CN 104378740B CN 201410618975 A CN201410618975 A CN 201410618975A CN 104378740 B CN104378740 B CN 104378740B
- Authority
- CN
- China
- Prior art keywords
- grouping
- channel
- group
- individual
- probability
- 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.)
- Active
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W4/00—Services specially adapted for wireless communication networks; Facilities therefor
- H04W4/06—Selective distribution of broadcast services, e.g. multimedia broadcast multicast service [MBMS]; Services to user groups; One-way selective calling services
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04W—WIRELESS COMMUNICATION NETWORKS
- H04W84/00—Network topologies
- H04W84/02—Hierarchically pre-organised networks, e.g. paging networks, cellular networks, WLAN [Wireless Local Area Network] or WLL [Wireless Local Loop]
- H04W84/04—Large scale networks; Deep hierarchical networks
- H04W84/08—Trunked mobile radio systems
Abstract
The invention discloses a kind of colony communication calling method and system, are especially applied to the trunked call method and system of intellectual property network.It can be across area and profession, communication is fast implemented in the user of different grouping, and be able to achieve and make an announcement, group's meeting, across group discuss, the consulting multiple functions such as response, the present invention improves the algorithm of dynamic allocation in the prior art simultaneously, and utilization rate and the response for further improving channel are balanced.
Description
Technical field
The present invention relates to fields of communication technology, and in particular to a kind of group calling system applied to intellectual property network and
Method.
Background technique
Trunked communication system is a kind of specialized mobile radio technology, shares the dynamic allocation with channel by multichannel,
To efficiently use frequency resource and Internet resources, to reduce the construction and operation cost of communication network.
First generation analog cluster system shares frequency, equipment, the resource of service, can be realized the centralized maintenance of system with
Management.Using simplex communication mode, " message trunking " and " transmission trunking " are realized using multichannel technology of sharing, improves frequency
Road utilization rate.Second generation digital cluster system, the availability of frequency spectrum are greatly improved than simulation system, have further expanded system appearance
Amount.Trunked communication system generallys use one-to-many half-duplex call, must obtain right of speech first before group member speech, only
Obtaining right of speech just allows to talk, and the group member for not obtaining right of speech can only select to answer.Group service is logical between group user
Communication service, this just needs to be managed group: calling initiate when must establish in advance and select one by one or more groups
Then the group of member composition could exhale key to initiate the group by PTT (Push-to-Talk, push to talk) group in terminal
Group is exhaled.In third generation partner program (3GPP) agreement, when main dialing user in relay MSC exhale by initiation group, relaying
MSC obtains the address of controlling MSC from Group Call Register (GCR), and selection interoffice routing accordingly, uses group call reference as quilt
Code call out the numbers to construct call setup message, is sent to controlling MSC.
Currently, wireless cluster communication system is widely used to the command dispatch communication system of all trades and professions and various occasions
System.Intellectual property industry there has been no nationwide integrated special at present due to dividing with stronger regional and profession
The synthesis group calling system of benefit, copyright and trade mark.
Summary of the invention
The characteristics of present invention combination intellectual property field, a kind of colony communication calling system and method is provided, is especially answered
Group calling system and method for intellectual property network.The group calling system and method can cross over area and field,
Communication is fast implemented in the user of different grouping, and be able to achieve and make an announcement, group's meeting, across group discuss, consulting response etc.
Multiple functions, while the present invention improves the algorithm of dynamic allocation in the prior art, further improves the benefit of channel
It is balanced with rate and response.
The purpose of the present invention is what is be achieved through the following technical solutions:
A kind of group calling system, including grouping trunked call unit, which includes audio call
Module issues call instruction, it can be achieved that multiple calling parties online interactive voice simultaneously, and including voice broadcast service module,
Broadcasting instructions are issued, it can be achieved that unidirectionally sending voice messaging, which further includes allocation unit, receives grouping cluster
Call information is sent to buffer if it is call instruction by the information that calling unit issues；If it is broadcasting instructions,
Directly to caller party terminal pushed information.
A kind of intellectual property network cluster calling system, including calling party's grouped element, the calling party are grouped single
Member can multi-step grouping, level-one is grouped into be grouped according to patent, copyright, trade mark, wherein patent level-one grouping further establish
Patent secondary data packets, including invention, utility model, appearance grouping, and can be set by the user according to region or type of service into
One step divides, and each grouping all has unique ID.
Preferably, calling party's grouped element can further comprise south China according to region zones with adjustability
Area, East China, North China and national each province, each municipality directly under the Central Government, and new group can be established across level according to setting；Root
It is divided according to type of service, can further comprise multiple traffic packets such as copyright consulting, dispute over copyright, trade mark registration, trademark assignment,
And above-mentioned grouping can also select associated user in different groupings and establish new grouping according to setting, be handed over solving to exist
The case where cross-cutting exchange when fork business, above-mentioned grouping dynamic change packet ID while update.
Preferably, in group mode, there are single variable value grouping and two kinds away from grouping of group, wherein single variable value, which is grouped, is
Using a variate-value as one group, group is that whole variate-values are in turn divided into several sections away from grouping, and by each section
Variate-value is as one group.
Preferably, further include grouping trunked call unit, including audio call module, issue call instruction, it can be achieved that more
A calling party interactive voice online simultaneously, and including voice broadcast service module, broadcasting instructions are issued, it can be achieved that unidirectional send
Voice messaging；And
Allocation unit receives the information that grouping trunked call unit issues and sends out call information if it is call instruction
Give buffer；If it is broadcasting instructions, directly to caller party terminal pushed information；
Buffer memory unit extracts packet ID entrained by different call request informations, and the difference in special time period is exhaled
It is the same packets ID duplicate removal of user, and to different grouping ID with time order and function and priority orders, arrangement caching；
Memory cell, storage calling party register parameter information, including terminal name, IP address of terminal, packet ID, and
Updated in real time according to other updates request is organized where calling party, according to dynamic allocation principle, corresponding packet ID with
Mapping relations are established between multiple points of processors；
Control unit successively receives packet ID in buffer, and according to specified point of the mapping relations of memory cell storage
Processor receives the call request information that corresponding calling party issues, and guarantees the calling of same group member, using specified
Divide processor processing；
Multiple points of processor units issue instruction according to the call request information that calling party issues, are sent to called
User terminal, and according to called party's terminal feedback information, establish corresponding communication channel.
Preferably, further include dividing processor unit, balance module is handled with solicited message, so that each
Divide the work relative equilibrium of processor.
Preferably, dividing processor unit includes dynamic channel allocation unit comprising following modules: (1) believing
Road division module: all groupings of different ID are divided into channel N1, N2 ..., sum is N, then grouped channels variation range is 0
~N, specific distribution condition are limited by the traffic and conflict, indicate conflict limitation with matrix X:
Wherein, XijThe conflict limitation of channel, the row and column where i and j are respectively represented in conflict restriction matrix are represented, M is
Entire channel number, when a channel cannot be reused by being grouped i and j, Xij=1, if grouping i and j can reuse a channel,
Xij=0, each grouped channels service condition is indicated with matrix A:
Wherein, if grouping i distributes channel, there is aik=1, otherwise, aik=0；This method comprises the following steps:
Every a line of matrix A is mapped as independent string, i.e. the i-th row is mapped as Ai=ai1ai2...aiN, whole system
Channel B is mapped as M*N independent strings, structure type B=a11a12...a1N...ai1ai2...aiN...aM1aM2...aMN,
The wherein corresponding gene strand of each state；
(2) initial population generation module: setting initial population individual amount as 30, random to generate certain amount individual, is
30 multiple therefrom screens defect individual and is put into initialization population, until population at individual quantity reaches requirement；
(3) the fitness function constructing module of grouped channels: setting tiIt is grouped the number of channel of demand for i-th, then has suitable
Response function:
Wherein, aiK is the i-th row K column channel usage, and ajK is jth row K column channel usage；
(4) to the selection operation module of different ID grouping: selection operation is built upon in all groupings of multiple and different ID
On the basis of individual adaptation degree assessment, it is assumed that some individual B ' fitness is f (B ') in group, then some individual B ' is selected
Probability is Ps=f (B ')/Σ f (B '), individual adaptation degree is bigger, and the probability selected is higher, and individual adaptation degree is smaller, is selected
Probability is lower, can thus determine that those individuals are selected；
(5) channel assignment module determines final Channel distribution mode according to genetic operator, wherein genetic operator packet
Improved crossover operator and improved mutation operator are included, wherein the crossover probability P of improved crossover operatorcChange formula are as follows:
Wherein, favgFor the whole individual average fitness values of contemporary population, fmaxFor maximum adaptation angle value individual in population,
fminFor individual minimum fitness value, f in populationiBiggish, the P for fitness value in 2 intersection individualsC1, Pc2, PC3It respectively indicates
The value of three different phase crossover probabilities, PC1Indicate fiCrossover probability when=0, Pc2Indicate fi=favgWhen crossover probability, Pc3It indicates
fi=fmaxWhen crossover probability；
The mutation probability P of improved mutation operatormFormula it is as follows:
Wherein fiFor chromosome fitness value, favgFor population average fitness value, Pm1, Pm2Respectively indicate two not same orders
The numerical value of section mutation probability, Pm1Indicate fi≤favgWhen mutation probability, Pm2Indicate fi> favgWhen mutation probability；
Termination condition, when algorithm evolution is to regulation algebra, when for example, 100 generation, the corresponding individual of fitness value f (B ')
B ' is the solution that algorithm is eventually found.
The technical solution implemented using the present invention, can focus on voice, broadcast capability, and guarantee same group member
Calling, divide processor to handle by specified, to save system resource, and good experience can be brought to user, reduce weight
The multiple number of calls.
Detailed description of the invention
Fig. 1 is intellectual property network cluster calling system packet diagram according to an embodiment of the present invention；
Fig. 2 is intellectual property network cluster calling system composition block diagram according to an embodiment of the present invention；
Fig. 3 is dynamics of channels allocation process diagram according to an embodiment of the present invention；
Fig. 4 is intellectual property network cluster calling system call flow diagram according to an embodiment of the present invention.
Specific embodiment
The present invention is understood and realized for the ease of persons skilled in the art, is described now in conjunction with attached drawing of the invention real
Example.
Intellectual property calling terminal, there are many block forms, wherein, can be as shown in Figure 1, carrying out as a part of example
Lower column split, level-one grouping are as follows: patent group, copyright group and trade mark group；Secondary data packets are as follows: patent group is further divided into appearance
Group, utility model group and invention group.Divided again according to user setting according to geographic location area and type of service simultaneously
Group, for example can be divided into according to region: Beijing group, Shanghai group, Hebei group etc. can combine before any group；According to traffic packets
Can be divided into: patent information issues bulletin group, patent consultation group, application process inquiry group, patent right transfer exchange group etc..
The grouping of intellectual property calling terminal has adjustability, can further comprise south China according to region zones
Area, East China, North China and national each province, each municipality directly under the Central Government, and new group can be established according to being manually set across level；
It is divided according to type of service, can further comprise multiple business such as copyright consulting, dispute over copyright, trade mark registration, trademark assignment point
Group, and above-mentioned grouping can also select associated user in different groupings and establish new grouping according to artificial settings, to solve
The case where there are cross-cutting exchanges when cross business.Above-mentioned grouping can dynamically update, while change packet ID.
In group mode, there are single variable value grouping and two kinds away from grouping of group.Single variable value grouping is a variate-value
As one group, this grouping general value is suitble to discrete variable, and uses in the less situation of variate-value.In continuous variable or change
In the case that magnitude is more, group is generallyd use away from grouping.It is whole variate-values are in turn divided into several sections, and by this
The variate-value in section is as one group.In group away from grouping, the minimum value of a group is known as lower limit；On the maximum value of one group is known as
Limit.When using group away from grouping, needs to follow and do not weigh leak-free principle.It is a certain wherein not refer to that an item data can only divide again
Group cannot repeat in other groups；It does not leak and refers to that group can be exhaustive, i.e., each item data in divided whole groups
It can divide in a certain group wherein, cannot omit.Group number generally with the characteristics of data itself and data number it is related.Due to dividing
Group the first purpose be observe data distribution feature, therefore organize number number answer it is moderate.If it is very little to organize number, the distribution of data
It will excessively concentrate, group number is too many, and data distribution will excessively disperse, this is all not easy to the feature of observation data distribution and rule
Rule.The determination of group number should be for the purpose of the distribution characteristics and rule that can show data.It, can be according to the more of data when practical application
It is required with feature and analysis less to determine a group number.Determine the group of each group away from.Group is away from the upper limit for being a group and the difference of lower limit.Group away from
It can be determined according to the maximum value of total data and minimum value and the group divided number and group is away from=(one minimum value of maximum value)/group
Number.Frequency distribution table is organized into according to grouping.
By packet transaction, the processing speed of mass data can be improved, and by the standardized designs of data grouping,
To realize the dynamic equalization of data grouping.
Embodiment one
Present embodiment describes a kind of intellectual property network cluster calling systems, as shown in Fig. 2, the system includes:
Calling party's grouped element 100 has patent group 101, copyright group 102, trade mark group 103, wherein patent group is also wrapped
Invention group 1011, utility model group 1012, appearance group 1013 are included, and can be set by the user and further be drawn according to region or business
Point, each grouping all has unique ID；
It is grouped trunked call unit 200, including audio call module 201, issues call instruction, it can be achieved that multiple callings are used
Family interactive voice online simultaneously, and including voice broadcast service module 202, broadcasting instructions are issued, it can be achieved that unidirectionally sending voice
Information；
Allocation unit 300 receives the information that grouping trunked call unit issues and believes calling if it is call instruction
Breath is sent to buffer 400；If it is broadcasting instructions, directly to caller party terminal pushed information:
Buffer memory unit 400 extracts packet ID entrained by different call request informations, by the difference in special time period
The same packets ID duplicate removal of calling party, and to different grouping ID with time order and function and priority orders, arrangement caching；
Memory cell 500, storage calling party register parameter information, including terminal name, IP address of terminal, grouping
ID, and updated in real time according to other update request is organized where calling party, according to principle is dynamically distributed, it is grouped accordingly
Mapping relations are established between ID and multiple points of processors 700；
Control unit 600 successively receives packet ID in buffer, and specified according to the mapping relations of memory cell storage
Divide processor to receive the call request information that corresponding calling party issues, guarantee the calling of same group member, using specified
Divide processor to handle；
Multiple points of processor units 700 issue instruction according to the call request information that calling party issues, are sent to and are exhaled
It is user terminal, and according to called party's terminal feedback information, establishes corresponding communication channel；
Dynamic allocation divide processor unit 800, handle homeostatic principle according to solicited message, so that each dividing the work of processor
Make relative equilibrium.
The calling of mobile communication system is all point-to-point communication mode, as long as system establishes a pair of of signaling connection and industry
Business channel can meet call caller and called call demand, and system is the use that the Traffic Channel that user provides all is in call
Family is dedicated.And the calling of trunked communication system, it is all point-to-multipoint mostly, Traffic Channel is all shared, at this moment caller
User is one, and called subscriber has many, everybody monitors a Traffic Channel, and called subscriber is likely to not be distributed in
In one region.This makes system establish signaling connection and shared service channel for each region, while will also be according to group
The region of service provided is changed in the movement of user in real time, group user to new region establish signaling connection and shared
Traffic Channel.The mode of this shared channel of trunked communication system is wanted complicated and is obtained than the mode of the dedicated channel of mobile communication
It is more, need to rethink that this algorithm of channel resource allocation algorithm is than relatively time-consuming process.It is logical that the application will also solve cluster
The Channel Assignment Problems of letter system.
Dynamic allocation divide processor unit to include dynamic channel allocation unit comprising channel division module, initial population
Generation module, grouped channels fitness function constructing module, to different ID grouping selection operation module and channel distribution
Module, workflow are as shown in Figure 3: channel division module, by all groupings of the different ID handled in group system,
It is divided into channel N1, N2 ..., sum is N, then grouped channels variation range is 0~N, and specific distribution condition is by the traffic and punching
Prominent limitation indicates conflict limitation with matrix X:
Wherein, XijThe conflict limitation of channel, the row and column where i and j are respectively represented in conflict restriction matrix are represented, M is
Entire channel number, when a channel cannot be reused by being grouped i and j, Xij=1, if grouping i and j can reuse a channel,
Xij=0, each grouped channels service condition is indicated with matrix A:
Wherein, if grouping i distributes channel, there is aik=1, otherwise, aik=0；This method comprises the following steps:
Every a line of matrix A is mapped as independent string, i.e. the i-th row is mapped as Ai=ai1ai2...aiN, whole system
Channel B is mapped as M*N independent strings, structure type B=a11a12...a1N...ai1ai2...aiN...aM1aM2...aMN,
The wherein corresponding gene strand of each state；
It is gene by the Parameter Switch in Channel Assignment Problems, it is specially that a grouped channels service condition is only with N
Every a line of matrix A is mapped as independent string, i.e. A by vertical stringi=ai1ai2...aiN, whole system channel is mapped as M*N
The independent string in position, structure type B=a11a12...a1N...ai1ai2...aiN...aM1aM2...aMN, wherein each state is corresponding
One gene strand.
Initial population generation module: initial population individual amount is set as 30, the random certain amount individual that generates (is 30
Multiple), it therefrom screens defect individual and is put into initialization population, until population at individual quantity reaches requirement.
The fitness function of grouped channels constructs, and genetic algorithm is using fitness function as foundation, and channel distribution is by the traffic
And conflict restriction, set tiIt is grouped the number of channel of demand for i-th, then has fitness function:
Wherein, aiK is the i-th row K column channel usage, and ajK is jth row K column channel usage；
To the selection operation of different ID grouping: on the basis of selection operation is built upon individual in population Fitness analysis,
Some individual B ' fitness is f (B ') in assumed group, then the probability that some individual B ' is selected is Ps=f (B ')/Σ f
(B '), individual adaptation degree is bigger, and the probability selected is higher, and individual adaptation degree is smaller, lower by select probability.It thus can be with
Determine that those individuals are selected.
According to genetic operator, final Channel distribution mode is determined:
Genetic operator includes improved crossover operator and improved mutation operator, wherein the intersection of improved crossover operator is general
Rate PcChange formula are as follows:
Wherein, favgFor the whole individual average fitness values of contemporary population, fmaxFor maximum adaptation angle value individual in population,
fminFor individual minimum fitness value, f in populationiBiggish, the P for fitness value in 2 intersection individualsC1, Pc2, PC3It respectively indicates
The value of three different phase crossover probabilities, PC1Indicate fiCrossover probability when=0, Pc2Indicate fi=favgWhen crossover probability, Pc3It indicates
fi=fmaxWhen crossover probability；
The mutation probability P of improved mutation operatormFormula it is as follows:
Wherein fiFor chromosome fitness value, favgFor population average fitness value.Pm1, Pm2Respectively indicate two not same orders
The numerical value of section mutation probability, Pm1Indicate fi≤favgWhen mutation probability, Pm2Indicate fi> favgWhen mutation probability.
Termination condition, when algorithm evolution is to regulation algebra, such as when 100 generation, the corresponding individual B of fitness value f (B) is calculation
The solution that method is eventually found.
The embodiment improves the performance of trunked call, so that KPI (Key Performance Indications), i.e.,
Refer to that KPI Key Performance Indicator obtains larger promotion, is in particular in following index: (1) percent of call completed, the percent of call completed of the present embodiment
>=95%, compared with the percent of call completed 80% of professional standard, it is higher than professional standard 15%, to improve customer satisfaction.(2)
Service level, i.e., answerphone quantity and call center access the percentage of phone in several seconds in some statistical time section, adopt
With the present embodiment, 95% phone responds within 20 seconds, and the phone that professional standard is 80% is made within 20 seconds
Response.(3) average queuing time, i.e., in certain section of statistical time, the waiting of awaiting acknowledgement is averaged after caller shortlists
Waiting time.Average queuing time≤10 second of the present embodiment, and professional standard is 20 seconds, is substantially reduced when waiting in line
Between.Therefore, the present invention improves percent of call completed, reduces waiting time and queuing time, so that cost sharp fall.
Embodiment two
Trunked call is all with the group common busy channel of cluster user in coverage area.Each usual user will occupy
The independent communication resource, also mean that resource occupation how many user in business realizing enter group exhale it is necessary to occupy how much
Channel resource, resource occupation will also double for PTT.
For this prior art problem, present embodiment describes a kind of work of intellectual property network cluster calling system
Process to save the communication resource, and realizes by optimizing the workflow of group calling system and quickly establishes communication
Channel, for specific workflow as shown in figure 4, step 1, calling party's grouped element issues audio call or broadcasting instructions,
Audio call can realize multiple calling parties interactive voice online simultaneously, and broadcasting instructions are, it can be achieved that unidirectionally send voice messaging；
Step 2, allocation unit receives the information that calling party's grouped element issues, and identifies to the type of information, if identification
As a result it is call instruction, sends information to buffer memory unit caching, it is if recognition result is broadcasting instructions, information is direct
It is pushed to user terminal；Step 3, buffer memory unit handles the information received, extracts the grouping that solicited message carries
ID, in special time period, by the same packets ID duplicate removal of different calling parties, and to different grouping ID with time order and function and in advance
The priority orders sequence first set；Step 4, using the user parameter information and packet ID that are stored in memory cell and
Mapping table between processor unit, control unit, which distributes to call request information, different divides processor unit；Step
Rapid 5, according to called party's terminal feedback information, it is confirmed whether to allow to establish connection, communication channel is established if allowing.
The channel distribution for the trunked communication system for being same as above embodiment one is utilized simultaneously: dividing the processor unit to include
Dynamic channel allocation unit comprising channel division module, initial population generation module, grouped channels fitness function construction
Module, to different ID grouping selection operation module and channel assignment module, workflow it is as shown in Figure 3: channel divide
All groupings of the different ID handled in group system are divided into channel N1, N2 ... by module, and sum is N, then are grouped
Channel variation range is 0~N, and specific distribution condition is limited by the traffic and conflict, indicates conflict limitation with matrix X:
Wherein, XijThe conflict limitation of channel, the row and column where i and j are respectively represented in conflict restriction matrix are represented, M is
Entire channel number, when a channel cannot be reused by being grouped i and j, Xij=1, if grouping i and j can reuse a channel,
Xij=0, each grouped channels service condition is indicated with matrix A:
Wherein, if grouping i distributes channel, there is aik=1, otherwise, aik=0；This method comprises the following steps:
Every a line of matrix A is mapped as independent string, i.e. the i-th row is mapped as Ai=ai1ai2...aiN, whole system
Channel B is mapped as M*N independent strings, structure type B=a11a12...a1N...ai1ai2...aiN...aM1aM2...aMN,
In the corresponding gene strand of each state；
It is gene by the Parameter Switch in Channel Assignment Problems, it is specially that a grouped channels service condition is only with N
Every a line of matrix A is mapped as independent string, i.e. A by vertical stringi=ai1ai2...aiN, whole system channel is mapped as M*N
The independent string in position, structure type B=a11a12...a1N...ai1ai2...aiN...aM1aM2...aMN, wherein each state is corresponding
One gene strand.
Initial population generation module: initial population individual amount is set as 30, the random certain amount individual that generates (is 30
Multiple), it therefrom screens defect individual and is put into initialization population, until population at individual quantity reaches requirement.
The fitness function of grouped channels constructs, and genetic algorithm is using fitness function as foundation, and channel distribution is by the traffic
And conflict restriction, set tiIt is grouped the number of channel of demand for i-th, then has fitness function:
Wherein, aiK is the i-th row K column channel usage, and ajK is jth row K column channel usage；
It is false on the basis of being built upon individual in population Fitness analysis to the selection operation selection operation of different ID grouping
If some individual B ' fitness is f (B ') in group, then the probability that some individual B ' is selected is Ps=f (B ')/Σ f (B ')
Individual adaptation degree is bigger, and the probability selected is higher, and individual adaptation degree is smaller, lower by select probability.It can thus determine
Those individuals are selected.
According to genetic operator, final Channel distribution mode is determined:
Genetic operator includes improved crossover operator and improved mutation operator, wherein the intersection of improved crossover operator is general
Rate PcChange formula are as follows:
Wherein, favgFor the whole individual average fitness values of contemporary population, fmaxFor maximum adaptation angle value individual in population,
fminFor individual minimum fitness value, f in populationiBiggish, the P for fitness value in 2 intersection individualsC1, Pc2, PC3It respectively indicates
The value of three different phase crossover probabilities, PC1Indicate fiCrossover probability when=0, Pc2Indicate fi=favgWhen crossover probability, Pc3It indicates
fi=fmaxWhen crossover probability；
The mutation probability P of improved mutation operatormFormula it is as follows:
Wherein fiFor chromosome fitness value, favgFor population average fitness value.Pm1, Pm2Respectively indicate two not same orders
The numerical value of section mutation probability, Pm1Indicate fi≤favgWhen mutation probability, Pm2Indicate fi> favgWhen mutation probability.
Termination condition, when algorithm evolution is to regulation algebra, such as when 100 generation, the corresponding individual B of fitness value f (B) is calculation
The solution that method is eventually found.
The embodiment optimizes the workflow of trunked call, so that KPI (Key Porformancc
Indications), that is, refer to that KPI Key Performance Indicator obtains larger promotion, be in particular in following index: (1) shortening and connect
The logical time, turn-on time≤15 second of the present embodiment, compared with professional standard≤30 second, period of reservation of number shortens half,
To improve work efficiency；(2) it avoids repeating to dial, by using the workflow of the present embodiment, so that in same grouping
Member avoids repeating to dial when being in communication with each other, be focused on by same point of processor, to quickly establish connection；(3) communication money
Source utilization rate, the present embodiment is by packet ID and divides the mapping between processor, takes full advantage of the communication resource, so that communication money
Source utilization rate reaches 99%, and the requirement higher than current professional standard 85% also reduces to improve the utilization rate of the communication resource
The maintenance cost of group calling system；(4) by way of dynamically distributing and sharing, reduce in network processes calling procedure
Time delay has quickly access, high channel efficiency and frequency spectrum utilization rate, higher user privacy, expansibility and supports industry
Type of being engaged in waits technological merits more.Channel sharing can adjust surplus and deficiency, dynamically distribute total number of users that channel can be supported than dispersion
The number of users summation that each self-channel that these total channels are distributed to each net when networking can be supported is much greater, thus can also improve
Service quality；It concentrates networking that can also strengthen management and safeguard, thus the grade of service can be improved, enhance system function.
Although depicting the present invention by embodiment, it will be appreciated by the skilled addressee that of the invention not departing from
In the case where spirit and essence, so that it may make the present invention there are many deformation and variation, the scope of the present invention is by the attached claims
To limit.
Claims (2)
1. a kind of intellectual property network cluster calling system, including calling party's grouped element, it is characterised in that: the calling is used
Family grouped element, with multi-step grouping, level-one grouping includes patent, copyright, trade mark grouping, is established under the grouping of patent level-one
Patent secondary data packets, including invention, utility model, appearance grouping, and can be set by the user according to region or type of service again
Secondary to be grouped, every grade of each grouping all has unique ID；
Calling party's grouped element is according to region zones, it may include South China, East China, North China, and according to
Setting establishes new grouping across level；It is divided according to type of service, including copyright consulting, dispute over copyright, trade mark registration, trade mark
Multiple traffic packets are transferred the possession of, and above-mentioned grouping can select associated user in different groupings and establish new grouping, it is above-mentioned
Packet ID is changed when grouping updates simultaneously；
Grouping includes single variable value grouping and group away from grouping, single variable value grouping be using a variate-value as one group, group away from point
Group is that whole variate-values are in turn divided into several sections, and using the variate-value in each section as one group；
Further include grouping trunked call unit, including audio call module, issues call instruction, it can be achieved that multiple calling parties are same
When online interactive voice, and including voice broadcast service module, issue broadcasting instructions, it can be achieved that unidirectionally sending voice messaging；Also
Including
Allocation unit receives the information that grouping trunked call unit issues, and the information includes call instruction and broadcasting instructions, such as
Fruit is call instruction, then call information is sent to buffer；If it is broadcasting instructions, directly to caller party terminal
Pushed information；Buffer memory unit extracts packet ID entrained by different call request informations, and the difference in special time period is exhaled
It is the same packets ID duplicate removal of user, and to different grouping ID with time order and function and preset priority orders, to caching
ID arranged；
Memory cell, storage calling party's registration parameter information, including terminal name, IP address of terminal, packet ID, and according to
It organizes other updates request where calling party to be updated in real time, according to dynamic allocation principle, in corresponding packet ID and multiple
Divide between processor and establishes mapping relations；
Control unit successively receives packet ID in buffer, and according to the specified point of processing of the mapping relations of memory cell storage
Device receives the call request information that corresponding calling party issues, and guarantees the calling of same group member, is existed respectively using specified
Manage device processing；
Multiple points of processor units issue instruction according to the call request information that calling party issues, are sent to called party
Terminal, and according to called party's terminal feedback information, establish corresponding communication channel；
Dynamic allocation divide processor unit, handle balance module with solicited message, so that each dividing the work phase of processor
To equilibrium.
2. a kind of intellectual property network cluster calling system as described in claim 1, it is characterised in that: dynamically distribute a point processing
Device unit includes dynamic channel allocation unit comprising following modules:
(1) channel division module: all groupings of different ID are divided into channel N1, N2 ..., sum is N, then grouped channels become
Change range is 0~N, and specific distribution condition is limited by the traffic and conflict, indicates conflict limitation with matrix X:
Wherein, XijThe conflict limitation of channel is represented, the row and column where i and j are respectively represented in conflict restriction matrix, M is entire
Channel number, when a channel cannot be reused by being grouped i and j, Xij=1, if grouping i and j can reuse a channel, Xij
=0, each grouped channels service condition is indicated with matrix A:
Wherein, if grouping i distributes channel, there is aik=1, otherwise, aik=0；Include the following steps:
Every a line of matrix A is mapped as independent string, i.e. the i-th row is mapped as Ai=ai1ai2...aiN, whole system channel B
It is mapped as M*N independent strings, structure type B=a11a12...a1N...ai1ai2...aiN...aM1aM2...aMN, wherein often
One state corresponds to a gene strand；
(2) initial population generation module: setting initial population individual amount as 30, random to generate certain amount individual, is 30
Multiple therefrom screens defect individual and is put into initialization population, until population at individual quantity reaches requirement；
(3) the fitness function constructing module of grouped channels: setting tiIt is grouped the number of channel of demand for i-th, then has fitness letter
Number:
Wherein, aiKFor the i-th row K column channel usage, ajKFor jth row K column channel usage；
(4) to the selection operation module of different ID grouping: selection operation is built upon in all groupings of multiple and different ID individual
On the basis of Fitness analysis, it is assumed that some individual B ' fitness is f (B '), the then probability that some individual B ' is selected in group
For Ps=f (B ')/∑ f (B '), individual adaptation degree is bigger, and the probability selected is higher, and individual adaptation degree is smaller, by select probability
It is lower, it can thus determine that those individuals are selected；
(5) channel assignment module determines final Channel distribution mode according to genetic operator, wherein genetic operator includes changing
Into crossover operator and improved mutation operator, wherein the crossover probability P of improved crossover operatorcChange formula are as follows:
Wherein, favgFor the whole individual average fitness values of contemporary population, fmaxFor maximum adaptation angle value individual in population, fminFor
Individual minimum fitness value, f in populationiBiggish, the P for fitness value in 2 intersection individualsC1, Pc2, PC3Respectively indicate three
The value of different phase crossover probability, PC1Indicate fiCrossover probability when=0, Pc2Indicate fi=favgWhen crossover probability, Pc3Indicate fi=
fmaxWhen crossover probability；
The mutation probability P of improved mutation operatormFormula it is as follows:
Wherein fiFor chromosome fitness value, favgFor population average fitness value, Pm1, Pm2Two different phases are respectively indicated to become
The numerical value of different probability, Pm1Indicate fi≤favgWhen mutation probability, Pm2Indicate fi> favgWhen mutation probability；
Termination condition, when algorithm evolution is to when providing algebra, the corresponding individual B ' of fitness value f (B ') is what algorithm was eventually found
Solution.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410618975.0A CN104378740B (en) | 2014-11-06 | 2014-11-06 | A kind of intellectual property network cluster calling system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201410618975.0A CN104378740B (en) | 2014-11-06 | 2014-11-06 | A kind of intellectual property network cluster calling system |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN104378740A CN104378740A (en) | 2015-02-25 |
| CN104378740B true CN104378740B (en) | 2019-03-19 |
Family
ID=52557335
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201410618975.0A Active CN104378740B (en) | 2014-11-06 | 2014-11-06 | A kind of intellectual property network cluster calling system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN104378740B (en) |
Families Citing this family (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN104469698B (en) * | 2014-11-27 | 2018-02-16 | 中细软移动互联科技有限公司 | A kind of PTT group calling systems applied to intellectual property call network |
| CN114599001B (en) * | 2020-12-03 | 2023-11-24 | 海能达通信股份有限公司 | Multi-group hierarchical configuration method and device, multi-group hierarchical scheduling method and terminal |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103024679A (en) * | 2011-09-20 | 2013-04-03 | 华为技术有限公司 | Method and network equipment for creating cluster call |
| CN103458385A (en) * | 2013-09-04 | 2013-12-18 | 哈尔滨海能达科技有限公司 | Voice calling method, voice calling terminal processing method, central equipment, terminal and voice calling system |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US8364191B2 (en) * | 2007-12-28 | 2013-01-29 | Apple Inc. | Group call management |
-
2014
- 2014-11-06 CN CN201410618975.0A patent/CN104378740B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN103024679A (en) * | 2011-09-20 | 2013-04-03 | 华为技术有限公司 | Method and network equipment for creating cluster call |
| CN103458385A (en) * | 2013-09-04 | 2013-12-18 | 哈尔滨海能达科技有限公司 | Voice calling method, voice calling terminal processing method, central equipment, terminal and voice calling system |
Also Published As
| Publication number | Publication date |
|---|---|
| CN104378740A (en) | 2015-02-25 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN104469703B (en) | A kind of channel dynamic allocation method of group calling system | |
| USRE43205E1 (en) | Skill based chat function in a communication system | |
| CN107979704A (en) | Queuing strategy, queuing system | |
| CN101888452A (en) | Multi-access customer service system and method thereof | |
| CN103249007A (en) | Method for establishing D2D multicast communication and allocating wireless source thereof in IMT-A system | |
| CN101616364A (en) | A kind of group-calling service implementation method | |
| CN104683608A (en) | Method for realizing distributed call center, distributed call center and related devices | |
| CN102903020A (en) | Real-time matching method for car pooling system | |
| CN106454761B (en) | A kind of method and system realized group and exhale merging | |
| CN103037110B (en) | Predicting call center performance | |
| CN100477862C (en) | Method and system for determining centrally controlled server | |
| CN104469698B (en) | A kind of PTT group calling systems applied to intellectual property call network | |
| CN107249205A (en) | A kind of resource allocation methods, device and user terminal | |
| CN104517208A (en) | Group-based task cooperation method of enterprise mobile office system | |
| CN108055701A (en) | A kind of resource regulating method and base station | |
| CN104378740B (en) | A kind of intellectual property network cluster calling system | |
| CN106332282B (en) | A kind of implementation method for the group call that rank groups are off the net | |
| CN104469702B (en) | A kind of method of calling of group system applied to intellectual property call network | |
| JP2006246090A (en) | Data distribution system, distribution server, scheduling device and data distributing method for use in them | |
| CN108462943A (en) | Implementation method based on participation group in broadband cluster communication system | |
| CN107948922A (en) | The processing method of cluster user server and terminal and region restricted service | |
| CN101340717B (en) | Area division, time division, grouping integrated business solutions based on intelligent network | |
| CN100407682C (en) | Multiside speaking system | |
| CN101123759B (en) | An access method for user resource allocation in cluster communication system | |
| CN107483756B (en) | Voice call processing method and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| C06 | Publication | ||
| PB01 | Publication | ||
| C10 | Entry into substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| CB02 | Change of applicant information |
Address after: 102455, Beijing, Changyang Town, Changyang, Fangshan District village, Nanjing railway, 110 meters East northbound Applicant after: CIPRUN MOBILE INTERCONNECTION SCIENCE & TECHNOLOGY Co.,Ltd. Address before: 102455, Beijing, Changyang Town, Changyang, Fangshan District village, Nanjing railway, 110 meters East northbound Applicant before: BEIJING CIPRUN MOBILE INTERNET TECHNOLOGY Co.,Ltd. |
|
| COR | Change of bibliographic data | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant | ||
| CP03 | Change of name, title or address |
Address after: 102400 floor 2, building 1, No. 73, Changhong West Road, Xilu street, Fangshan District, Beijing Patentee after: CIPRUN GROUP Co.,Ltd. Address before: 102455 north of 110m East Road of Nanjing Guangzhou railway, Changyang Village, Changyang Town, Fangshan District, Beijing Patentee before: CIPRUN MOBILE INTERCONNECTION SCIENCE & TECHNOLOGY Co.,Ltd. |
|
| CP03 | Change of name, title or address |