CN108809916B

CN108809916B - Service processing method and device

Info

Publication number: CN108809916B
Application number: CN201710314159.4A
Authority: CN
Inventors: 倪靖清
Original assignee: Datang Mobile Communications Equipment Co Ltd
Current assignee: Datang Mobile Communications Equipment Co Ltd
Priority date: 2017-05-05
Filing date: 2017-05-05
Publication date: 2020-08-28
Anticipated expiration: 2037-05-05
Also published as: CN108809916A

Abstract

The application discloses a service processing method and a service processing device, which are used for reducing the configuration difficulty of a terminal mutual access strategy and improving the service processing efficiency. The service processing method provided by the application comprises the following steps: determining the current service processing type as bearer creation or bearer deletion; and performing service processing according to the current service processing type and a preset data structure of the queue, wherein the data structure of the queue comprises at least one element, and each element comprises the IP address of the terminal, an IP address allocation interval and the number of the terminals in the IP address allocation interval.

Description

Service processing method and device

Technical Field

The present application relates to the field of communications technologies, and in particular, to a method and an apparatus for processing a service.

Background

The mobile users are growing continuously, the mobile communication network equipment is rapidly expanded, and an Evolved Packet Core (EPC) device provides a solution for expanding a resource pool. The service plane resource pool is essentially an abstraction, division and management of service plane processing resources, namely, multiple service nodes and multiple interface nodes are deployed, the service plane presents a load sharing mode, when the service is accessed, resources are selected from the resource pool to be accessed, and the load sharing mode is utilized to ensure the balance of the processing resources of each service node.

With the diversification of the EPC devices, more EPC devices are applied in various industries, and the terminal mutual access strategy is widely applied in some industries, for example, in the industry, a first terminal is connected with a camera, and a PC of a second terminal accesses an image of the camera. In the industrial application, almost all the service flows of the terminals conform to the terminal mutual access strategy, and each terminal is configured with the mutual access strategy, so that the configuration complexity is high. At this time, after the terminal accesses the process and matches the policy, i.e., after the Service node is processed, matching is performed on an outgoing Serving Gateway Interface (SGI) node, and after the terminal access node is determined, the terminal returns to the Service node, which causes repeated overhead of Service transmission.

As EPC devices all provide a solution of a resource pool, that is, multi-service resources and multi-interface resources, for a situation where there are multiple processing boards, a processing entity of a UE may be on different service processing units, and an SGI resource is also deployed in a load sharing manner.

And the user needing terminal mutual access configures the IP information into a policy table of terminal mutual access. If the target IP address to be accessed by the source IP matches the terminal mutual access strategy, the service data is directly transmitted back to the target terminal without being sent out of the EPC equipment.

Inside EPC, different service processing units access users in a load sharing mode, a global node SGI interface node exists, all service processing units and IP corresponding relations are known, strategy matching must be carried out on each terminal mutual access process at the service node, if the strategy is matched, an identifier which is successfully matched is brought to the SGI node, the SGI searches global resources, a corresponding UE accessed service processing unit is found, service data is transferred to the service processing unit, a downlink process is carried out, and the users accessed by different service processing units can be guaranteed to be mutually accessed.

The first terminal is accessed to the first service resource, the third terminal is accessed to the third service resource, the data message from the first terminal to the third terminal is matched with the mutual access strategy on the first service resource, the service processing unit transfers the data message to the SGI interface processing unit, the SGI interface processing unit stores the terminal information of the whole device, the SGI interface processing unit judges the terminal address, searches the processing entity of the target IP address according to the target IP address, and forwards the data packet to the single board where the processing entity is located.

In summary, in the industry where the terminal mutual access policy is widely applied in the prior art, the configuration difficulty is high, and when the EPC device is applied to the industry where the terminal mutual access service is widely applied, all terminal-to-terminal data packets need to be matched with the terminal mutual access policy. If the IP configuration information is added, the newly added IP and all the former IPs need to establish an inter-access strategy, the relationship is more complex, and finally the configuration of the inter-access strategy cannot be expanded continuously.

