CN112199174A - Message sending control method and device, electronic equipment and computer readable storage medium - Google Patents

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

Info

Publication number
CN112199174A
CN112199174A CN202011060102.4A CN202011060102A CN112199174A CN 112199174 A CN112199174 A CN 112199174A CN 202011060102 A CN202011060102 A CN 202011060102A CN 112199174 A CN112199174 A CN 112199174A
Authority
CN
China
Prior art keywords
sent
message
priority
messages
determining
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.)
Pending
Application number
CN202011060102.4A
Other languages
Chinese (zh)
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.)
Beijing ByteDance Network Technology Co Ltd
Original Assignee
Beijing ByteDance Network Technology 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 Beijing ByteDance Network Technology Co Ltd filed Critical Beijing ByteDance Network Technology Co Ltd
Priority to CN202011060102.4A priority Critical patent/CN112199174A/en
Publication of CN112199174A publication Critical patent/CN112199174A/en
Priority to PCT/CN2021/115015 priority patent/WO2022068488A1/en
Pending legal-status Critical Current

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/54Interprogram communication
    • G06F9/546Message passing systems or structures, e.g. queues
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F9/00Arrangements for program control, e.g. control units
    • G06F9/06Arrangements for program control, e.g. control units using stored programs, i.e. using an internal store of processing equipment to receive or retain programs
    • G06F9/46Multiprogramming arrangements
    • G06F9/48Program initiating; Program switching, e.g. by interrupt
    • G06F9/4806Task transfer initiation or dispatching
    • G06F9/4843Task transfer initiation or dispatching by program, e.g. task dispatcher, supervisor, operating system
    • G06F9/4881Scheduling strategies for dispatcher, e.g. round robin, multi-level priority queues

Landscapes

  • Engineering & Computer Science (AREA)
  • Software Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Transfer Between Computers (AREA)

Abstract

The embodiment of the disclosure discloses a message sending control method and device, electronic equipment and a computer readable storage medium. The message sending control method comprises the following steps: acquiring a message to be sent; determining the priority of the message to be sent; determining a first number, wherein the first number is the number of messages of the priority that have been sent before the message to be sent is sent; and discarding the message to be sent when the first number is greater than or equal to a number threshold corresponding to the priority. The method determines whether to send the message or not through the quantity threshold corresponding to the priority of the message, and solves the technical problem of message backlog caused by slow processing speed of the terminal.

Description

