Our work focuses on performance modelling of TCP-controlled file transfers in infrastructure mode IEEE 802.11 wireless networks, and application of the models in developing association schemes. A comprehensive set of analytical models is used to study the behaviour of TCP-controlled long and short file transfers in IEEE 802.11 WLANs. The results can provide insight into the performance of TCP-controlled traffic in 802.11 WLANs in a variety of different network environments. First, we consider several WLAN stations associated at rates r1, r2, ...,rk with an Access Point. Each station (STA) is downloading a long file from a local server, located on the LAN to which the AP is attached, using TCP. We assume that a TCP ACK will be produced after the reception of d packets at an STA. We model these simultaneous TCP-controlled transfers using a semi-Markov process. Our analytical approach leads to a procedure to compute aggregate download as well as per-STA throughputs numerically, and the results match simulations very well. Performance analysis of TCP-controlled long file transfers in a WLAN in infrastructure mode is available in the literature with one of the main assumptions being equal window size for all TCP connections. We extend the analysis to TCP-controlled long file uploads and downloads with different TCP windows. Our approach is based on the semi- Markov process considered in above work, but with arbitrary window sizes. We present simulation results to show the accuracy of the analytical model. Then, we obtain an association policy for STAs in an IEEE 802.11 WLAN by taking into account explicitly an aspect of practical importance: TCP controlled short file downloads interspersed with read times (motivated by web browsing). Our approach is based on two steps. First, we consider the analytical model mentioned above to obtain the aggregate download throughput. Second, we present a 2-node closed queueing network model to approximate the expected average-sized file download time for a user who shares the AP with other users associated at a multiplicity of rates. These analytical results motivate the proposed association policy, called the Estimated Delay based Association (EDA) policy: Associate with the AP at which the expected file download time is the least. Simulations indicate that for a web-browsing type traffic scenario, EDA outperforms other policies that have been proposed earlier; the extent of improvement ranges from 12.8% to 46.4% for a 9-AP network. We extend the performance model by considering _le sizes drawn from heavy-tailed distributions. We represent heavy-tailed distributions using a 1 mixture of exponential distributions (following Cox's method). We provide a closed queueing network model to approximate the expected average-sized file download time for a user who shares the AP with other users associated at a multiplicity of rates. Further, we analyze TCP-controlled bulk file transfers in a single station WLAN with nonzero propagation delay between the file server and the WLAN. Our approach is to model the flow of packets as a closed queueing network (BCMP network) with 3 service centres, one each for the Access Point and the STA, and the third for the propagation delay. The service rates of the first two are obtained by analyzing the WLAN MAC. We extend this work to obtain throughputs in multirate scenarios. Simulations show that our approach is able to predict observed throughputs with a high degree of accuracy.