Disclosure of Invention

The embodiment of the application provides a service processing method and device, which are used for reducing the configuration difficulty of a terminal mutual access strategy and improving the service processing efficiency.

The service processing method provided by the embodiment of the application comprises the following steps:

determining the current service processing type as bearer creation or bearer deletion;

and performing service processing according to the current service processing type and a preset data structure of the queue, wherein the data structure of the queue comprises at least one element, and each element comprises the IP address of the terminal, an IP address allocation interval and the number of the terminals in the IP address allocation interval.

By the method, the current service processing type is determined to be bearer creation or bearer deletion, and service processing is performed according to the current service processing type and a preset data structure of the queue, wherein the data structure of the queue comprises at least one element, and each element comprises the IP address of the terminal, an IP address allocation interval and the number of the terminals in the IP address allocation interval, so that the configuration difficulty of the terminal mutual access strategy is reduced, and the service processing efficiency is improved.

Optionally, if the current service processing type is bearer creation, performing service processing according to the current service processing type and a preset data structure of a queue, specifically including:

comparing the bearer creation IP with the head-to-head IPs in the queue;

and if the bearer creation IP is larger than the opposite IP and the IP address is not reversed, updating the opposite IP into the bearer creation IP.

Optionally, the performing service processing according to the current service processing type and a data structure of a preset queue, further includes:

and if the bearer creation IP is larger than the opposite IP and the failure or failure recovery of the service processing unit is monitored, determining the elements needing to be updated in the queue according to the failure times of the service processing unit and updating.

and if the IP address is turned over, deleting the elements corresponding to the IP address which is smaller than the bearer creation IP in the queue.

Optionally, if the current service processing type is bearer deletion, performing service processing according to the current service processing type and a preset data structure of the queue, specifically including:

searching for a bearer deletion IP from the queue, and if the bearer deletion IP is found, reducing the number Num of the terminals in an IP address allocation interval corresponding to the bearer deletion IP by one;

and if the Num after the subtraction is equal to zero and the element to which the Num belongs is the head node element of the queue, traversing other elements of the queue and deleting the element with the Num of zero.

An embodiment of the present application provides a service processing apparatus, including:

a first unit, configured to determine that a current service processing type is bearer creation or bearer deletion;

and the second unit is used for carrying out service processing according to the current service processing type and a preset data structure of the queue, wherein the data structure of the queue comprises at least one element, and each element comprises the IP address of the terminal, an IP address allocation interval and the number of the terminals in the IP address allocation interval.

Optionally, if the current service processing type is bearer creation, the second unit is specifically configured to:

comparing the bearer creation IP with the head-to-head IPs in the queue;

Optionally, the second unit is further configured to: and if the bearer creation IP is larger than the opposite IP and the failure or failure recovery of the service processing unit is monitored, determining the elements needing to be updated in the queue according to the failure times of the service processing unit and updating.

Optionally, the second unit is further configured to:

Optionally, if the current service processing type is bearer deletion, the second unit specifically includes:

Drawings

In order to more clearly illustrate the technical solutions in the embodiments of the present application, the drawings needed to be used in the description of the embodiments are briefly introduced below, and it is obvious that the drawings in the following description are only some embodiments of the present application, and it is obvious for those skilled in the art to obtain other drawings based on these drawings without creative efforts.

Fig. 1 is a schematic general flow chart of a service processing method according to an embodiment of the present application;

fig. 2 is a schematic diagram illustrating a processing result of a service processing unit to a terminal IP according to an embodiment of the present application;

FIG. 3 is a diagram illustrating a data structure of a queue according to an embodiment of the present application;

fig. 4 is a schematic flowchart of a service processing method according to an embodiment of the present application;

fig. 5 is a schematic structural diagram of a service processing apparatus according to an embodiment of the present application.

Detailed Description

