CN108243506B - L TE system service scheduling method and device - Google Patents

L TE system service scheduling method and device Download PDF

Info

Publication number
CN108243506B
CN108243506B CN201611230255.2A CN201611230255A CN108243506B CN 108243506 B CN108243506 B CN 108243506B CN 201611230255 A CN201611230255 A CN 201611230255A CN 108243506 B CN108243506 B CN 108243506B
Authority
CN
China
Prior art keywords
service
scheduling
priority
label
dscp
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
CN201611230255.2A
Other languages
Chinese (zh)
Other versions
CN108243506A (en
Inventor
李宗璋
孔建坤
牛海涛
张振刚
王治国
刘珂
石志同
潘亮
张涛
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
China Mobile Communications Group Co Ltd
China Mobile Group Shandong Co Ltd
Original Assignee
China Mobile Communications Group Co Ltd
China Mobile Group Shandong Co Ltd
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Application filed by China Mobile Communications Group Co Ltd, China Mobile Group Shandong Co Ltd filed Critical China Mobile Communications Group Co Ltd
Priority to CN201611230255.2A priority Critical patent/CN108243506B/en
Publication of CN108243506A publication Critical patent/CN108243506A/en
Application granted granted Critical
Publication of CN108243506B publication Critical patent/CN108243506B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
    • H04W72/542—Allocation or scheduling criteria for wireless resources based on quality criteria using measured or perceived quality
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/12—Wireless traffic scheduling
    • H04W72/1263—Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows
    • H04W72/1273—Mapping of traffic onto schedule, e.g. scheduled allocation or multiplexing of flows of downlink data flows
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/535—Allocation or scheduling criteria for wireless resources based on resource usage policies
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/54—Allocation or scheduling criteria for wireless resources based on quality criteria
    • H04W72/543—Allocation or scheduling criteria for wireless resources based on quality criteria based on requested quality, e.g. QoS
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W72/00—Local resource management
    • H04W72/50—Allocation or scheduling criteria for wireless resources
    • H04W72/56—Allocation or scheduling criteria for wireless resources based on priority criteria
    • H04W72/566—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient
    • H04W72/569—Allocation or scheduling criteria for wireless resources based on priority criteria of the information or information source or recipient of the traffic information
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W88/00—Devices specially adapted for wireless communication networks, e.g. terminals, base stations or access point devices
    • H04W88/08—Access point devices
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/0231—Traffic management, e.g. flow control or congestion control based on communication conditions
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/0289—Congestion control
    • H—ELECTRICITY
    • H04—ELECTRIC COMMUNICATION TECHNIQUE
    • H04W—WIRELESS COMMUNICATION NETWORKS
    • H04W28/00—Network traffic management; Network resource management
    • H04W28/02—Traffic management, e.g. flow control or congestion control
    • H04W28/10—Flow control between communication endpoints

Abstract

The invention relates to a service scheduling method and a device in an L TE system, wherein the method comprises the steps of receiving a service data message corresponding to a target service, wherein the service data message carries a Differentiated Service Code Point (DSCP) label, the DSCP label comprises a label added to the service data message by an upper network element according to the identification result of the target service, analyzing the DSCP label, determining the priority of the data message according to the analysis result of the DSCP label and a pre-established service priority model, and determining scheduling parameters according to the priority of the data message and the pre-established service optimal scheduling model so as to schedule the service data message.

Description

L TE system service scheduling method and device
Technical Field
The present invention relates to the field of communications technologies, and in particular, to a service scheduling method and apparatus in an L TE system.
Background
With the continuous improvement of L TE network construction and the continuous development of mobile internet, video playing, social media, instant messaging, OTT VOIP services, etc. are layered endlessly and rapidly, and different services have different speed requirements.
The eNodeB is a network element for allocating and managing radio resources, and is a key to implement differentiated scheduling of service levels. However, the current scheduling method of the eNodeB base station side does not consider the requirement of service differentiation rate, and currently, the eNodeB mainly adopts methods such as polling scheduling, Max C/I scheduling, PF scheduling, EPF scheduling, and the like.
Although the existing mixed service resource scheduling method can better meet the QoS requirement of the mixed service and reduce the packet loss rate by setting a higher priority for the GBR service class users and setting a corresponding priority according to the level of the requirement of the lowest data transmission rate, the method still stays at the user level and cannot perform differentiated scheduling for different service requirements of the same user.
In another existing service scheduling method in L TE system, bearer service information of a received data stream is detected by a DPI (deep packet Inspection) device disposed in an access network, QoS parameters of each service on each bearer are determined according to the detected bearer service information, and priority queuing and scheduling of the services are performed according to the determined QoS parameters, although differentiated scheduling of services with different application attributes can be implemented, the scheme relies on QCI parameters to identify different services, thereby implementing service differentiated scheduling.
Disclosure of Invention
Aiming at the defect that the existing service scheduling method can not carry out differentiated scheduling aiming at the abundant service types of the existing network, the invention provides the following technical scheme:
one aspect of the present invention provides a service scheduling method in an L TE system, including:
receiving a service data message corresponding to a target service; the service data message carries a Differentiated Services Code Point (DSCP) label; the DSCP label comprises a label added in the service data message by the upper layer network element according to the identification result of the target service;
analyzing the DSCP label, and determining the priority of the data message according to the analysis result of the DSCP label and a pre-established service priority model;
and determining scheduling parameters according to the priority of the data messages and a pre-established optimal service scheduling model so as to schedule the service data messages according to the scheduling parameters.
Optionally, the service priority model is specifically configured to determine a service priority score of the target service according to a service traffic ratio, a service duration ratio, a service guarantee rate, and a service experience weight of the target service, where a calculation formula of the service priority score is as follows:
Figure BDA0001193938620000021
optionally, the analyzing the DSCP label and determining the priority of the data packet according to the analysis result of the DSCP label and a pre-established service priority model include:
and determining the service flow ratio, the service duration ratio, the service guarantee rate and the service experience weight of the target service based on a third-party service platform according to the analysis result of the DSCP label.
Optionally, the scheduling parameter includes any one of the following and a combination thereof:
service scheduling weight, service best-effort guaranteed rate SGBR and service master boot record MBR.
Optionally, the method includes establishing the service optimal scheduling model according to the following steps:
determining a single-user guaranteed rate based on the current network service ratio, each service guaranteed rate and the service triggering ratio;
estimating the full load rate of a cell according to the current network average Channel Quality Indicator (CQI) information, and determining the ideal number of users of the cell according to the single-user guaranteed rate and the full load rate of the cell;
determining whether the cell is congested according to the ideal user number and the activated user number of the cell so as to determine a speed limit control strategy;
and establishing the optimal service scheduling model according to different speed limit control strategies.
Optionally, the upper network element comprises a universal media gateway UGW.
On the other hand, the present invention also provides a service scheduling apparatus in L TE system, including:
a message receiving unit, configured to receive a service data message corresponding to a target service; the service data message carries a Differentiated Services Code Point (DSCP) label; the DSCP label comprises a label added in the service data message by the upper layer network element according to the identification result of the target service;
a priority determining unit, configured to analyze the DSCP label, and determine a priority of the data packet according to an analysis result of the DSCP label and a pre-established service priority model;
and the service scheduling unit is used for determining scheduling parameters according to the priority of the data message and a pre-established service optimal scheduling model so as to schedule the service data message according to the scheduling parameters.
Optionally, the service priority model is specifically configured to determine a service priority score of the target service according to a service traffic ratio, a service duration ratio, a service guarantee rate, and a service experience weight of the target service, where a calculation formula of the service priority score is as follows:
Figure BDA0001193938620000031
optionally, the priority determining unit is specifically configured to determine, based on a third-party service platform, a service traffic ratio, a service duration ratio, a service guarantee rate, and a service experience weight of the target service according to the analysis result of the DSCP label.
Optionally, the scheduling parameter includes any one of the following and a combination thereof:
service scheduling weight, service best-effort guaranteed rate SGBR and service master boot record MBR.
According to the service scheduling method and device in the L TE system, the service data message which is corresponding to the target service and carries the DSCP label of the differentiated service code point is received, the DSCP label is analyzed, the priority of the data message is determined according to the analysis result of the DSCP label and the pre-established service priority model, the scheduling parameter is determined according to the priority of the data message and the pre-established service optimal scheduling model, the service data message is scheduled according to the scheduling parameter, the core network scheduling strategy can be not depended on, the service priority identification is realized by adopting the DSCP label, compared with the traditional QCI grade, the service can be distinguished, the matching and the butt joint with the upper network element are facilitated, the feasibility and the landing performance of the scheme can be improved, the service level differentiated scheduling can be realized efficiently, and the change of the existing network is small, so that the rapid and smooth evolution can be really realized.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings used in the description of the embodiments or the prior art will be briefly introduced below, and it is obvious that the drawings in the following description are some embodiments of the present invention, and for those skilled in the art, other drawings can be obtained according to these drawings without creative efforts.
Fig. 1 is a schematic flow chart of a service scheduling method in an L TE system according to an embodiment of the present invention;
FIG. 2 is a diagram of a protocol stack of network devices according to an embodiment of the present invention;
fig. 3 is a schematic flow chart of establishing a service optimal scheduling model according to an embodiment of the present invention;
FIG. 4 is a schematic diagram of traffic rate over time according to one embodiment of the present invention;
fig. 5 is a schematic structural diagram of a service scheduling apparatus in an L TE system according to an embodiment of the present invention;
fig. 6 is a schematic structural diagram of an electronic device for implementing the service scheduling method in the L TE system according to an embodiment of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some embodiments, but not all embodiments, of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
Fig. 1 is a schematic flow chart of a service scheduling method in an L TE system according to an embodiment of the present invention, as shown in fig. 1, the method includes:
s101: receiving a service data message corresponding to a target service; the service data message carries a Differentiated Services Code Point (DSCP) label; the DSCP label comprises a label added in the service data message by the upper layer network element according to the identification result of the target service;
specifically, an eNodeB receives a service data packet corresponding to a target service, where the service data packet carries a DSCP label, and the DSCP label is a label added by an upper network element in the service data packet according to an identification result of the target service and used for distinguishing priorities of different services.
For example, an upper layer network element (e.g., a universal media gateway (UGW)) identifies the target service by a DPI mode, adds a DSCP tag to an IP header of a data packet corresponding to the target service, and sends the data packet with the DSCP added thereto to an eNodeB, so that the eNodeB receives the data packet.
The dpi (deep Packet inspection) is called "deep Packet inspection", and the "deep" is a method that, compared with a common Packet analysis layer, only analyzes the contents below layer 4 of an IP Packet, including a source address, a destination address, a source port, a destination port, and a protocol type. Besides the previous hierarchical analysis, the DPI also adds application layer analysis to identify various applications and their contents. Currently, UGW and some third-party devices already have the capability of deeply analyzing protocol information of application layer packets and performing service identification and statistics according to traffic characteristics.
It is understood that the DSCP Differentiated Services Code Point, i.e. Differentiated Services Code Point, IETF issued Diff-serv (Differentiated service) QoS classification criteria in 12 months of 1998. The purpose of DSCP design is to guarantee QoS of communication, i.e. to encode 8 bits in the packet IP header to classify service classes (see fig. 2) and prioritize services. The DSCP in the step uses 6 bits of the 8 bits, namely the value range of the DSCP is 0-63, so that 64 classes of services can be classified at most.
S102: analyzing the DSCP label, and determining the priority of the data message according to the analysis result of the DSCP label and a pre-established service priority model;
specifically, the eNodeB analyzes the DSCP label carried by the data packet according to the received data packet, so as to determine the priority of the data packet according to the analysis result of the DSCP label and a pre-established service priority model.
As an optional implementation manner of this embodiment, the service priority model may be specifically configured to determine a service priority score of the target service according to a service traffic ratio, a service duration ratio, a service guarantee rate, and a service experience weight of the target service, where a calculation formula of the service priority score is as follows:
Figure BDA0001193938620000061
it should be noted that the service traffic ratio, the service duration ratio, the service guarantee rate, and the service experience weight of the target service for determining the service priority score of the target service may be obtained through a third-party service platform, such as SEQ, and the like, which is not limited in the present invention.
It can be understood that, although the existing service scheduling scheme makes specifications for the DSCP rules of the service classes and divides the DSCP of the service classes to avoid the possibility of mutual conflict, the 2/3/4G internet services DSCP are all marked as 18, and the difference requirements between different services are not considered. Based on this, in this embodiment, the DSCP label of the 2/3/4G internet service is divided into one segment, for example, the DSCP label value segment is set to 15 to 25, so as to meet the service requirement.
S103: and determining scheduling parameters according to the priority of the data messages and a pre-established optimal service scheduling model so as to schedule the service data messages according to the scheduling parameters.
Specifically, the eNodeB determines a scheduling parameter according to the determined priority of the data packet and a pre-established optimal service scheduling model, so as to schedule the service data packet according to the scheduling parameter.
It can be understood that L TE traffic models in different time periods, different regions and different scenes of the existing network are different, and in order to ensure differentiated scheduling of service levels, a service optimal scheduling model needs to be established.
Further, fig. 3 shows a process of establishing a service optimal scheduling model according to an embodiment of the present invention, and as shown in fig. 3, step S103 may further include establishing the service optimal scheduling model according to the following steps:
s031: determining a single-user guaranteed rate based on the current network service ratio, each service guaranteed rate and the service triggering ratio;
specifically, the eNodeB obtains the service trigger ratio in unit time according to the obtained service duration and the number of users of the current network, and then determines the single-user guaranteed rate according to the service guaranteed rate and the current network service ratio.
S032: estimating the full load rate of a cell according to the current network average Channel Quality Indicator (CQI) information, and determining the ideal number of users of the cell according to the single-user guaranteed rate and the full load rate of the cell;
for example, the eNodeB may evaluate a cell full rate by establishing a CQI & full throughput curve, and then determine an ideal number of users of a cell according to the determined single user guaranteed rate and the cell full rate.
S033: determining whether the cell is congested according to the ideal user number and the activated user number of the cell so as to determine a speed limit control strategy;
specifically, the determining, by the eNode, whether the cell is congested according to the ideal user number of the cell and the activated user number of the cell, so as to determine the speed limit control policy includes: and obtaining the number of ideal users which can ensure service perception in the evaluation cell, comparing the number of the ideal users with the number of the cell activation users to determine whether speed limit strategy control is necessary, and performing speed limit strategy control according to a preset speed limit control strategy.
S034: and establishing the optimal service scheduling model according to different speed limit control strategies.
It can be understood that the eNode establishes different security models according to different speed limit control strategies corresponding to different congestion conditions to adapt to various scenes of the existing network.
The service scheduling method in the L TE system of this embodiment implements service priority identification by using the DSCP label, may not rely on the core network scheduling policy, and compared with the conventional QCI class, the service scheduling method has more distinguishable services, is convenient for matching and docking with the upper network element, may improve the feasibility and the landing performance of the scheme, and may implement service level differentiated scheduling with high efficiency, and may actually implement fast and smooth evolution because the change to the existing network is small.
Further, as an optional implementation manner of the foregoing method embodiment, the scheduling parameter may include any one of the following items and a combination thereof:
service scheduling weight, service best-effort guaranteed rate SGBR and service master boot record MBR.
It should be noted that, in this embodiment, the service priority is added on the basis of the scheduling model of the EPF scheduling scheme, and the calculation formula of the service scheduling weight is as follows:
Figure BDA0001193938620000081
in the formula, eff is the current channel quality of the UE, Alpha is a capacity adjustment factor of a scheduling algorithm, r is the historical transmission rate of the UE, and Y isOCIThe weighting of the scheduling priority corresponding to the QCI level of the service (determined by the parameter standardqci. ullchpriority factor, i.e., the greater the weighting factor configuration value, the higher the scheduling priority).
Particularly, Yservice in the formula (2) is a weighting factor for accelerating the service, which can be adjusted according to the service scheduling requirement, and the rate perception of the VIP user can be ensured by setting the scheduling weighting factor at the base station side.
The method for obtaining the parameter standardqci.ullchpriorityfactor may adopt the conventional technical method and means according to actual needs, and the present invention is not limited thereto.
Further, the method for determining the service SGBR is as follows:
a downlink scheduling module in the eNodeB queries the configured service scheduling QOS configuration through the DSCP label, acquires the guaranteed rate of the service, adjusts the scheduling factor through the difference between the real rate and the guaranteed rate of the video user, and promotes the scheduling priority of the bearer.
It should be noted that, the above method for acquiring the real rate of the video user may adopt the existing technical method and means according to actual needs, and the present invention is not limited to this.
Specifically, the method comprises the following steps:
if the real rate of the video user is smaller than the service SGBR, the scheduling priority of the user needs to be improved;
when the resources are enough, the video rate is guaranteed to reach the SGBR as far as possible, and when the video rate exceeds the SGBR through speed regulation, the scheduling priority is reduced to enable the video rate to be kept at the SGBR level.
If the rate of the video user > is the service SGBR, no processing is required.
Meanwhile, for services such as online video, the initial buffering rate is required to be higher than the rate in the playing stage, multiple SGBRs may be set, for example, a large SGBR1 may be set, and after the duration (initial acceleration time) T, the guaranteed rate SGBR2 (see fig. 4) normally required by the video service is recovered.
Further, the downlink scheduling module in the eNodeB compares the actual service rate with the MBR, and when the actual service rate is greater than the MBR, the speed is limited, otherwise, no processing is required.
Fig. 5 is a schematic structural diagram of a service scheduling apparatus in L TE system according to an embodiment of the present invention, as shown in fig. 5, the apparatus includes a message receiving unit 21, a priority determining unit 22, and a service scheduling unit 23, where:
the message receiving unit 21 is configured to receive a service data message corresponding to a target service; the service data message carries a Differentiated Services Code Point (DSCP) label; the DSCP label comprises a label added in the service data message by the upper layer network element according to the identification result of the target service;
the priority determining unit 22 is configured to analyze the DSCP label, and determine a priority of the data packet according to an analysis result of the DSCP label and a pre-established service priority model;
as an optional implementation manner of this embodiment, the service priority model may be specifically configured to determine a service priority score of the target service according to a service traffic ratio, a service duration ratio, a service guarantee rate, and a service experience weight of the target service, where a calculation formula of the service priority score is as follows:
Figure BDA0001193938620000101
the service scheduling unit 23 is configured to set a scheduling parameter according to the priority of the data packet, so as to schedule the service data packet according to the scheduling parameter and a pre-established service optimal scheduling model.
Specifically, the process of the service scheduling device in the L TE system of this embodiment for performing service scheduling in the L TE system includes that the message receiving unit 21 receives a service data message corresponding to a target service, where the service data message carries a DSCP label, the DSCP label includes a label added to the service data message by an upper network element according to an identification result of the target service, and then the priority determining unit 22 parses the DSCP label, and determines a priority of the data message according to the parsing result of the DSCP label and a pre-established service priority model, and then the service scheduling unit 23 sets a scheduling parameter according to the priority of the data message, so as to schedule the service data message according to the scheduling parameter and a pre-established service optimal scheduling model.
The service scheduling apparatus in the L TE system of this embodiment implements service priority identification by using the DSCP label, and may not rely on a core network scheduling policy, and compared with the conventional QCI class, the service scheduling apparatus has more distinguishable services, and is convenient for matching and docking with an upper network element, and may improve feasibility and landability of a scheme, and may implement service level differentiated scheduling with high efficiency.
Further, as an optional implementation manner of the foregoing apparatus embodiment, the priority determining unit 22 may be specifically configured to determine, based on a third-party service platform, a service traffic ratio, a service duration ratio, a service guarantee rate, and a service experience weight of the target service according to an analysis result of the DSCP label.
As an optional implementation manner of the foregoing embodiment, the scheduling parameter may include any one of the following items and a combination thereof:
service scheduling weight, service best-effort guaranteed rate SGBR and service master boot record MBR.
The service scheduling apparatus in the L TE system according to this embodiment may be used to execute the service scheduling method embodiment in the L TE system, and the principle and technical effect are similar, which are not described herein again.
It should be noted that, for the device embodiment, since it is basically similar to the method embodiment, the description is relatively simple, and for the relevant points, reference may be made to part of the description of the method embodiment.
Fig. 6 is a schematic structural diagram of an electronic device for implementing L TE service scheduling method in the system according to an embodiment of the present invention, as shown in fig. 6, the electronic device includes a processor (processor)31, a bus 32 and a memory (memory)33, where the processor (processor)31 and the memory 33 complete communication with each other through the bus 32, the processor 31 may call a program instruction in the memory 33 to execute the following method:
receiving a service data message corresponding to a target service; the service data message carries a Differentiated Services Code Point (DSCP) label; the DSCP label comprises a label added in the service data message by the upper layer network element according to the identification result of the target service;
analyzing the DSCP label, and determining the priority of the data message according to the analysis result of the DSCP label and a pre-established service priority model;
and determining scheduling parameters according to the priority of the data messages and a pre-established optimal service scheduling model so as to schedule the service data messages according to the scheduling parameters.
The present embodiment discloses a computer program product comprising a computer program stored on a non-transitory computer readable storage medium, the computer program comprising program instructions which, when executed by a computer, enable the computer to perform the method provided by the above-mentioned method embodiments, for example, comprising:
receiving a service data message corresponding to a target service; the service data message carries a Differentiated Services Code Point (DSCP) label; the DSCP label comprises a label added in the service data message by the upper layer network element according to the identification result of the target service;
analyzing the DSCP label, and determining the priority of the data message according to the analysis result of the DSCP label and a pre-established service priority model;
and determining scheduling parameters according to the priority of the data messages and a pre-established optimal service scheduling model so as to schedule the service data messages according to the scheduling parameters.
The present embodiments provide a non-transitory computer-readable storage medium storing computer instructions that cause the computer to perform the methods provided by the above method embodiments, for example, including:
receiving a service data message corresponding to a target service; the service data message carries a Differentiated Services Code Point (DSCP) label; the DSCP label comprises a label added in the service data message by the upper layer network element according to the identification result of the target service;
analyzing the DSCP label, and determining the priority of the data message according to the analysis result of the DSCP label and a pre-established service priority model;
and determining scheduling parameters according to the priority of the data messages and a pre-established optimal service scheduling model so as to schedule the service data messages according to the scheduling parameters.
The invention realizes the service priority identification through the DSCP, compared with QCI grade, the distinguishable service is more, and the matching and the butt joint with the upper network element are more convenient, the feasibility and the landing performance of the scheme and the requirements on other network elements are provided based on the present network scheme and the service development of China Mobile, compared with the present scheme, the invention has obvious advantages, the service level differential scheduling can be realized efficiently, the actual conditions of the present scheme and the current L TE network development are fully considered, the change on the present network is smaller, and the rapid and smooth evolution is really realized.
Those of ordinary skill in the art will understand that: all or part of the steps for implementing the method embodiments may be implemented by hardware related to program instructions, and the program may be stored in a computer readable storage medium, and when executed, the program performs the steps including the method embodiments; and the aforementioned storage medium includes: various media that can store program codes, such as ROM, RAM, magnetic or optical disks.
The above-described embodiments are merely illustrative, and the units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the modules may be selected according to actual needs to achieve the purpose of the solution of the present embodiment. One of ordinary skill in the art can understand and implement it without inventive effort.
Through the above description of the embodiments, those skilled in the art will clearly understand that each embodiment can be implemented by software plus a necessary general hardware platform, and certainly can also be implemented by hardware. With this understanding in mind, the above-described technical solutions may be embodied in the form of a software product, which can be stored in a computer-readable storage medium such as ROM/RAM, magnetic disk, optical disk, etc., and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device, etc.) to execute the methods described in the embodiments or some parts of the embodiments.
Finally, it should be noted that: the above embodiments are only used for illustrating the technical solutions of the embodiments of the present invention, and are not limited thereto; although embodiments of the present invention have been described in detail with reference to the foregoing embodiments, those skilled in the art will understand that: the technical solutions described in the foregoing embodiments may still be modified, or some or all of the technical features may be equivalently replaced; and the modifications or the substitutions do not make the essence of the corresponding technical solutions depart from the scope of the technical solutions of the embodiments of the present invention.

