CN111294856B - Shared flow terminal identification method, device, equipment and readable storage medium - Google Patents

Shared flow terminal identification method, device, equipment and readable storage medium Download PDF

Info

Publication number
CN111294856B
CN111294856B CN201811497742.4A CN201811497742A CN111294856B CN 111294856 B CN111294856 B CN 111294856B CN 201811497742 A CN201811497742 A CN 201811497742A CN 111294856 B CN111294856 B CN 111294856B
Authority
CN
China
Prior art keywords
terminals
shared
terminal
tested
user number
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
Application number
CN201811497742.4A
Other languages
Chinese (zh)
Other versions
CN111294856A (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.)
China Mobile Communications Group Co Ltd
China Mobile Group Shanxi Co Ltd
Original Assignee
China Mobile Communications Group Co Ltd
China Mobile Group Shanxi Co Ltd
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 China Mobile Communications Group Co Ltd, China Mobile Group Shanxi Co Ltd filed Critical China Mobile Communications Group Co Ltd
Priority to CN201811497742.4A priority Critical patent/CN111294856B/en
Publication of CN111294856A publication Critical patent/CN111294856A/en
Application granted granted Critical
Publication of CN111294856B publication Critical patent/CN111294856B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • H04W28/0268Traffic management, e.g. flow control or congestion control using specific QoS parameters for wireless networks, e.g. QoS class identifier [QCI] or guaranteed bit rate [GBR]
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • H04W28/06Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information
    • H04W28/065Optimizing the usage of the radio link, e.g. header compression, information sizing, discarding information using assembly or disassembly of packets
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W28/00Network traffic management; Network resource management
    • H04W28/02Traffic management, e.g. flow control or congestion control
    • H04W28/10Flow control between communication endpoints

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Data Exchanges In Wide-Area Networks (AREA)

Abstract

The invention discloses a method, a device and equipment for identifying a shared flow terminal and a readable storage medium, wherein the identification method comprises the following steps: in a specific time period, splitting original signaling messages from M terminals to be tested at the PGW side of a packet domain data core network gateway, wherein M is a positive integer; analyzing the original signaling message to generate a corresponding relation table comprising the corresponding relation between the user number of each to-be-tested terminal in the M to-be-tested terminals and a survival time value, wherein the survival time value is used for limiting the maximum hop count of the Internet Protocol (IP) data packet in the original signaling message forwarded in a network; and identifying N terminals to be detected meeting the conditions in the M terminals to be detected as shared flow terminals according to the corresponding relation table, wherein N is a positive integer not greater than M. The method is used for solving the technical problem that the accuracy is low in the existing shared flow terminal identification method.

Description

