| With the development of information technology, computer technology, network technology and control technology, intelligent buildings are more and more popular, and intelligent spaces are being realized. Now the intelligent spaces are only to interlink the automation and control systems of the buildings, and they don't share their information and resources between different systems. They should be able to interlink separate intelligent building, and provide the perfect integration of control network and system, data network and system, voice network and system and video network and system. Interlinkage via Internet is a key technology to realize intelligent space, but IP network could only provide the "Best Effort" service, and could not ensure the quality of service. In this dissertation, the author presents the academic and algorithmic researches on intelligent space model based on IP network and quality of service unicast routing in model network. And the researches involve intelligent space model based on IP network, eliminating the influence of the imprecise state information to routing algorithms, various unicast routing algorithms of model network, like distributed routing algorithm, source routing algorithm and swarm intelligence routing algorithm, utilization of traffic engineering, and so on. (1) Constructs an intelligent space model based on IP network, according to the computer and network technology, voice compression and transmission technology, video compression and transmission technology, and building automation and control technology. The model could realize the perfect integration of control network and system, data network and system, voice network and system and video network and system, and provide powerful information and resource share. (2) Proposes a novel method to solve the influence of imprecise state information in intelligent space based on the cause of imprecision. It doesn't need any assumption for probability distribution or extremum of state information, and use existing information to choose an appropriate path meeting constraints of quality of service, which is least affected in probability by imprecise information. It can effectively weaken the influence to routing algorithms caused by network state information imprecision in intelligent space. (3) Proposes an extended Dijkstra unicast routing algorithm based on non-dominated paths for solving the multi-constrained path problem with imprecise information in intelligent space. It can weaken the influence of state information imprecision and efficiently utilize resource by searching paths with a combined main parameter of all metric. And it can reduce the computational complexity by limiting the counts of non-dominated paths kept at network nodes. The computerized simulations show that the algorithm is simple, efficient, scaleable and quickly convergent. It can weaken the influence of state information imprecision to a certain extend, and provide multi-constrained routing choices for the operations and applications of intelligent space. (4) Proposes a limited selective flooding unicast routing algorithm based on non-dominated paths for solving the multi-constrained path problem with imprecise information in intelligent space. It can reduce the time complexity and the space complexity by limiting the counts of non-dominated paths kept at network nodes and restricting the usage times of all network links. The computerized simulations show that the algorithm is simple, efficient, scaleable and quickly convergent. It can effectively weaken the influence of state information imprecision, and provide multi-constrained routing choices for the operations and applications of intelligent space. (5) Proposes a distributed unicast routing framework with extensive applicability, which is designed to solve NP-complete routing problems with imprecise information in intelligent space. Based on the framework, the typical NP-complete routing problems of intelligent space are analyzed and solved. The computerized simulations show that the framework is simple, scaleable and quickly convergent. It can effectively weaken the influence of state information imprecision, effectually solve the NP-complete routing problem, and provide routing choices with quality of service for various operations and applications of intelligent space.(6) Proposes an improved artificial ant colony algorithm for solving the problem that the capacities of paths are limited. It modifies the path selection rule by combining traffic engineering and can provide load balance for multi paths. And it can strengthen load balance of networks if it is used by routing algorithm. (7) Proposes a swarm intelligence unicast routing strategy based on local network state information. It doesn't need the network update of state information, while provides a same routing table for all applications by utilizing mobile agents which are unrelated with applications and perform the improved artificial ant colony algorithm. And it searches an appropriate path for an application call by utilizing mobile agents which are corresponding to the call and contain appointed quality of service parameters. It is extensively appliable for various quality of service routing problems of intelligent space, is able to provide routing choices of quality of service for the operations and applications, and can ensure good scaleable for new future applications. (8) Constructs an extended Dijkstra unicast routing algorithm based on traffic engineering for solving the bandwidth constrained delay constrained path problem, and research the influence of traffic engineering to routing algorithms. The computerized simulations show that the algorithm is simple and efficient, and can increase resource usage ratio and efficiently reduce the call bock ratio. It can adapt networks whose bandwidths of links are not same, and effectively solve the bandwidth constrained delay constrained path problem. Also, the simulations indicate that reasonable usage of traffic engineering can efficiently improve the performance of routing algorithms.
|
PDF Full Text Request