Performance analysis of different architectures and TCP congestion-avoidance algorithms using WMN-GA simulation system

In this paper, we evaluate the performance of two Wireless Mesh Networks (WMNs) architectures considering throughput, delay, jitter and fairness index metrics. For simulations, we used ns-3, Distributed Coordination Function (DCF) and Optimized Link State Routing (OLSR). We compare the performance of WMN for different Transmission Control Protocol (TCP): Tahoe, Reno and NewReno considering normal and uniform distributions of mesh clients by sending multiple Constant Bit Rate (CBR) flows in the network. The simulation results show that for normal and uniform distributions and both WMN architectures, the PDR values are almost the same. For Hybrid WMN, the throughput of TCP NewReno is good, but for I/B WMN, the throughput of TCP Tahoe is higher than other algorithms. For normal distribution, the delay and jitter of I/B WMN are lower compared with Hybrid WMN, while for uniform distribution, the delay and jitter of TCP NewReno are a little bit lower compared with other algorithms. The fairness index of normal distribution is higher than uniform distribution.Peer ReviewedPostprint (author's final draft

Enhanced FAST TCP by Solving Rerouting Problem

Delay-based congestion control algorithms inability to recognize increased RTT related to rerouting from increased RTT related to congestion is their most serious problem which has serious effect on their throughput. FAST TCP is one of delay-based TCP variants that although outperforms other TCP variants in high bandwidth-delay product networks, but suffers from several problems that inhere in its procedure to estimate trip delay. The most serious of these problems is rerouting. When rerouting occurs and round-trip time (RTT) of the new path is longer than RTT of the old path, the throughput of FAST TCP decreases sharply. Because FAST misinterprets the increased RTT as result of the network congestion and consequently decreases its own window size. This paper solves this problem by considering the relationship between sending rate and observed RTT. The simulation results show the effectiveness of proposed solution to solve rerouting problem while simultaneously preserves FAST TCP prominent primitive features

Articles indexats publicats per investigadors del Campus de Terrassa: 2017

Aquest informe recull els 241 treballs publicats per 222 investigadors/es del Campus de Terrassa en revistes indexades al Journal Citation Report durant el 2017Postprint (published version

Performance analysis of different architectures and TCP congestion-avoidance algorithms using WMN-GA simulation system

In this paper, we evaluate the performance of two Wireless Mesh Networks (WMNs) architectures considering throughput, delay, jitter and fairness index metrics. For simulations, we used ns-3, Distributed Coordination Function (DCF) and Optimized Link State Routing (OLSR). We compare the performance of WMN for different Transmission Control Protocol (TCP): Tahoe, Reno and NewReno considering normal and uniform distributions of mesh clients by sending multiple Constant Bit Rate (CBR) flows in the network. The simulation results show that for normal and uniform distributions and both WMN architectures, the PDR values are almost the same. For Hybrid WMN, the throughput of TCP NewReno is good, but for I/B WMN, the throughput of TCP Tahoe is higher than other algorithms. For normal distribution, the delay and jitter of I/B WMN are lower compared with Hybrid WMN, while for uniform distribution, the delay and jitter of TCP NewReno are a little bit lower compared with other algorithms. The fairness index of normal distribution is higher than uniform distribution.Peer Reviewe