The technical scheme provided by the embodiment of the application relates to a dynamic configuration and detection scheme based on a terminal IP, reduces configuration complexity and avoids the repeatability of service transmission. The method shortens the service processing path, saves the resource occupation and improves the service processing performance.

Referring to fig. 1, a service processing method provided in an embodiment of the present application includes:

s101, determining the current service processing type as bearer creation or bearer deletion;

s102, performing service processing according to the current service processing type and a preset data structure of the queue, wherein the data structure of the queue comprises at least one element, and each element comprises an IP address of a terminal, an IP address allocation interval and the number of terminals in the IP address allocation interval.

comparing the bearer creation IP with the head-to-head IPs in the queue;

The following provides a specific explanation of the technical solutions provided in the embodiments of the present application.

First, a filtering rule of a terminal mutual access policy based on a UE IP address pool provided in an embodiment of the present application is introduced:

when the EPC equipment is applied to the industry of widely applied terminal mutual access service, all terminal-to-terminal data messages need to be matched with a terminal mutual access strategy. The configured terminal addresses include static terminal IP (IP1, IP2) and terminal IP address POOL (IP POOL1), and the configuration is quite complex, and configuration is required to traverse all IP information, as shown in table one below:

ID	source address	Destination address
			1	IP1	IP2
2	IP2	IP1
			3	IP POOL1	IP1
4	IP1	IP POOL1
			5	IP POOL1	IP2
6	IP2	IP POOL1

Table one: terminal mutual access policy table

In the application of the fixed industry, all terminals need to be ensured to be matched with the mutual access strategy, the service processing unit only needs to synchronize the terminal IP information configured by the EPC into the terminal mutual access strategy, simplify the terminal IP information into a single table form and store the terminal IP information in a memory table, and the terminal mutual access strategy does not need to be configured manually, as shown in the following table two:

ID	source address	Destination address
				1	xxx (not to be concerned with)	IP1
2	xxx	IP2
			3	xxx	IP POOL1

Table two: terminal mutual access table generated based on terminal address

After strategy matching, only the target IP needs to be matched with the terminal mutual access strategy table, if the target IP is matched with the terminal mutual access strategy table, the terminal mutual access flow is firstly carried out, and if the target IP is not matched with the terminal mutual access strategy table, other service flows are carried out. When the IP of the terminal is dynamically updated, the memory table also avoids the relevant operation of the terminal mutual access strategy.

The following introduces a self-analysis system based on terminal IP allocation rules provided in the embodiments of the present application:

after the selection of the service processing unit resource pool is completed, the configuration thread receives a configuration message, and configures a transport stream template (TFT) template table and an Evolved GPRS tunnel Protocol (GTP-U) tunnel table of a User Plane, which are required by a terminal, for performing tunnel mapping and encapsulation during service processing. Unlike business processes, configuration processes have low performance requirements.

EPC equipment carries out capacity expansion through a resource pool deployment scheme, no service processing unit has the capacity of fixing the service of a user, if capacity expansion is needed, the service processing unit can be deployed according to the capacity required by the system, each service processing unit is in the same grade, and user terminal access is carried out in a load sharing mode. If 100 terminals need to be supported, assuming that the IP of the terminal is 1 to 100, and the capacity of each service processing unit is 25 terminals at this time, 4 service processing units need to be deployed, each service processing unit completes 25 user access processes, and 4 service processing units belong to load sharing mode access. Terminal IP allocation is allocated according to a sequence, and a final access result can certainly ensure complete load sharing, and the result is shown in the following table three:

table three: terminal access result in normal state

That is, when the respective service processing units are in a normal state, each service processing unit sequentially accesses the terminal IP. The terminal IP load sharing result in the table is the terminal IP accessed by different service processing units.

If the service processing unit is abnormal at this time, that is, after 12 terminals are accessed, the

service processing units

2 and 3 are abnormal, the terminals are not accessed to the

service processing units

2 and 3, and the load sharing of the 2 service processing units appears from the service processing unit, and the terminal access condition is as shown in the following table four:

	status of state	Terminal IP load sharing result
			Service processing unit 1	Is normal	1、5、9、13、15、17