Message sending control method and device, electronic equipment and computer readable storage medium
Technical Field
The present disclosure relates to the field of message processing, and in particular, to a method and an apparatus for controlling message sending, an electronic device, and a computer-readable storage medium.
Background
With the rapid development of information technology, the mobile internet technology has also advanced dramatically. Whether the emergence of intelligent devices or the arrival of the 5G era or the application of technologies such as big data, AI intelligence and algorithms, flying wings are inserted into the electronic mobile devices. In real life, the social communication is diversified due to the technologies, especially, the smart phone breaks through the space-time limitation of the daily communication of human beings, is a comprehensive handheld mobile device really integrating massive information, network audio-visual, leisure and entertainment and the like, and meets the daily information demand and the social communication of people.
At present, a plurality of platforms provide live broadcast services, the number of people in a live broadcast room may vary from several people to hundreds of thousands of people, the interaction frequency of audiences is very high, hundreds of interactive messages may be generated every second, the processing capacity of a client is limited, if the messages are issued too fast and the processing speed of the client is too slow, the messages are overstocked, and the client may be crashed.
Disclosure of Invention
This summary is provided to introduce a selection of concepts in a simplified form that are further described below in the detailed description. This summary is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.
In order to solve the above technical problem, the embodiments of the present disclosure propose the following technical solutions.
In a first aspect, an embodiment of the present disclosure provides a method for controlling message sending, including:
acquiring a message to be sent;
determining the priority of the message to be sent;
determining a first number, wherein the first number is the number of messages of the priority that have been sent before the message to be sent is sent;
and discarding the message to be sent when the first number is greater than or equal to a number threshold corresponding to the priority.
In a second aspect, an embodiment of the present disclosure provides a message transmission control apparatus, including:
the message to be sent acquiring module is used for acquiring a message to be sent;
a priority determining module, configured to determine a priority of the message to be sent;
a first number determining module, configured to determine a first number, where the first number is a number of messages of the priority that have been sent before the message to be sent is sent;
a control module, configured to discard the message to be sent when the first number is greater than or equal to a number threshold corresponding to the priority.
In a third aspect, an embodiment of the present disclosure provides an electronic device, including: at least one processor; and the number of the first and second groups,
a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of any one of the preceding first aspects.
In a fourth aspect, the present disclosure provides a non-transitory computer-readable storage medium, wherein the non-transitory computer-readable storage medium stores computer instructions for causing a computer to perform the method of any one of the foregoing first aspects.
The embodiment of the disclosure discloses a message sending control method and device, electronic equipment and a computer readable storage medium. The message sending control method comprises the following steps: acquiring a message to be sent; determining the priority of the message to be sent; determining a first number, wherein the first number is the number of messages of the priority that have been sent before the message to be sent is sent; and discarding the message to be sent when the first number is greater than or equal to a number threshold corresponding to the priority. . The method determines whether to send the message or not through the quantity threshold corresponding to the priority of the message, and solves the technical problem of message backlog caused by slow processing speed of the terminal.
The foregoing is a summary of the present disclosure, and for the purposes of promoting a clear understanding of the technical means of the present disclosure, the present disclosure may be embodied in other specific forms without departing from the spirit or essential attributes thereof.
Drawings
The above and other features, advantages and aspects of various embodiments of the present disclosure will become more apparent by referring to the following detailed description when taken in conjunction with the accompanying drawings. Throughout the drawings, the same or similar reference numbers refer to the same or similar elements. It should be understood that the drawings are schematic and that elements and features are not necessarily drawn to scale.
Fig. 1 is a schematic flowchart of a message transmission control method according to an embodiment of the present disclosure;
fig. 2 is a schematic flow chart illustrating a process of determining a priority of a message to be sent in a message sending control method according to an embodiment of the present disclosure;
fig. 3 is a schematic diagram illustrating an example of determining a first number in a message transmission control method according to an embodiment of the present disclosure;
fig. 4 is a schematic flowchart illustrating a counter starting in a message sending control method according to an embodiment of the disclosure;
fig. 5 is a schematic diagram of a usage manner of a counter in a message sending control method provided by an embodiment of the present disclosure;
fig. 6 is an application scenario diagram of a message sending control method according to an embodiment of the present disclosure.
Fig. 7 is a schematic structural diagram of an embodiment of a control apparatus for message transmission according to an embodiment of the present disclosure;
fig. 8 is a schematic structural diagram of an electronic device provided according to an embodiment of the present disclosure.
Detailed Description
Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While certain embodiments of the present disclosure are shown in the drawings, it is to be understood that the present disclosure may be embodied in various forms and should not be construed as limited to the embodiments set forth herein, but rather are provided for a more thorough and complete understanding of the present disclosure. It should be understood that the drawings and embodiments of the disclosure are for illustration purposes only and are not intended to limit the scope of the disclosure.
It should be understood that the various steps recited in the method embodiments of the present disclosure may be performed in a different order, and/or performed in parallel. Moreover, method embodiments may include additional steps and/or omit performing the illustrated steps. The scope of the present disclosure is not limited in this respect.
The term "include" and variations thereof as used herein are open-ended, i.e., "including but not limited to". The term "based on" is "based, at least in part, on". The term "one embodiment" means "at least one embodiment"; the term "another embodiment" means "at least one additional embodiment"; the term "some embodiments" means "at least some embodiments". Relevant definitions for other terms will be given in the following description.
It should be noted that the terms "first", "second", and the like in the present disclosure are only used for distinguishing different devices, modules or units, and are not used for limiting the order or interdependence relationship of the functions performed by the devices, modules or units.
It is noted that references to "a", "an", and "the" modifications in this disclosure are intended to be illustrative rather than limiting, and that those skilled in the art will recognize that "one or more" may be used unless the context clearly dictates otherwise.
The names of messages or information exchanged between devices in the embodiments of the present disclosure are for illustrative purposes only, and are not intended to limit the scope of the messages or information.
Fig. 1 is a flowchart of an embodiment of a method for controlling message sending provided by an embodiment of the present disclosure, where the method for controlling message sending provided by this embodiment may be executed by a message sending control device, the message sending control device may be implemented as software, or implemented as a combination of software and hardware, and the message sending control device may be integrally disposed in some device in a message sending control system, such as a message sending control server or a message sending control terminal device. As shown in fig. 1, the method comprises the steps of:
step S101, obtaining a message to be sent;
optionally, the message to be sent is a message generated by a message sending device or a message to be forwarded and received by the server from the terminal device. Illustratively, in a live broadcast scene, a plurality of terminal devices located in the same live broadcast room send messages to a server providing live broadcast services, and then the plurality of terminals pull all messages of a previous time period from the server at regular time, and after receiving a pull instruction, the server sends the messages cached in the previous time period to a terminal corresponding to the pull instruction.
Illustratively, the message to be sent is cached in the server, the terminal device sends a pull request of the message once per unit time, and after receiving the pull request, the server takes out the messages cached in the last unit time from the cache one by one. Wherein each of the buffered messages is the message to be sent in the step. Optionally, the message to be sent is cached in a queue, and when the server obtains the message to be sent, the server takes out one message to be sent from the top of the queue each time.
Illustratively, in the live broadcast scenario, the message to be sent is a chat message, a gift message, or the like acquired from all terminals participating in a live broadcast room.
Step S102, determining the priority of the message to be sent;
in the embodiment of the present disclosure, all messages have corresponding priorities, and the priorities are preset identifiers indicating the importance degrees of the messages.
Optionally, the step S102 includes:
step S201, determining the type of the message to be sent;
step S202, determining the priority of the message to be sent according to the type.
Optionally, in a message system, the messages are divided into a plurality of types, illustratively, the messages are divided into a type messages and B type messages, and each type of message is preset with a priority, for example, the priority of the a type message is a first priority, and the priority of the B type message is a second priority; further, each type of message may be further subdivided into sub-types, such as B-type messages, which may be further divided into B1-type messages and B2-type messages, and in the sub-types, there may be further sub-priorities, and in the case of the second priority, the sub-priority of the B1-type messages is higher than the sub-priority of the B2-type messages. Taking the above live broadcast scenario as an example, messages in live broadcast can be generally divided into chat messages and gift messages, the priority of the chat messages is 1, and the priority of the gift messages is 2; the gifts are classified into gifts 1 and gifts 2 according to different types, wherein the priority of the gifts 1 is 2.1, and the priority of the gifts 2 is 2.2. Thus, in step S202, the priority of the message can be determined by the type of the message.
Optionally, before step S101 or step S102, the method further includes: each type of message is given a priority. Optionally, the priority setting instruction may be received through a human-computer interface to set a priority for each type of message; optionally, the priority of each type of message may also be automatically set according to the number of the history messages, for example, the number of each type of message in the history time period is counted, and the priority is automatically set according to the number of the messages. As in the live scene described above, the priority of the chat message may be set lower than the priority of the gift message, and then in the gift message, the priority of the gift 1 is lower than the priority of the gift 2, and so on.
Optionally, before step S101 or step S102, the method further includes:
a number threshold is set for messages of different priorities. Optionally, the threshold of the number of messages with high priority is not less than the threshold of the number of messages with low priority. That is, more high priority messages may be sent than low priority messages.
Step S103, determining a first quantity;
wherein the first number is the number of messages of the priority that have been sent before the message to be sent is sent. In this step, after determining the priority of the message to be transmitted, a first number of messages of the priority that have been transmitted is obtained. For example, if the priority of the message to be sent is the first priority, the number of messages of the first priority that have been sent before the message to be sent is obtained.
Optionally, the number of messages of different priorities that have been sent is recorded by setting a counter for messages of different priorities. Such as a first priority counter, that increments by 1 each time a first priority message is sent. And when the first number needs to be acquired, reading the value of the counter.
Optionally, the step S103 includes:
step S301, acquiring a timestamp of the message to be sent;
step S302, determining a first number of messages of the priority level which have been sent in unit time according to the time stamp.
In this optional embodiment, each message to be sent has a timestamp T, and illustratively, the timestamp is expressed in seconds, that is, what second of the message to be sent is obtained through step S301, it can be understood that since there are many messages within one second, the second-level timestamps of many messages are the same, and at this time, messages of the same type can be distinguished according to the ID or sequence number of the message or timestamps of lower levels, which is not described herein again.
Optionally, in step S302, the timestamp corresponds to the unit time, if the unit time is a period in which the terminal pulls the message from the server, for example, once every 1 second, and the precision of the timestamp is also 1 second, the timestamp and the unit time may be directly corresponding to each other, and if T ═ 1, the number of messages with the priority and the timestamp of T ═ 1, which have been sent, is directly calculated, and is the first number.
Optionally, as described above, the counter is used to record the first data corresponding to the messages with different priorities. At this time, after the step S101, the method further includes:
step S401, acquiring a first timestamp of the message to be sent;
step S402, if the first time stamp is different from the second time stamp of the last message to be sent, a counter corresponding to the first time stamp is started, wherein the counter is used for recording the number of sent messages with time stamps of the first time stamp.
In this alternative embodiment, the timestamp of the message corresponds to a unit time, i.e., when the timestamp changes, it indicates a message pull into the next period. Therefore, in step S401, a first timestamp of the message to be sent is obtained, in step S402, whether the first timestamp is the same as a second timestamp of a previous message to be sent is compared, if the first timestamp is different from the second timestamp of the previous message to be sent, the two messages are located in different pull time periods, and at this time, a counter is started for the first timestamp to record the number of sent messages with timestamps as the first timestamp.
Optionally, the server corresponds to a plurality of terminals, and each terminal has different processing capabilities, so that the server independently records the first number of messages sent under each priority level for different terminals. E.g. for each terminal in the live room, the number of messages that have been sent is calculated independently for each priority.
Step S104, discarding the message to be sent when the first number is greater than or equal to the number threshold corresponding to the priority;
wherein the threshold number of messages of different priority is related to the priority of the message. Illustratively, the threshold number of high priority messages is not less than the threshold number of low priority messages. I.e., the greater the priority of the message, the greater the number it can send.
In this step, it is determined whether the first number is greater than or equal to a preset number threshold, and if so, the message to be sent is discarded, because the sent message exceeds the processing capability of the corresponding terminal at this time, even if the data to be sent is sent to the terminal, the terminal cannot process the data.
By the technical scheme, the number threshold is independently set for the messages with different priorities, so that the problems that the terminal cannot process the messages or the client side on the terminal for processing the messages crashes and the like caused by excessive messages can be effectively controlled. And because the quantity threshold values are independently set for different priorities, important messages can be guaranteed to be processed preferentially, so that the flow of the messages can be controlled, and the important messages can be guaranteed not to be lost.
Further, after the step S104, the method further includes:
sending the message to be sent when the first number is smaller than a number threshold corresponding to the priority;
accumulating the first number.
That is, if the number does not exceed the preset number threshold, the message is sent, and the number of sent messages corresponding to the priority of the message is accumulated.
On the basis of the foregoing technical solution, optionally, step S302 includes:
responding to a first sub-priority level of which the priority level of the message to be sent is a first priority level, and determining a first number of messages of the first priority level which have been sent in unit time according to the timestamp; wherein the first number is recorded in a unit time determined by a next time stamp.
Wherein the first sub-priority is a high-level sub-priority under the first priority. In this alternative embodiment, the number of messages of the first sub-priority that have been sent is recorded in a counter used for the next time period. Illustratively, in a live scene, the gift message includes gift 1 and gift 2, where the sub-priority of gift 2 is higher; since the gift 1 and the gift 2 commonly use the counter of the gift message, there may be a case where the number of the gifts 1 is excessive, the threshold of the number of the first priority is exhausted, and the more important gift 2 cannot be transmitted. Thus, in this alternative embodiment, the messages of the first sub-priority are counted using a counter used per unit time determined by the next timestamp. And if the timestamp of the message to be sent is T, counting the messages of the first sub-priority sent by using a counter of the first priority of the T +1 timestamp.
Optionally, the step S302 includes:
responding to a second sub-priority with the priority of the message to be sent being a first priority, and determining a first number of messages with the first priority, which are sent in unit time of the timestamp, according to the timestamp; wherein the number of messages of the first priority that have been transmitted includes the number of messages of a first sub-priority of the first priority that have been transmitted within the last unit time.
In this optional embodiment, if the priority of the message to be sent is the second sub-priority of the first priority, the first number of messages of the first priority is read from the counter corresponding to the unit time in which the timestamp is located. It should be noted that, except for the counter corresponding to the first timestamp, the counters of the first-priority messages corresponding to other timestamps all contain the number of the first-sub-priority messages of the first priority that are sent in the last unit time. I.e., the number of messages of the second sub-priority transmitted in the previous period, is included in the number of messages of the first priority transmitted in the current period.
Fig. 5 shows an example of the above message counting method. As shown in fig. 5, the system includes two kinds of messages, message a and message B, where message B can be divided into message B1 and message B2, where message a has a lower priority than message B, message B1 has a lower priority than message B2, at time T1, all messages a that have been sent out are counted by counter _ T1, all messages B1 that have been sent out are counted by counter _ T1, and all messages B2 that have been sent out are counted by counter _ T2, and so on. Thus, since the counter for the next period used by the message B2 counts, it can be guaranteed that the message B2 is transmitted, and thus a message of high priority can be guaranteed to be transmitted.
Optionally, the method for controlling message sending further includes:
determining whether the number of all sent messages is greater than or equal to a total number threshold, if the first number is less than a number threshold corresponding to the priority;
if the number of all sent messages is larger than or equal to the total number threshold value, discarding the messages to be sent;
and if the number of all the sent messages is smaller than the total number threshold value, sending the messages to be sent, and accumulating the first number.
In the above optional embodiment, a total threshold value needs to be set, where the total threshold value may be the maximum capability of the terminal device to process the message; in this alternative embodiment, the total number threshold is less than the sum of the number thresholds for the messages of the respective priorities. At this time, when the number of messages having sent the priority is smaller than the number threshold, it cannot be guaranteed that the terminal device can process the message to be sent, it needs to further confirm whether the number of all sent messages is greater than or equal to the total number threshold, and if all sent messages are greater than or equal to the total number threshold, the message to be sent is discarded. Otherwise, the message to be sent is sent, and the first number of the messages with the sent priority is accumulated. Illustratively, the messages include message a, message B, and message C, where the threshold number of message a is 20, the threshold number of message B is 30, the threshold number of message C is 50, and the threshold total number is 80, then if the number of sent messages a is 10, the number of sent messages B is 20, and the number of sent messages C is 50, then since the total number of sent messages is already 80, the messages a and B will be discarded even though the sent numbers of messages a and B have not reached the threshold number.
Fig. 6 is a schematic view of an application scenario according to an embodiment of the present disclosure. As shown in fig. 6, in the application scenario, a plurality of terminal devices 601 and 603 and a server 604 are included, where the plurality of terminal devices and the server perform data interaction through a wired or wireless link. As shown in fig. 6, for a process of sending a message in a live broadcast scenario, in a certain time period, a terminal device 601 and 603 sends messages to other terminals in a live broadcast room, where the messages are cached on the server 604, and then after the server receives a pull instruction of the terminal device, the server sends the cached messages to the corresponding terminal device. Since the processing capability of each terminal device may be different, an upper limit of messages that can be processed per terminal device or per type of terminal device per unit time (e.g., 1 second) may be configured on the server, for example, 100 messages per second, that is, the total threshold described above, using the technical solution in the embodiments of the present disclosure, a number threshold per unit time may also be set for each different type of message, such as 50 chat messages and 50 gift messages, so that when the number of chat messages that have been sent within 1 second exceeds 50 or the number of gift messages exceeds 50, the corresponding type of message is discarded; further, the gift messages may be divided into a gift a message and a gift B message, wherein the gift B has a higher priority due to its higher value, and as described above, in order to enable the gift B message to be sent, the count of the gift B is recorded by the counter of the next time period, which ensures that the gift B is sent. Assuming that 50 chat messages, gifts a and B are generated during the T period, it is guaranteed that the gifts are transmitted since the gifts B use the counter of the T +1 period. And by the time period T +1, the gift a is all discarded in the time period T +1 since the counter of the gift message has been counted up to 50, and the gift B can be guaranteed to be sent out using the counter of the time period T + 1. In a normal case, since the value of the gift B is high, the message of the gift B is not always generated at the above speed, and therefore, it is possible to ensure that the total number of messages after the T +1 period is not more than 100 in a normal case to keep the balance of the transmission speed of the server and the processing speed of the terminal device.
The embodiment of the disclosure discloses a message sending control method and device, electronic equipment and a computer readable storage medium. The message sending control method comprises the following steps: acquiring a message to be sent; determining the priority of the message to be sent; determining a first number, wherein the first number is the number of messages of the priority that have been sent before the message to be sent is sent; and discarding the message to be sent when the first number is greater than or equal to a number threshold corresponding to the priority. The method determines whether to send the message or not through the quantity threshold corresponding to the priority of the message, and solves the technical problem of message backlog caused by slow processing speed of the terminal.
In the above, although the steps in the above method embodiments are described in the above sequence, it should be clear to those skilled in the art that the steps in the embodiments of the present disclosure are not necessarily performed in the above sequence, and may also be performed in other sequences such as reverse, parallel, and cross, and further, on the basis of the above steps, other steps may also be added by those skilled in the art, and these obvious modifications or equivalents should also be included in the protection scope of the present disclosure, and are not described herein again.
Fig. 7 is a schematic structural diagram of an embodiment of a control device for message transmission according to an embodiment of the present disclosure. As shown in fig. 7, the apparatus 700 includes: a message to be sent acquiring module 701, a priority determining module 702, a first number determining module 703 and a control module 704. Wherein the content of the first and second substances,
a to-be-sent message obtaining module 701, configured to obtain a to-be-sent message;
a priority determining module 702, configured to determine a priority of the message to be sent;
a first quantity determining module 703, configured to determine a first quantity, where the first quantity is the quantity of the messages with the priority that have been sent before the message to be sent is sent;
a control module 704, configured to discard the message to be sent when the first number is greater than or equal to a number threshold corresponding to the priority.
Further, the control module 704 is further configured to:
sending the message to be sent when the first number is smaller than a number threshold corresponding to the priority; accumulating the first number.
Further, the first quantity determining module 703 is further configured to:
acquiring a timestamp of the message to be sent;
determining a first number of messages of the priority that have been sent within a unit of time based on the timestamp.
Further, the first quantity determining module 703 is further configured to:
responding to a first sub-priority level of which the priority level of the message to be sent is a first priority level, and determining a first number of messages of the first priority level which have been sent in unit time according to the timestamp; wherein the first number is recorded within a unit time determined by a next time stamp.
Further, the first quantity determining module 703 is further configured to:
responding to a second sub-priority with the priority of the message to be sent being a first priority, and determining a first number of messages with the first priority, which are sent in unit time of the timestamp, according to the timestamp; wherein the first number of messages of the first priority that have been transmitted includes a number of messages of a first sub-priority of the first priority that have been transmitted within a last unit time.
Further, the control module 704 is further configured to:
determining whether the number of all sent messages is greater than or equal to a total number threshold, if the first number is less than a number threshold corresponding to the priority;
if the number of all sent messages is larger than or equal to the total number threshold value, discarding the messages to be sent;
and if the number of all the sent messages is smaller than the total number threshold value, sending the messages to be sent, and accumulating the first number.
Further, the priority determining module 702 is further configured to:
determining the type of the message to be sent;
and determining the priority of the message to be sent according to the type.
Further, the apparatus 700 further includes:
and the quantity threshold setting module is used for setting quantity thresholds for the messages with different priorities, wherein the quantity threshold of the messages with high priorities is not less than the quantity threshold of the messages with low priorities.
Further, the apparatus 700 further includes:
the counter starting module is used for acquiring a first timestamp of the message to be sent; and if the first timestamp is different from the second timestamp of the last message to be sent, starting a counter corresponding to the first timestamp, wherein the counter is used for recording the number of sent messages with timestamps of the first timestamp.
The apparatus shown in fig. 7 can perform the method of the embodiment shown in fig. 1-5, and the detailed description of this embodiment can refer to the related description of the embodiment shown in fig. 1-5. The implementation process and technical effect of the technical solution refer to the descriptions in the embodiments shown in fig. 1 to 5, and are not described herein again.
Referring now to FIG. 8, shown is a schematic diagram of an electronic device 800 suitable for use in implementing embodiments of the present disclosure. The terminal device in the embodiments of the present disclosure may include, but is not limited to, a mobile terminal such as a mobile phone, a notebook computer, a digital broadcast receiver, a PDA (personal digital assistant), a PAD (tablet computer), a PMP (portable multimedia player), a vehicle terminal (e.g., a car navigation terminal), and the like, and a stationary terminal such as a digital TV, a desktop computer, and the like. The electronic device shown in fig. 8 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present disclosure.
As shown in fig. 8, an electronic device 800 may include a processing means (e.g., central processing unit, graphics processor, etc.) 801 that may perform various appropriate actions and processes in accordance with a program stored in a Read Only Memory (ROM)802 or a program loaded from a storage means 808 into a Random Access Memory (RAM) 803. In the RAM 803, various programs and data necessary for the operation of the electronic apparatus 800 are also stored. The processing apparatus 801, the ROM 802, and the RAM 803 are connected to each other by a bus 804. An input/output (I/O) interface 805 is also connected to bus 804.
Generally, the following devices may be connected to the I/O interface 805: input devices 806 including, for example, a touch screen, touch pad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; output devices 807 including, for example, a Liquid Crystal Display (LCD), speakers, vibrators, and the like; storage 808 including, for example, magnetic tape, hard disk, etc.; and a communication device 809. The communication means 809 may allow the electronic device 800 to communicate wirelessly or by wire with other devices to exchange data. While fig. 8 illustrates an electronic device 800 having various means, it is to be understood that not all illustrated means are required to be implemented or provided. More or fewer devices may alternatively be implemented or provided.
In particular, according to an embodiment of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program product comprising a computer program carried on a non-transitory computer readable medium, the computer program containing program code for performing the method illustrated by the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication means 809, or installed from the storage means 808, or installed from the ROM 802. The computer program, when executed by the processing apparatus 801, performs the above-described functions defined in the methods of the embodiments of the present disclosure.
It should be noted that the computer readable medium in the present disclosure can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In contrast, in the present disclosure, a computer readable signal medium may comprise a propagated data signal with computer readable program code embodied therein, either in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, optical cables, RF (radio frequency), etc., or any suitable combination of the foregoing.
In some embodiments, the clients, servers may communicate using any currently known or future developed network Protocol, such as HTTP (HyperText Transfer Protocol), and may interconnect with any form or medium of digital data communication (e.g., a communications network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), the Internet (e.g., the Internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future developed network.
The computer readable medium may be embodied in the electronic device; or may exist separately without being assembled into the electronic device.
The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to: acquiring an input image and a first text; extracting the features of the input image to obtain a feature vector of the input image; coding the first text to obtain a feature vector of the first text; obtaining a combined feature vector according to the feature vector of the input image and the feature vector of the first text; and decoding the joint feature vector to generate a second text.
Computer program code for carrying out operations for the present disclosure may be written in any combination of one or more programming languages, including but not limited to an object oriented programming language such as Java, Smalltalk, C + +, and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any type of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or the connection may be made to an external computer (for example, through the Internet using an Internet service provider).
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. 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 involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The units described in the embodiments of the present disclosure may be implemented by software or hardware. Where the name of an element does not in some cases constitute a limitation on the element itself.
The functions described herein above may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: field Programmable Gate Arrays (FPGAs), Application Specific Integrated Circuits (ASICs), Application Specific Standard Products (ASSPs), systems on a chip (SOCs), Complex Programmable Logic Devices (CPLDs), and the like.
In the context of this disclosure, a machine-readable medium may be a tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. The machine-readable medium may be a machine-readable signal medium or a machine-readable storage medium. A machine-readable medium may include, but is not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any suitable combination of the foregoing. More specific examples of a machine-readable storage medium would include an electrical connection based on one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing.
According to one or more embodiments of the present disclosure, there is provided a method for controlling message transmission, including:
acquiring a message to be sent;
determining the priority of the message to be sent;
determining a first number, wherein the first number is the number of messages of the priority that have been sent before the message to be sent is sent;
and discarding the message to be sent when the first number is greater than or equal to a number threshold corresponding to the priority.
Further, the method further comprises:
sending the message to be sent when the first number is smaller than a number threshold corresponding to the priority;
accumulating the first number.
Further, the determining the first number includes:
acquiring a timestamp of the message to be sent;
determining a first number of messages of the priority that have been sent within a unit of time based on the timestamp.
Further, the determining a first number of messages of the priority that have been sent within a unit time according to the timestamp includes:
responding to a first sub-priority level of which the priority level of the message to be sent is a first priority level, and determining a first number of messages of the first priority level which have been sent in unit time according to the timestamp; wherein the first number is recorded within a unit time determined by a next time stamp.
Further, the determining a first number of messages of the priority that have been sent within a unit time according to the timestamp includes:
responding to a second sub-priority with the priority of the message to be sent being a first priority, and determining a first number of messages with the first priority, which are sent in unit time of the timestamp, according to the timestamp; wherein the first number of messages of the first priority that have been transmitted includes a number of messages of a first sub-priority of the first priority that have been transmitted within a last unit time.
Further, the method further comprises:
determining whether the number of all sent messages is greater than or equal to a total number threshold, if the first number is less than a number threshold corresponding to the priority;
if the number of all sent messages is larger than or equal to the total number threshold value, discarding the messages to be sent;
and if the number of all the sent messages is smaller than the total number threshold value, sending the messages to be sent, and accumulating the first number.
Further, the determining the priority of the message to be sent includes:
determining the type of the message to be sent;
and determining the priority of the message to be sent according to the type.
Further, before the obtaining of the message to be sent, the method further includes:
and setting a quantity threshold value for messages with different priorities, wherein the quantity threshold value for messages with high priorities is not less than the quantity threshold value for messages with low priorities.
Further, after the obtaining of the message to be sent, the method further includes:
acquiring a first timestamp of the message to be sent;
and if the first timestamp is different from the second timestamp of the last message to be sent, starting a counter corresponding to the first timestamp, wherein the counter is used for recording the number of the sent messages with timestamps being the first timestamp.
According to one or more embodiments of the present disclosure, there is provided a control apparatus for message transmission, including:
the message to be sent acquiring module is used for acquiring a message to be sent;
a priority determining module, configured to determine a priority of the message to be sent;
a first number determining module, configured to determine a first number, where the first number is a number of messages of the priority that have been sent before the message to be sent is sent;
a control module, configured to discard the message to be sent when the first number is greater than or equal to a number threshold corresponding to the priority.
Further, the control module is further configured to:
sending the message to be sent when the first number is smaller than a number threshold corresponding to the priority; accumulating the first number.
Further, the first quantity determining module is further configured to:
acquiring a timestamp of the message to be sent;
determining a first number of messages of the priority that have been sent within a unit of time based on the timestamp.
Further, the first quantity determining module is further configured to:
responding to a first sub-priority level of which the priority level of the message to be sent is a first priority level, and determining a first number of messages of the first priority level which have been sent in unit time according to the timestamp; wherein the first number is recorded within a unit time determined by a next time stamp.
Further, the first quantity determining module is further configured to:
responding to a second sub-priority with the priority of the message to be sent being a first priority, and determining a first number of messages with the first priority, which are sent in unit time of the timestamp, according to the timestamp; wherein the first number of messages of the first priority that have been transmitted includes a number of messages of a first sub-priority of the first priority that have been transmitted within a last unit time.
Further, the control module is further configured to:
determining whether the number of all sent messages is greater than or equal to a total number threshold, if the first number is less than a number threshold corresponding to the priority;
if the number of all sent messages is larger than or equal to the total number threshold value, discarding the messages to be sent;
and if the number of all the sent messages is smaller than the total number threshold value, sending the messages to be sent, and accumulating the first number.
Further, the priority determining module is further configured to:
determining the type of the message to be sent;
and determining the priority of the message to be sent according to the type.
Further, the apparatus further includes:
and the quantity threshold setting module is used for setting quantity thresholds for the messages with different priorities, wherein the quantity threshold of the messages with high priorities is not less than the quantity threshold of the messages with low priorities.
Further, the apparatus further includes:
the counter starting module is used for acquiring a first timestamp of the message to be sent; and if the first timestamp is different from the second timestamp of the last message to be sent, starting a counter corresponding to the first timestamp, wherein the counter is used for recording the number of sent messages with timestamps of the first timestamp.
According to one or more embodiments of the present disclosure, there is provided an electronic device including: at least one processor; and a memory communicatively coupled to the at least one processor; wherein the memory stores instructions executable by the at least one processor to enable the at least one processor to perform the method of controlling the transmission of a message according to any one of the preceding first aspects.
According to one or more embodiments of the present disclosure, there is provided a non-transitory computer-readable storage medium characterized by storing computer instructions for causing a computer to execute the method of controlling message transmission according to any one of the first aspect described above.
The foregoing description is only exemplary of the preferred embodiments of the disclosure and is illustrative of the principles of the technology employed. It will be appreciated by those skilled in the art that the scope of the disclosure herein is not limited to the particular combination of features described above, but also encompasses other embodiments in which any combination of the features described above or their equivalents does not depart from the spirit of the disclosure. For example, the above features and (but not limited to) the features disclosed in this disclosure having similar functions are replaced with each other to form the technical solution.

Claims (12)

1. A method for controlling message transmission, comprising:
acquiring a message to be sent;
determining the priority of the message to be sent;
determining a first number, wherein the first number is the number of messages of the priority that have been sent before the message to be sent is sent;
and discarding the message to be sent when the first number is greater than or equal to a number threshold corresponding to the priority.
2. The method of controlling message transmission according to claim 1, wherein the method further comprises:
sending the message to be sent when the first number is smaller than a number threshold corresponding to the priority;
accumulating the first number.
3. The method of controlling message transmission according to claim 1, wherein said determining the first number comprises:
acquiring a timestamp of the message to be sent;
determining a first number of messages of the priority that have been sent within a unit of time based on the timestamp.
4. The method of controlling message transmission according to claim 3, wherein the determining a first number of messages of the priority that have been transmitted in a unit time according to the time stamp includes:
responding to a first sub-priority level of which the priority level of the message to be sent is a first priority level, and determining a first number of messages of the first priority level which have been sent in unit time according to the timestamp; wherein the first number is recorded within a unit time determined by a next time stamp.
5. The method of controlling message transmission according to claim 3, wherein the determining a first number of messages of the priority that have been transmitted in a unit time according to the time stamp includes:
responding to a second sub-priority with the priority of the message to be sent being a first priority, and determining a first number of messages with the first priority, which are sent in unit time of the timestamp, according to the timestamp; wherein the first number of messages of the first priority that have been transmitted includes a number of messages of a first sub-priority of the first priority that have been transmitted within a last unit time.
6. The method of controlling message transmission according to claim 1, wherein the method further comprises:
determining whether the number of all sent messages is greater than or equal to a total number threshold, if the first number is less than a number threshold corresponding to the priority;
if the number of all sent messages is larger than or equal to the total number threshold value, discarding the messages to be sent;
and if the number of all the sent messages is smaller than the total number threshold value, sending the messages to be sent, and accumulating the first number.
7. The method for controlling message transmission according to claim 1, wherein the determining the priority of the message to be transmitted comprises:
determining the type of the message to be sent;
and determining the priority of the message to be sent according to the type.
8. The method for controlling message transmission according to claim 1, wherein before the obtaining of the message to be transmitted, the method further comprises:
and setting a quantity threshold value for messages with different priorities, wherein the quantity threshold value for messages with high priorities is not less than the quantity threshold value for messages with low priorities.
9. The method for controlling message transmission according to claim 1, wherein after the obtaining of the message to be transmitted, the method further comprises:
acquiring a first timestamp of the message to be sent;
and if the first timestamp is different from the second timestamp of the last message to be sent, starting a counter corresponding to the first timestamp, wherein the counter is used for recording the number of the sent messages with timestamps being the first timestamp.
10. A message transmission control apparatus, comprising:
the message to be sent acquiring module is used for acquiring a message to be sent;
a priority determining module, configured to determine a priority of the message to be sent;
a first number determining module, configured to determine a first number, where the first number is a number of messages of the priority that have been sent before the message to be sent is sent;
a control module, configured to discard the message to be sent when the first number is greater than or equal to a number threshold corresponding to the priority.
11. An electronic device, comprising:
a memory for storing computer readable instructions; and
a processor for executing the computer readable instructions such that the processor when executed implements the method of any of claims 1-9.
12. A non-transitory computer readable storage medium storing computer readable instructions which, when executed by a computer, cause the computer to perform the method of any one of claims 1-9.
CN202011060102.4A 2020-09-30 2020-09-30 Message sending control method and device, electronic equipment and computer readable storage medium Pending CN112199174A (en)

Priority Applications (2)

Application Number Priority Date Filing Date Title
CN202011060102.4A CN112199174A (en) 2020-09-30 2020-09-30 Message sending control method and device, electronic equipment and computer readable storage medium
PCT/CN2021/115015 WO2022068488A1 (en) 2020-09-30 2021-08-27 Message sending control method and apparatus, and electronic device and computer-readable storage medium

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN202011060102.4A CN112199174A (en) 2020-09-30 2020-09-30 Message sending control method and device, electronic equipment and computer readable storage medium

Publications (1)

Publication Number Publication Date
CN112199174A true CN112199174A (en) 2021-01-08

Family

ID=74012520

Family Applications (1)

Application Number Title Priority Date Filing Date
CN202011060102.4A Pending CN112199174A (en) 2020-09-30 2020-09-30 Message sending control method and device, electronic equipment and computer readable storage medium

Country Status (2)

Country Link
CN (1) CN112199174A (en)
WO (1) WO2022068488A1 (en)

Cited By (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107809391A (en) * 2016-09-09 2018-03-16 奥特润株式会社 Apparatus and method for control message traffic load
CN112994934A (en) * 2021-02-07 2021-06-18 杭州迪普科技股份有限公司 Data interaction method, device and system
WO2022068488A1 (en) * 2020-09-30 2022-04-07 北京字节跳动网络技术有限公司 Message sending control method and apparatus, and electronic device and computer-readable storage medium
CN115209166A (en) * 2021-04-12 2022-10-18 北京字节跳动网络技术有限公司 Message sending method, device, equipment and storage medium
CN116701009A (en) * 2022-11-21 2023-09-05 荣耀终端有限公司 Data communication method and electronic equipment

Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103561394A (en) * 2013-11-08 2014-02-05 惠州Tcl移动通信有限公司 Method and system for sending message
CN106257958A (en) * 2015-06-30 2016-12-28 北京智谷睿拓技术服务有限公司 Message method, message receival method and device thereof
CN108093123A (en) * 2017-10-30 2018-05-29 努比亚技术有限公司 A kind of message informing processing method, terminal and computer readable storage medium
CN108174305A (en) * 2016-12-07 2018-06-15 北京云中融信网络科技有限公司 The message treatment method and device of chatroom is broadcast live
CN109245867A (en) * 2018-08-14 2019-01-18 深圳壹账通智能科技有限公司 A kind of message method, computer readable storage medium and terminal device
CN110191348A (en) * 2018-02-23 2019-08-30 武汉斗鱼网络科技有限公司 The processing method and processing device of interactive message in net cast
CN110231972A (en) * 2019-05-27 2019-09-13 维沃移动通信有限公司 A kind of message display method and terminal device
CN110417879A (en) * 2019-07-18 2019-11-05 北京蜜莱坞网络科技有限公司 A kind of message treatment method, device, equipment and storage medium
CN110662085A (en) * 2019-10-16 2020-01-07 北京字节跳动网络技术有限公司 Message sending method, device, readable medium and electronic equipment
US20200042367A1 (en) * 2018-07-31 2020-02-06 International Business Machines Corporation Determining when to send message to a computing node to process items using a machine learning module
CN111124573A (en) * 2019-12-16 2020-05-08 维沃移动通信有限公司 Message notification method and electronic equipment

Family Cites Families (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20070002736A1 (en) * 2005-06-16 2007-01-04 Cisco Technology, Inc. System and method for improving network resource utilization
CN111416765A (en) * 2020-03-20 2020-07-14 北京字节跳动网络技术有限公司 Interactive message processing method and device
CN112199174A (en) * 2020-09-30 2021-01-08 北京字节跳动网络技术有限公司 Message sending control method and device, electronic equipment and computer readable storage medium

Patent Citations (11)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN103561394A (en) * 2013-11-08 2014-02-05 惠州Tcl移动通信有限公司 Method and system for sending message
CN106257958A (en) * 2015-06-30 2016-12-28 北京智谷睿拓技术服务有限公司 Message method, message receival method and device thereof
CN108174305A (en) * 2016-12-07 2018-06-15 北京云中融信网络科技有限公司 The message treatment method and device of chatroom is broadcast live
CN108093123A (en) * 2017-10-30 2018-05-29 努比亚技术有限公司 A kind of message informing processing method, terminal and computer readable storage medium
CN110191348A (en) * 2018-02-23 2019-08-30 武汉斗鱼网络科技有限公司 The processing method and processing device of interactive message in net cast
US20200042367A1 (en) * 2018-07-31 2020-02-06 International Business Machines Corporation Determining when to send message to a computing node to process items using a machine learning module
CN109245867A (en) * 2018-08-14 2019-01-18 深圳壹账通智能科技有限公司 A kind of message method, computer readable storage medium and terminal device
CN110231972A (en) * 2019-05-27 2019-09-13 维沃移动通信有限公司 A kind of message display method and terminal device
CN110417879A (en) * 2019-07-18 2019-11-05 北京蜜莱坞网络科技有限公司 A kind of message treatment method, device, equipment and storage medium
CN110662085A (en) * 2019-10-16 2020-01-07 北京字节跳动网络技术有限公司 Message sending method, device, readable medium and electronic equipment
CN111124573A (en) * 2019-12-16 2020-05-08 维沃移动通信有限公司 Message notification method and electronic equipment

Cited By (8)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN107809391A (en) * 2016-09-09 2018-03-16 奥特润株式会社 Apparatus and method for control message traffic load
WO2022068488A1 (en) * 2020-09-30 2022-04-07 北京字节跳动网络技术有限公司 Message sending control method and apparatus, and electronic device and computer-readable storage medium
CN112994934A (en) * 2021-02-07 2021-06-18 杭州迪普科技股份有限公司 Data interaction method, device and system
CN112994934B (en) * 2021-02-07 2023-02-10 杭州迪普科技股份有限公司 Data interaction method, device and system
CN115209166A (en) * 2021-04-12 2022-10-18 北京字节跳动网络技术有限公司 Message sending method, device, equipment and storage medium
WO2022218103A1 (en) * 2021-04-12 2022-10-20 北京字节跳动网络技术有限公司 Message sending method and apparatus, and device and storage medium
CN116701009A (en) * 2022-11-21 2023-09-05 荣耀终端有限公司 Data communication method and electronic equipment
CN116701009B (en) * 2022-11-21 2024-05-17 荣耀终端有限公司 Data communication method and electronic equipment

Also Published As

Publication number Publication date
WO2022068488A1 (en) 2022-04-07

Similar Documents

Publication Publication Date Title
CN112199174A (en) Message sending control method and device, electronic equipment and computer readable storage medium
US20220394316A1 (en) Message sending method and device, readable medium and electronic device
CN112135169B (en) Media content loading method, device, equipment and medium
CN111147606B (en) Data transmission method, device, terminal and storage medium
CN112311656B (en) Message aggregation and display method and device, electronic equipment and computer readable medium
CN111221638B (en) Concurrent task scheduling processing method, device, equipment and medium
CN112954354B (en) Video transcoding method, device, equipment and medium
CN110636367A (en) Video loading method and device, terminal equipment and medium
CN110545472A (en) Video data processing method and device, electronic equipment and computer readable medium
CN110856004B (en) Message processing method and device, readable storage medium and electronic equipment
CN112218034A (en) Video processing method, system, terminal and storage medium
CN113542856B (en) Method, device, equipment and computer readable medium for reverse playing of online video
CN111478916B (en) Data transmission method, device and storage medium based on video stream
CN111225255B (en) Target video push playing method and device, electronic equipment and storage medium
CN113364767A (en) Streaming media data display method and device, electronic equipment and storage medium
CN112203103B (en) Message processing method, device, electronic equipment and computer readable storage medium
CN107342981B (en) Sensor data transmission method and device and virtual reality head-mounted equipment
CN115378878B (en) CDN scheduling method, device, equipment and storage medium
CN112040328B (en) Data interaction method and device and electronic equipment
CN112162682A (en) Content display method and device, electronic equipment and computer readable storage medium
WO2022218103A1 (en) Message sending method and apparatus, and device and storage medium
CN113364672B (en) Method, device, equipment and computer readable medium for determining media gateway information
CN112653691B (en) Data processing method, device, equipment and storage medium
CN113765692B (en) Current limiting method, device, electronic equipment and computer readable medium
CN114760506B (en) Video transcoding evaluation method, device, equipment and storage medium

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