Large capacity realtime stream processing method for removing dithering in buffer memory

Abstract

First, with real time stream data packet being received, write request is sent to the dispatching queue and request for reading packets is sent at fixed time interval. Read / write arbitrator arbitrates the writing and reading requests and starts-up reading and writing flows. The reading flow reads channel information, fetching packet data from shared buffer and stores them in output buffer. The writing flow reads channel information and writes data packet to shared buffer. In the invention, the buffered de-dithering chain table is omitted so as to prevent the additional dither inducted by requests of reading voice packets put forward from multiple channel at same time. Since allocation mode of fixed position and average capacity is utilized, thus the processing performance is stable. The processing is carried out in parallel so as to increase de-dithering channels.

Description

technical field [0001] The invention relates to a large-capacity real-time stream processing method for realizing cache debounce, and belongs to the technical field of real-time stream transmission on a packet network (including IP network and Ethernet). Background technique [0002] When transmitting real-time streams on an IP network, due to the uncertainty of network delay, time jitter and disorder of real-time streams will be introduced. In order to ensure the quality of the real-time stream, it is necessary to buffer a certain number of packets at the receiving end of the real-time stream, and then send each packet at a fixed time interval to eliminate time jitter and disorder at the cost of additional delay. This method is called " Cache Debounce". The key technology to implement cache debounce is queue scheduling. [0003] In the prior art, a linked list method based on software is generally used to debounce the cache. figure 1 Is its implementation block diagram. ...

AI Technical Summary

Problems solved by technology

In either case, linked list operations are more complicated

Due to the uncertainty of the number of nodes in the linked list and the sending time of the real-time streaming data packet, the time taken for the real-time streaming data packet insertion operation also has great uncertainty

[0012] (2) The sending time of real-time streaming data packets of each channel is independent of each other. When multiple channels send sending requests at the same time, it is difficult to ensure that each real-time streaming data packet can get a timely response, and the last sending channel will introduce relatively large delay

[0013] Therefore, the processing process of the above method is complicated and has great uncertainty. The number of channels that a single processor can handle is not large, generally between several hundred to one thousand channels, which makes the cost of a single channel relatively high.

Images