Service processing unit 2	Fault of
			Service processing unit 3	Fault of
Service processing unit 4	Is normal	4、8、12、14、16、18

Watch four

After the service processing unit 3 recovers from the failure, the terminal can continue to access the service processing unit and recover to the load sharing condition of 3 service processing units, and the terminal access condition is shown in the following table five:

	status of state	Terminal IP load sharing result
			Service processing unit 1	Is normal	1、5、9、13、15、17、19、22、25
Service processing unit 2	Fault of
			Service processing unit 3	Is normal	20、23、26
Service processing unit 4	Is normal	4、8、12、14、16、18、21、24、27

Watch five

Based on the terminal IP load sharing rule, the self-analysis data of the service processing unit 1 for the terminal IP is finally obtained as shown in fig. 2, where the ordinate represents the terminal IP and the abscissa represents time.

In summary, the system configures 4 service processing units, where:

in the first time period, 4 service processing units are normal, for the service processing unit 1, the IP is between 1 and 13, each IP interval is 4, and on the service processing unit 1, the accessed terminal IP is 1, 5, 9, respectively, as shown in table three above;

in the second time period, the service processing unit 2 and the service processing unit 3 are in failure, and the user can only access the service processing unit 1 and the service processing unit 4, so that the terminal IP is from 13 to 19 at an interval of 2, as shown in the table four above;

in the third time period, after which the service processing unit 3 returns to normal, there are three normal service processing units and the terminal IP interval on the service processing unit 1 becomes 3 again, as shown in table five above.

And in the fourth time period, all the service processing units are normal.

The embodiment of the application aims at the service model and establishes a self-analysis system based on the terminal IP allocation rule. The service processing unit needs to analyze in the configuration process and write the analysis result into the shared memory of the configuration thread and the service thread, so that the judgment can be completed in the service processing flow, whether the target IP is the local board or not is determined, if the judgment is successful, the target IP is the local board, the target IP is directly delivered to the next processing node of the local board for processing, and the SGI interface node is not output.

Before establishing the above self-analysis system data, a data structure of a queue needs to be established to maintain the terminal self-analysis system, and for the above example, the basic structure of the queue is shown in the following table six:

queue element	IP address	IP allocation interval	In the intervalTerminal number (Num)
				Element 1	1	4	4
Element 2	13	2	3
				Element 3	19	3	3
Element 4	25	4	0

Watch six

As can be seen, IP a through IP d correspond to

IP addresses

1, 13, 19, 25, respectively; IP allocation intervals are 4, 2, 3 and 4; the number of terminals in the interval is 4, 3 and 0.

The data structure of the queue is in the memory of the business process, the data structure is shown in fig. 3, the data structure of the queue comprises 4 elements, and each element comprises an IP address of a terminal, an IP address allocation interval, and the number (Num) of terminals in the IP address allocation interval.

The service processing units correspond to the queues one to one, i.e. each service processing unit maintains one of the queues. The service processing unit obtains a detailed algorithm according to the load sharing rule of the service processing unit based on the self-analysis system of the terminal IP allocation rule, and performs terminal IP self-analysis when creating and deleting the load. As shown in fig. 4, includes:

s401, in the creating process, terminal IP addresses of Packet Data Network (PDN) gateway (PDNGateway, PGW) devices are allocated one by one from small to large according to terminal IP address pool resources, and when the IP addresses do not turn over (namely after the IP addresses are allocated to the maximum IP, the first minimum IP in the IP resource pool is restarted to be allocated), expansion of the self-analysis system is carried out. S401 specifically includes the following steps:

step 41: setting the head of line IP x as a comparison object, and comparing the comparison object with the access IP n; if IP n is larger than IPx, turning to Step42, otherwise, turning to Step 45;

step42 extension of the self-analysis system (alternatively referred to as an update, i.e., an update to a column) occurs when no IP address roll-over occurs. And inquiring whether the service processing unit has a fault or fault recovery information. If there is no fault, it indicates that there is no other service processing unit state transition in the IP access process, and goes to Step 43. If a fault occurs or the fault recovers, indicating that the previous interval is not met, go to Step 44;

