CN111294856A - 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
CN111294856A
CN111294856A CN201811497742.4A CN201811497742A CN111294856A CN 111294856 A CN111294856 A CN 111294856A CN 201811497742 A CN201811497742 A CN 201811497742A CN 111294856 A CN111294856 A CN 111294856A
Authority
CN
China
Prior art keywords
terminals
tested
shared
terminal
value
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.)
Granted
Application number
CN201811497742.4A
Other languages
Chinese (zh)
Other versions
CN111294856B (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

Images

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, equipment and a readable storage medium for identifying a shared flow terminal, wherein the identification method comprises the following steps: in a specific time period, original signaling messages from M terminals to be tested are split at a 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 a corresponding relation between a user number and a time-to-live value of each terminal to be tested in the M terminals to be tested, wherein the time-to-live value is used for limiting the maximum hop count forwarded in a network by an Internet Protocol (IP) data packet in the original signaling message; and identifying N terminals to be tested which meet the conditions in the M terminals to be tested 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 rate of the existing method for identifying the shared flow terminal is low.

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 higher and higher. In order to meet the flow demand of users, various large-flow packages are released by operators. During the use process, the user who subscribes the flow package can share the flow for other terminal users by opening the terminal hotspot.
In the prior art, a method of identifying a shared traffic terminal through terminal information is often adopted, specifically, internet access signaling list data of a target user number in a specific time period is collected, the terminal information is extracted from the internet access signaling list data, and judgment is performed on the terminal information to determine whether the terminal is the shared traffic terminal. The terminal information includes a terminal model or an operating system version. More specifically, the number of terminals whose terminal information is on line using the target user number within a specific time period is determined to determine whether the terminal is a shared traffic terminal. And determining the terminals which meet the condition that the number of the terminals is more than or equal to 2 as the shared flow terminals.
However, in the process of using the method for identifying a shared traffic terminal, for a scene shared by terminals of the same terminal model or the same operating system version, the terminal of the same terminal model or the same operating system version is identified as the same terminal, and the shared traffic terminal to be detected is mistakenly determined as a non-shared traffic terminal; for another example, when the user changes the device, the terminal to be tested is originally a non-shared traffic terminal, but the terminal to be tested is wrongly judged as a shared traffic terminal because different terminal signals or different operating system versions correspond to different terminals; for another example, for a scenario with one number of multiple terminals, misjudgment may occur in the identification of the shared traffic terminal, because the one number of multiple terminals does not belong to the traffic sharing scenario.
Therefore, the existing identification method for the shared traffic terminal has the technical problem of low accuracy.
Disclosure of Invention
The embodiment of the invention provides a shared traffic terminal identification method, a device, equipment and a readable storage medium, which are used for solving the technical problem of low accuracy rate of the existing shared traffic 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, original signaling messages from M terminals to be tested are split at a 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 a corresponding relation between a user number and a time-to-live value of each terminal to be tested in the M terminals to be tested, wherein the time-to-live value is used for limiting the maximum hop count forwarded in a network by an Internet Protocol (IP) data packet in the original signaling message;
and identifying N terminals to be tested which meet the conditions in the M terminals to be tested 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 tested that meet the conditions in the M terminals to be tested as shared traffic terminals includes:
and if the time-to-live value of each user number in the N terminals to be tested in the corresponding relation table at least comprises TTL and (TTL-N), identifying the N terminals to be tested as shared flow terminals, wherein N is more than or equal to 1 and is less than or equal to TTL, and both TTL and (TTL-N) are used for representing the characteristic value corresponding to the time-to-live value in the specific time period.
Optionally, parsing the original signaling message to 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, includes:
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 corresponding survival time value in the 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 the 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 is used for representing the service level of the target user number in a network;
reporting the sharing event information relation table to a PCRF (policy and control server) of a packet domain data core network through the PGW;
receiving a control strategy generated by the PCRF based on the sharing 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 traffic sharing behavior of the N terminals to be tested according to the control policy includes: and blocking, limiting the speed or opening the shared flow terminals of the number of the target user or the number of the specific terminals 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 apparatus, including:
the system comprises an optical splitting unit, a data transmission unit and a data transmission unit, wherein the optical splitting unit is used for splitting original signaling messages from M terminals to be tested at a PGW side of a packet domain data core network gateway in a specific time period, and M is a positive integer;
a first generating unit, configured to analyze the original signaling message, and generate a corresponding relationship table including a corresponding relationship between a user number and a time-to-live value of each of the M terminals to be tested, where the time-to-live value is used to limit a maximum hop count of an internet protocol IP 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 identification unit is configured to:
and if the time-to-live value of each user number in the N terminals to be tested in the corresponding relation table at least comprises TTL and (TTL-N), identifying the N terminals to be tested as shared flow terminals, wherein N is more than or equal to 1 and is less than or equal to TTL, and both TTL and (TTL-N) are used for representing the characteristic value corresponding to the time-to-live 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 corresponding survival time value in the 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 tested;
a second generating unit, configured to generate a shared event information relationship table, where the shared event information relationship table at least includes the target subscriber number, the specific time period, and a quality of service class identifier QCI value that is parsed from the original signaling message and used to characterize a service level of the target subscriber number in a network;
the reporting unit is used for reporting the sharing 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 the speed or opening the shared flow terminals of the number of the target user or the number of the specific terminals 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, and when the computer program is executed by a processor, the steps of the method for identifying a shared traffic terminal are implemented.
One or more 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, original signaling messages from M terminals to be tested are split by a PGW side in a specific time period, then the original signaling messages are analyzed to generate a corresponding relation table comprising the corresponding relation between the user number and the survival time value, and then the shared flow terminals in the M terminals to be tested are identified according to the corresponding relation table. That is, the shared traffic terminal is directly identified through the corresponding relation table including the corresponding relation between the subscriber number and the lifetime value, and since the lifetime value can represent the traffic sharing behavior of the terminal, 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 hereof 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 used in the description of the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention.
Fig. 1 is a schematic flow chart illustrating a method for identifying a shared traffic terminal according to an embodiment of the present invention;
fig. 2 is a schematic flowchart of a method in step S102 of 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 the method for identifying a shared traffic terminal according to an embodiment of the present invention;
fig. 4 is a schematic diagram of the entire 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 apparatus according to an embodiment of the present invention;
fig. 6 is a schematic structural diagram of a communication device provided in 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 can be included in at least one embodiment of the invention. The appearances of the phrase 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. It is explicitly and implicitly understood by one skilled in the art that the embodiments described herein can be combined with other embodiments.
In order to better understand the technical solutions of the present invention, the technical solutions of the present invention are described in detail below with reference to the drawings and the specific embodiments, and it should be understood that the specific features in the embodiments and the embodiments of the present invention are detailed descriptions of the technical solutions of the present invention, and are not limitations of the technical solutions of the present invention, and the technical features in the embodiments and the embodiments of the present invention may be combined with each other without conflict.
In the embodiment of the present invention, for an application scenario in which a shared traffic terminal provides a hot spot to a shared traffic terminal, signals received by the terminal may specifically be a 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 are converted into wifi signals to be transmitted, and the wifi signals are provided for other terminals outside the terminal to use a traffic corresponding to the wifi signals, so that the shared traffic terminal shares the traffic to the shared traffic terminal. In order to improve the identification accuracy of the shared traffic terminal, the identification of the shared traffic terminal is carried out based on a corresponding relation table between a user number and a life time value. In the specific implementation process, the survival time value can represent the sharing behavior of the terminal, so that the identification accuracy of the shared traffic terminal can be improved.
Referring to fig. 1, an embodiment of the present invention provides a flow diagram of a method for identifying a shared traffic terminal, where the method specifically includes:
s101: in a specific time period, original signaling messages from M terminals to be tested are split at a 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 a corresponding relation between a user number and a time-to-live value of each terminal to be tested in the M terminals to be tested, wherein the time-to-live value is used for limiting the maximum hop count forwarded in a network by an Internet Protocol (IP) data packet in the original signaling message;
s103: and identifying N terminals to be tested which meet the conditions in the M terminals to be tested as shared flow terminals according to the corresponding relation table, wherein N is a positive integer not greater than M.
In a specific implementation process, when M terminals to be tested surf the internet within a specific time period, original signaling messages from the M terminals to be tested are split by a Packet Data Network Gateway (PGW) side. Each terminal to be tested may be a terminal device such as a Personal Computer (PC), a tablet PC, a Personal Digital Assistant (PDA), a Personal Communication Service (PCs) phone, a notebook, a mobile phone, or a Computer having a mobile terminal, for example, a portable, pocket, handheld, Computer-embedded or vehicle-mounted mobile device, or other terminal devices that use data traffic to perform internet access. In the implementation process, the specific time period may be specifically 5min, may also be 1 hour, and may also be one day or more, and of course, a person skilled in the art may set the specific time period according to the actual usage habit of the user, which is not described herein again. In a specific implementation process, the PGW stores original signaling messages from M terminals to be tested locally after performing a light splitting process on the original signaling messages. For those skilled in the art, the PGW performs a light splitting process on the original signaling packet, that is, the PGW performs a copy process on the original signaling packet.
Then, the original signaling message is analyzed, and a corresponding relation table including a corresponding relation between a user number of each terminal to be tested in the M terminals to be tested and a Time to live value (Time to live) is generated, wherein the Time to live value is used for limiting a maximum hop count forwarded in a network by an Internet Protocol (IP) data packet in the original signaling message. For a specific example, when 5 terminals to be tested correspond to a-f and total 6 user numbers within a time period of 5min, the generated corresponding relationship table includes a corresponding relationship between the user number a and at least one time-to-live value within the time period, a corresponding relationship between the user number b and at least one time-to-live value within the time period, … …, and a corresponding relationship between the user number f and at least one time-to-live value within the time period.
Then, according to the correspondence table, the N terminals to be tested that meet the conditions in the M terminals to be tested are identified as shared traffic terminals, that is, the shared traffic terminals are identified from the M terminals to be tested by using the correspondence table as a determination condition. In the specific implementation process, the lifetime value is set for preventing the IP packet from being forwarded in the network for an unlimited number of times, the characteristic value is used for telling the network how many times the IP packet can be forwarded in the network, and the router subtracts 1 from the value corresponding to the lifetime value of the IP packet every time the IP packet is forwarded once. In the embodiment of the invention, the shared traffic terminal is identified according to the life time value capable of representing the terminal sharing behavior, so that the identification accuracy of the shared traffic terminal can be effectively improved.
In the embodiment of the present invention, in order to realize accurate identification of a shared traffic terminal, step S103: according to the corresponding relation table, identifying N terminals to be tested which meet the conditions in the M terminals to be tested as shared flow terminals, including: and if the survival time value of each user number in the N terminals to be tested in the corresponding relation table at least comprises TTL and (TTL-N), identifying the N terminals to be tested as shared flow terminals, wherein N is more than or equal to 1 and is less than or equal to TTL, and both TTL and (TTL-N) are used for representing the specific characteristic value of the survival time value in the specific time period.
In the specific implementation process, when the terminal serving as the hotspot supports forwarding of the IP data packet of the backend device, the specific value TTL corresponding to the time-to-live value is reduced by 1. For example, the characteristic value of the lifetime value of the IP header of the traffic of the terminal a user itself is 64, and the characteristic value of the lifetime value of the IP header after passing the shared traffic once is 63. As shown in table 1, the lifetime values of the shared traffic terminal and the shared traffic terminal in different operating systems (Android, IOS, WP, and Windows) are shown as one of the characteristic values. Specifically, the eigenvalue of the lifetime value after the shared traffic terminal shares the traffic for one time with the shared traffic terminal is reduced by 1 compared with the original eigenvalue.
Figure BDA0001897325920000091
TABLE 1
In a specific implementation process, for a complex networking or a complex scene in which a relay server appears in the middle of a shared network, a situation that a specific value TTL corresponding to a survival time value is subtracted by n (where n is an integer greater than 1) by a back-end device may occur in an identification process of a shared traffic terminal, which inevitably causes identification confusion. Therefore, in the specific implementation process, the shared traffic terminal is identified by identifying the characteristic value (TTL-n) corresponding to the time-to-live value (where n is greater than or equal to 1 and less than or equal to TTL). In the specific implementation process, if the time-to-live value of a certain user number in the corresponding relation table includes the characteristic value TTL and at least one of { TTL-1, TTL-2, … …, TTL-n }, the terminal to be detected corresponding to the user number is identified as the shared traffic terminal. For example, if the feature value corresponding to the time-to-live value of the user number a in the correspondence table includes TTL and TTL-1, the terminal to be tested corresponding to the user number a is a shared traffic terminal; for another example, if the feature value corresponding to the time-to-live value of the user number b in the corresponding relationship table includes TTL, TTL-2, and TTL-3, the terminal to be tested corresponding to the user number b is the shared traffic terminal. In the specific 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 discards the IP packet whose TTL is 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 terminal to be tested in 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 corresponding survival time value in the 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 specific implementation process, the specific implementation process from 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 header. For example, the original signaling message in 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 is generated in which the 100 terminals include 120 subscriber numbers and corresponding lifetime values in the IP headers. For example, the corresponding relationship table includes the user number a and the corresponding characteristic value set { TTL, TTL-1} of the time-to-live value, the user number b and the corresponding characteristic value set { TTL, TTL-1, TTL-2, TTL-3} of the time-to-live value, and the user number c and the corresponding characteristic value set { TTL, TTL-2, TTL-3, TTL-5} of the time-to-live value. Of course, in the specific implementation process, the corresponding relationship table specifically changes in real time according to the specific situation of the user number and the corresponding time-to-live value in the specific time period, and is not described herein again.
In the embodiment of the present invention, in order to implement accurate control on the shared traffic terminal, please refer to fig. 3, in step S103: after the N terminals to be tested meeting the conditions among the M terminals to be tested are identified as the 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 is used for representing the service level of the target user number in a network;
s303: reporting the sharing event information relation table to a PCRF (policy and control server) of a packet domain data core network through the PGW;
s304: receiving a control strategy generated by the PCRF based on the sharing 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 specific implementation process, the specific implementation process of step S301 to step S305 is as follows:
firstly, after N terminals to be tested meeting conditions in M terminals to be tested are identified as shared flow terminals, determining target user numbers corresponding to the N terminals to be tested; then, a shared event information relationship table is generated, wherein the shared event information relationship table at least includes the target user number, the specific time period, and a Quality of service class Identifier (Quality of service Identifier) QCI value for characterizing the service level of the target user number in the network, which is analyzed from the original signaling message. Generally, smaller values of QCI values correspond to higher levels, and vice versa. For example, the QCI value of the target subscriber number corresponding to the VIP subscriber is set to a higher level, "QCI ═ 1", and the QCI value of the target subscriber number corresponding to the general subscriber is set to a lower level, "QCI ═ 6"; for another example, the QCI value of the internet service of the target subscriber number is set to a higher level "QCI ═ 3", and the QCI value of the telephone service of the target subscriber number is set to a lower level "QCI ═ 5". Of course, those skilled in the art may set the specific value of the QCI value of the target user number according to the actual usage habit of the user, and the detailed description is omitted here.
Then, the sharing event information relation table is reported to a packet domain data core network Policy and control server (Policy and Charging Rules Function) PCRF by the PGW. Then, the PCRF generates a control strategy for differentiated flow control of the shared flow terminal under the shared flow terminal based on the relevant parameters in the shared information relation table; and then, the PCRF issues the control strategy to the PGW, and the PGW performs differentiated control on the traffic sharing behavior of the shared traffic terminal under the shared traffic terminal according to the control strategy.
In the embodiment of the present invention, step S305: controlling the flow sharing behavior of the N terminals to be tested according to the control strategy, comprising the following steps:
and blocking, limiting the speed or opening the shared flow terminals of the number of the target user or the number of the specific terminals at least according to the specific time period and the QCI value.
In a specific implementation process, the PGW blocks, limits speed or puts through the shared traffic terminals of the target subscriber number or the specific number of terminals at least according to the specific time period and the QCI value in the shared information relationship table. For example, the PGW blocks a shared traffic terminal corresponding to a target user number under each shared traffic terminal in 10 shared traffic terminals in the time period of 13:00 to 14:00 in the afternoon, or shared traffic terminals of a specific number of terminals, that is, the shared traffic terminals corresponding to the target user numbers or the shared traffic terminals of the specific data volume of the terminals will not be on the network. More specifically, for example, the traffic of the shared traffic terminal corresponding to the subscriber numbers b, c, and d of the shared traffic terminal a in this time period is blocked. For another example, the flow of any 5 shared flow terminals under the shared flow terminal B in this time period is limited in speed. Of course, a person skilled in the art may set a specific control method for the traffic sharing behavior of the PGW to the shared traffic terminal according to the actual usage habit of the user, and details are not described here. In the embodiment of the invention, the sharing traffic terminal is accurately identified based on the PGW side spectral detection, the PGW reports the sharing event information relation table to the PCRF, and then the PGW receives the control strategy generated by the PCRF based on the relevant parameters in the sharing event information relation table and blocks, limits the speed or puts through the sharing traffic terminals of the target user number or the specific terminal number, thereby realizing the differential control of the hotspot sharing behavior 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 apparatus, and because the principle of the apparatus for solving the problem is similar to the shared traffic terminal identification method, the implementation of the apparatus may refer to the implementation of the method, and repeated details are not described again.
Fig. 4 is a schematic diagram illustrating the entire process of identifying and controlling the shared traffic terminal according to the embodiment of the present invention. Specifically, a shared traffic end user sends an internet access request to a PGW; the PGW sends a CreditControl Request-Initial (CCR-I) message to the PCRF; the PCRF sends a CreditControl Answer-Initial (CCA-I) message to the PGW; the shared flow terminal user is successfully activated after confirming normal response through the PCRF, and can surf the internet; the shared flow terminal user shares the flow to the shared flow terminal user; the shared flow terminal user uses the flow of the shared flow terminal user to surf the internet; in a 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 identifying the shared flow terminal user, reporting a shared event information relation table to the PCRF through a Credit Control Answer Update (CCA-U) message; then, the PCRF issues a differentiated control action (namely a control strategy) to the shared traffic terminal through the CCA-U message; therefore, the PGW performs differentiated control such as blocking, limiting speed or releasing on the shared traffic terminal. Then, the shared traffic terminal generates internet traffic. Since the steps in the figure have already been described in detail in the above, they are not described again here.
Fig. 5 is a schematic structural diagram of a shared traffic terminal identification apparatus according to an embodiment of the present invention, including:
the optical splitting unit 10 is configured to split original signaling messages from M terminals to be tested at a PGW side of a packet domain data core network gateway within a specific time period, where M is a positive integer;
a first generating unit 20, configured to analyze the original signaling message, and generate a corresponding relationship table including a corresponding relationship between a user number and a time-to-live value of each of the M terminals to be tested, where the time-to-live value is used to limit a maximum hop count forwarded in a network by an internet protocol IP packet in the original signaling message;
and the identifying unit 30 identifies N terminals to be tested meeting the conditions among the M terminals to be tested as shared traffic terminals according to the correspondence table, where N is a positive integer not greater than M.
In the embodiment of the present invention, the identification unit 30 is configured to:
and if the time-to-live value of each user number in the N terminals to be tested in the corresponding relation table at least comprises TTL and (TTL-N), identifying the N terminals to be tested as shared flow terminals, wherein N is more than or equal to 1 and is less than or equal to TTL, and both TTL and (TTL-N) are used for representing the characteristic value corresponding to the time-to-live 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 corresponding survival time value in the 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 this embodiment of the present invention, after the identifying unit 30 identifies the N terminals to be tested as the 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 tested;
a second generating unit, configured to generate a shared event information relationship table, where the shared event information relationship table at least includes the target subscriber number, the specific time period, and a quality of service class identifier QCI value that is parsed from the original signaling message and used to characterize a service level of the target subscriber number in a network;
the reporting unit is used for reporting the sharing 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 the speed or opening the shared flow terminals of the number of the target user or the number of the specific terminals at least according to the specific time period and the QCI value.
For convenience of description, the above parts are separately described as modules (or units) according to functional division. Of course, the functionality of the various modules (or units) may be implemented in the same or in multiple pieces of software or hardware in practicing the invention.
Based on the same technical concept, the embodiment of the present application further provides a communication device, and the communication device can implement the method in the foregoing embodiments.
Referring to fig. 6, a schematic structural diagram of a communication device according to an embodiment of the present invention is shown, where the communication device includes: a processor 40, a memory 50, a transceiver 60, and a 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 interconnected buses and bridges, with one or more processors, represented by processor 40, and various circuits, represented by memory 50, being linked together. The bus architecture may also link together various other circuits such as peripherals, voltage regulators, power management circuits, and the like, which are well known in the art, and therefore, will not be described any 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 process disclosed by the embodiment of the present invention can be applied to the processor 40, or implemented by the processor 40. In implementation, the steps of the signal processing flow may be implemented by integrated logic circuits of hardware or instructions in the form of software in the 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, discrete gate or transistor logic, discrete hardware components, or the like that implement or perform the methods, steps, and logic blocks disclosed in embodiments of the present invention. A general purpose processor may be a microprocessor or any conventional processor or the like. The steps of the method for identifying a shared traffic terminal disclosed by the embodiment of the invention can be directly embodied as being executed by a hardware processor, or can be executed and completed by combining hardware and software modules in the processor. The software module may be located in ram, flash memory, rom, prom, or eprom, registers, etc. storage media as is 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 completes the steps of the signal processing flow in combination with the hardware thereof.
Specifically, the processor 40 is configured to read a program in the memory 50 and execute any step of the shared traffic terminal identification method.
Based on the same technical concept, the embodiment of the present application further provides a readable storage medium on which the computer program is stored. The computer program, when executed by a processor, implements any of the steps described in the aforementioned shared traffic terminal identification method.
As will be appreciated by one skilled in the art, 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, 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 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.
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. Therefore, it is intended that the appended claims be interpreted as including 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 changes and modifications may be made in the present invention without departing from the spirit and scope of the invention. Thus, if such modifications and variations of the present invention fall within the scope of the claims of the present invention and their equivalents, the present invention is also intended to include such modifications and variations.

Claims (12)

1. A method for identifying a shared traffic terminal is characterized by comprising the following steps:
in a specific time period, original signaling messages from M terminals to be tested are split at a 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 a corresponding relation between a user number and a time-to-live value of each terminal to be tested in the M terminals to be tested, wherein the time-to-live value is used for limiting the maximum hop count forwarded in a network by an Internet Protocol (IP) data packet in the original signaling message;
and identifying N terminals to be tested which meet the conditions in the M terminals to be tested as shared flow terminals according to the corresponding relation table, wherein N is a positive integer not greater than M.
2. The method according to claim 1, wherein identifying N terminals to be tested among the M terminals to be tested that meet a condition as shared traffic terminals according to the correspondence table comprises:
and if the time-to-live value of each user number in the N terminals to be tested in the corresponding relation table at least comprises TTL and (TTL-N), identifying the N terminals to be tested as shared flow terminals, wherein N is more than or equal to 1 and is less than or equal to TTL, and both TTL and (TTL-N) are used for representing the characteristic value corresponding to the time-to-live value in the specific time period.
3. The method according to claim 1, wherein parsing the original signaling packet to generate a mapping table including a mapping between a user number and a time-to-live value of 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 corresponding survival time value in the 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 is used for representing the service level of the target user number in a network;
reporting the sharing event information relation table to a PCRF (policy and control server) of a packet domain data core network through the PGW;
receiving a control strategy generated by the PCRF based on the sharing 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 the speed or opening the shared flow terminals of the number of the target user or the number of the specific terminals at least according to the specific time period and the QCI value.
6. A shared traffic terminal identification apparatus, comprising:
the system comprises an optical splitting unit, a data transmission unit and a data transmission unit, wherein the optical splitting unit is used for splitting original signaling messages from M terminals to be tested at a PGW side of a packet domain data core network gateway in a specific time period, and M is a positive integer;
a first generating unit, configured to analyze the original signaling message, and generate a corresponding relationship table including a corresponding relationship between a user number and a time-to-live value of each of the M terminals to be tested, where the time-to-live value is used to limit a maximum hop count of an internet protocol IP 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 time-to-live value of each user number in the N terminals to be tested in the corresponding relation table at least comprises TTL and (TTL-N), identifying the N terminals to be tested as shared flow terminals, wherein N is more than or equal to 1 and is less than or equal to TTL, and both TTL and (TTL-N) are used for representing the characteristic value corresponding to the time-to-live value in the specific time period.
8. The apparatus of claim 6, wherein the first generating 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 corresponding survival time value in the 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 tested;
a second generating unit, configured to generate a shared event information relationship table, where the shared event information relationship table at least includes the target subscriber number, the specific time period, and a quality of service class identifier QCI value that is parsed from the original signaling message and used to characterize a service level of the target subscriber number in a network;
the reporting unit is used for reporting the sharing 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 as claimed in claim 9, wherein said control unit is specifically configured to:
and blocking, limiting the speed or opening the shared flow terminals of the number of the target user or the number of the specific terminals 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, reading the program in the memory, performs the method of any of claims 1-5.
12. A readable storage medium having stored thereon a computer program, characterized in that: the computer program, when executed by a processor, implements the method of any one of claims 1-5.
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 true CN111294856A (en) 2020-06-16
CN111294856B 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)

