WO2023237035A1

WO2023237035A1 - Repetitive data optimization in n40 interface

Info

Publication number: WO2023237035A1
Application number: PCT/CN2023/099042
Authority: WO
Inventors: Zhansheng WEI; Robert Toernkvist; Jiehong YANG; Juan Li; Sven THOMKE
Original assignee: Telefonaktiebolaget Lm Ericsson (Publ)
Priority date: 2022-06-10
Filing date: 2023-06-08
Publication date: 2023-12-14

Abstract

The embodiments herein relate to repetitive data optimization in N40 interface. In some embodiments, there proposes a method (1400) performed by a first network function (110) implementing a Session Management Function (SMF). In an embodiment, the method may comprise the step of encoding (S1401) a message related to charging. In an embodiment, the method may further comprise the step of transmitting (S1402) the message to a second network function (120) implementing a Charging Function (CHF). The message may include a first set of information (201, 521), and a second set of information (202, 522). The message may further include a common set of information (304, 624, 811, 812, 1031, 1032) including the common information shared by the first set of information (201, 521) and the second set of information (202, 522). The embodiments may greatly reduce the length of N40 messages and thus may improve the live application, for example livestreaming.

Description

REPETITIVE DATA OPTIMIZATION IN N40 INTERFACE

Cross Reference to Related Application

This application claims priorities of PCT Application Serial Number PCT/CN2022/098171 filed on June 10, 2022 with title of "REPETITIVE DATA OPTIMIZATION IN N40 INTERFACE" , the entire contents of which are incorporated herein by reference.

Technical Field

The embodiments herein relate generally to the field of communication, and more particularly, the embodiments herein relate to repetitive data optimization in N40 interface.

Background

The third Generation Partnership Project (3GPP) Technical Specification (TS) 32.290 and TS 32.291 specifies converged charging, which is performed by the Session Management Function (SMF) 110 interacting with Charging Function (CHF) 120 using Nchf. Converged charging includes quota management and usage reporting.

Figure 1A is a schematic signaling chart showing the messages for converged charging. Figure 1B is a schematic diagram showing example data structure 100 of the Charging Data Request message from the SMF 110 to the CHF 120.

As shown in Figure 1A, the SMF 110 shall be able to perform convergent charging by interacting with CHF 120, for charging data related to Protocol Data Unit (PDU) sessions. The Charging Data Request and Charging Data Response are exchanged between the SMF 110 and the CHF 120, based on session based charging (SCUR) scenarios specified in 3GPP TS 32.290. The Charging Data Request is issued by the SMF 110 towards the CHF 120 when certain conditions (chargeable events) are met.

As shown in Figure 1B, the SMF 110 may report the usage information to the CHF 120 via usedUnitContainer 141 for Flow Based Charging (FBC) and MultipleQFIcontainer 151 for Quality of Service (QoS) flow based charging (QBC) .

In the UsedUnitContainer 141, specific charging information used for 5G data connectivity charging is provided within the PDU Container Information 101, see section 6.2.1.3 Definition of PDU Container information of 3GPP TS32.255.

In the MultipleQFIcontainer 151, specific charging information used for 5G data connectivity QoS flow based charging (QBC) charging is provided within the QFI Container Information 121, see section 6.2.1.5 Definition of QoS Flow Identifier (QFI) Container information of3GPP TS 32.255.

In each Charging Data Request message, multiple MultipleUnitUsages 142 can be included depending on the number of Rating groups (RGs) , one MultipleUnitUsage 142 per RG. Multiple UsedUnitContainers 141 (PDUContainerInformations 101) can be included per MultipleUnitUsage 142.

In each Charging Data Request message, multiple MultipleQFIcontainer 151 can be included depending on the number of QoS flow. One MultipleQFIcontainer 151 per QoS Flow.

Summary

Most information in PDUContainerInformation 101 of different rating groups or different rating group+service Identifier (ID) are sharing the same value. Most information in qFIContainerInformation 121 of different QoS flow ID are sharing the same value.

For example, the following information are User Equipment (UE) level information, the value is the same for all UsedUnitContainers 141 or MultipleQFIcontainer 151 generated within the same reporting interval and might be the same in different reporting intervals for all rating groups or rating group+service ID or Qos flow IDs.

ο userLocationInformation

ο uetimeZone

ο presenceReportingAreaInformation

ο rATType

ο servingNetworkFunctionID

ο 3gppPSDataOffStatus

For example, the following information are rating group or rating group+service level, the information is the same among the UsedUnitContainers 141 generated within the same reporting interval and might be the same in different reporting intervals for the same Rating group or rating group+service ID.

ο qoSInformation

ο qoSCharacteristics

ο afChargingIdentifier

ο afChargingIdString

ο sponsorIdentity

ο applicationserviceProviderIdentity

ο chargingRuleBaseName

ο mAPDUSteeringFunctionality

ο mAPDUSteeringMode

For example, the following information are QoS flow level, the information is the same among the MultipleQFIcontainer 151 generated in different reporting intervals for the same QoS flow.

ο qoSInformation

ο qoSCharacteristics

ο 3gppChargingId

ο diagnostics

ο enhancedDiagnostics

As a result, there will be great or heavy repetitive data of PDUContainerInformation 101 or qFIContainerInformation 121 in a Charging Data Request message; which make the message length of N40 message too long especially when the number of RGs is big within a charging session.

There are lots of problems or issues found in the live network because of the transferring of big packet of N40 messages, for example, transferring delay or big message handling time in the CHF 120 side.

