Lie Qian

Bio: Lie Qian is an academic researcher from Southeastern Oklahoma State University. The author has contributed to research in topics: Quality of service & Network packet. The author has an hindex of 6, co-authored 18 publications receiving 155 citations. Previous affiliations of Lie Qian include Alcatel-Lucent & Beijing Union University.

Data structure for range-specified algorithms

Abstract: A disjoint graph structure for packet classification in communication systems is presented. The disjoint graph is comprised of two types of data structures; an elementary interval tree (EIT) and a disjoint interval tree (DIT). The disjoint graph is constructed based on a range-specified rule set finding particular application in the classification of data packets. Each rule in the rule set has an equal number of fields and each field specifies a range referred to as an integer interval having a lower and an upper bound. The disjoint graph has the same number of layers as there are fields in each rule. The layers are comprised of nodes, and each node has an associated rule set selected from the range-specified rule set. The disjoint graph enables packet classification in only one pass through the tree. The EIT and DIT structures are also presented in detail.

Optimized software implementation of a full-rate IEEE 802.11a compliant digital baseband transmitter on a digital signal processor

Abstract: The explosive growth of 802.11-based wireless LANs has attracted interest in providing higher data rates and greater system capacities. Among the IEEE 802.11 standards, the 802.11a standard based on OFDM modulation scheme has been defined to address high-speed and large-system-capacity challenges. Hardware implementations are often used to meet the high-data-rate requirements of 802.11a standard. Although software based solutions are more attractive due to the lower cost, shorter development time, and higher flexibility, it is still a challenge to meet the high-data-rate requirements of 802.11a by software. In this paper, we implement a software-based 802.11a digital baseband transmitter on the TI TMS320C64x DSP. The transmitter can operate over all data rates defined in the 802.11a standard and is compatible with the high-rate portions of the 802.11g standard. Two major optimizations have been used in the software implementation to achieve the high-data-rate: 1) parallelizing the scrambler function and 2) concatenating the FEC encoder, puncturing, and interleaver functions. Experimental results show that the optimized software implementation on a single C64x DSP with a clock frequency of 1.0 GHz can operate at the maximum of 136 Mbits/s, which is twice as fast as the previous software implementation at the same clock frequency

Forwarding state sharing between multiple traffic paths in a communication network

Abstract: The sharing of forwarding states between multiple traffic paths is described. There is a described a method for establishing a data traffic path in a communication network from a first node towards a second node. The method includes searching a set of pre-existing forwarding states for a pre-existing forwarding state associated with the first node for defining the traffic path from the first node towards the second node. If the pre-existing forwarding state for defining the traffic path cannot be found in the set of pre-existing forwarding states, then a new forwarding state for defining the traffic path from the first node towards the second node is generated the new forwarding state is used to establish the traffic path from the first node towards the second node. An apparatus implementing the method is described. The sharing of forwarding states as described may be used in MPLS enabled networks.

A new traffic model and statistical admission control algorithm for providing QoS guarantees to on-line traffic

Abstract: On-line traffic, including conversational calls, videoconference calls, and live video, is becoming an important type of traffic in the Internet. The traffic traces of on-line traffic are not pre-recorded, which means little information on the on-line traffic is known in advance. Hence, on-line traffic is hard to characterize by existing traffic models, such as D-BIND. In order to anticipate and capture the burstiness property of on-line traffic, we introduce a new confidence-level-based statistical bounding interval-length dependent (S-BIND) traffic model and a statistical admission control algorithm, based on the S-BIND traffic model: the GammaH-BIND algorithm. Our simulation results show that by using the S-BIND traffic model as inputs, the GammaH-BIND algorithm can achieve the maximum valid network utilization for both low-bursty and high-bursty on-line traffic, which is 50%/spl sim/70% higher than the achievable network utilization under the D-BIND traffic model.

Method and server for controlling data flows in telecommunications network

Abstract: The invention relates to a method for controlling data traffic in a telecommunications network (150), said control being carried out in terms of a statistic modelling of the traffic transmitted by the network (150) by means of a gaussian distribution of the data flow. According to the invention, one such method is characterised in that a characteristic value of the gaussian distribution is weighted by means of a parameter ? which varies according to the intensity of the variations, or the discontinuity, of the traffic processed by said network (150), said weighted value being used to evaluate the traffic in the network.

Systems and methods for mobile image capture and processing

Abstract: In various embodiments, methods, systems, and computer program products for processing digital images captured by a mobile device are disclosed. Myriad features enable and/or facilitate processing of such digital images using a mobile device that would otherwise be technically impossible or impractical, and furthermore address unique challenges presented by images captured using a camera rather than a traditional flat-bed scanner, paper-feed scanner or multifunction peripheral.

Adaptive bitrate management for streaming media over packet networks

Abstract: A method including receiving a receiver report from a terminal; estimating one or more network conditions of a media network based at least in part on the receiver report; determining an optimal session bitrate based on the estimated one or more network conditions; and providing media data to the terminal based on the optimal session bitrate.

Root node redundancy for multipoint-to-multipoint transport trees

Abstract: A mechanism is provided to configure a plurality of transport trees in a transport network, each of which correspond to a native tree (e.g., a bidirectional multicast tree). In embodiments of the present invention, each of the plurality of transport trees has a unique root node so that in the event of a failure of any root node, the transport trees with surviving root nodes can be used to transport traffic from the native tree. The present invention provides for each transport network edge router being independently responsible for selection of a transport tree that the edge router will use to transmit a datastream, while also being capable of receiving packets from any transport tree. Through the use of such configured transport trees along with independent selection of a transport tree, the present invention provides a reduction in the disruption of datastream transmission due to a root node failure.

Polynomial Estimation of Time-Varying Multipath Gains With Intercarrier Interference Mitigation in OFDM Systems

Abstract: In this paper, we consider the case of a high-speed mobile receiver operating in an orthogonal frequency-division multiplexing (OFDM) communication system. We present an iterative algorithm for estimating multipath complex gains with intersubcarrier interference (ICI) mitigation (using comb-type pilots). Each complex gain variation is approximated by a polynomial representation within several OFDM symbols. Assuming knowledge of delay-related information, polynomial coefficients are obtained from time-averaged gain values, which are estimated using the least-square (LS) criterion. The channel matrix is easily computed, and the ICI is reduced by using successive interference suppression (SIS) during data symbol detection. The algorithm's performance is further enhanced by an iterative procedure, performing channel estimation and ICI mitigation at each iteration. Theoretical analysis and simulation results for a Rayleigh fading channel show that the proposed algorithm has low computational complexity and good performance in the presence of high normalized Doppler spread.

Systems, methods, and computer program products for determining document validity

Abstract: A method according to one embodiment includes extracting an identifier from an electronic first document, and identifying a complementary document associated with the first document using the identifier. A validity of the first document is determined by simultaneously considering: textual information from the first document; textual information from the complementary document; and predefined business rules. An indication of the determined validity is output. Systems and computer program products for providing, performing, and/or enabling the methodology presented above are also presented.