step 43: turning to Step46 without updating the self-analysis system;

wherein the non-updating self-analysis system does not perform queue updating.

Step 44: if the service processing unit fails once, the allocation interval is reduced by 1, the last access IP address IP n-1 is obtained according to the latest interval, the IP address is used as an updating record, the self-analysis system is updated, namely, the queue corresponding to the service processing unit is updated, wherein the interval is the latest interval, the Num number is 1, similarly, the fault recovery occurs, the allocation interval is increased by 1, the last access IP address is obtained through calculation, and the self-analysis system is updated. Go to Step 46.

Step 45: if the IP address is inverted, the IP address is distributed from the beginning, and the analysis result smaller than the IP information needs to be cleared, so that the same IP address section is ensured, and no repeated analysis rule exists, namely no repeated element exists in the queue. Go to Step 46.

Step 46: the creation flow is completed.

When the IP address is turned over, the access IP address is smaller than the head address of the queue, the corresponding position needs to be inquired from the tail of the queue, and the previous rule is cleared.

S402, in the deleting process, from the tail of the queue, namely the IP index from the beginning, finding the corresponding position by halving search, updating the self-analysis record of the segment, and subtracting one from the Num field, if the record has no terminal information and belongs to the tail node of the queue (namely the last element of the opposite column), deleting the rule that all the records Num from the beginning are 0.

In the service processing flow, the queue head is searched in half, the interval of the IP is judged and recorded according to the recording position of the target IP, whether the interval is the same or not is confirmed, if yes, the target IP is the IP accessed by the service processing unit of the local board, the terminal mutual access flow is carried out, and if not, other flows are continuously completed.

Taking the service resource 1 as an example, access is carried out from IP1 to IP25, and then IP in the middle of IP1 to IP25 is deleted.

The IP is 1, and when the access is carried out, the head of line element, namely element 1, is added;

and IP5, IP9 and IP13 judge that no fault exists, update the information of the element 1 and add 1 to Num each time.

When IP15 accesses, it is judged that there is a fault, the head element of the queue is added, 13 is started, the interval is 2, and Num is 1.

When IP17 and IP19 are accessed, it is judged that no fault occurs, the information of element 2 is updated, and Num is added with 1 each time.

When IP22 accesses, it is judged that there is a fault and the queue head element is added, beginning 19, interval 3, Num is 1.

When IP25 accesses, it is judged that there is no failure, and the information of element 3 is updated, and Num is incremented by 1 each time.

When IP29 accesses, it is judged that there is a fault to recover, the head element of the queue is added, 25 is started, the interval 4 is set, and Num is 1.

The deletion procedure now occurs:

deleting 13, and performing a binary search, wherein the binary search belongs to a queue element 2, Num is reduced by 1, Num is 2 and is not 0;

deleting 15, and performing a binary search, wherein the binary search belongs to a queue element 2, Num is reduced by 1, Num is 1 and is not 0;

deleting IP17, and performing a binary search, belonging to queue element 2, where Num is minus 1, Num is 0, and is 0. And judging that the element 2 is not the queue tail node and does not operate.

Similarly, in the deletion flow, when IP1, IP5, and IP9 are deleted, Num of element 1 is 0 and 0, it is determined that element 1 is the end-of-line node, and the element with Num of 0 is deleted, in which case element 1 and element 2 are deleted.

In summary, in the service processing flow, the complexity involves two points: and halving and searching the corresponding element record and the number of the service processing units.

Based on industry analysis, the industry requiring the terminal mutual access strategy has low requirements on EPC performance, does not need to deploy a multi-node service processing unit, and the self-analysis system has simpler algorithm in the application of miniaturization industry, namely, under the condition of less configuration of the service processing unit.

