Tree based reliable topology for distributing link state information

Finding paths that satisfy the performance requirements of applications according to link state information in a network is known as the Quality-of- Service (QoS) routing problem and has been extensively studied. However, distributing link state information may introduce a significant protocol overhead on network resources. In this thesis, the issue on how to update link state information efficiently and effectively is investigated. A theoretical framework is presented, and a high performance link state policy that is capable of minimizing the false blocking probability of connections under a given update rate constraint is proposed. Through theoretical analysis, it is shown that the proposed policy outperforms the current state of the art in terms of the update rate and higher scalability and reliability

Direct search for the optimum of a simulated process continuing noise

The objective of this work was to study the optimization of a function whose measurement contains error or noise. A search method developed for noise free systems was applied to a noisy function using minimum variance estimators to improve the accuracy of the functional values. The results of the new search method are compared to those of a modified stochastic approximation method which has good convergence on noisy systems. At moderate noise levels (σ ≤ 0.5), the new method appears to converge faster than the best method reported for the modified stochastic approximation although at higher noise levels (σ > 0.5), this advan­tage seems to be lost