Claims (9)

1. A traffic scheduling method executed by eNodeB side in L TE system, comprising:
receiving a service data message corresponding to a target service; the service data message carries a Differentiated Services Code Point (DSCP) label; the DSCP label comprises a label added in the service data message by the upper layer network element according to the identification result of the target service;
analyzing the DSCP label, and determining the priority of the data message according to the analysis result of the DSCP label and a pre-established service priority model;
determining scheduling parameters according to the priority of the data messages and a pre-established optimal service scheduling model so as to schedule the service data messages according to the scheduling parameters;
the method comprises the following steps of establishing the optimal service scheduling model:
determining a single-user guaranteed rate based on the current network service ratio, each service guaranteed rate and the service triggering ratio;
estimating the full load rate of a cell according to the current network average Channel Quality Indicator (CQI) information, and determining the ideal number of users of the cell according to the single-user guaranteed rate and the full load rate of the cell;
determining whether the cell is congested according to the ideal user number and the activated user number of the cell so as to determine a speed limit control strategy;
and establishing the optimal service scheduling model according to different speed limit control strategies.
2. The method according to claim 1, wherein the service priority model is specifically configured to determine a service priority score of the target service according to a service traffic ratio, a service duration ratio, a service guarantee rate, and a service experience weight of the target service, and a calculation formula of the service priority score is as follows:
Figure FDA0002399330490000011
3. the method of claim 2, wherein the parsing the DSCP label and determining the priority of the data packet according to the parsing result of the DSCP label and a pre-established service priority model comprises:
and determining the service flow ratio, the service duration ratio, the service guarantee rate and the service experience weight of the target service based on a third-party service platform according to the analysis result of the DSCP label.
4. The method of claim 1, wherein the scheduling parameter comprises any one of the following and combinations thereof:
service scheduling weight, service best-effort guaranteed rate SGBR and service master boot record MBR.
5. The method of claim 1, wherein the upper network element comprises a universal media gateway (UGW).
6. An apparatus for scheduling traffic configured on an eNB side in an L TE system, comprising:
a message receiving unit, configured to receive a service data message corresponding to a target service; the service data message carries a Differentiated Services Code Point (DSCP) label; the DSCP label comprises a label added in the service data message by the upper layer network element according to the identification result of the target service;
a priority determining unit, configured to analyze the DSCP label, and determine a priority of the data packet according to an analysis result of the DSCP label and a pre-established service priority model;
the service scheduling unit is used for determining scheduling parameters according to the priority of the data messages and a pre-established service optimal scheduling model so as to schedule the service data messages according to the scheduling parameters;
wherein the apparatus further comprises an establishing module configured to:
determining a single-user guaranteed rate based on the current network service ratio, each service guaranteed rate and the service triggering ratio;
estimating the full load rate of a cell according to the current network average Channel Quality Indicator (CQI) information, and determining the ideal number of users of the cell according to the single-user guaranteed rate and the full load rate of the cell;
determining whether the cell is congested according to the ideal user number and the activated user number of the cell so as to determine a speed limit control strategy;
and establishing the optimal service scheduling model according to different speed limit control strategies.
7. The apparatus according to claim 6, wherein the service priority model is specifically configured to determine a service priority score of the target service according to a service traffic ratio, a service duration ratio, a service guarantee rate, and a service experience weight of the target service, and a calculation formula of the service priority score is as follows:
Figure FDA0002399330490000031
8. the apparatus of claim 7, wherein the priority determining unit is specifically configured to determine, according to the parsing result of the DSCP tag, a service traffic ratio, a service duration ratio, a service guarantee rate, and a service experience weight of the target service based on a third-party service platform.
9. The apparatus of claim 6, wherein the scheduling parameter comprises any one of the following and combinations thereof:
service scheduling weight, service best-effort guaranteed rate SGBR and service master boot record MBR.
CN201611230255.2A 2016-12-27 2016-12-27 L TE system service scheduling method and device Active CN108243506B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201611230255.2A CN108243506B (en) 2016-12-27 2016-12-27 L TE system service scheduling method and device

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201611230255.2A CN108243506B (en) 2016-12-27 2016-12-27 L TE system service scheduling method and device