The embodiments herein propose methods, network functions, computer readable medium and computer program product for repetitive data optimization in N40 interface.

In some embodiments, there proposes a method performed by a first network function implementing a SMF. In an embodiment, the method may comprise the step of encoding a message related to charging. The method may further comprise the step of transmitting the message to a second network function implementing a CHF. In addition, the message may include a first set of information, and a second set of information; and the message may further include a common set of information including the common information shared by the first set of information and the second set of information.

In an embodiment, the first set of information may include the common set of information and a first identifier identifying the common set of information. In addition, the second set of information may include a second identifier identifying a reference to the common set of information.

In an embodiment, the second set of information may further include a differential set of information. The differential set of information may include the difference of the second set of information from the common set of information. In addition, the differential set of information may override the respective information of the common set of information.

In an embodiment, the second set of information may further include a third identifier, which may identify the overridden common set of information by overriding the common set of information with the differential set of information. In addition, the message may further include a third set of information, which may include a fourth identifier identifying a reference to the overridden common set of information.

In an embodiment, the common set of information may be separated from the first set of information and the second set of information.

In an embodiment, the first set of information may include a first differential set of information. The first differential set of information may include the difference of the first set of information from the common set of information, and the first differential set of information may override the respective information of the common set of information.

In an embodiment, the second set of information may include a second differential set of information. The second differential set of information may include the difference of the second set of information from the common set of information, and the second differential set may override the respective information of the common set of information.

In an embodiment, the common set of information may be PDUContainerCommonInformation. In an embodiment, the common set of information may be QFIContainerCommonInformation.

In an embodiment, the first set of information and the second set of information may be information related to the same RG and different service IDs or related to different RGs and different service ID.

In an embodiment, the first set of information and the second set of information may be information related to different QoS flows.

In an embodiment, the first set of information and the second set of information may be PDUContainerInformation. In an embodiment, the first set of information and the second set of information may be QFIContainerInformation.

In an embodiment, the first set of information and the second set of information may be included in UsedUnitContainer. In an embodiment, the first set of information and the second set of information may be included in MultipleQFIContainer.

In an embodiment, the message may be a Charging Data Request message, which is sent from the SMF to the CHF over N40 interface.

In an embodiment, the method may further comprise the step of receiving a Charging Data Response message from the second network function.

In some embodiments, there proposes a method performed by a second network function implementing a CHF. In an embodiment, the method may comprise the step of receiving a message related to charging from a first network function implementing a SMF. In an embodiment, the method may further comprise the step of decoding the message.

In an embodiment, the method may further comprise the step of transmitting a Charging Data Response message to the first network function.

In some embodiments, there proposes a network function, comprising: at least one processor; and a non-transitory computer readable medium coupled to the at least one processor. In an embodiment, the non-transitory computer readable medium may store instructions executable by the at least one processor, whereby the at least one processor may be configured to perform the above methods related to the above network functions. In an embodiment, the network function may be configured as any of the above first network function, second network function, third network function, or fourth network function.

In some embodiments, there proposes a computer readable medium stores computer readable code, which when run on an apparatus, causes the apparatus to perform any of the above methods.

In some embodiments, there proposes a computer program product stores computer readable code, which when run on an apparatus, causes the apparatus to perform any of the above methods.

The embodiments may greatly reduce the length of N40 messages and improve the message handling cost in both SMF 110 side and CHF 120 side. Thus, the embodiments may improve the transferring delay or big message handling time in the CHF 120 side, and may improve the live application, for example livestreaming.

Brief Description of the Drawings

The accompanying drawings, which are incorporated herein and form part of the specification, illustrate various embodiments of the present disclosure and, together with the description, further serve to explain the principles of the disclosure and to enable a person skilled in the pertinent art to make and use the embodiments disclosed herein. In the drawings, like reference numbers indicate identical or functionally similar elements, and in which:

Figure 1A is a schematic block diagram showing example architecture of a wireless communication system for enabling Edge applications;

Figure 1B is a schematic diagram showing example data structure of the Charging Data Request message from the SMF to the CHF;

Figure 2 is a schematic diagram showing example data structure of the Charging Data Request message for flow-based charging;

Figure 3 is a schematic diagram showing example data structure of the Charging Data Request message for flow-based charging, according to the embodiments herein;

Figure 4 is a schematic diagram showing another example data structure of the Charging Data Request message for flow-based charging, according to the embodiments herein;

Figure 5 is a schematic diagram showing example data structure of the Charging Data Request message for QoS Flow based charging;

Figure 6 is a schematic diagram showing example data structure of the Charging Data Request message for QoS Flow based charging, according to the embodiments herein;

Figure 7 is a schematic diagram showing another example data structure of the Charging Data Request message for QoS Flow based charging, according to the embodiments herein;

Figure 8 is a schematic diagram showing yet example data structure of the Charging Data Request message for flow-based charging, according to the embodiments herein;

Figure 9 is a schematic diagram showing yet another example data structure of the Charging Data Request message for flow-based charging, according to the embodiments herein;

Figure 10 is a schematic diagram showing yet example data structure of the Charging Data Request message for QoS Flow based charging, according to the embodiments herein;

Figure 11 is a schematic diagram showing yet another example data structure of the Charging Data Request message for QoS Flow based charging, according to the embodiments herein;

Figure 12 is a schematic diagram showing still yet another example data structure of the Charging Data Request message for flow-based charging, according to the embodiments herein;

Figure 13 is a schematic diagram showing still yet another example data structure of the Charging Data Request message for QoS Flow based charging, according to the embodiments herein;

