CN112822646B - Message processing method and device, electronic equipment and computer readable storage medium - Google Patents

Message processing method and device, electronic equipment and computer readable storage medium Download PDF

Info

Publication number
CN112822646B
CN112822646B CN202110416747.5A CN202110416747A CN112822646B CN 112822646 B CN112822646 B CN 112822646B CN 202110416747 A CN202110416747 A CN 202110416747A CN 112822646 B CN112822646 B CN 112822646B
Authority
CN
China
Prior art keywords
registration request
equal
message
request message
preset threshold
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
CN202110416747.5A
Other languages
Chinese (zh)
Other versions
CN112822646A (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.)
ZTE Corp
Original Assignee
ZTE Corp
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 ZTE Corp filed Critical ZTE Corp
Priority to CN202110416747.5A priority Critical patent/CN112822646B/en
Publication of CN112822646A publication Critical patent/CN112822646A/en
Application granted granted Critical
Publication of CN112822646B publication Critical patent/CN112822646B/en
Priority to PCT/CN2022/082427 priority patent/WO2022222674A1/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W4/00Services specially adapted for wireless communication networks; Facilities therefor
    • H04W4/12Messaging; Mailboxes; Announcements
    • HELECTRICITY
    • H04ELECTRIC COMMUNICATION TECHNIQUE
    • H04WWIRELESS COMMUNICATION NETWORKS
    • H04W72/00Local resource management
    • H04W72/04Wireless resource allocation

Landscapes

  • Engineering & Computer Science (AREA)
  • Computer Networks & Wireless Communication (AREA)
  • Signal Processing (AREA)
  • Mobile Radio Communication Systems (AREA)

Abstract

The application provides a message processing method and device, electronic equipment and a computer readable storage medium, wherein the message processing method comprises the following steps: sending N first registration request messages to a network storage function entity; wherein N is an integer greater than or equal to 1; the N first registration request messages are obtained by splitting second registration request messages which need to be sent to the network storage functional entity; the information quantity of each first registration request message is less than or equal to a first preset threshold; the time interval between the first registration request messages sent in two adjacent times is larger than or equal to a second preset threshold value.

Description