Publications (2)

Publication Number Publication Date
CN108243506A CN108243506A (en) 2018-07-03
CN108243506B true CN108243506B (en) 2020-07-21

Family

ID=62701716

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201611230255.2A Active CN108243506B (en) 2016-12-27 2016-12-27 L TE system service scheduling method and device

Country Status (1)

Country Link
CN (1) CN108243506B (en)

Families Citing this family (4)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN111278111B (en) * 2018-12-05 2023-04-28 中国移动通信集团浙江有限公司 Service scene-based network resource differentiated scheduling method and device
CN110290554A (en) * 2019-06-28 2019-09-27 京信通信系统（中国）有限公司 Data transmission processing method, device and communication equipment
CN112202589B (en) * 2019-07-08 2023-04-07 中国移动通信集团浙江有限公司 Network service management and control method and system
CN114338425B (en) * 2021-12-31 2023-09-19 中国联合网络通信集团有限公司 Network planning method, device and storage medium

Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102075984A (en) * 2010-12-31 2011-05-25 北京邮电大学 System and method for optimizing video service transmission of wireless local area network

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102264145B (en) * 2010-05-31 2014-12-31 中国移动通信集团公司 Service scheduling method, device and system
CN102378382B (en) * 2010-08-10 2015-05-27 华为技术有限公司 Method, equipment and system for scheduling data streams
CN101958844A (en) * 2010-11-02 2011-01-26 南京邮电大学 Active queue scheduling method based on QoS (Quality of Service) in differentiated service network
CN103442391A (en) * 2013-09-12 2013-12-11 华为终端有限公司 Data transmission method and system as well as user terminal
CN104661259A (en) * 2013-11-20 2015-05-27 华为技术有限公司 Transmission treatment method, device and system in wireless backhaul link