Figure 14 is a schematic flow chart showing an example method in the first network function, according to the embodiments herein;

Figure 15 is a schematic flow chart showing an example method in the second network function, according to the embodiments herein;

Figure 16 is a schematic block diagram showing an example network function, according to the embodiments herein;

Figure 17 is a schematic block diagram showing an example computer-implemented apparatus, according to the embodiments herein.

Detailed Description of Embodiments

Embodiments herein will be described in detail hereinafter with reference to the accompanying drawings, in which embodiments are shown. These embodiments herein may, however, be embodied in many different forms and should not be construed as being limited to the embodiments set forth herein. The elements of the drawings are not necessarily to scale relative to each other.

Reference to "one embodiment" or "an embodiment" means that a particular feature, structure or characteristic described in connection with the embodiment is included in at least one embodiment. Thus, the appearances of the phrase "in an embodiment" appearing in various places throughout the specification are not necessarily all referring to the same embodiment.

The term "A, B, or C" used herein means "A" or "B" or "C" ; the term "A, B, and C" used herein means "A" and "B" and "C" ; the term "A, B, and/or C" used herein means "A" , "B" , "C" , "A and B" , "A and C" , "B and C" or "A, B, and C" .

It should also be understood that, a network function can be implemented either as a network element on a dedicated hardware, as a software instance running on a dedicated hardware, or as a virtualized function instantiated on an appropriate platform, e.g. on a cloud infrastructure.

Figure 2 is a schematic diagram showing example data structure 200 of the Charging Data Request message for flow-based charging (FBC) . As shown in Figure 2, in the Charging Data Request message, usage of two RGs shall be reported; for RG1 there is two UsedUnitContainers 141 and for RG2 there is one UsedUnitContainers 141 to be transferred in N40 interface.

As an example, it is assumed that all attributes (except timeofFirstUsage/timeofLastUsage) in the PDU Containers are sharing the same value.

Figure 5 is a schematic diagram showing example data structure 500 of the Charging Data Request message for QoS Flow based charging (QBC) . As shown in Figure 2, in the Charging Data Request message, usage of two QoS flows shall be reported; for each QoS flow, there is one MultipleQFIcontainer 151 to be transferred in N40 interface

As an example, it is assumed that all attributes (except timeofFirstUsage/timeofLastUsage) in the QFI Containers are sharing the same value.

In view of the above key issues, the embodiments propose a solution for optimizing the repetitive data in N40 interface.

Figure 3 is a schematic diagram showing example data structure 300 of the Charging Data Request message for flow-based charging, according to the embodiments herein. Figure 4 is a schematic diagram showing another example data structure 400 of the Charging Data Request message for flow-based charging, according to the embodiments herein.

As shown in Figure 3 and Figure 4, in the embodiments, for flow-based charging, the embodiments propose adding a PDUContainerInformation ID 305 to identify at least a part of the PDUContainerInformation 201 (also referred as common set of information 304) and a PDUContainerInformation reference ID 306 pointing to the common set of information 304.

The following table 1 shows information for the PDUContainerInformation including the pDUContainerInfoId 305 and refPDUContainerInfoId 306, which may be sent from the SMF 110 to the CHF 120. Note that, the PDUContainerInformation does not need to include the pDUContainerInfoId 305 and refPDUContainerInfoId 306 at the same time, for example, as shown in Figure 3, the PDUContainerInformation 201 may include the pDUContainerInfoId 305 and the PDUContainerInformation 202 and 203 may include the refPDUContainerInfoId 306.

Table 1 pDUContainerInfoId and refPDUContainerInfoId in the PDUContainerInformation

With the message structure 300 shown in figure 3, the PDUContainerInfo2 and the PDUContainerInfo3 inherit all the information defined in the PDUContainerInfo1 (except timeofFirstUsage/timeofLastUsage) , by reference information from pDUContainerInfoId.

In an embodiment, the PDUContainerInfo1 may include the pDUContainerInfoId 305 to identify the common set of information 304, which may be a subset of the set of information 201. Then, the PDUContainerInfo2 may refer to the common set of information 304 by including the refPDUContainerInfoId 306, which identifying a reference to the common set of information 304. As a result, compared with the data structure 200 in Figure 2, the representation of the set of information 202 or 203 may be simplified, i.e., only including the timeofFirstUsage/timeofLastUsage and the refPDUContainerInfoId 306.

In an embodiment, the information defined in the PDUContainerInfo can override the one it referred to. For example, if the location information in the UsedUnitContainer2 is different from the one in the UsedUnitContainer1, then the PDUContainerInfo2 may further include a userLocationInformation (location2) 407. That is, by including a userLocationInformation (location2) 407 in the set of information 202, the userLocationInformation (location2) 407 may be used to override the respective information userLocationInformation (location1) in the common set of information 304.

In an embodiment, the PDUContainerInfo2 (the set of information 202) may further include the pDUContainerInfoId 408 to identify the overridden common set of information, by overridding the respective information userLocationInformation (location1) in the common set of information 304 with the userLocationInformation (location2) 407. Then, the PDUContainerInfo3 (the set of information 203) may refer to the overridden common set of information by including the refPDUContainerInfoId 409, which identifying a reference to the overridden common set of information.

