Abstract: This invention discloses a bit-stuffing method for crosstalk avoidance in high-speed buses, which comprises the steps of inputting a plurality of data bit streams in parallel to a data input buffer; the data input buffer sequentially inputting data bits of the data bit streams to a bit-switching unit, and the bit-switching unit switching the data bits to generate bit-switched data; parallelly inputting the bit-switched data to a bit-stuffing encoding unit; the bit-stuffing encoding unit performing bit-stuffing encoding on the bit-switched data to generate encoded data bits and inputting the encoded data bits to an encoded data buffer; and the encoded data buffer outputting the encoded data to a high-speed bus. The encoded data bits passed through the high-speed bus are decoded using a bit-removing method to recover the data bit streams.

Abstract: This invention discloses a bit-stuffing method for crosstalk avoidance in high-speed buses, which comprises the steps of inputting a plurality of data bit streams in parallel to a data input buffer; the data input buffer sequentially inputting data bits of the data bit streams to a bit-switching unit, and the bit-switching unit switching the data bits to generate bit-switched data; parallelly inputting the bit-switched data to a bit-stuffing encoding unit; the bit-stuffing encoding unit performing bit-stuffing encoding on the bit-switched data to generate encoded data bits and inputting the encoded data bits to an encoded data buffer; and the encoded data buffer outputting the encoded data to a high-speed bus. The encoded data bits passed through the high-speed bus are decoded using a bit-removing method to recover the data bit streams.

Abstract: Four methods for transmitting data in base stations of radio access network are provided. Each base station includes a plurality of logic channels, a plurality of transport channels and a media access control layer. The logic channels are configured to receive data and transmit it to the media access control layer. The media access control layer distributes the data by means of the methods of the preset invention and then the data is able to transmit through the transport channels.

Abstract: Disclosed is a weighted longest queue first (WLQF) service discipline for ATM networks. The sources are classified so that sources in one class have the same cell loss probability requirement. For N classes of traffic the WLQF system has N buffers to store the traffic, wherein buffer i is assigned a positive number w.sub.i for the weight of buffer i. The scheduler transmits a cell from that buffer whose index maximizes w.sub.i Q.sub.i for i=1, 2, . . . ,N, where Q.sub.i is the queue length of buffer i at the moment when the scheduler makes a decision about which buffer to serve. Accordingly, the inventive system always serves the most congested buffer relative to the weighted queue lengths, and can adapt to temporary overload quickly. This feature ensures that in temporary overloads of one of the buffers, the overloaded buffer, receives almost all the service and therefore, losses due to buffer overflows and cell delay variation (CDV) are much small.

Abstract: Methods of traffic smoothing for frames of different video sources where each video source transmits frames at fixed intervals and the network is free to decide the relative temporal spacing of video frames from different sources provide significant performance advantages. The time at which a given source begins to transmit its first frame is under the control of the network; however, thereafter, all frames from the source are transmitted at fixed intervals. Two heuristic and one optimization method control the temporal placement of the video frames from different sources in order to reduce the loss rate of the high priority cells and to minimize the smoothness index of the traffic.

Abstract: A satellite communication system increases its efficiency by using adaptive pipeline polling as the control protocol. In this protocol, the earth stations are separated into active and inactive sets and a first number of slots (salary) is assigned to each active station. Additionally, periodically active stations are queried as to the length of their queues and assigned salary slots not needed by any active station are reallofted to stations with queues that exceed their assigned salary in proportion to the size of such excess. A contention period is included outside of the normal salary and bonus periods during which stations in the inactive are allowed to contend to be included in the active set.