Patent Application
20070116110
Keyboard, video, and mouse (KVM) redirection refers to the redirection of signals from a keyboard, a video source, or a mouse to a site remote to the keyboard, the video source, or the mouse. KVM redirection is typically used for the maintenance and configuration of computers at a remote site. In an enterprise environment, KVM redirection allows an information technology (IT) team to administer and maintain corporate servers and desktop computers through a network without being physically present at the location of the computers. In a server environment, it is unlikely to allocate a console to each server where the servers are clustered in a computer room. KVM redirection allows an IT team to manage the servers through a network from one single remote location.
One of the most common implementations of video redirection is based on tile compression algorithms. These algorithms typically split the screen into rectangles of pixel data (e.g., tiles of 64×64 pixels each), and look for changes in the corresponding tiles between subsequently sampled frames. If a change is detected, the tile from the currently sampled frame is compressed and sent, or redirected, to a remote console. Otherwise, no action is taken with respect to that tile. An example of an algorithm and network protocol is the Virtual Network Computing (VNC) based on the Remote Frame Buffer (RFB) protocol.
When a new screen shot of video stream is to be redirected to a remote viewer, a frame sampler 111 of video redirection system 11 grabs a frame and saves it into current frame buffer 121. Grabbing a frame may involve sampling the video at a pre-determined rate to comply with a desired resolution. After an entire frame is sampled and saved, a tile comparator 112 of video redirection system 11 reads the frame from current frame buffer 121 and a reference frame from reference frame buffer 122 via memory bus 15. Tile comparator 112 compares the two frames, tile by tile, to determine if any tile of the currently sampled frame is different from the corresponding tile of the reference frame. If a tile is different, the tile is sent to a compression module 113 for compression. The compressed tiles are buffered in compressed tile buffer 123 before being sent to a network module 114 of video redirection system 11 for transmission to the remote console. Thereafter, the content of current frame buffer 121 becomes the reference frame as a new frame cycle begins.
The aforementioned operations make heavy use of memory bus 15. In every frame cycle, both the currently sampled frame and the reference frame are read from memory 12. This creates a burden to the memory bandwidth and requires a high performance memory to be used. A fast and wide memory array may accommodate the bandwidth required by the above operations but the cost is high.
Embodiments are illustrated by way of example and not by way of limitation in the figures of the accompanying drawings in which like references indicate similar elements. It should be noted that references to “an” or “one” embodiment in this disclosure are not necessarily to the same embodiment, and such references mean at least one.
Video redirection system 21 includes a frame sampler 211 for sampling incoming video streams. The sampled frame is stored in frame buffer 225 in memory 22. In contrast to memory 11 of video redirection system 11 (
Hash module 212 implements a hash algorithm which maps an input of a relatively large domain (e.g., a tile) into to a hash value of a relatively small domain. The mapping into a smaller domain means that there are fewer bits in a hash value than in a tile. Thus, these smaller hash values may be stored locally in video redirection system 21. These hash values represent the newly sampled tiles and may be compared with hash values of the tiles of a reference frame. As a result, the number of memory reads may be reduced because there is no longer a need to retrieve a reference frame from memory 22 for the purpose of tile comparisons.
Hash module 212 may implement any known hash algorithms. Logic circuits and software for implementing hash algorithms are known in the art. For example, the Secure Hash Algorithm (SHA-1) algorithm, often adopted by security algorithms for user authentication and signature verification, may be used to map a tile of any size into 160-bit output. Thus, for a tile of 16×16 pixel with 24 bits per pixel, the reduction ratio is 160: (16×16×24)=1:38.4. The reduction in the domain size may sometimes cause collision, meaning that different inputs are mapped to the same output. A collision may cause missed detection of a tile change because different tiles are mapped to the same hash value. The SHA-1 algorithm has a low probability of collision (2−160). Thus, the probability of missing a tile change because of hash collision is negligible. Alternative hash algorithms, e.g., SHA-2 or Message-Digest Algorithm 5 (MD5), may have different probability of collision and achieve different reduction ratio in the output bits.
In one embodiment, hash module 212 may store the hash values output in a hash value buffer 219 of video redirection system 21. Hash value buffer 219 may designate a current buffer 213 for storing the hash values of the tiles of the currently sampled frame, and a reference buffer 214 for storing the hash values of the tiles of a reference frame. At the end of a frame cycle, the content of current buffer 213 may be copied into the reference buffer 214 to become the new reference hash values. Alternatively, buffers 213 and 214 may be implemented as a double buffer. At the end of a frame cycle, the designation of current buffer 213 and reference buffer 214 may be swapped to avoid the copying operations.
A video stream carries pixel information of the frame sequentially in a line by line manner. Thus, the sampled bits are also sequentially ordered. In one embodiment, hash module 212 includes an internal buffer to accumulate the sampled bits. As a tile is usually a square or rectangular block of image, hash module 212 may accumulate several lines of a frame before forming one or more tiles. Hash module 212 computes the hash values for each of the tiles as the tiles are accumulated, and temporarily stores the hash values in current buffer 213 of video redirection system 21.
Video redirection system 21 may also include a hash value comparator 215 which compares two hash values to determine whether there is a difference. Hash value comparator 215 may be implemented by logic circuits or a software module executable by a microcontroller. At block 32, hash value comparator 215 compares the hash values in current buffer 213 with the corresponding reference hash values in reference buffer 214. A corresponding reference hash value is the hash value of a tile of a previously sampled frame that occupies the same location in a frame as the tile of the currently sampled frame. If hash value comparator 215 determines there is a difference between the current hash value and the corresponding reference hash value, hash value comparator 215 signals a changed tile reader 216 with an identifier or an address of the tile to enable a memory read. If hash value comparator 215 determines there is no difference between the two hash values, no memory read is enabled for the tile. Changed tile reader 216 may be implemented as a hardware or software interface for reading specific data locations from memory 22. In one embodiment, changed tile reader 216 may be implemented as a standard memory interface for reading specific addresses of data units in memory 22.
In one embodiment, hash value comparator 215 may signal changed tile reader 216 with an identifier or address of a tile every time a difference in hash values is detected. Alternatively, hash value comparator 215 may compile a list of all the tiles having different hash values from the corresponding reference hash values. Hash value comparator 215 may send the entire list to changed tile reader 216 after all the tiles of the currently sampled frame are processed. The choice of implementation may depend on the speed of compression module 217 and the bandwidth of memory bus 25.
At block 33, changed tile reader 216 reads the tiles having changed hash values from frame buffer 225, and forwards the tiles to a compression module 217 of video redirection system 21. At block 34, compression module 217 compresses the tiles, using any lossless compression algorithms, e.g., run-length coding or Lempel-Ziv coding. Compression circuits or software for implementing the lossless compression algorithms are well known in the art. Compression module 217 may alternatively implement lossy compression algorithms, e.g., moving picture experts group (MPEG) or similar algorithms, for applications that can tolerate data loss. However, the common video compression standards such as MPEG may not be adequate for the compression of a computer screen where textual images predominate, because these standards suffer from information loss as a result of the reduced compression ratio. Textual images generally have sharper edges than a typical video application and thus may not be a suitable candidate for lossy compressions. However, in applications where textual images do not predominate, lossy compression algorithms may be used.
Following the compression, compression module 217 temporarily stores the compressed tiles in compressed tile buffer 226. In an alternative embodiment, compressed tile buffer 226 may be internal to compression module 217 if space allows. At block 35, a network module 218 of video redirection system 21 retrieves the compressed tiles from compressed tile buffer 226 and transmits the compressed tiles to a remote console via network interface 23 according to a pre-determined protocol, e.g., the Virtual Network Computing (VNC) based on the Remote Frame Buffer (RFB) protocol, or other proprietary protocols.
At block 36, video redirection system 21 designates the current hash values in current buffer 213 as the reference hash values. Video redirection system may replace the entire content of reference buffer 214 with the content of buffer 213, or replace only the hash values of the changed tiles. Alternatively, the designation of current and reference buffers 213 and 214 may be swapped without making a real copy of the hash values. Thereafter, at block 37, video redirection system 21 repeats the operations of blocks 31-36 for the next frame cycle. In one embodiment, the video redirection system 21 may repeat the operations when prompted by a request from a viewer program at the remote management console. The speed at which the video streams are redirected may depend on the processing speed of the remote console and the connection thereto.
The aforementioned embodiments have the advantages of speed, efficiency, and cost-effectiveness. The size of memory 22 may be reduced, as the memory is no longer required to store a reference frame. Memory bandwidth is also reduce because only the tiles different from the reference frame are read from memory 22. As a consequence, power consumption at the memory interface is minimized.
In the foregoing specification, specific embodiments have been described. It will, however, be evident that various modifications and changes can be made thereto without departing from the broader spirit and scope of the appended claims. The specification and drawings are, accordingly, to be regarded in an illustrative rather than a restrictive sense.