As a result, compared with the data structure 200 in Figure 2, the representation of the set of information 202 may be simplified, i.e., only including the timeofFirstUsage/timeofLastUsage, the refPDUContainerInfoId 306, and a differential set of information 407, which shows the difference of the set of information 202 from the common set of information 304, and may override the respective information of the common set of information 304. In addition, compared with the data structure 200 in Figure 2, the representation of the set of information 203 may be also simplified, i.e., only including the timeofFirstUsage/timeofLastUsage, and the refPDUContainerInfoId 409, which indicates the reference to the overridden common set of information.

Figure 6 is a schematic diagram showing example data structure 600 of the Charging Data Request message for QoS Flow based charging, according to the embodiments herein. Figure 7 is a schematic diagram showing another example data structure 700 of the Charging Data Request message for QoS Flow based charging, according to the embodiments herein.

As shown in Figure 6 and Figure 7, in the embodiments, for QoS Flow based charging, the embodiments propose adding a qFIContainerInformation ID 625 to identify at least a part of the qFIContainerInformation 521 (also referred as common set of information 624) and a qFIContainerInformation reference ID 626 pointing to the common set of information 624.

The following table 2 shows information for the qFIContainerInformation 521 including the qFIContainerInfoId 625 and refQFIContainerInfoId 626, which may be sent from the SMF 110 to the CHF 120. Note that, the qFIContainerInformation 521 does not need to include the qFIContainerInfoId 625 and refQFIContainerInfoId 626 at the same time, for example, as shown in Figure 6 and Figure 7, the qFIContainerInformation 521 may include the qFIContainerInfoId 625 and the qFIContainerInformation 522 may include the refQFIContainerInfoId 626.

Table 2 qFIContainerInfoId and refQFIContainerInfoId in the QFIContainerInformation

With the message structure 600 shown in figure 6, the QFIContainerInfo 522 (QFI=6, also referred as QFI 6) inherits all the information defined in the QFIContainerInfo 521 (QFI=5, also referred as QFI 5) (except timeofFirstUsage/timeofLastUsage) , by reference information from the qFIContainerInfoId 625.

In an embodiment, the QFIContainerInfo 521 may include the qFIContainerInfoId 625 to identify the common set of information 624, which may be a subset of the set of information 521. Then, the QFIContainerInfo 522 may refer to the common set of information 624 by including the refQFIContainerInfoId 626, which identifying a reference to the common set of information 624. As a result, compared with the data structure 500 in Figure 5, the representation of the set of information 522 may be simplified, i.e., only including the timeofFirstUsage/timeofLastUsage and the refQFIContainerInfoId 626.

In an embodiment, the information defined in the QFIContainerInformation 522 can override the one defined in QFIContainerInformation 521 referred to. For example, if the location information is different from the one in the QFIContainerInfo1, then userLocationInformation (location2) shall be present in the QFIContainerInfo 522. That is, by including a userLocationInformation (location2) 727 in the set of information 522, the userLocationInformation (location2) 727 may be used to override the respective information userLocationInformation (location1) in the common set of information 624.

As a result, compared with the data structure 200 in Figure 5, the representation of the set of information 522 may be simplified, i.e., only including the timeofFirstUsage/timeofLastUsage, the refQFIContainerInfoId 626, and a differential set of information 727, which shows the difference of the set of information 522 from the common set of information 624, and may override the respective information of the common set of information 624.

With the embodiments above in Figures 3-7, the information in a container may be referred by the following containers, as a result, the more containers including in a N40 message, the saving is more notable.

Figure 8 is a schematic diagram showing yet example data structure 800 of the Charging Data Request message for flow-based charging, according to the embodiments herein. Figure 9 is a schematic diagram showing yet another example data structure 900 of the Charging Data Request message for flow-based charging, according to the embodiments herein.

As shown in Figure 8 and Figure 9, in the embodiments, for flow based charging, the embodiments propose adding a PDUContainerCommonInformation 811 or 812 (also referred as common set of information 811 or 812) in MultipleUnitUsage 142 per rating group, which is a common part for all PDUContainerInformation container 201, 202, or 203 of a rating group. In addition, the common set of information 811, 812 may be separated from the set of information 201, 202, or 203.

The following table 3 shows information for the MultipleUnitUsage 142 including the PDUContainerCommonInformation 811 or 812, which may be sent from the SMF 110 to the CHF 120. For example, for RG1, the MultipleUnitUsage 142 may include the PDUContainerCommonInformation 811, and for RG2, the MultipleUnitUsage 142 may include the PDUContainerCommonInformation 812.

Table 3 MultipleUnitUsage

With the message structure 800 shown in figure 8, by including the PDUContainerCommonInformation 811, which is used as the common set of information for the pDUcontainerInfo 201 and 202 of the first RG (RG1) , compared with the data structure 200 in Figure 2, the representation of the set of information 201 and 202 may be simplified, i.e., only including the timeofFirstUsage/timeofLastUsage.

In an embodiment, the information defined in the pDUcontainerInformation 202 can override the one defined in the PDUContainerCommonInfomation 811. For example, if the location information is different from the one in the PDUContainerCommonInfomation 811, then userLocationInformation (location2) shall be present in the pDUcontainerInformation 202. That is, by including a userLocationInformation (location2) 917 in the set of information 202, the userLocationInformation (location2) 917 may be used to override the respective information userLocationInformation (location1) in the common set of information 811.

Figure 10 is a schematic diagram showing yet example data structure 1000 of the Charging Data Request message for QoS Flow based charging, according to the embodiments herein. Figure 11 is a schematic diagram showing yet another example data structure 1100 of the Charging Data Request message for QoS Flow based charging, according to the embodiments herein.