Shared flow terminal identification method, device, equipment and readable storage medium
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a method, an apparatus, a device, and a readable storage medium for identifying a shared traffic terminal.
Background
With the rapid development of mobile network speed and intelligent terminals, the user traffic demand is increasing. To meet the traffic demands of users, various high-traffic packages are introduced by various operators. In the use process, the user ordering the traffic package can share traffic to other terminal users by opening the terminal hot spot.
In the prior art, a method of identifying a shared traffic terminal through terminal information is often adopted, specifically, by collecting internet surfing signaling list data of a target user number in a specific time period, extracting terminal information from the internet surfing signaling list data, and judging the terminal information to determine whether the shared traffic terminal is the shared traffic terminal. Wherein the terminal information includes a terminal model or an operating system version. More specifically, the terminal information is determined to determine whether it is a shared traffic terminal by determining the number of terminals that are surfing the internet using the target user number within a specific time period. And determining the terminals meeting the terminal number of more than or equal to 2 as shared flow terminals.
However, in the process of adopting the above-mentioned shared traffic terminal identification method, for the scenario of sharing to the same terminal model or the same operating system version terminal, the shared traffic terminal to be tested is misjudged as a non-shared traffic terminal because the terminal of the same terminal model or the same operating system version is identified as the same terminal; for another example, the user changes the terminal to be tested into a non-shared traffic terminal by himself, but because different terminal signals or different operating system versions correspond to different terminals, the terminal to be tested is misjudged as a shared traffic terminal; for another example, for a one-number multi-terminal service scenario, misjudgment may occur in identifying a shared traffic terminal, because the one-number multi-terminal service does not belong to the traffic sharing scenario.
Therefore, the existing shared flow terminal identification method has the technical problem of low accuracy.
Disclosure of Invention
The embodiment of the invention provides a shared flow terminal identification method, a device, equipment and a readable storage medium, which are used for solving the technical problem of low accuracy of the existing shared flow terminal identification method.
In a first aspect, an embodiment of the present invention provides a method for identifying a shared traffic terminal, including:
in a specific time period, splitting original signaling messages from M terminals to be tested at the PGW side of a packet domain data core network gateway, wherein M is a positive integer;
analyzing the original signaling message to generate a corresponding relation table comprising the corresponding relation between the user number of each to-be-tested terminal in the M to-be-tested terminals and a survival time value, wherein the survival time value is used for limiting the maximum hop count of the Internet Protocol (IP) data packet in the original signaling message forwarded in a network;
and identifying N terminals to be detected meeting the conditions in the M terminals to be detected as shared flow terminals according to the corresponding relation table, wherein N is a positive integer not greater than M.
Optionally, identifying, according to the correspondence table, N terminals to be detected that meet the condition in the M terminals to be detected as shared traffic terminals includes:
and if the survival time value of each user number in the N terminals to be detected in the corresponding relation table at least comprises TTL and (TTL-N), identifying the N terminals to be detected as shared flow terminals, wherein N is more than or equal to 1 and less than or equal to TTL, and both TTL and (TTL-N) are used for representing the characteristic value corresponding to the survival time value in the specific time period.
Optionally, the parsing the original signaling message to generate a correspondence table including a correspondence between a user number and a lifetime value of each of the M terminals to be tested, including:
analyzing the original signaling message to obtain the user number of each terminal to be tested in the M terminals to be tested and the survival time value in the corresponding IP header;
and generating a corresponding relation table comprising the corresponding relation between the user number of each terminal to be tested and the survival time value.
Optionally, after identifying the N terminals to be tested as shared traffic terminals, the method further includes:
determining target user numbers corresponding to the N terminals to be tested;
generating a shared event information relation table, wherein the shared event information relation table at least comprises the target user number, the specific time period and a service quality class identifier QCI value which is analyzed from the original signaling message and used for representing the service level of the target user number in a network;
reporting the shared event information relation table to a policy and control server PCRF of a packet domain data core network through the PGW;
receiving a control policy generated by the PCRF based on the shared event information relation table;
and controlling the flow sharing behaviors of the N terminals to be tested according to the control strategy.
Optionally, controlling the flow sharing behavior of the N terminals to be tested according to the control policy includes: and blocking, limiting or releasing the shared flow terminals of the target user number or the specific terminal number at least according to the specific time period and the QCI value.
In a second aspect, an embodiment of the present invention provides a shared traffic terminal identification device, including:
the system comprises a beam splitting unit, a packet domain data core network gateway PGW and a packet domain data core network gateway PGW, wherein the beam splitting unit is used for splitting original signaling messages from M terminals to be detected in a specific time period, and M is a positive integer;
the first generation unit is used for analyzing the original signaling message and generating a corresponding relation table comprising the corresponding relation between the user number of each to-be-detected terminal in the M to-be-detected terminals and a survival time value, wherein the survival time value is used for limiting the maximum hop count of the Internet Protocol (IP) data packet in the original signaling message forwarded in a network;
and the identification unit is used for identifying N terminals to be detected, which meet the conditions, in the M terminals to be detected as shared flow terminals according to the corresponding relation table, wherein N is a positive integer not greater than M.
Optionally, the identifying unit is configured to:
and if the survival time value of each user number in the N terminals to be detected in the corresponding relation table at least comprises TTL and (TTL-N), identifying the N terminals to be detected as shared flow terminals, wherein N is more than or equal to 1 and less than or equal to TTL, and both TTL and (TTL-N) are used for representing the characteristic value corresponding to the survival time value in the specific time period.
Optionally, the first generating unit is configured to:
analyzing the original signaling message to obtain the user number of each terminal to be tested in the M terminals to be tested and the survival time value in the corresponding IP header;
and generating a corresponding relation table comprising the corresponding relation between the user number of each terminal to be tested and the survival time value.
Optionally, after the identifying unit identifies the N terminals to be tested as shared traffic terminals, the apparatus further includes:
the determining unit is used for determining the target user numbers corresponding to the N terminals to be detected;
a second generating unit, configured to generate a shared event information relation table, where the shared event information relation table at least includes the target user number, the specific time period, and a quality of service class identifier QCI value that is parsed from the original signaling packet and is used to characterize a service class of the target user number in a network;
the reporting unit is used for reporting the shared event information relation table to a packet domain data core network policy and control server PCRF through the PGW;
a receiving unit, configured to receive a control policy generated by the PCRF based on the shared event information relationship table;
and the control unit is used for controlling the flow sharing behaviors of the N terminals to be tested according to the control strategy.
Optionally, the control unit is specifically configured to:
and blocking, limiting or releasing the shared flow terminals of the target user number or the specific terminal number at least according to the specific time period and the QCI value.
In a third aspect, an embodiment of the present invention further provides a communication device, including: a processor, a memory, and a transceiver; the memory stores a computer program, and the processor is configured to read the program in the memory and execute the steps of the shared traffic terminal identification method.
In a fourth aspect, an embodiment of the present invention further provides a readable storage medium, where a computer program is stored, where the computer program when executed by a processor implements the steps of the above-mentioned shared traffic terminal identification method.
The above technical solutions in the embodiments of the present invention at least have one or more of the following technical effects:
in the technical scheme of the embodiment of the invention, in a specific time period, original signaling messages from M terminals to be detected are split through a PGW side, then the original signaling messages are analyzed to generate a corresponding relation table comprising the corresponding relation between user numbers and survival time values, and then the shared flow terminals in the M terminals to be detected are identified according to the corresponding relation table. That is, the shared traffic terminal is directly identified by the correspondence table including the correspondence between the user number and the time-to-live value, and the time-to-live value can characterize the traffic sharing behavior of the terminal, so that the identification accuracy is higher compared with the existing identification method.
Additional features and advantages of the invention will be set forth in the description which follows, and in part will be obvious from the description, or may be learned by practice of the invention. The objectives and other advantages of the invention will be realized and attained by the structure particularly pointed out in the written description and claims thereof as well as the appended drawings.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings that are used in the description of the embodiments will be briefly introduced below, and it is obvious that the drawings in the description below are only some embodiments of the present invention.
Fig. 1 is a flow chart of a method for identifying a shared traffic terminal according to an embodiment of the present invention;
fig. 2 is a schematic flow chart of a method in step S102 in a method for identifying a shared traffic terminal according to an embodiment of the present invention;
fig. 3 is a schematic flowchart of a method after step S103 in a shared traffic terminal identification method according to an embodiment of the present invention;
fig. 4 is a schematic diagram of the overall process of identifying and controlling a shared traffic terminal according to an embodiment of the present invention;
fig. 5 is a schematic structural diagram of a shared traffic terminal identification device according to an embodiment of the present invention;
fig. 6 is a schematic structural diagram of a communication device according to an embodiment of the present invention.
Detailed Description
Reference herein to "an embodiment" means that a particular feature, structure, or characteristic described in connection with the embodiment may be included in at least one embodiment of the invention. The appearances of such phrases in various places in the specification are not necessarily all referring to the same embodiment, nor are separate or alternative embodiments mutually exclusive of other embodiments. Those of skill in the art will explicitly and implicitly appreciate that the embodiments described herein may be combined with other embodiments.
In order to better understand the above technical solutions, the following detailed description of the technical solutions of the present invention is made by using the accompanying drawings and specific embodiments, and it should be understood that the specific features of the embodiments and the embodiments of the present invention are detailed descriptions of the technical solutions of the present invention, and not limiting the technical solutions of the present invention, and the embodiments and the technical features of the embodiments of the present invention may be combined with each other without conflict.
In the embodiment of the invention, aiming at the application scenario that a shared flow terminal opens a hot spot to a shared flow terminal, the method specifically can convert the signals of a general packet radio service technology (General Packet Radio Service) GPRS, a third generation mobile communication technology (the 3-rd Generation Mobile Communication Technology) 3G, a fourth generation mobile communication technology (the 4th Generation Mobile Communication Technology) 4G and a fifth generation mobile communication technology (the 5th Generation Mobile Communication Technology) 5G received by the terminal into wifi signals to be sent out, so that other terminals outside the terminal can use the flows corresponding to the wifi signals, and the shared flow terminal can share the flows to the shared flow terminal. In order to improve the identification accuracy of the shared flow terminal, the identification of the shared flow terminal is performed based on a corresponding relation table between the user number and the survival time value. In the implementation process, the survival time value can represent the sharing behavior of the terminal, so that the identification accuracy of the shared flow terminal can be improved.
Referring to fig. 1, an embodiment of the present invention provides a flow chart of a method for identifying a shared traffic terminal, where the method specifically includes:
s101: in a specific time period, splitting original signaling messages from M terminals to be tested at the PGW side of a packet domain data core network gateway, wherein M is a positive integer;
s102: analyzing the original signaling message to generate a corresponding relation table comprising the corresponding relation between the user number of each to-be-tested terminal in the M to-be-tested terminals and a survival time value, wherein the survival time value is used for limiting the maximum hop count of the Internet Protocol (IP) data packet in the original signaling message forwarded in a network;
s103: and identifying N terminals to be detected meeting the conditions in the M terminals to be detected as shared flow terminals according to the corresponding relation table, wherein N is a positive integer not greater than M.
In the specific implementation process, when M terminals to be tested surf the internet in a specific time period, original signaling messages from the M terminals to be tested are split through a packet domain data core network gateway (Packet Data Network Gateway, PGW) side. Each terminal to be tested may be a terminal device such as a personal computer (Personal Computer, PC), a tablet computer, a personal digital assistant (Personal Digital Assistant, PDA), a personal communication service (Personal Communication Service, PCs) phone, a notebook, a mobile phone, or the like, or may be a computer with a mobile terminal, for example, a portable, pocket, hand-held, built-in or vehicle-mounted mobile device of the computer, or other terminal devices that use data traffic to access the internet. In the implementation process, the specific time period may be specifically 5min, 1 hour, or one or more days, and of course, those skilled in the art may set the specific time period according to the actual usage habits of the user, which will not be described herein. In a specific implementation process, after the PGW performs beam splitting processing on original signaling messages from M terminals to be tested, the original signaling messages are stored locally. It is obvious to those skilled in the art that the PGW performs a beam splitting process on the original signaling message, that is, the PGW performs a copying process on the original signaling message.
And then, analyzing the original signaling message to generate a corresponding relation table comprising the corresponding relation between the user number of each to-be-tested terminal in the M to-be-tested terminals and a Time to live value (Time to live), wherein the Time to live value is used for limiting the maximum hop count of the internet protocol (Internet Protocol, IP) data packet forwarded in the network in the original signaling message. For a specific example, when the time period is 5min and the 5 terminals to be tested correspond to a to f and total 6 user numbers, the generated corresponding relation table includes the corresponding relation between the user number a and at least one survival time value in the time period, the corresponding relation between the user number b and at least one survival time value in the time period, … …, and the corresponding relation between the user number f and at least one survival time value in the time period.
And then, according to the corresponding relation table, identifying the N terminals to be detected meeting the conditions in the M terminals to be detected as shared traffic terminals, namely, identifying the shared traffic terminals from the M terminals to be detected by taking the corresponding relation table as a judgment condition. In the implementation process, the lifetime value is set to prevent the IP data packet from being forwarded infinitely in the network, and the characteristic value is used to tell the network how many times the IP data packet can be forwarded in the network, and the router subtracts 1 from the value corresponding to the lifetime value of the IP data packet once for each forwarding of the IP data packet. In the embodiment of the invention, the shared flow terminal is identified according to the survival time value capable of representing the sharing behavior of the terminal, so that the identification accuracy of the shared flow terminal can be effectively improved.
In the embodiment of the present invention, in order to realize accurate identification of the shared traffic terminal, step S103: according to the corresponding relation table, identifying the N terminals to be detected meeting the conditions in the M terminals to be detected as shared flow terminals, including: and if the survival time value of each user number in the N terminals to be detected in the corresponding relation table at least comprises TTL and (TTL-N), identifying the N terminals to be detected as shared flow terminals, wherein N is more than or equal to 1 and less than or equal to TTL, and the TTL and (TTL-N) are used for representing specific characteristic values of the survival time value in the specific time period.
In the implementation process, when the terminal serving as the hot spot supports forwarding the IP data packet of the back-end equipment, the specific numerical value TTL corresponding to the survival time value is reduced by 1. For example, the characteristic value of the lifetime value of the IP header of the user of the terminal a is 64, and the characteristic value of the lifetime value of the IP header after one-time sharing of the traffic is 63. Table 1 shows one of the characteristic values of the lifetime values of the shared traffic terminals and the shared traffic terminals under different operating systems (Android, IOS, WP, windows). Specifically, the characteristic value of the lifetime value obtained by sharing the flow once by the shared flow terminal is subtracted by 1 from the original characteristic value.
TABLE 1
In the specific implementation process, for complex scenes of networking complexity or a relay server in the middle of a shared network, the situation that the specific numerical value TTL corresponding to the survival time value of the back-end equipment is subtracted by n (where n is an integer greater than 1) may occur in the process of identifying the shared flow terminal, so that confusion in identification is unavoidable. Therefore, in the implementation process, the shared flow terminal is identified by identifying the characteristic value (TTL-n) corresponding to the time-to-live value (wherein, 1 is less than or equal to n is less than or equal to TTL). In the implementation process, if the survival time value of a user number in the corresponding relation table includes a feature value TTL and at least one of { TTL-1, TTL-2, … …, TTL-n }, identifying the terminal to be detected corresponding to the user number as a shared flow terminal. For example, if the characteristic value corresponding to the survival time value of the user number a in the corresponding relation table includes TTL and TTL-1, the terminal to be tested corresponding to the user number a is a shared flow terminal; for another example, if the characteristic value corresponding to the survival time value of the user number b in the corresponding relation table includes TTL, TTL-2 and TTL-3, the terminal to be tested corresponding to the user number b is a shared traffic terminal. In the implementation process, when n is TTL, it indicates that the TTL is reduced to 0 before the IP packet reaches the destination IP, and the router will discard the received IP packet with ttl=0.
In the embodiment of the present invention, in order to improve the identification accuracy of the shared traffic terminal, please refer to fig. 2, step S102: analyzing the original signaling message to generate a corresponding relation table comprising the corresponding relation between the user number and the survival time value of each of the M terminals to be tested, wherein the corresponding relation table comprises the following steps:
s201: analyzing the original signaling message to obtain the user number of each terminal to be tested in the M terminals to be tested and the survival time value in the corresponding IP header;
s202: and generating a corresponding relation table comprising the corresponding relation between the user number of each terminal to be tested and the survival time value.
In the implementation process, the specific implementation process of step S201 to step S202 is as follows:
firstly, the original signaling message is analyzed to obtain the user number of each terminal to be tested in M terminals to be tested and the corresponding survival time value in the IP head. For example, the original signaling message within 1h is analyzed to obtain the user number of each terminal to be tested in 100 terminals and the corresponding lifetime value in the IP header. And then, generating a corresponding relation table comprising the corresponding relation between the user number of each terminal to be tested and the survival time value. For example, a correspondence table including 120 user numbers and corresponding lifetime values in the IP header is generated in the 100 terminals. For example, the correspondence table includes a user number a and a feature value set { TTL, TTL-1} of the corresponding time-to-live values, a user number b and a feature value set { TTL, TTL-1, TTL-2, TTL-3} of the corresponding time-to-live values, and a user number c and a feature value set { TTL, TTL-2, TTL-3, TTL-5} of the corresponding time-to-live values. Of course, in the implementation process, the corresponding relation table specifically changes in real time according to the specific situation of the user number and the corresponding survival time value in the specific time period, which is not described herein again.
In the embodiment of the present invention, in order to realize accurate control of the shared traffic terminal, please refer to fig. 3, in step S103: after identifying the N terminals to be detected, which meet the conditions, of the M terminals to be detected as shared traffic terminals according to the correspondence table, the method further includes:
s301: determining target user numbers corresponding to the N terminals to be tested;
s302: generating a shared event information relation table, wherein the shared event information relation table at least comprises the target user number, the specific time period and a service quality class identifier QCI value which is analyzed from the original signaling message and used for representing the service level of the target user number in a network;
s303: reporting the shared event information relation table to a policy and control server PCRF of a packet domain data core network through the PGW;
s304: receiving a control policy generated by the PCRF based on the shared event information relation table;
s305: and controlling the flow sharing behaviors of the N terminals to be tested according to the control strategy.
In the implementation process, the implementation process of step S301 to step S305 is as follows:
firstly, after N terminals to be detected meeting the conditions in M terminals to be detected are identified as shared flow terminals, determining target user numbers corresponding to the N terminals to be detected; a shared event information relationship table is then generated, wherein the shared event information relationship table includes at least the target user number, a specific time period, and a quality of service class identifier (Quality of Service Class Identifier) QCI value parsed from the original signaling message to characterize the service class of the target user number in the network. Generally, the smaller the QCI value, the higher the corresponding level, and vice versa. For example, the QCI value of the target user number corresponding to the VIP user is set to a higher level "qci=1", and the QCI value of the target user number corresponding to the normal user is set to a lower level "qci=6"; for another example, the QCI value of the internet service of the target user number is set to a higher level "qci=3", and the QCI value of the telephone service of the target user number is set to a lower level "qci=5". Of course, the specific value of the QCI value of the target subscriber number can be set by those skilled in the art according to the actual usage habit of the subscriber, and will not be described herein.
The shared event information relationship table is then reported by the PGW to a packet domain data core network policy and control server (Policy and Charging Rules Function) PCRF. Then, the PCRF generates a control strategy for differentiated flow control of the shared flow terminal under the shared flow terminal based on the related parameters in the shared information relation table; and then, the PCRF issues the control strategy to the PGW, and the PGW performs differential control on the flow sharing behavior of the shared flow terminal under the shared flow terminal according to the control strategy.
In the embodiment of the present invention, step S305: controlling flow sharing behaviors of the N terminals to be tested according to the control strategy, wherein the flow sharing behaviors comprise:
and blocking, limiting or releasing the shared flow terminals of the target user number or the specific terminal number at least according to the specific time period and the QCI value.
In the implementation process, the PGW blocks, limits speed or puts through the shared flow terminals of the target user number or the specific terminal number according to at least the specific time period and QCI value in the shared information relation table. For example, the PGW blocks the shared traffic terminals corresponding to the target user numbers or the shared traffic terminals of the specific number of terminals in each of the 10 shared traffic terminals in the period of 13:00-14:00 pm, that is, the shared traffic terminals corresponding to the target user numbers or the shared traffic terminals of the specific terminal data amount will not be networked. More specifically, for example, the traffic of the shared traffic terminal corresponding to the user numbers b, c, and d in the shared traffic terminal a in the period of time is blocked. For another example, the traffic of any 5 shared traffic terminals B in the shared traffic terminal B in this period is limited. Of course, a specific control method of the PGW on the flow sharing behavior of the shared flow terminal may be set by a person skilled in the art according to the actual usage habit of the user, which is not described herein. In the embodiment of the invention, the shared flow terminals are accurately identified based on the spectroscopic detection at the PGW side, the PGW reports the shared event information relation table to the PCRF, and then the PGW receives the control strategy generated by the PCRF based on the related parameters in the shared event information relation table, and blocks, limits the speed or puts through the shared flow terminals with the target user numbers or the specific terminal numbers, thereby realizing the differential control of hot spot sharing behaviors and protecting the network resources of operators.
Based on the same inventive concept, the embodiment of the present invention provides a shared traffic terminal identification device, and because the principle of the device for solving the problem is similar to that of the shared traffic terminal identification method, the implementation of the device can refer to the implementation of the method, and the repetition is omitted.
Fig. 4 is a schematic diagram illustrating the overall process of identifying and controlling the shared traffic terminals according to an embodiment of the present invention. Specifically, the shared flow end user sends a surfing request to the PGW; the PGW sends a credit control request initiation (Credit Control Request-Initial, CCR-I) message to the PCRF; the PCRF transmits a control response Initial (Credit Control Answer-Initial, CCA-I) message to the PGW; the shared flow terminal user is activated successfully after the PCRF confirms that the response is normal, and can surf the internet; the shared flow end user shares the flow to the shared flow end user; the shared flow end user uses the flow of the shared flow end user to surf the internet; in the specific implementation process, the PGW detects and judges the sharing behavior of the terminal user based on a corresponding relation table between the user number and the survival time value; after the shared flow end user is identified, reporting a shared event information relation table to the PCRF through a credit control response Update (Credit Control Answer-Update, CCA-U) message; then, the PCRF issues differentiated control actions (namely control strategies) to the shared flow terminal through the CCA-U message; thus, the PGW performs differential control such as blocking, speed limiting or releasing on the shared flow terminal. The shared traffic terminal then generates the internet traffic. Since each step in the figure is already described in detail in the foregoing, a detailed description is omitted here.
Fig. 5 is a schematic structural diagram of a shared traffic terminal identification device according to an embodiment of the present invention, including:
the light splitting unit 10 is configured to split original signaling messages from M terminals to be tested by the PGW side of the packet domain data core network gateway in a specific time period, where M is a positive integer;
a first generating unit 20, configured to parse the original signaling packet, and generate a correspondence table including a correspondence between a user number of each of the M terminals to be tested and a time-to-live value, where the time-to-live value is used to limit a maximum hop count of forwarding an IP packet of the internet protocol in the original signaling packet in a network;
and the identifying unit 30 identifies the N terminals to be detected, which meet the condition, of the M terminals to be detected as shared traffic terminals according to the correspondence table, where N is a positive integer not greater than M.
In an embodiment of the present invention, the identifying unit 30 is configured to:
and if the survival time value of each user number in the N terminals to be detected in the corresponding relation table at least comprises TTL and (TTL-N), identifying the N terminals to be detected as shared flow terminals, wherein N is more than or equal to 1 and less than or equal to TTL, and both TTL and (TTL-N) are used for representing the characteristic value corresponding to the survival time value in the specific time period.
In the embodiment of the present invention, the first generating unit 20 is configured to:
analyzing the original signaling message to obtain the user number of each terminal to be tested in the M terminals to be tested and the survival time value in the corresponding IP header;
and generating a corresponding relation table comprising the corresponding relation between the user number of each terminal to be tested and the survival time value.
In the embodiment of the present invention, after the identifying unit 30 identifies the N terminals to be tested as shared traffic terminals, the apparatus further includes:
the determining unit is used for determining the target user numbers corresponding to the N terminals to be detected;
a second generating unit, configured to generate a shared event information relation table, where the shared event information relation table at least includes the target user number, the specific time period, and a quality of service class identifier QCI value that is parsed from the original signaling packet and is used to characterize a service class of the target user number in a network;
the reporting unit is used for reporting the shared event information relation table to a packet domain data core network policy and control server PCRF through the PGW;
a receiving unit, configured to receive a control policy generated by the PCRF based on the shared event information relationship table;
and the control unit is used for controlling the flow sharing behaviors of the N terminals to be tested according to the control strategy. In an embodiment of the present invention, the control unit is specifically configured to:
and blocking, limiting or releasing the shared flow terminals of the target user number or the specific terminal number at least according to the specific time period and the QCI value.
For convenience of description, the above parts are described as being functionally divided into modules (or units) respectively. Of course, the functions of each module (or unit) may be implemented in the same piece or pieces of software or hardware when implementing the present invention.
Based on the same technical concept, the embodiment of the application also provides a communication device, which can implement the method in the previous embodiment.
Referring to fig. 6, a schematic structural diagram of a communication device according to an embodiment of the present invention is provided, where the communication device includes: processor 40, memory 50, transceiver 60, and bus interface.
The processor 40 is responsible for managing the bus architecture and general processing, and the memory 50 may store data used by the processor 40 in performing operations. The transceiver 60 is used to receive and transmit data under the control of the processor 40.
The bus architecture may include any number of interconnecting buses and bridges, and in particular, one or more processors represented by the processor 40 and various circuits of the memory, represented by the memory 50, are linked together. The bus architecture may also link together various other circuits such as peripheral devices, voltage regulators, power management circuits, etc., which are well known in the art and, therefore, will not be described further herein. The bus interface provides an interface. The processor 40 is responsible for managing the bus architecture and general processing, and the memory 50 may store data used by the processor 40 in performing operations.
The flow disclosed in the embodiments of the present invention may be applied to the processor 40 or implemented by the processor 40. In implementation, the steps of the signal processing flow may be performed by integrated logic circuitry in hardware or instructions in software in processor 40. The processor 40 may be a general purpose processor, a digital signal processor, an application specific integrated circuit, a field programmable gate array or other programmable logic device, a discrete gate or transistor logic device, a discrete hardware component, and may implement or perform the methods, steps and logic blocks disclosed in embodiments of the invention. The general purpose processor may be a microprocessor or any conventional processor or the like. The steps of the method for identifying the shared traffic terminal disclosed in the embodiment of the invention can be directly embodied as the execution of a hardware processor or the execution of the combination of hardware and software modules in the processor. The software modules may be located in a random access memory, flash memory, read only memory, programmable read only memory, or electrically erasable programmable memory, registers, etc. as well known in the art. The storage medium is located in the memory 50 and the processor 40 reads the information in the memory 50 and, in combination with its hardware, performs the steps of the signal processing flow.
Specifically, the processor 40 is configured to read the program in the memory 50, and execute any step of the above-mentioned shared traffic terminal identification method.
Based on the same technical idea, the embodiments of the present application also provide a readable storage medium having a computer program stored thereon. The computer program, when executed by a processor, performs any of the steps described above for the shared traffic terminal identification method.
It will be appreciated by those skilled in the art that embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, magnetic disk storage, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems) and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flowchart illustrations and/or block diagrams, and combinations of flows and/or blocks in the flowchart illustrations 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.
While preferred embodiments of the present invention have been described, additional variations and modifications in those embodiments may occur to those skilled in the art once they learn of the basic inventive concepts. It is therefore intended that the following claims be interpreted as including the preferred embodiments and all such alterations and modifications as fall within the scope of the invention.
It will be apparent to those skilled in the art that various modifications and variations can be made to the present invention without departing from the spirit or scope of the invention. Thus, it is intended that the present invention also include such modifications and alterations insofar as they come within the scope of the appended claims or the equivalents thereof.

