Browsing by Subject "Performance Analysis"
Now showing 1 - 2 of 2
Results Per Page
Sort Options
Item Analysis of coded OFDM system over frequency-selective fading channels(Texas A&M University, 2004-11-15) Zheng, JunThis thesis considers the analysis of system performance and resource allocation for a coded OFDM system over frequency selective fading channels. Due to the inseparable role taken by channel coding in a coded OFDM system, an information theoretical analysis is carried out and taken as the basis for the system performance and throughput. Based on the results of the information theoretical analysis, the optimal system BER performance of a coded OFDM system is first shown to converge to the outage probability for large OFDM block lengths. Instead of evaluating the outage probability numerically, we provide in this thesis a simple analytical closed form approximation of the outage probability for a coded OFDM system over frequency selective quasi-static fading channels. Simulation results of the turbo-coded OFDM systems further confirm the approximation of the outage probability. By taking the instantaneous channel capacity as the analytical building block, system throughput of a coded OFDM system is then provided. With the aim to compare the performance difference between adaptive and uniform resource allocation strategies, the system throughput of different allocation schemes under various channel conditions is analyzed. First, it is demonstrated that adaptive power allocation over OFDM sub-carriers at the transmitter achieves very little gain in terms of throughput over a uniform power distribution scheme. Theoretical analysis is then provided of the throughput increase of adaptive-rate schemes compared with fixed-rate schemes under various situations. Two practical OFDM systems implementing rate-compatible-punctured-turbo-code-based (RCPT-based) hybrid automatic-repeat-request (Hybrid-ARQ) and redundancy incremental Hybrid-ARQ protocols are also provided to verify the analytical results.Item Stochastic Dynamic Programming and Stochastic Fluid-Flow Models in the Design and Analysis of Web-Server Farms(2010-10-12) Goel, PiyushA Web-server farm is a specialized facility designed specifically for housing Web servers catering to one or more Internet facing Web sites. In this dissertation, stochastic dynamic programming technique is used to obtain the optimal admission control policy with different classes of customers, and stochastic uid- ow models are used to compute the performance measures in the network. The two types of network traffic considered in this research are streaming (guaranteed bandwidth per connection) and elastic (shares available bandwidth equally among connections). We first obtain the optimal admission control policy using stochastic dynamic programming, in which, based on the number of requests of each type being served, a decision is made whether to allow or deny service to an incoming request. In this subproblem, we consider a xed bandwidth capacity server, which allocates the requested bandwidth to the streaming requests and divides all of the remaining bandwidth equally among all of the elastic requests. The performance metric of interest in this case will be the blocking probability of streaming traffic, which will be computed in order to be able to provide Quality of Service (QoS) guarantees. Next, we obtain bounds on the expected waiting time in the system for elastic requests that enter the system. This will be done at the server level in such a way that the total available bandwidth for the requests is constant. Trace data will be converted to an ON-OFF source and fluid- flow models will be used for this analysis. The results are compared with both the mean waiting time obtained by simulating real data, and the expected waiting time obtained using traditional queueing models. Finally, we consider the network of servers and routers within the Web farm where data from servers flows and merges before getting transmitted to the requesting users via the Internet. We compute the waiting time of the elastic requests at intermediate and edge nodes by obtaining the distribution of the out ow of the upstream node. This out ow distribution is obtained by using a methodology based on minimizing the deviations from the constituent in flows. This analysis also helps us to compute waiting times at different bandwidth capacities, and hence obtain a suitable bandwidth to promise or satisfy the QoS guarantees. This research helps in obtaining performance measures for different traffic classes at a Web-server farm so as to be able to promise or provide QoS guarantees; while at the same time helping in utilizing the resources of the server farms efficiently, thereby reducing the operational costs and increasing energy savings.