Patent Citations (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN102075984A (en) * 2010-12-31 2011-05-25 北京邮电大学 System and method for optimizing video service transmission of wireless local area network

Also Published As

Publication number Publication date
CN108243506A (en) 2018-07-03

Similar Documents

Publication Publication Date Title
EP3446464B1 (en) Systems and method for quality of service monitoring, policy enforcement, and charging in communications network
US8767553B2 (en) Dynamic resource partitioning for long-term fairness to non-elastic traffic on a cellular basestation
US8611217B2 (en) Subscriber/service differentiation in advanced wireless networks
EP2859697B1 (en) Communication network congestion control using allocation and retention priority
CN108243506B (en) L TE system service scheduling method and device
CN104918283B (en) A kind of jamming control method and equipment
EP2374246B1 (en) Admission control systems and methods
Jung et al. Intelligent active queue management for stabilized QoS guarantees in 5G mobile networks
CN102037688A (en) Partitioning entity and method for partitioning capacity
US9642156B2 (en) Transmitting radio node and method therein for scheduling service data flows
Iturralde et al. Resource allocation using Shapley value in LTE networks
US20160164791A1 (en) Method and network node for congestion management in a wireless communications network
CN112543508A (en) Wireless resource allocation method and network architecture for 5G network slice
US11540164B2 (en) Data packet prioritization for downlink transmission at sender level
EP2663037A1 (en) Multi-level Bearer Profiling in Transport Networks
WO2014173466A1 (en) Method for operating a wireless network and a wireless network
Trabelsi et al. Performance evaluation of a decoupled-level with QoS-aware downlink scheduling algorithm for LTE networks
CN110461042B (en) Self-adaptive method and device for scheduling algorithm
Astudillo et al. LTE time-domain uplink scheduler for QoS provisioning
Kumar et al. A three level LTE downlink scheduling framework for RT VBR traffic
CN107135170B (en) High-quality QoS (quality of service) guarantee method for content-centric network
CN107155220B (en) Resource scheduling method and device
Khan et al. QoE-based video delivery over LTE hierarchical architecture
Carvalho et al. Performance analysis of multi-service wireless network: An approach integrating CAC, scheduling, and buffer management
Hsu et al. Cross layer design and analysis of multiuser wireless video streaming over 802.11 e EDCA

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