As shown in Figure 10 and Figure 11, in the embodiments, for QoS Flow based charging, the embodiments propose adding a QFIContainerCommonInformation 1031 or 1032 (also referred as common set of information 1031 or 1032) in the RoamingQBCInformation 152 per QFI, which is a common part for all QFIContainerInformation containers 521, 522, or 523, 524 of a QFI. In addition, the common set of information 1031 or 1032 may be separated from the set of information 521, 522, or 523, 524.

The following table 4 shows information for the RoamingQBCInformation 152 including the QFIContainerCommonInformation 1031 or 1032, which may be sent from the SMF 110 to the CHF 120. For example, for QFI5, the RoamingQBCInformation 152 may include the QFIContainerCommonInformation 1031, and for QFI6, the RoamingQBCInformation 152 may include the QFIContainerCommonInformation 1032.

Table 4 RoamingQBCInformation

With the message structure 1000 shown in figure 10, by including the QFIContainerCommonInformation 1031 or 1032, which is used as the common set of information for the QFIContainerInfo 521, 522 of the first QFI (QFI=5) or the common set of information for the QFIContainerInfo 523, 524 of the second QFI (QFI=6) , compared with the data structure 500 in Figure 5, the representation of the set of information 521, 522, 523 and 524 may be simplified, i.e., only including the timeofFirstUsage/timeofLastUsage.

In an embodiment, the information defined in the QFIContainerInformation 522 can override the one defined in the QFIContainerCommonInformation 1031. For example, if the location information is different from the one in the QFIContainerCommonInformation 1031, then userLocationInformation (location2) shall be present in the QFIContainerInfo 522. That is, by including a userLocationInformation (location2) 1137 in the set of information 522, the userLocationInformation (location2) 1137 may be used to override the respective information userLocationInformation (location1) in the common set of information 1031.

Figure 12 is a schematic diagram showing still yet another example data structure 1200 of the Charging Data Request message for flow-based charging, according to the embodiments herein.

Compared with Figure 8, in Figure 12, the timeofFirstUsage and timeofLastusage is moved from PDUContainerInfo to the respective UsedUnitContainer information, so that there is no need to include a separate PDUContainerInfo.

The following table 5 shows information for the UsedUnitContainer 141 including the timeofFirstUsage and timeofLastusage, which may be sent from the SMF 110 to the CHF 120.

Table 5 UsedUnitContainer

With the message structure 1200 shown in figure 12, by moving the timeofFirstUsage and timeofLastusage into the UsedUnitContainer 141 (i.e., including the set of information 201, 202, and 203 in the UsedUnitContainer 141) , compared with the data structure 200 in Figure 2, the representation of the set of information 201, 202, and 203 may be simplified; in addition, the message structure 1200 may be simplified by removing the PDUContainerInformation.

Figure 13 is a schematic diagram showing still yet another example data structure 1300 of the Charging Data Request message for QoS Flow based charging, according to the embodiments herein.

Compared with Figure 10, in Figure 13, the timeofFirstUsage, the timeofLastusage, the reportTime and the qFI is moved from QFIContainerInformation to the respective MultipleQFIContainer information, so that there is no need to include a separate QFIContainerInformation.

The following table 6 shows information for the MultipleQFIContainer 151 including the timeofFirstUsage, the timeofLastusage, the reportTime and the qFI, which may be sent from the SMF 110 to the CHF 120.

Table 6 MultipleQFIcontainer

With the message structure 1300 shown in figure 13, by moving the timeofFirstUsage, the timeofLastusage, the reportTime and the qFI into the MultipleQFIContainer 151 (i.e., including the set of information 521, 522, 523, and 524 in the MultipleQFIContainer 151) , compared with the data structure 500 in Figure 5, the representation of the set of information 521, 522, 523, and 524 may be simplified; in addition, the message structure 1300 may be simplified by removing the QFIContainerInformation.

With the embodiments above in Figures 8-13, the common parts of the containers may be included separately, as a result, the more containers including in a N40 message, the saving is more notable.

Figure 14 is a schematic flow chart showing an example method 1400 in the first network function, according to the embodiments herein. In an embodiment, the flow chart in Figure 14 may be implemented in the SMF 110 in Figures 1A.

The method 1400 may begin with step S1401, in which the first network function (such as the SMF 110) may encode a message related to charging.

Then, the method 1400 may proceed to step S1402, in which the first network function (such as the SMF 110) may transmit the message to a second network function 120 (such as the CHF 120) .

As shown in the Figures 3-4, and 6-13, in an embodiment, in addition to a first set of information 201, 521, and a second set of information 202, 522, the message may further include a common set of information 304, 624, 811, 812, 1031, 1032, which may include the common information shared by the first set of information 201, 521 and the second set of information 202, 522.

As shown in the Figures 3-4, and 6-7, in an embodiment, the common set of information 304, 624 may be included in the first set of information 201, 521. In addition, the first set of information 201, 521 may further include a first identifier 305, 625 identifying the common set of information 304, 624.

In addition, as shown in the Figures 3-4, and 6-7, in an embodiment, the second set of information 202, 522 may include a second identifier 306, 626 identifying a reference to the common set of information 304, 624.

As shown in the Figures 4, and 7, in an embodiment, the second set of information 202, 522 further includes a differential set of information 407, 727. The differential set of information 407, 727 may include the difference of the second set of information 202, 522 from the common set of information 304, 624. In addition, the differential set of information 407, 727 may be used to overrides the respective information of the common set of information 304, 624.

As shown in the Figure 4, in an embodiment, the second set of information 202 may further includes a third identifier 408. The third identifier may identify the overridden common set of information by overriding the common set of information 304 with the differential set of information 407.