Message processing method and device, electronic equipment and computer readable storage medium
Technical Field
The embodiment of the application relates to the field of communication, in particular to a message processing method and device, electronic equipment and a computer-readable storage medium.
Background
Fifth generation mobile communication technology (5G, 5)thGeneration) Core Network (5 GC, 5G Core Network) adopts a Service Based Architecture (SBA), and all Network Function (NF) entities in the 5GC can be divided into two types, i.e., a Service producer and a Service consumer. Service producers need to register with Network storage Function (NRF) entities, and the current registration method causes NF entities as service producers to occupy excessive Network bandwidth resources during registration, thereby affecting the reception and transmission of common messages, resulting in link congestion and even Network paralysis.
Disclosure of Invention
The embodiment of the application provides a message processing method and device, electronic equipment and a computer readable storage medium.
In a first aspect, an embodiment of the present application provides a message processing method, including:
sending N first registration request messages to a network storage function entity; wherein N is an integer greater than or equal to 1;
the N first registration request messages are obtained by splitting second registration request messages which need to be sent to the network storage functional entity;
the information quantity of each first registration request message is less than or equal to a first preset threshold; the time interval between the first registration request messages sent in two adjacent times is larger than or equal to a second preset threshold value.
In a second aspect, an embodiment of the present application provides a message processing apparatus, including:
the sending module is used for sending N first registration request messages to the network storage functional entity; wherein N is an integer greater than or equal to 1;
the N first registration request messages are obtained by splitting second registration request messages which need to be sent to the network storage functional entity;
the information quantity of each first registration request message is less than or equal to a first preset threshold; the time interval between the first registration request messages sent in two adjacent times is larger than or equal to a second preset threshold value.
In a third aspect, an embodiment of the present application provides an electronic device, including:
at least one processor;
a memory having at least one program stored thereon, the at least one program, when executed by the at least one processor, implementing any of the message processing methods described above.
In a fourth aspect, an embodiment of the present application provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements any one of the message processing methods described above.
According to the message processing method provided by the embodiment of the application, a second registration request message needing to be sent to an NRF entity is split to obtain N first registration request messages, the second registration request message is an ultra-long message, the information quantity of each split first registration request message is smaller than or equal to a first preset threshold, and the time interval between the first registration request messages sent twice in the adjacent process is larger than or equal to a second preset threshold, namely, the second registration request message is split into N short messages, and the N short messages are sent out discretely in time, so that the network bandwidth resources occupied by sending the N first registration request messages are much smaller than the network bandwidth resources occupied by sending the second registration request message, the influence on the receiving and sending of common messages is reduced, and the smooth transmission of a link is ensured; and CPU resources are saved, thereby improving the processing efficiency.
Drawings
Fig. 1 is a schematic diagram of communication system interaction provided in the related art;
FIG. 2 is a diagram illustrating registration interaction provided in the related art;
FIG. 3 is a diagram illustrating a service discovery interaction provided by the related art;
fig. 4 is a flowchart of a message processing method according to an embodiment of the present application;
fig. 5 is a first interaction diagram of a message processing method according to an embodiment of the present application;
FIG. 6 is a first schematic diagram illustrating a service discovery interaction according to an embodiment of the present application;
fig. 7 is a second interaction diagram of a message processing method according to an embodiment of the present application;
fig. 8 is a third interaction diagram of a message processing method according to an embodiment of the present application;
fig. 9 is a fourth interaction diagram of a message processing method according to an embodiment of the present application;
fig. 10 is a block diagram of a message processing apparatus according to another embodiment of the present application.
Detailed Description
In order to make those skilled in the art better understand the technical solution of the present application, the following describes in detail a message processing method and apparatus, an electronic device, and a computer-readable storage medium provided in the present application with reference to the accompanying drawings.
Example embodiments will be described more fully hereinafter with reference to the accompanying drawings, but which may be embodied in different forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete, and will fully convey the scope of the disclosure to those skilled in the art.
The embodiments and features of the embodiments of the present application may be combined with each other without conflict.
As used herein, the term "and/or" includes any and all combinations of at least one of the associated listed items.
The terminology used herein is for the purpose of describing particular embodiments only and is not intended to be limiting of the application. As used herein, the singular forms "a", "an" and "the" are intended to include the plural forms as well, unless the context clearly indicates otherwise. It will be further understood that the terms "comprises" and/or "comprising," when used in this specification, specify the presence of stated features, integers, steps, operations, elements, and/or components, but do not preclude the presence or addition of at least one other feature, integer, step, operation, element, component, and/or group thereof.
Unless otherwise defined, all terms (including technical and scientific terms) used herein have the same meaning as commonly understood by one of ordinary skill in the art. It will be further understood that terms, such as those defined in commonly used dictionaries, should be interpreted as having a meaning that is consistent with their meaning in the context of the relevant art and the present application and will not be interpreted in an idealized or overly formal sense unless expressly so defined herein.
Fig. 1 is a schematic diagram of interaction of a communication system provided in the related art.
As shown in fig. 1, the communication system includes: a first NF entity, an NRF entity and a second NF entity.
Wherein the first NF entity acts as a service producer and the second NF entity acts as a service consumer. The role of a single NF entity can be switched back and forth between service producer and service consumer in different business scenarios.
The process of registering a first NF entity, currently acting as a service producer, with an NRF entity substantially comprises:
the first NF entity sends a registration request message to the NRF entity;
the first NF entity receives the registration response message sent by the NRF entity.
The registration request message carries NF configuration (NFProfile) parameters in JSON (JavaScript Object Notation) format of the first NF entity, where the NFProfile parameters include a series of configuration parameters of the first NF entity and a service that can be provided by the first NF entity, and the configuration parameters may carry at least one of the following range lists of the service provided by the first NF entity:
a user Permanent Identifier (SUPI) scope list (SUPIRanges);
a Generic Public user Identifier (GPSI) range list (GPSIRanges);
a user Internet Protocol Version 4 (IPv 4, Internet Protocol Version 4) address range list (IPv 4address ranges);
a user Internet Protocol Version 6 (IPv 6, Internet Protocol Version 6) prefix range list (IPv 6prefix ranges);
tracking Area Identification (TAI) range list.
An example of a SUPI Range list (SUPIRanges) is shown below, which is a JSON array format that includes two SUPI ranges, i.e., a SUPI range list size of 2, each SUPI range containing a start (start) field and an end (end) field. The formats of the GPSI range list, the user IPv4address range list, the user IPv6prefix range list and the TAI range list are similar to the formats of the GPSI range list, the user IPv4address range list, the user IPv6prefix range list and the TAI range list, and only the value formats of the list name, the start field and the end field are different.
"supiRanges": [
{
"start": "460123456780000",
"end": "460123456789999"
},
{
"start": "460123456790000",
"end": "460123456799999"
}]
The registration request message specifically carries which scope lists are related to the type of the first NF entity, for example, a Policy Control Function (PCF) entity only supports two scope lists, namely SUPI and GPSI, and a Binding Support Function (BSF) entity only supports a user IPv4address scope list and a user IPv6prefix scope list.
Fig. 2 is a schematic diagram of registration interaction provided in the related art.
As shown in fig. 2, for simplicity of description, only the SUPI scope list is carried in the registration request message, and some other types of scope lists may be carried in practice. Assuming that the first NF entity corresponds to 1 ten thousand SUPI ranges, the NFProfile parameter in the registration request message sent by the first NF entity will carry the 1 ten thousand SUPI ranges and other configuration parameters. According to an estimation, the whole registration request message is a very long message with a length of about 700 KB.
In the current registration process, each independently deployed NF entity only sends one registration request message to the NRF entity, because an operator currently implements a large area system, the number of mobile users served by a single NF entity is huge, and due to reasons such as improper configuration of operation and maintenance personnel (e.g., number segments are too scattered), the number of range lists of NFProfile parameters in the registration request message may be very large, for example, thousands or even tens of thousands of range lists, and the NFProfile parameters are in a pure text format, so that the registration request message may become an ultra-long message with a size of several hundred kilobytes (KB, kilhbyte) or even several megabytes (MB, Megabyte). Although a Control plane of the 5GC has a framing mechanism that can split a relatively long message body into a plurality of smaller DATA (DATA) frames in a Hypertext Transfer Protocol version 2 (HTTP/2) Protocol stack used by a Service Based Interface (SBI) and a fragmentation mechanism in a Transmission Control Protocol (TCP) Protocol stack, the Control plane needs to completely transmit in a very short time no matter splitting into a plurality of DATA frames or performing TCP fragmentation, because the bottom layer cannot sense Service logic, discrete Control cannot be performed.
In addition, as shown in fig. 2, the registration response message returned by the first NRF entity needs to carry the NFProfile parameter in the registration request message; in summary, the current registration method causes the first NF entity to occupy too much network bandwidth resources during the registration process, thereby affecting the transceiving of common messages, resulting in link congestion and even network paralysis.
In addition, the first NF entity also occupies more Central Processing Unit (CPU) resources due to the need to process the ultra-long packet during the registration process, which results in a reduction in Processing efficiency of the first NF entity.
In addition, when a second NF entity serving as a service consumer needs to invoke services provided by other NF entities, service discovery needs to be performed to the NRF entity, that is, the second NF entity sends a discovery request message to the NRF entity; the second NF entity receives the discovery response message sent by the NRF entity; and the discovery response message carries the NFProfile parameter of the NF entity of the qualified service producer. As shown in fig. 3, it is assumed that the discovery request message sent by the second NF entity to the NRF entity for the first time carries SUPI a, the discovery request message sent to the NRF entity for the second time carries SUPI B, and SUPI a falls within the SUPI range 1 corresponding to the first NF entity, and SUPI B falls within the SUPI range 1 ten thousand corresponding to the first NF entity, then the discovery response messages returned by the NRF entity twice each carry complete NFProfile parameters, where the NFProfile parameters include 1 ten thousand SUPI ranges, that is, service discovery is performed with any SUPI that can fall within the SUPI range 1 ten thousand, and the returned discovery response messages are all very long messages with a length of about 700 KB. Therefore, the second NF entity can occupy excessive network bandwidth resources in the service discovery process, thereby influencing the receiving and sending of common messages and causing link congestion and even network paralysis; in addition, the second NF entity also occupies more CPU resources due to the need to process the ultra-long packet in the service discovery process, which results in a reduction in the processing efficiency of the second NF entity.
Description of technical terms
In the present application, unless otherwise specified, the following technical terms should be understood in accordance with the following explanations:
the NF entity refers to an NF instance that implements a service function provided for a user.
The registration request message, the registration response message, the discovery request message, and the discovery response message in the embodiments of the present application are all transmitted in the form of messages in the network, and generally, a message with a total length exceeding 64KB is considered to be an ultra-long message.
The message processing method of the embodiment of the present application may be applied to any network including a first NF entity, an NRF entity, and a second NF entity, and may be applied to, for example, the third generation partnership project (3 GPP )rdGeneration Partnership Project) protocol, a 5GC control plane network implemented using the SBA architecture, may also be applied to future networks.
Fig. 4 is a flowchart of a message processing method according to an embodiment of the present application.
In a first aspect, referring to fig. 4, an embodiment of the present application provides a message processing method applied to a first NF entity, where the method includes:
step 400, sending N first registration request messages to an NRF entity; wherein N is an integer greater than or equal to 1.
In this embodiment of the present application, the N first registration request messages are obtained by splitting a second registration request message that needs to be sent to the NRF entity.
In the embodiment of the present application, the information amount of each of the first registration request messages is less than or equal to a first preset threshold; the time interval between the first registration request messages sent in two adjacent times is larger than or equal to a second preset threshold value.
In the embodiment of the present application, the second registration request message that needs to be sent to the NRF entity is the registration request message in the related art described above, and as can be seen from the foregoing description, the second registration request message is an ultra-long message, and excessive network bandwidth resources need to be occupied for processing the ultra-long message in the registration process, so that the receiving and sending of common messages are affected, and a link is congested, even a network is broken down; in addition, in the registration process, the processing efficiency of the first NF entity is reduced because the very long message needs to be processed, which also occupies more CPU resources.
In some exemplary embodiments, in an actual implementation process, it may be determined whether a second registration request message that needs to be sent to an NRF entity is an ultra-long message, and when the second registration request message that needs to be sent to the NRF entity is an ultra-long message, the second registration request message is split into N first registration request messages, so that an information amount of each first registration request message is less than or equal to a first preset threshold; and then transmits N first registration request messages to the NRF entity.
Under the condition that the second registration request message is not an ultra-long message, the second registration request message is not required to be split into N first registration request messages, and the second registration request message is directly used as the first registration request message to be sent to the NRF entity.
In some exemplary embodiments, a time interval may be preset, and the N first registration request messages may be sequentially transmitted to the NRF entity at the preset time interval.
The specific value of the second preset threshold is not limited in the embodiment of the application, for example, the time interval may be configured between 10 milliseconds and 10000 milliseconds, and the specific value may be determined according to the total duration of the registration process and the impact prevention requirement, and generally, it is relatively reasonable to configure the value to be 100 milliseconds.
In some exemplary embodiments, the information amount of each first registration request message being less than or equal to the first preset threshold includes:
the range number contained in the configuration parameters carried in each first registration request message is less than or equal to a third preset threshold;
or, each range number included in the configuration parameters carried in each first registration request message is less than or equal to a fourth preset threshold;
or the length of the configuration parameter carried in each first registration request message is less than or equal to a fifth preset threshold;
or the length of each first registration request message is less than or equal to a sixth preset threshold.
That is to say, that the information amount of each of the first registration request messages described above is less than or equal to the first preset threshold may mean that the range number included in the configuration parameter carried in each of the first registration request messages is less than or equal to the third preset threshold, so as to indirectly reflect that the information amount of each of the first registration request messages is less than or equal to the first preset threshold; the number of each range included in the configuration parameters carried in each first registration request message may also be smaller than or equal to a fourth preset threshold, so as to indirectly reflect that the information amount of each first registration request message is smaller than or equal to the first preset threshold; the length of the configuration parameter carried in each first registration request message may also be smaller than or equal to a fifth preset threshold, so as to indirectly reflect that the information amount of each first registration request message is smaller than or equal to the first preset threshold; the length of each first registration request message may also be smaller than or equal to a sixth preset threshold, so as to indirectly reflect that the information amount of each first registration request message is smaller than or equal to the first preset threshold.
Regardless of the method, the final purpose is to make the information amount of each first registration request message smaller than or equal to the first preset threshold, and other methods adopted for achieving the purpose that the information amount of each first registration request message is smaller than or equal to the first preset threshold are within the protection scope of the embodiment of the present application, and are not described herein again.
In some exemplary embodiments, the configuration parameters carried in the first registration request message refer to the NFProfile parameters described above.
The specific value of the third preset threshold is not limited in the embodiment of the present application. For example, the range number included in the configuration parameter carried in each first registration request message is between 100 and 5000, and it is generally relatively reasonable to configure the range number to be about 500, that is, the third preset threshold may be configured to be 500.
For example, still taking the example in fig. 2 as an example, when the first NF entity registers with the NRF entity, it is determined whether the number of SUPI ranges served by the first NF entity is less than or equal to 500, and in a case that the number of SUPI ranges served by the first NF entity (1 ten thousand in this example) is greater than 500, as shown in fig. 5, the SUPI range list including 1 ten thousand SUPI ranges is split into 20 SUPI range lists, and each SUPI range list includes 500 SUPI ranges. Then, each of the first registration request messages and the registration response messages becomes about 35KB of short messages, and the size of each of the short messages is 1/20. After the registration is completed, NFProfile parameters corresponding to 20 virtual NF entities can be viewed on the NRF entity.
After the registration procedure is completed, the second NF entity performs service discovery to the NRF entity using the user related parameter (which is SUPI of the terminal), as shown in fig. 6, still taking the discovery conditions SUPI a and SUPI B as examples, the second NF entity sends a discovery request message 1 to the NRF entity, where the discovery request message 1 carries SUPI a; the discovery response message 1 returned by the NRF to the second NF entity only carries the NFProfile parameter including the SUPI range of the SUPI a, that is, only carries 500 SUPI ranges; similarly, the second NF entity sends a discovery request message 2 to the NRF entity, where the discovery request message 2 carries the SUPI B; the discovery response message 2 returned by the NRF to the second NF entity only carries the NFProfile parameter in which the SUPI range including the SUPI B is located, that is, only 500 SUPI ranges. Thus, each discovery response message is about 35KB message, and the length is only 1/20.
The specific value of the fifth preset threshold is not limited in the embodiment of the present application. For example, the length of the configuration parameter carried in each first registration request message is between 16KB and 128KB, and it is generally relatively reasonable to configure the length to be about 32KB, that is, the fifth preset threshold may be configured to be 32 KB.
For example, still taking the example in fig. 2 as an example for explanation, when the first NF entity registers with the NRF entity, it is determined that the maximum length of the NFProfile parameter carried in the first registration request message is 32KB, and when constructing the NFProfile parameter, if the total length of the NFProfile parameter is greater than 32KB, a new NFProfile parameter needs to be split, but the integrity of syntax must be ensured in the splitting process, and a condition that the parameter is incomplete cannot occur, that is, it should be ensured that the NFProfile parameter includes an integer number of SUPI ranges in the splitting process, and generally, the actually constructed length is smaller than 32 KB. As shown in fig. 7, a registration flow in a manner of configuring the maximum length of the NFProfile parameter to be 32KB is that an original ultra-long message of about 750KB is split into a plurality of short messages carrying the NFProfile parameter smaller than or equal to 32KB, and each time a first registration request message is sent, the registration flow waits according to a configured time interval, and then sends a next first registration request message.
The specific value of the sixth preset threshold is not limited in the embodiment of the present application. For example, the length of each first registration request message is between 16KB and 128KB, and it is generally relatively reasonable to configure the length to be about 32KB, that is, the sixth preset threshold may be configured to be 32 KB.
In some example embodiments, the range included in the configuration parameter carried in the first registration request message includes at least one of:
SUPI range;
a GPSI range;
user IPv4address ranges;
user IPv6prefix range;
the TAI range.
That is, in the embodiment of the present application, the configuration parameters carried in the first registration request message may include only one of the ranges, or may include two or more of the ranges. Which parameters are specifically carried are related to the NF type.
For example, as shown in fig. 8, the NFProfile parameter carried in the first registration request message includes both the SUPI range and the GPSI range, and at this time, the maximum number of each range can be configured reasonably to control the total number of ranges included in the NFProfile parameter. If the maximum number of the SUPI range and the maximum number of the GPSI range included in the NFProfile parameter carried in each first registration request message are both configured to be 250, then each time the number of the SUPI range or the GPSI range included in the NFProfile parameter carried in one first registration request message reaches 250, or each time the number of the SUPI range and the GPSI range included in the NFProfile parameter carried in one first registration request message reaches 250 at the same time, a new first registration request message is split. Assuming that the original NFProfile parameters include 1 ten thousand SUPI ranges and 1 ten thousand GPSI ranges, the original NFProfile parameters are finally split into 40 first registration request messages, and each NFProfile parameter carried by each first registration request message includes 250 SUPI ranges and 250 GPSI ranges.
For another example, if the maximum number of the user IPv4address ranges and the user IPv6prefix ranges carried by each NFProfile parameter is 300, when a single NFProfile parameter simultaneously carries 1 ten thousand user IPv4address ranges and 1 ten thousand user IPv6prefix ranges, the NFProfile parameter can be finally split into 34 first registration request messages, the NFProfile parameter carried by the first 33 first registration request messages includes 300 IPv4address ranges and 300 IPv6prefix ranges, and the NFProfile parameter carried by the last first registration request message includes 100 IPv4address ranges and 100 IPv6prefix ranges, as shown in fig. 9.
In this embodiment of the application, the ranges included in the configuration parameters carried in the first registration request message are all ranges corresponding to services provided by the first NF, where the services refer to services for the terminal.
In some exemplary embodiments, the configuration parameters carried in the first registration request message include virtual NF instance identifiers, and the virtual network function instance identifiers included in the configuration parameters carried in different first registration request messages are different.
In this embodiment of the present application, a virtual NF instance identifier range pool may be configured for the first NF entity in advance, where the virtual NF instance identifier range pool includes M virtual NF instance identifiers, and each time a first registration request message is sent, a virtual NF instance identifier is applied from the virtual NF instance identifier range pool.
In the embodiment of the present application, the M specific values may be determined according to specific situations, as long as it is ensured that the virtual NF instance identifier is globally unique. In order to ensure that the virtual NF instance identifiers are globally unique, the virtual NF instance identifier range pools configured for different first NF entities cannot be overlapped with each other, that is, each virtual NF instance identifier in the virtual NF instance identifier range pool configured for the first NF instance is globally unique.
In the embodiment of the present application, because each virtual NF instance identifier is globally unique, each first registration request message sent by a first NF entity can be regarded as being sent by one virtual NF entity, that is, one first NF entity has N virtual NF entities for its appearance, and the registration process of each virtual NF entity is the same as the registration process of the first NF entity in the related art, except that the sent registration request message has different lengths, so that the first registration request message sent by the virtual NF entity of the embodiment of the present application has a shorter length, and does not occupy too much network bandwidth resources, thereby reducing the influence on the sending and receiving of common messages and ensuring that a link is smooth; and CPU resources are saved, thereby improving the processing efficiency.
In some exemplary embodiments, after sending the N first registration request messages to the NRF entity, the method further includes:
step 401, receiving N registration response messages returned by the NRF entity; and the N first registration request messages correspond to the N registration response messages one by one.
In some example embodiments, the number of ranges included in the configuration parameters carried in the corresponding first registration request message and the registration response message is the same.
In this embodiment of the present application, that the first registration request message and the registration response message correspond to each other means that the registration response message is a message in reply to the first registration request message.
According to the message processing method provided by the embodiment of the application, a second registration request message needing to be sent to an NRF entity is split to obtain N first registration request messages, the second registration request message is an ultra-long message, the length of each split first registration request message is smaller than or equal to a first preset threshold, and the time interval between the first registration request messages sent twice is larger than or equal to a second preset threshold, namely, the second registration request message is split into N short messages, and the N short messages are sent out discretely in time, so that network bandwidth resources occupied by sending the N first registration request messages are much less than network bandwidth resources occupied by sending the second registration request message, the influence on receiving and sending of common messages is reduced, and a smooth link is ensured; and CPU resources are saved, thereby improving the processing efficiency.
In addition, after the message processing method of the embodiment of the application is adopted to realize the registration process, in the process of service discovery of the second NF entity, the discovery response message returned to the second NF entity by the NRF entity is also changed into a shorter common message, so that the network bandwidth resource occupied in the service discovery process is relatively reduced, thereby reducing the influence on the receiving and sending of the common message and ensuring the smooth link; and CPU resources are saved, thereby improving the processing efficiency.
In a second aspect, an embodiment of the present application provides an electronic device, including:
at least one processor;
a memory having at least one program stored thereon, the at least one program, when executed by the at least one processor, implementing any of the message processing methods described above.
Wherein, the processor is a device with data processing capability, which includes but is not limited to a Central Processing Unit (CPU) and the like; memory is a device with data storage capabilities including, but not limited to, random access memory (RAM, more specifically SDRAM, DDR, etc.), Read Only Memory (ROM), Electrically Erasable Programmable Read Only Memory (EEPROM), FLASH memory (FLASH).
In some embodiments, the processor, memory, and in turn other components of the computing device are connected to each other by a bus.
In a third aspect, an embodiment of the present application provides a computer-readable storage medium, on which a computer program is stored, where the computer program, when executed by a processor, implements any one of the message processing methods described above.
Fig. 10 is a block diagram of a message processing apparatus according to another embodiment of the present application.
In a fourth aspect, referring to fig. 10, another embodiment of the present application provides a message processing apparatus, including:
a sending module 1001, configured to send N first registration request messages to an NRF entity; wherein N is an integer greater than or equal to 1;
the N first registration request messages are obtained by splitting a second registration request message which needs to be sent to the NRF entity;
the information quantity of each first registration request message is less than or equal to a first preset threshold; the time interval between the first registration request messages sent in two adjacent times is larger than or equal to a second preset threshold value.
In some exemplary embodiments, the information amount of each first registration request message being less than or equal to a first preset threshold includes:
the range number contained in the configuration parameters carried in each first registration request message is less than or equal to a third preset threshold;
or, each range number included in the configuration parameters carried in each first registration request message is less than or equal to a fourth preset threshold;
or the length of the configuration parameter carried in each first registration request message is less than or equal to a fifth preset threshold;
or the length of each first registration request message is less than or equal to a sixth preset threshold.
In some example embodiments, the range included in the configuration parameter carried in the first registration request message includes at least one of:
SUPI range;
a GPSI range;
user IPv4address ranges;
user IPv6prefix range;
the TAI range.
In some exemplary embodiments, the configuration parameters carried in the first registration request message include virtual network function instance identifiers, and the virtual network function instance identifiers included in the configuration parameters carried in different first registration request messages are different.
In some exemplary embodiments, further comprising:
a receiving module 1002, configured to receive N registration response messages returned by the NRF entity; and the N first registration request messages correspond to the N registration response messages one by one.
In some example embodiments, the number of ranges included in the configuration parameters carried in the corresponding first registration request message and the registration response message is the same.
The specific implementation process of the message processing apparatus is the same as that of the message processing method in the foregoing embodiment, and is not described here again.
It will be understood by those of ordinary skill in the art that all or some of the steps of the methods, systems, functional modules/units in the devices disclosed above may be implemented as software, firmware, hardware, and suitable combinations thereof. In a hardware implementation, the division between functional modules/units mentioned in the above description does not necessarily correspond to the division of physical components; for example, one physical component may have multiple functions, or one function or step may be performed by several physical components in cooperation. Some or all of the physical components may be implemented as software executed by a processor, such as a central processing unit, digital signal processor, or microprocessor, or as hardware, or as an integrated circuit, such as an application specific integrated circuit. Such software may be distributed on computer readable media, which may include computer storage media (or non-transitory media) and communication media (or transitory media). The term computer storage media includes volatile and nonvolatile, removable and non-removable media implemented in any method or technology for storage of information such as computer readable instructions, data structures, program modules or other data, as is well known to those of ordinary skill in the art. Computer storage media includes, but is not limited to, RAM, ROM, EEPROM, flash memory or other memory technology, CD-ROM, Digital Versatile Disks (DVD) or other optical disk storage, magnetic cassettes, magnetic tape, magnetic disk storage or other magnetic storage devices, or any other medium which can be used to store the desired information and which can be accessed by the computer. In addition, communication media typically embodies computer readable instructions, data structures, program modules or other data in a modulated data signal such as a carrier wave or other transport mechanism and includes any information delivery media as known to those skilled in the art.
Example embodiments have been disclosed herein, and although specific terms are employed, they are used and should be interpreted in a generic and descriptive sense only and not for purposes of limitation. In some instances, features, characteristics and/or elements described in connection with a particular embodiment may be used alone or in combination with features, characteristics and/or elements described in connection with other embodiments, unless expressly stated otherwise, as would be apparent to one skilled in the art. Accordingly, it will be understood by those skilled in the art that various changes in form and details may be made therein without departing from the scope of the application as set forth in the appended claims.

