The optimal solution of the multi-constrained QoS multicast routing problem is a tree-like hierarchical structure in the topology graph. This multicast route contains a feasible path from the source node to each of th...The optimal solution of the multi-constrained QoS multicast routing problem is a tree-like hierarchical structure in the topology graph. This multicast route contains a feasible path from the source node to each of the destinations with respect to a set of QoS constraints while minimizing a cost function. Often, it is a tree. In other cases, the hierarchies can return several times to nodes and links of the topology graph. Similarly to Steiner problem, finding such a structure is an NP-hard problem. The usual tree and topology enumeration algorithms applied for the Steiner problem cannot be used to solve the addressed problem. In this paper, we propose an exact algorithm based on the Branch and Bound principle and improved by the Lookahead technique. We show relevant properties of the optimum hierarchy permitting efficient pruning of the search space. To our knowledge, our paper is the first to propose an exact algorithm for this non-trivial multi-constrained optimal multicast route computation. Simulations illustrate the efficiency of the proposed pruning operations. The analysis of the execution time shows that in simple topologies and with tight QoS constraints the exact algorithm requires relatively little execution time. With loose constraints the computation time cannot be tolerated even for off-line route computation. In these cases, the solution is close to a Steiner tree and heuristics can be applied. These results can serve as basis for the design of efficient, polynomial-time routing algorithms.展开更多
An assessment method for the quality of service （QoS） of virtual knowledge communities （VKC） is proposed based on fuzzy theory and analytic hierarchy process （AHP）. The QoS is evaluated in terms of Website desig...An assessment method for the quality of service （QoS） of virtual knowledge communities （VKC） is proposed based on fuzzy theory and analytic hierarchy process （AHP）. The QoS is evaluated in terms of Website design, reliability, responsiveness, trust, personalization, and information quality. The cognitive QoS and the QoS evaluated by assessors are compared to analyze which QoS of the VKC should be improved urgently and which indicators keep leading positions, and to assist administrators of the VKC on measuring and understanding current status and implementation effect of the QoS.展开更多
文摘The optimal solution of the multi-constrained QoS multicast routing problem is a tree-like hierarchical structure in the topology graph. This multicast route contains a feasible path from the source node to each of the destinations with respect to a set of QoS constraints while minimizing a cost function. Often, it is a tree. In other cases, the hierarchies can return several times to nodes and links of the topology graph. Similarly to Steiner problem, finding such a structure is an NP-hard problem. The usual tree and topology enumeration algorithms applied for the Steiner problem cannot be used to solve the addressed problem. In this paper, we propose an exact algorithm based on the Branch and Bound principle and improved by the Lookahead technique. We show relevant properties of the optimum hierarchy permitting efficient pruning of the search space. To our knowledge, our paper is the first to propose an exact algorithm for this non-trivial multi-constrained optimal multicast route computation. Simulations illustrate the efficiency of the proposed pruning operations. The analysis of the execution time shows that in simple topologies and with tight QoS constraints the exact algorithm requires relatively little execution time. With loose constraints the computation time cannot be tolerated even for off-line route computation. In these cases, the solution is close to a Steiner tree and heuristics can be applied. These results can serve as basis for the design of efficient, polynomial-time routing algorithms.
文摘An assessment method for the quality of service （QoS） of virtual knowledge communities （VKC） is proposed based on fuzzy theory and analytic hierarchy process （AHP）. The QoS is evaluated in terms of Website design, reliability, responsiveness, trust, personalization, and information quality. The cognitive QoS and the QoS evaluated by assessors are compared to analyze which QoS of the VKC should be improved urgently and which indicators keep leading positions, and to assist administrators of the VKC on measuring and understanding current status and implementation effect of the QoS.