In addition, as shown in the Figure 4, in an embodiment, the message may further include a third set of information 203. The third set of information 203 may include a fourth identifier 409 for identifying a reference to the overridden common set of information.

As shown in the Figures 8-13, in an embodiment, the common set of information 811, 812, 1031, 1032 may be separated from the first set of information 201, 521 and the second set of information 202, 522. That is, the common set of information 811, 812, 1031, 1032 may be placed out of the first set of information 201, 521 and the second set of information 202, 522.

As shown in the Figures 9 and 11, in an embodiment, the second set of information 202, 522 may include a second differential set of information 917, 1137. The second differential set of information 917, 1137 may include the difference of the second set of information 202, 522 from the common set of information 811, 1031. In addition, in an embodiment, the second differential set of information 917, 1137 may be used to override the respective information of the common set of information.

Although not shown in the Figures 9 and 11, in an embodiment, the first set of information 201, 521 may also include a first differential set of information. The first differential set of information may include the difference of the first set of information 201, 521 from the common set of information. In addition, in an embodiment, the first differential set of information may be used to override the respective information of the common set of information.

As shown in the Figures 8-9 and 12, in an embodiment, the common set of information may be PDUContainerCommonInformation. In addition, as shown in the Figures 10-11 and 13, in an embodiment, the common set of information may be QFIContainerCommonInformation.

As shown in the Figures 2-4, 8-9 and 12, in an embodiment, the first set of information 201 and the second set of information 202 may be information related to the same RG and different service IDs. In another embodiment, the first set of information 201 and the third set of information 203 may also be information related to different RGs and different service IDs.

As shown in the Figures 5-7, 10-11 and 13, in an embodiment, the first set of information 521 and the second set of information 522 may be information related to different QoS flows.

As shown in the Figures 2-4, 8-9 and 12, in an embodiment, the first set of information 201 and the second set of information 202 may be PDUContainerInformation.

As shown in the Figures 5-7, 10-11 and 13, in an embodiment, the first set of information 521 and the second set of information 522 are QFIContainerInformation.

As shown in the Figure 12, in an embodiment, the first set of information 201 and the second set of information 202 may be included in UsedUnitContainer.

As shown in the Figure 13, in an embodiment, the first set of information 521 and the second set of information 522 may be included in MultipleQFIContainer.

As shown in the Figure 1A, the message may be a Charging Data Request message, which may be sent from the SMF 110 to the CHF 120 over N40 interface.

As shown in the Figure 1A, the method may further comprise the step of receiving a Charging Data Response message from the second network function (such as the CHF 120) , although not shown in Figure 14.

The above steps are only examples, and the first network function (such as the SMF 110) may perform any related actions described with respect to Figures 1A-13.

Figure 15 is a schematic flow chart showing an example method 1500 in the second network function, according to the embodiments herein. In an embodiment, the flow chart in Figure 15 may be implemented in the CHF 120 in Figures 1A.

The method 1500 may begin with step S1501, in which the second network function (such as the CHF 120) may receive a message related to charging from a first network function (such as the SMF 110) implementing a SMF.

Then, the method 1500 may proceed to step S1502, in which the second network function (such as the CHF 120) may decode the received message.

As shown in the Figure 1A, the method may further comprise the step of transmit a Charging Data Response message to the first network function (such as the SMF 110) , although not shown in Figure 15.

The above steps are only examples, and the second network function (such as the CHF 120) may perform any related actions described with respect to Figures 1A-13.

Figure 16 is a schematic block diagram showing an example network function 1600, according to the embodiments herein. In an embodiment, the network function 1600 in Figure 16 may be implemented as the SMF 110 or the CHF 120 in Figure 1A.

In an embodiment, the network function 1600 may include at least one processor 1601; and a non-transitory computer readable medium 1602 coupled to the at least one processor 1601. The non-transitory computer readable medium 1602 may store instructions executable by the at least one processor 1601, whereby the at least one processor 1601 is configured to perform the steps in the example methods 1400, 1500 as shown in the schematic flow charts of Figures 14 and 15; the details thereof are omitted here.

Note that, the network function 1600 may be implemented as hardware, software, firmware and any combination thereof. For example, the network function 1600 may include a plurality of units, circuities, modules or the like, each of which may be used to perform one or more steps of the example methods 1400, 1500 or one or more steps shown in Figures 1A-13 related to the first network function (such as the SMF 110) or the second network function (such as the CHF 120) .

It should be understood that, the network function may be implemented either as a network element on a dedicated hardware, as a software instance running on a dedicated hardware, or as a virtualized function instantiated on an appropriate platform, e.g. on a cloud infrastructure.

Figure 17 is a schematic block diagram showing an example computer-implemented apparatus 1700, according to the embodiments herein. In an embodiment, the apparatus 1700 may be configured as the above mentioned apparatus, such as the first network function (such as the SMF 110) , or the second network function (such as the CHF 120) .

In an embodiment, the apparatus 1700 may include but not limited to at least one processor such as Central Processing Unit (CPU) 1701, a computer-readable medium 1702, and a memory 1703. The memory 1703 may comprise a volatile (e.g., Random Access Memory, RAM) and/or non-volatile memory (e.g., a hard disk or flash memory) . In an embodiment, the computer-readable medium 1702 may be configured to store a computer program and/or instructions, which, when executed by the processor 1701, causes the processor 1701 to carry out any of the above mentioned methods.