Claims (9)

1. A method of message processing, comprising:
sending N first registration request messages to a network storage function entity; wherein N is an integer greater than or equal to 1;
the N first registration request messages are obtained by splitting second registration request messages which need to be sent to the network storage functional entity;
the information quantity of each first registration request message is less than or equal to a first preset threshold; the time interval between the first registration request messages sent in two adjacent times is larger than or equal to a second preset threshold value.
2. The message processing method according to claim 1, wherein the information amount of each of the first registration request messages is less than or equal to a first preset threshold value, including:
the range number contained in the configuration parameters carried in each first registration request message is less than or equal to a third preset threshold;
or, each range number included in the configuration parameters carried in each first registration request message is less than or equal to a fourth preset threshold;
or the length of the configuration parameter carried in each first registration request message is less than or equal to a fifth preset threshold;
or the length of each first registration request message is less than or equal to a sixth preset threshold.
3. The message processing method according to claim 2, wherein the range included in the configuration parameter carried in the first registration request message includes at least one of:
a user permanent identifier range;
a universal public user identifier range;
user internet protocol version 4address range;
user internet protocol version 6prefix range;
the tracking area identifies the range.
4. The message processing method according to claim 1, wherein the configuration parameters carried in the first registration request message include virtual network function instance identifiers, and the virtual network function instance identifiers included in the configuration parameters carried in different first registration request messages are different.
5. The message processing method according to any of claims 1 to 4, after sending the N first registration request messages to the network storage function entity, the method further comprising:
receiving N registration response messages returned by the network storage functional entity; and the N first registration request messages correspond to the N registration response messages one by one.
6. The message processing method according to claim 5, wherein the number of the ranges contained in the configuration parameters carried in the corresponding first registration request message and the registration response message is the same.
7. A message processing apparatus comprising:
the sending module is used for sending N first registration request messages to the network storage functional entity; wherein N is an integer greater than or equal to 1;
the N first registration request messages are obtained by splitting second registration request messages which need to be sent to the network storage functional entity;
the information quantity of each first registration request message is less than or equal to a first preset threshold; the time interval between the first registration request messages sent in two adjacent times is larger than or equal to a second preset threshold value.
8. An electronic device, comprising:
at least one processor;
memory having stored thereon at least one program which, when executed by the at least one processor, carries out a message processing method according to any one of claims 1-6.
9. A computer-readable storage medium, having stored thereon a computer program which, when executed by a processor, implements a message processing method according to any one of claims 1-6.
CN202110416747.5A 2021-04-19 2021-04-19 Message processing method and device, electronic equipment and computer readable storage medium Active CN112822646B (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN202110416747.5A CN112822646B (en) 2021-04-19 2021-04-19 Message processing method and device, electronic equipment and computer readable storage medium
PCT/CN2022/082427 WO2022222674A1 (en) 2021-04-19 2022-03-23 Message processing method and apparatus, electronic device, and computer-readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202110416747.5A CN112822646B (en) 2021-04-19 2021-04-19 Message processing method and device, electronic equipment and computer readable storage medium

Publications (2)

Publication Number Publication Date
CN112822646A CN112822646A (en) 2021-05-18
CN112822646B true CN112822646B (en) 2021-08-13

Family

ID=75863662

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202110416747.5A Active CN112822646B (en) 2021-04-19 2021-04-19 Message processing method and device, electronic equipment and computer readable storage medium

Country Status (2)

Country Link
CN (1) CN112822646B (en)
WO (1) WO2022222674A1 (en)

Families Citing this family (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN112822646B (en) * 2021-04-19 2021-08-13 中兴通讯股份有限公司 Message processing method and device, electronic equipment and computer readable storage medium
CN113687878B (en) * 2021-08-23 2023-12-01 北京京东振世信息技术有限公司 Information interaction method, device, equipment and storage medium

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106713170A (en) * 2016-12-30 2017-05-24 杭州迪普科技股份有限公司 Message fragmentation method and device for VSM channel
CN111314908A (en) * 2018-02-09 2020-06-19 Oppo广东移动通信有限公司 Wireless communication method, network equipment and terminal equipment

Family Cites Families (7)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
JP6787190B2 (en) * 2017-03-06 2020-11-18 カシオ計算機株式会社 Authentication device and program
CN109803242B (en) * 2017-11-17 2021-09-03 中兴通讯股份有限公司 Method, apparatus and readable storage medium for NF discovery through NRF
US20190230556A1 (en) * 2018-01-19 2019-07-25 Electronics And Telecommunications Research Institute Apparatus and method for network function profile management
US20210243170A1 (en) * 2018-05-21 2021-08-05 Telefonaktiebolaget Lm Ericsson (Publ) Methods for processing encrypted domain name server, dns, queries received from user equipment in a telecommunication network
US11864098B2 (en) * 2018-11-14 2024-01-02 Telefonaktiebolaget Lm Ericsson (Publ) Methods and apparatuses for network function selection in 5G for a user
CN115396851A (en) * 2019-09-26 2022-11-25 华为技术有限公司 NF-based communication method, NF-based communication equipment and NF-based storage medium
CN112822646B (en) * 2021-04-19 2021-08-13 中兴通讯股份有限公司 Message processing method and device, electronic equipment and computer readable storage medium

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN106713170A (en) * 2016-12-30 2017-05-24 杭州迪普科技股份有限公司 Message fragmentation method and device for VSM channel
CN111314908A (en) * 2018-02-09 2020-06-19 Oppo广东移动通信有限公司 Wireless communication method, network equipment and terminal equipment

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
Introducing a new set of key issues to TR 33.855;Deutsche Telekom AG;《3GPP TSG SA WG3 (Security) Meeting #92 S3-182503》;20180824;全文 *

Also Published As

Publication number Publication date
CN112822646A (en) 2021-05-18
WO2022222674A1 (en) 2022-10-27

Similar Documents

Publication Publication Date Title
US9497598B2 (en) Service information pushing and receiving method, and related apparatus and system
CN112822646B (en) Message processing method and device, electronic equipment and computer readable storage medium
CN112152940B (en) Message processing method, device and system
EP3754995A1 (en) Video optimization method, device, system, terminal, network apparatus, and storage medium
EP3813318A1 (en) Packet transmission method, communication device, and system
CN111585815B (en) Port data acquisition method and device
US10136375B2 (en) Method for service data management, apparatus, and system
CN112671818A (en) Data subscription method, device and system
US20200344725A1 (en) Data transmission method and apparatus, and computer storage medium
CN112422485B (en) Communication method and device of transmission control protocol
CN113973091A (en) Message processing method, network equipment and related equipment
CN110784510A (en) Method for accessing target service node to bus and information interaction method of service node
CN111224759A (en) Bearer configuration method, device and equipment
US11436172B2 (en) Data frame interface network device
CN115344405A (en) Data processing method, network interface card, electronic equipment and storage medium
CN114071386B (en) Method, device and system for charging of cooperative network side and charging side
CN114697269A (en) Data communication method, apparatus, device and medium
CN112003796A (en) Broadcast message processing method, system, equipment and computer storage medium
US20140074956A1 (en) Message sending method and apparatus
CN113709015A (en) Data transmission method, electronic device and storage medium
CN103580805A (en) Message processing method and device
CN110445721B (en) Message forwarding method and device
CN113596029B (en) Data packet transmission method and device of functional mobile phone and functional mobile phone
CN111567015B (en) Data transmission method and device and computer storage medium
CN107852597A (en) A kind of method and apparatus for finding terminal 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