With traditional network architecture, it is hard to reach the requirement of elasticity deployment of the network. With virtual network architecture, although it is relatively easy to setup the network, but the system manager still needs tons of setup steps to accomplish his mission. Moreover, the setup steps of the solutions of virtual network are various, and give no guarantee to its consistency. In this paper, we introduce a new approach of network deployment mechanism, named "Mechanism of Automatic Deployment for Virtual Network Environment, MADV", to simplify the setup steps, and make it more friendly and ease to use for the newbies. We believe that with the MADV mechanism, the system manger can use it to deploy the hosts with low cost.

This paper presents an integrated solution for code management, assignment, and reassignment problems in UMTS. We propose a new architecture for code management and, based upon this new architecture, a code assignment strategy, referred to as "crowded-group first strategy". Our system architecture and code assignment strategy represent significant improvements both in the time complexity and the maintenance complexity. Moreover, the code blocking probability of the crowded-group first strategy is competitive to that of the other strategies. In this paper, we also propose a new code reassignment strategy, called the "crowded-branch first strategy". The main objective of this reassignment strategy is to reduce reassigned call probability with low computation overhead and extend this strategy for the general case. In order to systematically analyze the performances of the code assignment strategy, we implement a simulator to analyze the code selection behavior and code blocking probability of each strategy. Moreover, we propose some new performance metrics, named "weighted code blocking", "reassigned call probability", and "ratio of actual code reassignments", in order to precisely measure the performance obtained by different strategies. From the simulation results, we show that our proposed strategies efficiently utilize the OVSF codes with low computation overhead.

In 3G WCDMA, several multi-code assignment mechanisms have proposed to reduce the waste rate. Nevertheless, these methods bring two inevitable drawbacks including, high complexity of handling multiple codes, and increasing the cost of using more rake combiners at both the base stations and mobile nodes. Therefore, we propose an adaptive grouping code assignment herein to provide a single channelization code for any possible rate of traffic, even though the required rate is not powers of two of the basic rate. Based on the dynamic programming algorithm, the adaptive grouping approach forms several calls into a group. Then it allocates a subtree to the group and adaptively shares the subtree codes for these calls in the concept of time-sharing of slots during a group cycle time. Numerical results indicate that the proposed adaptive grouping approach reduces significantly the waste rate and thus increases the system utilization.

This paper presents an integrated solution to the code management and assignment problem in the UMTS system. We propose a new architecture for code management, and based upon this new architecture, a new code assignment strategy, referred to as 'crowded-group first strategy'. Our system architecture and code assignment strategy represent significant improvements in the time complexity and in the complexity of the storage operation. Moreover, the code blocking probability of the crowded-group first strategy can be as good as that of the crowded-first strategy. In order to systematically analyze the performance of the code assignment strategies, we implement a simulator to analyze the code selection behavior of each strategy, and the performance of the code blocking can be anticipated based on the analysis. We also propose a new performance metric, named 'weighted code blocking', in order to precisely measure the performance obtained by different strategies. From the simulation results, we show that our strategy efficiently utilizes the OVSF codes with the low computation overhead.

Since the orthogonal characteristic of the orthogonal variable spreading factor (OVSF) code tree in wideband CDMA (WCDMA) systems, code blocking increases as traffle load or required rate increases. This causes inefficient utilization of channelization codes. Hence, how to efficiently manage the resource of channelization codes of OVSF code tree in WCDMA is an important issue and has been studied extensively. Therefore, in this paper we focus on how to assign channelization code efficiently. Additionally, most researches did not consider the analysis of tree state with dynamic traffic load and lack of systematic call admission control (CAC) mechanism. Therefore, in this paper, we first propose the Markov decision process (MDP) based analysis to assign channelization codes efficiently. Next, we extend the MDP-based approach as the call admission control mechanism to maximize system revenue while reducing blocking. Numerical results indicate that the proposed MDP approach yields the best fractional reward loss and code blocking reward loss as compare to that of others, including the random, left most, and crowded first schemes, and the MDP-based CAC outperforms the capacity-based CAC significantly.

In this paper we study the path-constrained-cost-optimized routing problem, which tries to minimize path cost while satisfying the QoS requirements of a connection. In previous research, each link of the network is associated with a set of QoS metrics, which represents the QoS metrics that can be provided by this link. However, in a real network, ATM switches are able to provide a finite number of QoS classes, instead of just one QoS class. Therefore, in this paper, we studied the path-constrained-cost-optimized routing problem where each link of the network is associated with several sets of QoS metrics. Our solution to this problem consists of two tasks: QoS decomposition and QoS-constrained least cost routing. We propose a greedy algorithm to decompose the end-to-end QoS constraint to local QoS constraints such that the path cost can be minimized. For QoS-constrained least cost routing, we first study three approaches for defining link costs. We then propose two routing algorithms for finding QoS-constrained paths.