An explicit congestion notification (ECN)-based distributed transport protocol,ARROW-WTCP (AcceleRate tRansmission towards Optimal Window size TCP for Wireless network),was proposed.The ARROW-WTCP enables feasible deployment of ARROW-TCP from wired to wireless networks by providing a joint design of source and router algorithms.The protocol obtains the actual capacity of the wireless channel by calculating the queue variation in base station (BS) and adjusts the congestion window by using the feedback from its bottleneck link.The simulation results show that the ARROW-WTCP achieves strong stability,max-min fairness in dynamic networks,fast convergence to efficiency without introducing much excess traffic,and almost full link utilization in the steady state.It outperforms the XCP-B (eXplicit Control Protocol Blind),the wireless version of XCP,in terms of stability,fairness,convergence and utilization in wireless networks.
The Circle algorithm was proposed for large datasets.The idea of the algorithm is to find a set of vertices that are close to each other and far from other vertices.This algorithm makes use of the connection between clustering aggregation and the problem of correlation clustering.The best deterministic approximation algorithm was provided for the variation of the correlation of clustering problem,and showed how sampling can be used to scale the algorithms for large datasets.An extensive empirical evaluation was given for the usefulness of the problem and the solutions.The results show that this method achieves more than 50% reduction in the running time without sacrificing the quality of the clustering.