Claims (12)

1. A method for identifying a shared traffic terminal, comprising:
in a specific time period, splitting original signaling messages from M terminals to be tested at the PGW side of a packet domain data core network gateway, wherein M is a positive integer;
analyzing the original signaling message to generate a corresponding relation table comprising the corresponding relation between the user number of each to-be-tested terminal in the M to-be-tested terminals and a survival time value, wherein the survival time value is used for limiting the maximum hop count of the Internet Protocol (IP) data packet in the original signaling message forwarded in a network;
and identifying N terminals to be detected meeting the conditions in the M terminals to be detected as shared flow terminals according to the corresponding relation table, wherein N is a positive integer not greater than M.
2. The method of claim 1, wherein identifying, as a shared traffic terminal, the eligible N terminals under test of the M terminals under test according to the correspondence table comprises:
and if the survival time value of each user number in the N terminals to be detected in the corresponding relation table at least comprises TTL and (TTL-N), identifying the N terminals to be detected as shared flow terminals, wherein N is more than or equal to 1 and less than or equal to TTL, and both TTL and (TTL-N) are used for representing the characteristic value corresponding to the survival time value in the specific time period.
3. The method of claim 1, wherein parsing the original signaling message to generate a correspondence table including a correspondence between a user number and a time-to-live value for each of the M terminals to be tested, comprises:
analyzing the original signaling message to obtain the user number of each terminal to be tested in the M terminals to be tested and the survival time value in the corresponding IP header;
and generating a corresponding relation table comprising the corresponding relation between the user number of each terminal to be tested and the survival time value.
4. The method of claim 2, wherein after identifying the N terminals under test as shared traffic terminals, the method further comprises:
determining target user numbers corresponding to the N terminals to be tested;
generating a shared event information relation table, wherein the shared event information relation table at least comprises the target user number, the specific time period and a service quality class identifier QCI value which is analyzed from the original signaling message and used for representing the service level of the target user number in a network;
reporting the shared event information relation table to a policy and control server PCRF of a packet domain data core network through the PGW;
receiving a control policy generated by the PCRF based on the shared event information relation table;
and controlling the flow sharing behaviors of the N terminals to be tested according to the control strategy.
5. The method of claim 4, wherein controlling traffic sharing behavior of the shared traffic terminal according to the control policy comprises:
and blocking, limiting or releasing the shared flow terminals of the target user number or the specific terminal number at least according to the specific time period and the QCI value.
6. A shared traffic terminal identification device, comprising:
the system comprises a beam splitting unit, a packet domain data core network gateway PGW and a packet domain data core network gateway PGW, wherein the beam splitting unit is used for splitting original signaling messages from M terminals to be detected in a specific time period, and M is a positive integer;
the first generation unit is used for analyzing the original signaling message and generating a corresponding relation table comprising the corresponding relation between the user number of each to-be-detected terminal in the M to-be-detected terminals and a survival time value, wherein the survival time value is used for limiting the maximum hop count of the Internet Protocol (IP) data packet in the original signaling message forwarded in a network;
and the identification unit is used for identifying N terminals to be detected, which meet the conditions, in the M terminals to be detected as shared flow terminals according to the corresponding relation table, wherein N is a positive integer not greater than M.
7. The apparatus of claim 6, wherein the identification unit is to:
and if the survival time value of each user number in the N terminals to be detected in the corresponding relation table at least comprises TTL and (TTL-N), identifying the N terminals to be detected as shared flow terminals, wherein N is more than or equal to 1 and less than or equal to TTL, and both TTL and (TTL-N) are used for representing the characteristic value corresponding to the survival time value in the specific time period.
8. The apparatus of claim 6, wherein the first generation unit is to:
analyzing the original signaling message to obtain the user number of each terminal to be tested in the M terminals to be tested and the survival time value in the corresponding IP header;
and generating a corresponding relation table comprising the corresponding relation between the user number of each terminal to be tested and the survival time value.
9. The apparatus of claim 7, wherein after the identifying unit identifies the N terminals under test as shared traffic terminals, the apparatus further comprises:
the determining unit is used for determining the target user numbers corresponding to the N terminals to be detected;
a second generating unit, configured to generate a shared event information relation table, where the shared event information relation table at least includes the target user number, the specific time period, and a quality of service class identifier QCI value that is parsed from the original signaling packet and is used to characterize a service class of the target user number in a network;
the reporting unit is used for reporting the shared event information relation table to a packet domain data core network policy and control server PCRF through the PGW;
a receiving unit, configured to receive a control policy generated by the PCRF based on the shared event information relationship table;
and the control unit is used for controlling the flow sharing behaviors of the N terminals to be tested according to the control strategy.
10. The apparatus according to claim 9, wherein the control unit is specifically configured to:
and blocking, limiting or releasing the shared flow terminals of the target user number or the specific terminal number at least according to the specific time period and the QCI value.
11. A communication device, comprising: a processor, a memory, and a transceiver; wherein the memory stores a computer program and the processor is configured to read the program in the memory and perform the method of any one of claims 1-5.
12. A readable storage medium having stored thereon a computer program, characterized by: the computer program implementing the method according to any of claims 1-5 when executed by a processor.
CN201811497742.4A 2018-12-07 2018-12-07 Shared flow terminal identification method, device, equipment and readable storage medium Active CN111294856B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201811497742.4A CN111294856B (en) 2018-12-07 2018-12-07 Shared flow terminal identification method, device, equipment and readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201811497742.4A CN111294856B (en) 2018-12-07 2018-12-07 Shared flow terminal identification method, device, equipment and readable storage medium