In addition, in the self-analysis system, the reason for the increase of system resources is that the service processing unit is abnormal, and in industrial application, the service flow is single, the abnormal conditions of the service processing unit are rarely met, and the self-learning system is ensured to be maintained in a performance mode. The search for the business process does not cause performance influence.

It follows that the self-analysis system is simple and feasible.

Correspondingly to the above method, referring to fig. 5, an embodiment of the present application provides a service processing apparatus, including:

a first unit 11, configured to determine that a current service processing type is bearer creation or bearer deletion;

a second unit 12, configured to perform service processing according to a current service processing type and a preset data structure of a queue, where the data structure of the queue includes at least one element, and each element includes an IP address of a terminal, an IP address allocation interval, and a number of terminals in the IP address allocation interval.

comparing the bearer creation IP with the head-to-head IPs in the queue;

Optionally, the second unit is further configured to:

The first unit and the second unit may be implemented by physical devices such as a processor, and may be the same processor or different processors. The processor may be a Central Processing Unit (CPU), an Application Specific Integrated Circuit (ASIC), a Field Programmable Gate Array (FPGA), or a Complex Programmable Logic Device (CPLD).

In summary, the embodiments of the present application provide a terminal mutual access policy filtering rule establishment based on a UE IP address pool, and a self-analysis system based on a terminal IP allocation rule. The embodiment of the application provides a dynamic configuration and self-analysis system based on a terminal IP (Internet protocol), which aims at a configuration mode and a service process of terminal mutual access, reduces configuration complexity and avoids the repeatability of service transmission. The method shortens the service processing path, saves the resource occupation and improves the service processing performance.

As will be appreciated by one skilled in the art, embodiments of the present application may be provided as a method, system, or computer program product. Accordingly, the present application may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present application may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, optical storage, and the like) having computer-usable program code embodied therein.

The present application is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the application. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded processor, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.

These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.

It will be apparent to those skilled in the art that various changes and modifications may be made in the present application without departing from the spirit and scope of the application. Thus, if such modifications and variations of the present application fall within the scope of the claims of the present application and their equivalents, the present application is intended to include such modifications and variations as well.

Claims

1. A method for processing a service, the method comprising:

performing service processing according to the current service processing type and a preset data structure of a queue, wherein the data structure of the queue comprises at least one element, and each element comprises an IP address of a terminal, an IP address allocation interval and the number of terminals in the IP address allocation interval; the queues correspond to service processing units in Evolved Packet Core (EPC) equipment one to one.

2. The method according to claim 1, wherein if the current service processing type is bearer creation, performing service processing according to the current service processing type and a data structure of a preset queue, specifically comprising:

comparing the bearer creation IP with the head-to-head IPs in the queue;

3. The method of claim 2, wherein the service processing is performed according to the current service processing type and a data structure of a preset queue, further comprising:

4. The method of claim 2, wherein the service processing is performed according to the current service processing type and a data structure of a preset queue, further comprising:

5. The method according to claim 1, wherein if the current service processing type is bearer deletion, performing service processing according to the current service processing type and a data structure of a preset queue, specifically comprising:

6. A traffic processing apparatus, comprising:

a second unit, configured to perform service processing according to a current service processing type and a preset data structure of a queue, where the data structure of the queue includes at least one element, and each element includes an IP address of a terminal, an IP address allocation interval, and a number of terminals in the IP address allocation interval; the queues correspond to service processing units in Evolved Packet Core (EPC) equipment one to one.

7. The apparatus according to claim 6, wherein if the current service processing type is bearer creation, the second unit is specifically configured to:

comparing the bearer creation IP with the head-to-head IPs in the queue;

8. The apparatus of claim 7, wherein the second unit is further configured to: and if the bearer creation IP is larger than the opposite IP and the failure or failure recovery of the service processing unit is monitored, determining the elements needing to be updated in the queue according to the failure times of the service processing unit and updating.

9. The apparatus of claim 7, wherein the second unit is further configured to:

10. The apparatus of claim 6, wherein if the current service processing type is bearer deletion, the second unit specifically includes: