CN108521611A - A kind of anti-jitter video data access method and computer equipment - Google Patents
A kind of anti-jitter video data access method and computer equipment Download PDFInfo
- Publication number
- CN108521611A CN108521611A CN201810256798.4A CN201810256798A CN108521611A CN 108521611 A CN108521611 A CN 108521611A CN 201810256798 A CN201810256798 A CN 201810256798A CN 108521611 A CN108521611 A CN 108521611A
- Authority
- CN
- China
- Prior art keywords
- seq
- messages
- rtp messages
- target
- rtp
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/60—Network structure or processes for video distribution between server and client or between remote clients; Control signalling between clients, server and network components; Transmission of management data between server and client, e.g. sending from server to client commands for recording incoming content stream; Communication details between server and client
- H04N21/63—Control signaling related to video distribution between client, server and network components; Network processes for video distribution between server and clients or between remote clients, e.g. transmitting basic layer and enhancement layers over different transmission paths, setting up a peer-to-peer communication via Internet between remote STB's; Communication protocols; Addressing
- H04N21/647—Control signaling between network components and server or clients; Network processes for video distribution between server and clients, e.g. controlling the quality of the video stream, by dropping packets, protecting content from unauthorised alteration within the network, monitoring of network load, bridging between two different networks, e.g. between IP and wireless
- H04N21/64784—Data processing by the network
- H04N21/64792—Controlling the complexity of the content stream, e.g. by dropping packets
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04N—PICTORIAL COMMUNICATION, e.g. TELEVISION
- H04N21/00—Selective content distribution, e.g. interactive television or video on demand [VOD]
- H04N21/80—Generation or processing of content or additional data by content creator independently of the distribution process; Content per se
- H04N21/85—Assembly of content; Generation of multimedia applications
- H04N21/854—Content authoring
- H04N21/8547—Content authoring involving timestamps for synchronizing content
Landscapes
- Engineering & Computer Science (AREA)
- Computer Networks & Wireless Communication (AREA)
- Computer Security & Cryptography (AREA)
- Multimedia (AREA)
- Signal Processing (AREA)
- Data Exchanges In Wide-Area Networks (AREA)
Abstract
The present invention provides a kind of anti-jitter video data access method, receives video message；If the difference of the seq of the currently received rtp messages and seq of next target rtp messages is more than or equal to first threshold, or the timestamp of currently received rtp messages and the difference of the timestamp of next target rtp messages are more than or equal to second threshold, all messages in chained list are then emptied, and opposite end is asked to send key frame；If the timestamp of currently received rtp messages and the difference of the timestamp of next target rtp messages are less than second threshold, message is stored in chained list, and seq is stored in seq Hash tables；It according to target seq, is searched from seq Hash tables, if finding, corresponding rtp messages is searched according to seq, and send the rtp messages；It is no, then all messages in chained list are emptied；The present invention also provides a kind of computer equipments, improve search efficiency, rationally utilize memory space.
Description
Technical field
The present invention relates to a kind of anti-jitter video data access method and computer equipments.
Background technology
Currently, rtp agreements are mainly based upon for real time media data transmission to carry out.Real-time media transmission encounters core and asks
One of topic is during the video data transmission of larger data amount, due to network jitter, after terminal receives media data, to cause
Video message is out of order, and mosaic, Hua Ping are may result in when codec decodes, when serious even blank screen.It is general to solve network
The mode of shake is to create jitter cache area, and buffered video data enables codec to read video message in order.
The prior art, the data structure generally used are doubly linked list or array, are inserted into according to the seq of video message
Sequence, merger sequence etc., improve the access efficiency of video data.The shortcomings that this data structure is, if a. using array, Gu
Determine video message caching number and wastes memory space if network condition is relatively good, for the more situation of concurrent session number,
Larger memory space may be occupied；If using doubly linked list, if dynamic increases and decreases chained list node, it is empty preferably to solve storage
Between the problem of wasting, but realize, maintenance cost it is higher；B. search efficiency is low, this kind of way sequence is multiple plus the time searched
Miscellaneous degree be preferably also required to O (nlogn) even if the c. prior arts using dynamic buffering mode, but for the optimization of packet loss scene
Deficiency, many times, buffer area be also close to full, cannot be compared with good utilisation buffer space.
Invention content
The technical problem to be solved in the present invention, is to provide a kind of anti-jitter video data access method and computer is set
It is standby, search efficiency is improved, memory space is rationally utilized.
What one of present invention was realized in：A kind of anti-jitter video data access method, including：
Step 1 receives video message；
If the difference of the seq and the seq of next target rtp messages of step 2, currently received rtp messages are more than or equal to
The difference of the timestamp of the timestamp of first threshold or currently received rtp messages and next target rtp messages is more than etc.
In second threshold, then all messages in chained list are emptied, and opposite end is asked to send key frame；
If the difference of the seq of the currently received rtp messages and seq of next target rtp messages is less than first threshold,
All seq in subtracting 1 by the seq of the seq by next target rtp messages to the currently received rtp messages are inserted into packet loss and breathe out
Uncommon table, request retransmission corresponds to message after waiting for time-out；
If the timestamp of currently received rtp messages and the difference of the timestamp of next target rtp messages are less than second
Message is then stored in chained list by threshold value, and seq is stored in seq Hash tables；
Step 3, according to target seq, searched from seq Hash tables, if finding, corresponding rtp searched according to seq and is reported
Text, and send the rtp messages；It is no, then all messages in chained list are emptied；
The step 2 and step 3 part tandem.
Further, the step 3 is specially further：It according to target seq, is searched from seq Hash tables, if for the first time
Target seq is found, then corresponding rtp messages are searched according to seq, and send the rtp messages；If finding time of target seq
Number finds corresponding rtp messages mark according to seq and is set to 1 more than 1 and less than restriction number, then it is all to abandon the frame
Message；If the number for finding target seq is more than 1 and less than restriction number, and finds corresponding rtp messages according to seq
Mark are not set to 1, then send the rtp messages；If the number for finding target seq, which is equal to, limits number, by institute in chained list
There is message to empty.
Further, the step 3 is specially further：A message section is set, and calculates losing in the message section
Packet rate empties all messages in chained list if packet loss is more than setting packet loss；It is no, then according to target seq, from seq Hash tables
Middle lookup searches corresponding rtp messages, and send the rtp messages if finding according to seq；It is no, then will own in chained list
Message empties
Further, when the chained list caching frame number is more than restriction frame number, random frame losing is carried out, and key frame cannot be lost.
What one of present invention was realized in：A kind of computer equipment, including memory, processor and it is stored in memory
Computer program that is upper and can running on a processor, the processor realize following steps when executing described program：Step 1,
Receive video message；
If the difference of the seq and the seq of next target rtp messages of step 2, currently received rtp messages are more than or equal to
The difference of the timestamp of the timestamp of first threshold or currently received rtp messages and next target rtp messages is more than etc.
In second threshold, then all messages in chained list are emptied, and opposite end is asked to send key frame；
If the difference of the seq of the currently received rtp messages and seq of next target rtp messages is less than first threshold,
All seq in subtracting 1 by the seq of the seq by next target rtp messages to the currently received rtp messages are inserted into packet loss and breathe out
Uncommon table, request retransmission corresponds to message after waiting for time-out；
If the timestamp of currently received rtp messages and the difference of the timestamp of next target rtp messages are less than second
Message is then stored in chained list by threshold value, and seq is stored in seq Hash tables；
Step 3, according to target seq, searched from seq Hash tables, if finding, corresponding rtp searched according to seq and is reported
Text, and send the rtp messages；It is no, then all messages in chained list are emptied；
The step 2 and step 3 part tandem.
Further, the step 3 is specially further：It according to target seq, is searched from seq Hash tables, if for the first time
Target seq is found, then corresponding rtp messages are searched according to seq, and send the rtp messages；If finding time of target seq
Number finds corresponding rtp messages mark according to seq and is set to 1 more than 1 and less than restriction number, then it is all to abandon the frame
Message；If the number for finding target seq is more than 1 and less than restriction number, and finds corresponding rtp messages according to seq
Mark are not set to 1, then send the rtp messages；If the number for finding target seq, which is equal to, limits number, by institute in chained list
There is message to empty.
Further, the step 3 is specially further：A message section is set, and calculates losing in the message section
Packet rate empties all messages in chained list if packet loss is more than setting packet loss；It is no, then according to target seq, from seq Hash tables
Middle lookup searches corresponding rtp messages, and send the rtp messages if finding according to seq；It is no, then will own in chained list
Message empties
Further, when the chained list caching frame number is more than restriction frame number, random frame losing is carried out, and key frame cannot be lost.
The invention has the advantages that：By introducing Hash table, the efficiency of lookup is improved, the time complexity of lookup is made to connect
It is bordering on O (1)；It introduces to factors such as out of order, serious network jitter, high packet loss, as packet loss Rule of judgment, reduces memory space
The possibility to rise suddenly and sharply rationally utilizes memory space；The largest buffered upper limit, dynamic buffering video data are set.
Description of the drawings
The present invention is further illustrated in conjunction with the embodiments with reference to the accompanying drawings.
Fig. 1 is specific embodiment of the invention schematic diagram one.
Fig. 2 is specific embodiment of the invention schematic diagram two.
Fig. 3 is specific embodiment of the invention schematic diagram three.
Specific implementation mode
Anti-jitter video data access method of the present invention, including：
Step 1 receives video message；
If the difference of the seq and the seq of next target rtp messages of step 2, currently received rtp messages are more than or equal to
The difference of the timestamp of the timestamp of first threshold or currently received rtp messages and next target rtp messages is more than etc.
In second threshold, then all messages in chained list are emptied, and opposite end is asked to send key frame；
If the difference of the seq of the currently received rtp messages and seq of next target rtp messages is less than first threshold,
All seq in subtracting 1 by the seq of the seq by next target rtp messages to the currently received rtp messages are inserted into packet loss and breathe out
Uncommon table, request retransmission corresponds to message after waiting for time-out；
If the timestamp of currently received rtp messages and the difference of the timestamp of next target rtp messages are less than second
Message is then stored in chained list by threshold value, and seq is stored in seq Hash tables, and the chained list caching frame number, which is more than, limits frame number
When, random frame losing is carried out, and key frame cannot be lost；
Step 3, one message section of setting, and the packet loss in the message section is calculated, if packet loss is more than setting packet loss
Rate then empties all messages in chained list；It is no, then it according to target seq, is searched from seq Hash tables, if finding target for the first time
Seq then searches corresponding rtp messages according to seq, and sends the rtp messages；If the number for finding target seq is more than 1 and small
In restriction number, and corresponding rtp messages mark are found according to seq and are set to 1, then abandons all messages of the frame；If looking into
The number for finding target seq is more than 1 and less than restriction number, and finds corresponding rtp messages mark according to seq and be not set to
1, then send the rtp messages；If the number for finding target seq, which is equal to, limits number, all messages in chained list are emptied；
The step 2 and step 3 part tandem.
What one of present invention was realized in：A kind of computer equipment, including memory, processor and it is stored in memory
Computer program that is upper and can running on a processor, the processor realize following steps when executing described program：
Step 1 receives video message；
If the difference of the seq and the seq of next target rtp messages of step 2, currently received rtp messages are more than or equal to
The difference of the timestamp of the timestamp of first threshold or currently received rtp messages and next target rtp messages is more than etc.
In second threshold, then all messages in chained list are emptied, and opposite end is asked to send key frame；
If the difference of the seq of the currently received rtp messages and seq of next target rtp messages is less than first threshold,
All seq in subtracting 1 by the seq of the seq by next target rtp messages to the currently received rtp messages are inserted into packet loss and breathe out
Uncommon table, request retransmission corresponds to message after waiting for time-out；
If the timestamp of currently received rtp messages and the difference of the timestamp of next target rtp messages are less than second
Message is then stored in chained list by threshold value, and seq is stored in seq Hash tables, and the chained list caching frame number, which is more than, limits frame number
When, random frame losing is carried out, and key frame cannot be lost；
Step 3, one message section of setting, and the packet loss in the message section is calculated, if packet loss is more than setting packet loss
Rate then empties all messages in chained list；It is no, then it according to target seq, is searched from seq Hash tables, if finding target for the first time
Seq then searches corresponding rtp messages according to seq, and sends the rtp messages；If the number for finding target seq is more than 1 and small
In restriction number, and corresponding rtp messages mark are found according to seq and are set to 1, then abandons all messages of the frame；If looking into
The number for finding target seq is more than 1 and less than restriction number, and finds corresponding rtp messages mark according to seq and be not set to
1, then send the rtp messages；If the number for finding target seq, which is equal to, limits number, all messages in chained list are emptied；
The step 2 and step 3 part tandem.
A kind of specific implementation mode of the present invention：
(1) buffering area storage organization defines：
Single linked list：The single linked list is actual video data storage unit.Each node in chained list is a video
Rtp messages；
The sequence number Hash table (referred to as " seq Hash tables ") of rtp messages：It is value with rtp messages index using seq as key,
Rtp messages are only rtp message nodes index, non-physical memory location；
Packet loss Hash table：When the seq that the seq for receiving rtp messages subtracts target rtp messages is more than 0, then it is assumed that from target rtp
The seq of message puts it into packet loss Hash table to the seq ranging from packet loss messages for receiving rtp messages.Packet loss Hash table is with packet loss
Seq values be key, to receive time after the message as value.Time after receiving the message is more than time-out time T, then
It can be to the opposite end request retransmission message.
" access is lost " package operation of chained list and Hash table, is required for synchronized update；
It is n that the chained list largest buffered message amount, which is arranged,.Define the maximum value of chain table cache message number, it is therefore an objective to which dynamic is slow
Stored messages are avoided due to shaking seriously, and being cached more rtp messages causes memory space to rise suddenly and sharply.
As shown in Figure 1, video message bag deposit, taking packet stream journey
For the transceiver terminal of any one video message, all there is such a bag deposit and the model of packet is taken
(as shown below)：" bag deposit " refers to the rtp messages that opposite end is dealt into local terminal, puts buffer area into；" taking packet ", refer to by
Seq sequences take out rtp messages from buffer area, give codec decoding.
A. as shown in Fig. 2, receiving the bag deposit flow of video message：
If a is the seq values for receiving rtp messages, b is the seq values of next target rtp messages, and c is to receive rtp messages
Timestamp value, d are the timestamp value of next target rtp messages.If the difference of a and b is more than or equal to the difference of p or c and d
More than or equal to q, then it is assumed that network jitter is serious, and the data in chained list are no longer valid, empties all messages in chained list, sends simultaneously
Fir, request opposite end send key frame；(fir is sent, the purpose that request opposite end sends key frame is that Video Decoder needs are closing
It could normally be decoded on the basis of key frame, caching has been cleared, it is expected that being synchronized to newest video pictures)
If the difference of a and b is less than p, the seq of b to a-1 is inserted into packet loss Hash table, waits for request pair after time-out
End retransmits the message；
Rtp messages are added in chained list, while updating seq Hash tables；
B. as shown in figure 3, transmission video message takes packet stream journey：
Statistics stage packet loss (i.e. using continuous 250 messages as a stage, it will be in continuous 250 messages
The message of loss divided by 250 can be obtained packet loss), if stage packet loss is more than 60%, then it is assumed that the video data is
It is unfavorable for decoding coding, and in order to save memory space, empties all messages in chained list.
It enables and searches number i=0；
According to target seq, is searched from seq Hash tables, takes packet.If finding the rtp messages of corresponding seq, jump to
Step 4；If do not found and i<10, i++, go to step 3；
If i=0, i.e., corresponding rtp messages are just found according to seq for the first time, this rtp message is sent as video and is reported
Text；If 0<i<10 and rtp messages mark that find be set to 1 (, the broadcasting of video is played by certain frame per second, frame per second
Mean that the picture of broadcasting per second, i.e. a frame are exactly a picture, a frame contains one or more messages again.When a message
The positions mark be marked as 1, that is, indicate this message be this frame the last one message.), that is, find last of whole frame
A message (for Video Decoder, if a frame loses a message, this frame be solution not out, 0<i<10, it says
This bright frame is simultaneously imperfect, and in this case, direct dropping packets can be to avoid consumption CPU, memory source), directly abandoning should
Frame is also present in all messages of chained list；If i=10, i.e., target seq is not found continuous 10 times, think continuously to lose at this time
Packet 10 is serious packet loss, and video data has been unfavorable for decoding coding, and in order to save memory space, empties the institute in chained list
There is message, after emptying, packet receiving again can be waited for, then take message；
If current chained list caching frame number is more than maximum frame number, random frame losing is proceeded by, the principle of random frame losing is not
Key frame is lost, as makes packet loss distribution average as possible, avoids blank screen or stuck.
Although specific embodiments of the present invention have been described above, those familiar with the art should manage
Solution, we are merely exemplary described specific embodiment, rather than for the restriction to the scope of the present invention, it is familiar with this
The technical staff in field modification and variation equivalent made by the spirit according to the present invention, should all cover the present invention's
In scope of the claimed protection.
Claims (8)
1. a kind of anti-jitter video data access method, it is characterised in that：Including：
Step 1 receives video message；
If the difference of the seq of step 2, the currently received rtp messages and seq of next target rtp messages is more than or equal to first
The difference of the timestamp of the timestamp of threshold value or currently received rtp messages and next target rtp messages is more than or equal to the
Two threshold values then empty all messages in chained list, and opposite end is asked to send key frame；
If the difference of the seq of the currently received rtp messages and seq of next target rtp messages is less than first threshold, should
All seq in subtracting 1 by the seq of the seq of next target rtp messages to currently received rtp messages are inserted into packet loss Hash table,
Request retransmission corresponds to message after waiting for time-out；
If the timestamp of currently received rtp messages and the difference of the timestamp of next target rtp messages are less than second threshold,
Then message is stored in chained list, and seq is stored in seq Hash tables；
Step 3, according to target seq, searched from seq Hash tables, if finding, corresponding rtp messages searched according to seq,
And send the rtp messages；It is no, then all messages in chained list are emptied；
The step 2 and step 3 part tandem.
2. a kind of anti-jitter video data access method according to claim 1, it is characterised in that：The step 3 is into one
Step is specially：It according to target seq, is searched from seq Hash tables, if finding target seq for the first time, according to seq lookups pair
The rtp messages answered, and send the rtp messages；If the number for finding target seq is more than 1 and less than restriction number, and according to
Seq finds corresponding rtp messages mark and is set to 1, then abandons all messages of the frame；If finding the number of target seq
More than 1 and less than restriction number, and corresponding rtp messages mark are found according to seq and are not set to 1, then sends rtp reports
Text；If the number for finding target seq, which is equal to, limits number, all messages in chained list are emptied.
3. a kind of anti-jitter video data access method according to claim 1, it is characterised in that：The step 3 is into one
Step is specially：A message section is set, and calculates the packet loss in the message section, if packet loss is more than setting packet loss,
Empty all messages in chained list；It is no, then it according to target seq, searches from seq Hash tables, if finding, is searched according to seq
Corresponding rtp messages, and send the rtp messages；It is no, then all messages in chained list are emptied.
4. a kind of anti-jitter video data access method according to claim 1, it is characterised in that：The chained list caching frame
When number is more than restriction frame number, random frame losing is carried out, and key frame cannot be lost.
5. a kind of computer equipment, including memory, processor and storage are on a memory and the meter that can run on a processor
Calculation machine program, it is characterised in that：The processor realizes following steps when executing described program：Step 1 receives video message；
If the difference of the seq of step 2, the currently received rtp messages and seq of next target rtp messages is more than or equal to first
The difference of the timestamp of the timestamp of threshold value or currently received rtp messages and next target rtp messages is more than or equal to the
Two threshold values then empty all messages in chained list, and opposite end is asked to send key frame；
If the difference of the seq of the currently received rtp messages and seq of next target rtp messages is less than first threshold, should
All seq in subtracting 1 by the seq of the seq of next target rtp messages to currently received rtp messages are inserted into packet loss Hash table,
Request retransmission corresponds to message after waiting for time-out；
If the timestamp of currently received rtp messages and the difference of the timestamp of next target rtp messages are less than second threshold,
Then message is stored in chained list, and seq is stored in seq Hash tables；
Step 3, according to target seq, searched from seq Hash tables, if finding, corresponding rtp messages searched according to seq,
And send the rtp messages；It is no, then all messages in chained list are emptied；
The step 2 and step 3 part tandem.
6. a kind of computer equipment according to claim 5, it is characterised in that：The step 3 is specially further：According to
Target seq is searched from seq Hash tables, if finding target seq for the first time, corresponding rtp messages are searched according to seq, and
Send the rtp messages；If the number for finding target seq is more than 1 and less than limiting number, and is found according to seq corresponding
Rtp messages mark are set to 1, then abandon all messages of the frame；If the number for finding target seq is more than 1 and less than restriction
Number, and corresponding rtp messages mark are found according to seq and are not set to 1, then send the rtp messages；If finding target
The number of seq, which is equal to, limits number, then empties all messages in chained list.
7. a kind of computer equipment according to claim 5, it is characterised in that：The step 3 is specially further：Setting
One message section, and the packet loss in the message section is calculated, if packet loss is more than setting packet loss, empties in chained list and own
Message；It is no, then it according to target seq, is searched from seq Hash tables, if finding, corresponding rtp messages is searched according to seq,
And send the rtp messages；It is no, then all messages in chained list are emptied.
8. a kind of computer equipment according to claim 5, it is characterised in that：The chained list caching frame number, which is more than, limits frame
When number, random frame losing is carried out, and key frame cannot be lost.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810256798.4A CN108521611B (en) | 2018-03-27 | 2018-03-27 | Anti-jitter video data access method and computer equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810256798.4A CN108521611B (en) | 2018-03-27 | 2018-03-27 | Anti-jitter video data access method and computer equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108521611A true CN108521611A (en) | 2018-09-11 |
| CN108521611B CN108521611B (en) | 2020-09-01 |
Family
ID=63434174
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810256798.4A Active CN108521611B (en) | 2018-03-27 | 2018-03-27 | Anti-jitter video data access method and computer equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108521611B (en) |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112511441A (en) * | 2020-11-18 | 2021-03-16 | 潍柴动力股份有限公司 | Message processing method and device |
| CN112822717A (en) * | 2020-12-31 | 2021-05-18 | 联想未来通信科技(重庆)有限公司 | Method, device and system for dynamically controlling message buffering |
Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101222288A (en) * | 2008-02-01 | 2008-07-16 | 华为技术有限公司 | IP network transmission method, system and equipment automatically adapting network jitter |
| US20150124165A1 (en) * | 2013-11-05 | 2015-05-07 | Broadcom Corporaton | Parallel pipelines for multiple-quality level video processing |
-
2018
- 2018-03-27 CN CN201810256798.4A patent/CN108521611B/en active Active
Patent Citations (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN101222288A (en) * | 2008-02-01 | 2008-07-16 | 华为技术有限公司 | IP network transmission method, system and equipment automatically adapting network jitter |
| US20150124165A1 (en) * | 2013-11-05 | 2015-05-07 | Broadcom Corporaton | Parallel pipelines for multiple-quality level video processing |
Non-Patent Citations (2)
| Title |
|---|
| BONG-JIN OH等: "Efficient Retransmission Architecture of Digital Broadcast Services over IPTV Networks", 《IEEE TRANSACTIONS ON CONSUMER ELECTRONICS》 * |
| 彭国刊: "一个基于RTSP协议的自适应流媒体传输系统", 《中国优秀硕士学位论文全文数据库》 * |
Cited By (2)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN112511441A (en) * | 2020-11-18 | 2021-03-16 | 潍柴动力股份有限公司 | Message processing method and device |
| CN112822717A (en) * | 2020-12-31 | 2021-05-18 | 联想未来通信科技(重庆)有限公司 | Method, device and system for dynamically controlling message buffering |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108521611B (en) | 2020-09-01 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US7721117B2 (en) | Stream control failover utilizing an attribute-dependent protection mechanism | |
| US9825860B2 (en) | Flow-driven forwarding architecture for information centric networks | |
| CN104205772B (en) | Improved DASH clients and receiver with buffer water level decision-making | |
| Perino et al. | Caesar: A content router for high-speed forwarding on content names | |
| US20080212600A1 (en) | Router and queue processing method thereof | |
| US8370649B2 (en) | Stream control failover utilizing an attribute-dependent protection mechanism | |
| CN108900570B (en) | Cache replacement method based on content value | |
| CN101394362B (en) | Method for load balance to multi-core network processor based on flow fragmentation | |
| EP1490783A4 (en) | Method and apparatus for establishing and sharing a virtual change notification list among a plurality of peer nodes | |
| US8929372B2 (en) | Grid router | |
| CN101330472A (en) | Method for caching and processing stream medium data | |
| CN102263701B (en) | Queue regulation method and device | |
| US20070160048A1 (en) | Method for providing data and data transmission system | |
| CN109905720B (en) | Cache replacement method based on video-on-demand system under named data network | |
| Diop et al. | QoS-oriented MPTCP extensions for multimedia multi-homed systems | |
| CN108521611A (en) | A kind of anti-jitter video data access method and computer equipment | |
| WO2017117942A1 (en) | Information query method and system for sdn controllers at multiple layers | |
| CN109905482A (en) | Name the caching method based on video living transmission system in data network | |
| CN104243412B (en) | Network data processing terminal and method in wherein network data | |
| Chen et al. | Improving NDN forwarding engine performance by rendezvous-based caching and forwarding | |
| Diop et al. | QoS-aware multipath-TCP extensions for mobile and multimedia applications | |
| Ndikumana et al. | Scalable aggregation-based packet forwarding in content centric networking | |
| CN109861908B (en) | Route forwarding method and equipment | |
| CN113329048B (en) | Cloud load balancing method and device based on switch and storage medium | |
| CN104469539A (en) | A cooperation buffering method, streaming media managing subsystem and server |
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 | ||
| CP01 | Change in the name or title of a patent holder | ||
| CP01 | Change in the name or title of a patent holder |
Address after: 361000 unit 1001, No.56, guanri Road, phase II, software park, Siming District, Xiamen City, Fujian Province Patentee after: Fujian Xingwang Intelligent Technology Co., Ltd Address before: 361000 unit 1001, No.56, guanri Road, phase II, software park, Siming District, Xiamen City, Fujian Province Patentee before: FUJIAN STAR-NET WISDOM TECHNOLOGY Co.,Ltd. |