In an embodiment, the computer-readable medium 1702 (such as non-transitory computer readable medium) may be stored in the memory 1703. In another embodiment, the computer program may be stored in a remote location for example computer program product 1704 (also may be embodied as computer-readable medium) , and accessible by the processor 1701 via for example carrier 1705.

The computer-readable medium 1702 and/or the computer program product 1704 may be distributed and/or stored on a removable computer-readable medium, e.g. diskette, CD (Compact Disk) , DVD (Digital Video Disk) , flash or similar removable memory media (e.g. compact flash, SD (secure digital) , memory stick, mini SD card, MMC multimedia card, smart media) , HD-DVD (High Definition DVD) , or Blu-ray DVD, USB (Universal Serial Bus) based removable memory media, magnetic tape media, optical storage media, magneto-optical media, bubble memory, or distributed as a propagated signal via a network (e.g. Ethernet, ATM, ISDN, PSTN, X. 25, Internet, Local Area Network (LAN) , or similar networks capable of transporting data packets to the infrastructure node) .

Example embodiments are described herein with reference to block diagrams and/or flowchart illustrations of computer-implemented methods, apparatus (systems and/or devices) and/or non-transitory computer program products. It is understood that a block of the block diagrams and/or flowchart illustrations, and combinations of blocks in the block diagrams and/or flowchart illustrations, may be implemented by computer program instructions that are performed by one or more computer circuits. These computer program instructions may be provided to a processor circuit of a general purpose computer circuit, special purpose computer circuit, and/or other programmable data processing circuit to produce a machine, such that the instructions, which execute via the processor of the computer and/or other programmable data processing apparatus, transform and control transistors, values stored in memory locations, and other hardware components within such circuitry to implement the functions/acts specified in the block diagrams and/or flowchart block or blocks, and thereby create means (functionality) and/or structure for implementing the functions/acts specified in the block diagrams and/or flowchart block (s) .

These computer program instructions may also be stored in a tangible computer-readable medium that may direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable medium produce an article of manufacture including instructions which implement the functions/acts specified in the block diagrams and/or flowchart block or blocks. Accordingly, embodiments of present inventive concepts may be embodied in hardware and/or in software (including firmware, resident software, micro-code, etc. ) that runs on a processor such as a digital signal processor, which may collectively be referred to as “circuitry, ” “a module” or variants thereof.

It should also be noted that in some alternate implementations, the functions/acts noted in the blocks may occur out of the order noted in the flowcharts. For example, two blocks shown in succession may in fact be executed substantially concurrently or the blocks may sometimes be executed in the reverse order, depending upon the functionality/acts involved. Moreover, the functionality of a given block of the flowcharts and/or block diagrams may be separated into multiple blocks and/or the functionality of two or more blocks of the flowcharts and/or block diagrams may be at least partially integrated. Finally, other blocks may be added/inserted between the blocks that are illustrated, and/or blocks/operations may be omitted without departing from the scope of inventive concepts. Moreover, although some of the diagrams include arrows on communication paths to show a primary direction of communication, it is to be understood that communication may occur in the opposite direction to the depicted arrows.

Many variations and modifications can be made to the embodiments without substantially departing from the principles of the present inventive concepts. All such variations and modifications are intended to be included herein within the scope of present inventive concepts. Accordingly, the above disclosed subject matter is to be considered illustrative, and not restrictive, and the appended examples of embodiments are intended to cover all such modifications, enhancements, and other embodiments, which fall within the spirit and scope of present inventive concepts. Thus, to the maximum extent allowed by law, the scope of present inventive concepts are to be determined by the broadest permissible interpretation of the present disclosure including the following examples of embodiments and their equivalents, and shall not be restricted or limited by the foregoing detailed description.

Abbreviations

3GPP 3rd Generation Partnership Project

CHF Charging Function

FBC Flow-Based Charging

ID Identifier

PDU Protocol Data Unit

QBC QoS flow-Based Charging

QFI QoS Flow Identifier

QoS Quality of Service

RG Rating Group

SMF Session Management Function

UE User Equipment.

Claims

A method (1400) performed by a first network function (110) implementing a Session Management Function (SMF) , comprising:

- encoding (S1401) a message related to charging; and

- transmitting (S1402) the message to a second network function (120) implementing a Charging Function (CHF) ,

wherein the message includes a first set of information (201, 521) , and a second set of information (202, 522) ; and

wherein the message further includes a common set of information (304, 624, 811, 812, 1031, 1032) including the common information shared by the first set of information (201, 521) and the second set of information (202, 522) .
The method (1400) according to claim 1, wherein the first set of information (201, 521) includes the common set of information (304, 624) and a first identifier (305, 625) identifying the common set of information (304, 624) ; and

wherein the second set of information (202, 522) includes a second identifier (306, 626) identifying a reference to the common set of information (304, 624) .
The method (1400) according to claim 2, wherein the second set of information (202, 522) further includes a differential set of information (407, 727) , which including the difference of the second set of information (202, 522) from the common set of information (304, 624) , and overrides the respective information of the common set of information (304, 624) .
The method (1400) according to claim 3, wherein the second set of information (202) further includes a third identifier (408) , which identifying the overridden common set of information by overriding the common set of information (304) with the differential set of information (407) ;

the message further includes a third set of information (203) , which includes a fourth identifier (409) identifying a reference to the overridden common set of information.
The method (1400) according to claim 1, wherein the common set of information (811, 812, 1031, 1032) is separated from the first set of information (201, 521) and the second set of information (202, 522) .
The method (1400) according to claim 1 or 5, wherein the first set of information (201, 521) includes a first differential set of information, which including the difference of the first set of information (201, 521) from the common set of information, and overrides the respective information of the common set of information; and/or