Cited By (1)

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

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106302423A (en) * 2012-06-20 2017-01-04 华为技术有限公司 A kind of identify that network shares the method for behavior, node, mobile terminal and system
CN108024291A (en) * 2016-11-01 2018-05-11 中兴通讯股份有限公司 The method and device that shared verification detects in a kind of mobile network
CN108235303A (en) * 2017-12-29 2018-06-29 中国移动通信集团江苏有限公司 Method, apparatus, equipment and the medium of the shared flow user of identification

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106302423A (en) * 2012-06-20 2017-01-04 华为技术有限公司 A kind of identify that network shares the method for behavior, node, mobile terminal and system
CN108024291A (en) * 2016-11-01 2018-05-11 中兴通讯股份有限公司 The method and device that shared verification detects in a kind of mobile network
CN108235303A (en) * 2017-12-29 2018-06-29 中国移动通信集团江苏有限公司 Method, apparatus, equipment and the medium of the shared flow user of identification

Cited By (2)

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

Also Published As

Publication number Publication date
CN111294856B (en) 2023-07-21

Similar Documents

Publication Publication Date Title
US11601555B2 (en) Methods and apparatuses for service layer charging correlation with underlying networks
KR101868070B1 (en) Service layer southbound interface and quality of service
EP3025538B1 (en) Detecting fraudulent traffic in a telecommunications system
CN102870445B (en) A kind of identify that network shares the method for behavior, node, mobile terminal and system
CN108337652B (en) Method and device for detecting flow fraud
CN104185973B (en) For the method and apparatus for the priority for setting data transmission
CN108259425A (en) The determining method, apparatus and server of query-attack
MX2012013659A (en) Device- assisted services for protecting network capacity.
ES2652345T3 (en) Device-assisted services to protect network capacity
CN103918221A (en) Rules engine evaluation for policy decisions
JP2009135916A (en) Method and system for managing information
CN106162758B (en) Service processing method, PCRF (policy and charging rules function) and service processing system
CN102142990A (en) Traffic monitoring method and device
US20150230074A1 (en) Charging Control Method, Device, and System for Data Service of Roaming Subscriber
CN103718508A (en) Advanced determination, processing and control in communication networks
EP3310093B1 (en) Traffic control method and apparatus
CN109996216A (en) Subscribe to request processing method, network entity and ability open platform
WO2014187227A1 (en) Data flow transmission control method and apparatus
US10700879B2 (en) Charging method and device, access device, service quality control method and device
WO2016109970A1 (en) Network entity and service policy management method
CN111294856B (en) Shared flow terminal identification method, device, equipment and readable storage medium
CN102075386B (en) Identification method and device
EP3641248B1 (en) Traffic optimization device, communication system, traffic optimization method, and program
WO2016029698A1 (en) Policy control method and system and gateway
CN110858957A (en) Information pushing system, method, device, medium and equipment

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