367 research outputs found
Recommended from our members
A connection-level call admission control using genetic algorithm for MultiClass multimedia services in wireless networks
Call admission control in a wireless cell in a personal communication system (PCS) can be modeled as an M/M/C/C queuing system with m classes of users. Semi-Markov Decision Process (SMDP) can be used to optimize channel utilization with upper bounds on handoff blocking probabilities as Quality of Service constraints. However, this method is too time-consuming and therefore it fails when state space and action space are large. In this paper, we apply a genetic algorithm approach to address the situation when the SMDP approach fails. We code call admission control decisions as binary strings, where a value of “1” in the position i (i=1,…m) of a decision string stands for the decision of accepting a call in class-i; a value of “0” in the position i of the decision string stands for the decision of rejecting a call in class-i. The coded binary strings are feed into the genetic algorithm, and the resulting binary strings are founded to be near optimal call admission control decisions. Simulation results from the genetic algorithm are compared with the optimal solutions obtained from linear programming for the SMDP approach. The results reveal that the genetic algorithm approximates the optimal approach very well with less complexity
STOCHASTIC MODELING AND TIME-TO-EVENT ANALYSIS OF VOIP TRAFFIC
Voice over IP (VoIP) systems are gaining increased popularity due to the cost effectiveness, ease of management, and enhanced features and capabilities. Both enterprises and carriers are deploying VoIP systems to replace their TDM-based legacy voice networks. However, the lack of engineering models for VoIP systems has been realized by many researchers, especially for large-scale networks. The purpose of traffic engineering is to minimize call blocking probability and maximize resource utilization. The current traffic engineering models are inherited from the legacy PSTN world, and these models fall short from capturing the characteristics of new traffic patterns. The objective of this research is to develop a traffic engineering model for modern VoIP networks. We studied the traffic on a large-scale VoIP network and collected several billions of call information. Our analysis shows that the traditional traffic engineering approach based on the Poisson call arrival process and exponential holding time fails to capture the modern telecommunication systems accurately. We developed a new framework for modeling call arrivals as a non-homogeneous Poisson process, and we further enhanced the model by providing a Gaussian approximation for the cases of heavy traffic condition on large-scale networks. In the second phase of the research, we followed a new time-to-event survival analysis approach to model call holding time as a generalized gamma distribution and we introduced a Call Cease Rate function to model the call durations. The modeling and statistical work of the Call Arrival model and the Call Holding Time model is constructed, verified and validated using hundreds of millions of real call information collected from an operational VoIP carrier network. The traffic data is a mixture of residential, business, and wireless traffic. Therefore, our proposed models can be applied to any modern telecommunication system. We also conducted sensitivity analysis of model parameters and performed statistical tests on the robustness of the models’ assumptions.
We implemented the models in a new simulation-based traffic engineering system called VoIP Traffic Engineering Simulator (VSIM). Advanced statistical and stochastic techniques were used in building VSIM system. The core of VSIM is a simulation system that consists of two different simulation engines: the NHPP parametric simulation engine and the non-parametric simulation engine. In addition, VSIM provides several subsystems for traffic data collection, processing, statistical modeling, model parameter estimation, graph generation, and traffic prediction. VSIM is capable of extracting traffic data from a live VoIP network, processing and storing the extracted information, and then feeding it into one of the simulation engines which in turn provides resource optimization and quality of service reports
Admission Control for Multiuser Communication Systems
During the last few years, broadband wireless communication has experienced very rapid growth in telecommunications industry. Hence, the performance analysis of such systems is one of the most important topics. However, accurate systems’ analysis requires first good modeling of the network traffic. Moreover, broadband wireless communication should achieve certain performance in order to satisfy the customers as well as the operators. Therefore, some call admission control techniques should be integrated with wireless networks in order to deny new users/services if accepting them will lead to degrade the network performance to less than the allowed threshold. This thesis mainly discusses the above two issues which can be summarized as follows. First issue is the traffic modeling of wireless communication. The performance analysis is discussed in terms of the quality of services (QoS) and also the grade of services (GoS). Different scenarios have been studies such as enhancing the GoS of handover users. The second issue is the admission control algorithms. Admission Control is part of radio resource management. The performance of admission control is affected by channel characteristics such as fading and interference. Hence, some wireless channel characteristics are introduced briefly. Seven different channel allocation schemes have been discussed and analyzed. Moreover, different admission control algorithms are analyzed such as power-based and multi-classes fuzzy-logic based. Some simulations analyses are given as well to show the system performance of different algorithms and scenarios.fi=Opinnäytetyö kokotekstinä PDF-muodossa.|en=Thesis fulltext in PDF format.|sv=Lärdomsprov tillgängligt som fulltext i PDF-format
Admission control for a capacitated supply system with real-time replenishment information
Control towers can provide real-time information on logistic processes to support decision making. The question however, is how to make use of it and how much it may save. We consider this issue for a company supplying expensive spare parts and which has limited production capacity. Besides deciding on base stock levels, it can accept or reject customers. The real-time status information is captured by a k-Erlang distributed replenishment lead time. First we model the problem with patient customers as an infinite-horizon Markov decision process and minimize the total expected discounted cost. We prove that the optimal policy can be characterized using two thresholds: a base work storage level that determines when ordering takes place and an acceptance work storage level that determines when demand of customers should be accepted. In a numerical study, we show that using real-time status information on the replenishment item and adopting admission control can lead to significant cost savings. The cost savings are highest when the optimal admission threshold is a work storage level with a replenishment item halfway in process. This finding is different from the literature, where it is stated that the cost increase of ignoring real-time information is negligible under either the lost sales or the backordering case. Next we study the problem where customers are of limited patience. We find that the optimal admission policy is not always of threshold type. This is different from the literature which assumes an exponential production lead time.</p
A Queuing Theoretic Scheme for a QoS-Enabled 4G Wireless Access
There will be heterogeneous wireless access networks in 4G systems, e.g., WLAN, UTRAN etc. The networks will need to support QoS provisioning and full mobility. For each connection request by a mobile user in such networks, there will be need for a scheme for selecting the best network from among the available networks. The research proposes a scheme that selects the best network based on the user_s QoS requirements. The scheme models each radio access network as a network of queuing nodes. This model then uses the network state (e.g. traffic arrival and service rates) to compute the end-to-end QoS parameter statistics (e.g., delay and throughput) of user traffic flow through each available network. We postulate that the statistics indicate the QoS capabilities of the network and can therefore be used to select the best network to serve the mobile user
Final report on the evaluation of RRM/CRRM algorithms
Deliverable public del projecte EVERESTThis deliverable provides a definition and a complete evaluation of the RRM/CRRM algorithms selected in D11 and D15, and evolved and refined on an iterative process. The evaluation will be carried out by means of simulations using the simulators provided at D07, and D14.Preprin
Hierarchical Beamforming: Resource Allocation, Fairness and Flow Level Performance
We consider hierarchical beamforming in wireless networks. For a given
population of flows, we propose computationally efficient algorithms for fair
rate allocation including proportional fairness and max-min fairness. We next
propose closed-form formulas for flow level performance, for both elastic (with
either proportional fairness and max-min fairness) and streaming traffic. We
further assess the performance of hierarchical beamforming using numerical
experiments. Since the proposed solutions have low complexity compared to
conventional beamforming, our work suggests that hierarchical beamforming is a
promising candidate for the implementation of beamforming in future cellular
networks.Comment: 34 page
- …