wherein the second set of information (202, 522) includes a second differential set of information (917, 1137) , which including the difference of the second set of information (202, 522) from the common set of information (811, 1031) , and overrides the respective information of the common set of information (811, 1031) .
The method (1400) according to claim 5 or 6, wherein the common set of information (811, 812, 1031, 1032) is PDUContainerCommonInformation (811, 812) or QFIContainerCommonInformation (1031, 1032) .
The method (1400) according to any one of claims 1-7, wherein the first set of information (201) and the second set of information (202) are information related to the same Rating Group (RG) and different service Identifiers (IDs) or related to different RGs and different service IDs; and/or

wherein the first set of information (521) and the second set of information (522) are information related to different Quality of Service (QoS) flows.
The method (1400) according to any one of claims 1-8, wherein the first set of information (201) and the second set of information (202) are PDUContainerInformation; and/or

wherein the first set of information (521) and the second set of information (522) are QFIContainerInformation.
The method (1400) according to any one of claims 1-8, wherein the first set of information (201) and the second set of information (202) are included in UsedUnitContainer; and/or

wherein the first set of information (521) and the second set of information (522) are included in MultipleQFIContainer.
The method (1400) according to any one of claims 1-10, wherein the message is a Charging Data Request message, which is sent from the SMF (110) to the CHF (120) over N40 interface.
The method (1400) according to any one of claims 1-11, further comprising:

- receiving a Charging Data Response message from the second network function (120) .
A method (1500) performed by a second network function (120) implementing a Charging Function (CHF) , comprising:

- receiving (S1501) a message related to charging from a first network function (110) implementing a Session Management Function (SMF) ; and

- decoding (S1502) the message,

wherein the message includes a first set of information (201, 521) , and a second set of information (202, 522) ; and

wherein the message further includes a common set of information including the common information (304, 624, 811, 812, 1031, 1032) shared by the first set of information (201, 521) and the second set of information (202, 522) .
The method (1500) according to claim 13, wherein the first set of information (201, 521) includes the common set of information (304, 624) and a first identifier (305, 625) identifying the common set of information (304, 624) ; and

wherein the second set of information (202, 522) includes a second identifier (306, 626) identifying a reference to the common set of information (304, 624) .
The method (1400) according to claim 14, wherein the second set of information (202, 522) further includes a differential set of information (407, 727) , which including the difference of the second set of information (202, 522) from the common set of information (304, 624) , and overrides the respective information of the common set of information (304, 624) .
The method (1500) according to claim 15, wherein the second set of information (202) further includes a third identifier (408) , which identifying the overridden common set of information by overriding the common set of information (304) with the differential set of information (407) ;

the message further includes a third set of information (203) , which includes a fourth identifier (409) identifying a reference to the overridden common set of information.
The method (1500) according to claim 13, wherein the common set of information (811, 812, 1031, 1032) is separated from the first set of information (201, 521) and the second set of information (202, 522) .
The method (1500) according to claim 13 or 17, wherein the first set of information (201, 521) includes a first differential set of information, which including the difference of the first set of information (201, 521) from the common set of information, and overrides the respective information of the common set of information; and/or

wherein the second set of information (202, 522) includes a second differential set of information (917, 1137) , which including the difference of the second set of information (202, 522) from the common set of information (811, 1031) , and overrides the respective information of the common set of information (811, 1031) .
The method (1500) according to claim 17 or 18, wherein the common set of information (811, 812, 1031, 1032) is PDUContainerCommonInformation (811, 812) or QFIContainerCommonInformation (1031, 1032) .
The method (1500) according to any one of claims 13-19, wherein the first set of information (201) and the second set of information (202) are information related to the same Rating Group (RG) and different service Identifiers (IDs) or related to different RGs and different service IDs; and/or

wherein the first set of information (521) and the second set of information (522) are information related to different Quality of Service (QoS) flows.
The method (1500) according to any one of claims 13-20, wherein the first set of information (201) and the second set of information (202) are PDUContainerInformation; and/or

wherein the first set of information (521) and the second set of information (522) are QFIContainerInformation.
The method (1500) according to any one of claims 13-20, wherein the first set of information (201) and the second set of information (202) are included in UsedUnitContainer; and/or

wherein the first set of information (521) and the second set of information (522) are included in MultipleQFIContainer.
The method (1500) according to any one of claims 13-22, wherein the message is a Charging Data Request message, which is sent from the SMF (110) to the CHF (120) over N40 interface.
The method (1500) according to any one of claims 13-23, further comprising:

- transmitting a Charging Data Response message to the first network function (120) .
A network function (1600) , comprising:

at least one processor (1601) ; and

a non-transitory computer readable medium (1602) coupled to the at least one processor (1601) , the non-transitory computer readable medium (1602) contains instructions executable by the at least one processor (1601) , whereby the at least one processor (1601) is configured to perform the method (1400, 1500) according to any one of claims 1-24.
A computer readable medium (1602, 1702) comprising computer readable code, which when run on an apparatus (110, 120, 1600, 1700) , causes the apparatus (110, 120, 1600, 1700) to perform the method (1400, 1500) according to any one of claims 1-24.
A computer program product (1704) comprising computer readable code, which when run on an apparatus (110, 120, 1600, 1700) , causes the apparatus (110, 120, 1600, 1700) to perform the method (1400, 1500) according to any one of claims 1-24.