The exponential growth of the Internet coupled with the increasing popularity of dynamically generated content on the World Wide Web, has created the need for more and faster Web servers capable of serving the over 100 million Internet users. To converge the control method has emerged as a promising technique to solve the Web QoS problem. In this paper, a model of adaptive session is presented and a session flow self regulating algorism based on Kalman Filter are proposed towards Weh Server. And a Web QoS self-regularing scheme is advanced. To attain the goal of on-line system identification, the optimized estimation of QoS parameters is fulfilled by utilizing Kalman Filter in full domain, The simulation results shows thal the proposed scheme can guarantee the QoS with both robusmess and stability .
A specialized Hungarian algorithm was developed here for the maximum likelihood data association problem with two implementation versions due to presence of false alarms and missed detections. The maximum likelihood data association problem is formulated as a bipartite weighted matching problem. Its duality and the optimality conditions are given. The Hungarian algorithm with its computational steps, data structure and computational complexity is presented. The two implementation versions, Hungarian forest （HF） algorithm and Hungarian tree （HT） algorithm, and their combination with the naYve auction initialization are discussed. The computational results show that HT algorithm is slightly faster than HF algorithm and they are both superior to the classic Munkres algorithm.