Publications (2)

Publication Number Publication Date
CN111294856A CN111294856A (en) 2020-06-16
CN111294856B true CN111294856B (en) 2023-07-21

Family

ID=71028039

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201811497742.4A Active CN111294856B (en) 2018-12-07 2018-12-07 Shared flow terminal identification method, device, equipment and readable storage medium

Country Status (1)

Country Link
CN (1) CN111294856B (en)

Families Citing this family (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN115243248B (en) * 2021-04-21 2023-09-01 中国移动通信集团湖南有限公司 Method and device for identifying traffic sharing type of terminal and electronic equipment

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
RU2598581C2 (en) * 2012-06-20 2016-09-27 Хуавей Текнолоджиз Ко., Лтд. Method, node, mobile terminal and system for identifying network tethering behavior
CN108024291B (en) * 2016-11-01 2023-02-24 中兴通讯股份有限公司 Method and device for detecting shared internet access in mobile network
CN108235303B (en) * 2017-12-29 2020-12-15 中国移动通信集团江苏有限公司 Method, device, equipment and medium for identifying shared flow users

Also Published As

Publication number Publication date
CN111294856A (en) 2020-06-16

Similar Documents

Publication Publication Date Title
CN109152095B (en) Wireless network connection method for terminal
CN101873640B (en) Flow processing method, device and mobile terminal
WO2017193427A1 (en) Packet switching service recognition method and terminal
CN110611723B (en) Scheduling method and device of service resources
CN112312339A (en) Charging method, charging system and communication device
CN106332183B (en) Flow control method, flow control processing device and terminal
CN103918221A (en) Rules engine evaluation for policy decisions
EP3310093B1 (en) Traffic control method and apparatus
US20150230074A1 (en) Charging Control Method, Device, and System for Data Service of Roaming Subscriber
CN106412975B (en) A kind of test method and device of content charging loophole
CN106851779A (en) A kind of method and mobile terminal for recognizing access point and focus
CN104619045A (en) Access control method and device for mobile terminal
CN110634057A (en) Charging method, device and system
WO2014187227A1 (en) Data flow transmission control method and apparatus
US10700879B2 (en) Charging method and device, access device, service quality control method and device
CN111294856B (en) Shared flow terminal identification method, device, equipment and readable storage medium
CN109587053A (en) Network shunt method and relevant device
CN106507408A (en) A kind of terminal control method and handheld terminal
CN109479007B (en) Data service control method, related equipment and system
CN102075386B (en) Identification method and device
CN105814930A (en) Charging control device, method and system
CN109905486A (en) A kind of application program identification methods of exhibiting and device
CN109104306A (en) Process analytic method, device, computer readable storage medium and electronic equipment
CN102421106B (en) A kind of by quantity monitoring method and system
CN109889374B (en) Bearing evaluation method and device

Legal Events

Date Code Title Description
PB01 Publication
PB01 Publication
SE01 Entry into force of request for substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant