共查询到20条相似文献,搜索用时 539 毫秒
1.
In this paper, we propose a novel downlink resource management framework for multiservice WiMAX (worldwide interoperability for microwave access) networks. Our framework consists of two major components: adaptive power allocation (APA) and call admission control (CAC). We formulate each of them as an optimization problem, where the demands of both WiMAX service providers and subscribers are taken into account. To solve the optimization problems, we develop a fairness-constrained greedy revenue algorithm for downlink APA optimization and a utility-constrained greedy approximation algorithm for downlink CAC optimization. Our simulation results show that, when combining the APA and CAC optimization methods together, the proposed resource management framework can meet the expectations of both service providers and subscribers 相似文献
2.
Bo Rong Yi Qian Hsiao-Hwa Chen 《Wireless Communications, IEEE》2007,14(1):14-19
To achieve a successful broadband wireless access solution, the IEEE 802.16 subcommittee has released a series of standards for WiMAX (worldwide interoperability for microwave access). From a technical viewpoint, WiMAX is a feasible alternative to the wired Internet access solutions such as cable modem and DSL. Nevertheless, from the commercial viewpoint, whether the promise of WiMAX will be materialized still depends on its revenue rate to telecom operators and its service quality to the subscribers. In such a context, this article addresses two resource management mechanisms in WiMAX access networks, that is, adaptive power allocation (APA) and call admission control (CAC), from the perspectives of both service providers and WiMAX subscribers. APA emphasizes how to share the limited power resource of base station among different WiMAX subscribers and further influences the access bandwidth of each subscriber; CAC highlights how to assign a subscriber's access bandwidth to different types of applications. Moreover, to build a WiMAX access network, APA and CAC have to work cooperatively to provide cross-layer resource management. In this article we focus on the OFDMA-TDD system, which allows high spectrum-utility efficiency on uplink and downlink channels in the asymmetric scenario of "lastmile" Internet access. We conclude the article with an optimization strategy to balance service provider's revenue and subscriber's satisfaction 相似文献
3.
Previous studies of call admission control (CAC) in mobile communication networks focused on call blocking and call dropping
mechanisms. However, achieving global optimization of the system benefit is a complicated process. In this paper, we propose
a benefit optimization model that accommodates as many users as possible, while simultaneously maintaining system-wide quality
of service (QoS) in terms of admission control. To clarify the CAC concept, we construct a framework of CAC policies, derive
associated interference models based on the framework, and then investigate the effects of the policies on the system benefit.
In addition, to solve the complicated integer programming problem, we adopt the Lagrangean relaxation approach, and employ
Lagrangean multipliers to perform sensitivity analysis of several parameters. The contribution of this study is twofold: the
novel problem formulation and the improvement in the system benefit. The computational results demonstrate that the system
accrues more benefit as new traffic is loaded and the number of users increases. Meanwhile, the sensitivity analysis shows
that proper assignment of the strength of power-controlled signals is a key factor in the global optimization of the system
benefit. 相似文献
4.
Okan Yilmaz Ing-Ray Chen Gregory Kulczycki William B. Frakes 《Wireless Personal Communications》2010,53(1):111-131
We propose and analyze spillover-partitioning call admission control (CAC) for servicing multiple service classes in mobile wireless networks for revenue optimization with quality of service (QoS) guarantees. We evaluate the performance of spillover-partitioning CAC in terms of execution time and optimal revenue obtainable by comparing it with existing CAC algorithms, including partitioning, threshold, and partitioning-threshold hybrid admission control algorithms. We also investigate fast spillover-partitioning CAC that applies a greedy heuristic search method to find a near optimal solution fast to effectively trade off solution quality for solution efficiency. The solution found by spillover-partitioning CAC is evaluated by an analytical model developed in the paper. We demonstrate through test cases that spillover-partitioning CAC outperforms existing CAC algorithms for revenue optimization with QoS guarantees in both solution quality and solution efficiency for serving multiple QoS service classes in wireless networks. 相似文献
5.
J. Siwko I. Rubin 《International Journal of Satellite Communications and Networking》2000,18(2):87-106
Many networks, such as non‐geostationary orbit satellite (NGOS) networks and networks providing multi‐priority service using advance reservations, have capacities which vary over time for some or all types of calls carried on these networks. For connection‐oriented networks, call admission control (CAC) policies which only use current capacity information may lead to excessive and intolerable dropping of admitted calls whenever the network capacity decreases. Thus novel CAC policies are required for these networks. We present the admission limit curve (ALC) and prove it is a constraint limiting the conditions under which any causal CAC policy may admit calls and still meet call dropping guarantees on an individual call basis. The ALC also leads to a lower bound on the call blocking performance achievable by any causal CAC policy which provides dropping guarantees to individual calls. Also, we introduce a new CAC policy which uses knowledge of future capacity changes to provide dropping guarantees on an individual call basis and which achieves blocking performance close to the lower bound. Copyright © 2000 John Wiley & Sons, Ltd. 相似文献
6.
We solve the adaptive call admission control (CAC) problem in multimedia networks via reinforcement learning (RL). The problem requires that network revenue be maximized while simultaneously meeting quality of service (QoS) constraints that forbid entry into certain states and use of certain actions. We show that RL provides a solution to this constrained semi-Markov decision problem and is able to earn significantly higher revenues than alternative heuristics. Unlike other model-based algorithms, RL does not require the explicit state transition models to solve the decision problems. This feature is very important if one considers large integrated service networks supporting a number of different service types, where the number of states is so large that model-based optimization algorithms are infeasible. Both packet-level and call-level QoS constraints are addressed, and both conservative and aggressive approaches to the QoS constraints are considered. Results are demonstrated on a single link and extended to routing on a multilink network 相似文献
7.
This paper proposes a prioritized call admission control (CAC) model to support soft handoff calls with quality of service (QoS) assurances for both the uplink and downlink connections in a CDMA system. CAC is formulated as a combinatorial optimization problem in which the problem objective is to minimize the handoff forced termination rate. The model, which is based on the adaptive channel reservation (ACR) scheme for prioritized calls, adapts to changes in handoff traffic where the associated parameters (reserved channels, and new and handoff call arrival rates) can be varied. To solve the optimization model, iteration-based Lagrangean relaxation is applied by allocating a time budget. We express our achievements in terms of the problem formulation and performance improvement. Computational experiments demonstrate that the proposed ACR scheme outperforms other approaches when there are fewer rather than more channels, and it reduces the handoff call blocking rate more efficiently when the handoff traffic is heavily loaded. Moreover, the model can be adapted to any kind of reservation service. 相似文献
8.
无线移动网中呼叫接纳控制模型分析 总被引:7,自引:1,他引:6
新一代无线网应该能够同时支持传统的数据业务和实时交互式多媒体业务,并能够为用户提供QoS保证。在无线网中提供QoS保证,呼叫接纳控制扮演着重要的角色。对已有的呼叫接纳控制方面的研究成果进行了归纳、总结和分析,以期得出适合于无线移动多媒体网络的呼叫接纳控制模型。为适应当前的多媒体应用,侧重于对和适应性带宽分配相结合的接纳控制模型的分析。另外,介绍了与价格机制相结合的接纳控制模型,经济学概念的引入,为我们解决问题提供了一种新的视角。 相似文献
9.
Joint connection-level and packet-level quality-of-service support for VBR traffic in wireless multimedia networks 总被引:4,自引:0,他引:4
In this paper, we investigate call admission control (CAC) schemes that can jointly provide connection-level quality-of-service (QoS) (in terms of the new call blocking probability and the handoff dropping probability) and packet-level QoS (in terms of the packet loss probability) for wireless multimedia networks. Stationary CAC schemes are proposed as the results of the solution to constrained optimization problems. A dynamic CAC scheme that can be adapted to varied and varying traffic conditions dynamically is also proposed. The proposed CAC schemes are computationally efficient and easy to implement, thus being suitable for real-time system deployment. Simulation results have demonstrated that the proposed dynamic CAC scheme achieves better performance when applied to realistic traffic conditions found in wireless multimedia networks. 相似文献
10.
Jyrki Ari Timo Mika 《AEUE-International Journal of Electronics and Communications》2007,61(2):118-126
In this paper we present a packet scheduling method which guarantees bandwidth of the connection and optimizes revenue of the network service provider. A closed form formula for updating the adaptive weights of a packet scheduler is derived from a revenue-based optimization problem. The weight updating procedure is fast and independent on the assumption of the connections’ statistical behavior. The features of the algorithm are simulated and analyzed with and without a call admission control (CAC) mechanism. We also show in context with the CAC procedure a mechanism for guaranteeing a specified mean bandwidth for different service classes. 相似文献
11.
Bensaou B. Lam S.T.C. Hon-Wai Chu Tsang D.H.K. 《Networking, IEEE/ACM Transactions on》1997,5(4):572-584
An important parameter in asynchronous transfer model (ATM)-based network design and management is the cell loss ratio (CLR) in ATM multiplexers. It is a key parameter to many vital functions in the network such as call admission control (CAC), bandwidth allocation, etc. However, the CLR depends usually on many unknown and unpredictable traffic parameters such as input traffic correlations. In this paper, we propose a simple and robust fuzzy-based algorithm to predict the CLR in large-sized systems based on both a small amount of information from small-sized systems, and the asymptotic behavior for very large systems. Unlike the model-based approaches, our approximation avoids the problem of assuming any traffic parameters or arrival process. This algorithm is used with real-time traffic measurement to propose an effective measurement-based call admission control framework for ATM networks 相似文献
12.
13.
Sidi‐Mohammed Senouci Andr‐Luc Beylot Guy Pujolle 《International Journal of Network Management》2004,14(2):89-103
In this paper, we address the call admission control (CAC) problem in a cellular network that handles several classes of traffic with different resource requirements. The problem is formulated as a semi‐Markov decision process (SMDP) problem. We use a real‐time reinforcement learning (RL) [neuro‐dynamic programming (NDP)] algorithm to construct a dynamic call admission control policy. We show that the policies obtained using our TQ‐CAC and NQ‐CAC algorithms, which are two different implementations of the RL algorithm, provide a good solution and are able to earn significantly higher revenues than classical solutions such as guard channel. A large number of experiments illustrates the robustness of our policies and shows how they improve quality of service (QoS) and reduce call‐blocking probabilities of handoff calls even with variable traffic conditions. Copyright © 2004 John Wiley & Sons, Ltd. 相似文献
14.
Panagakis A. Dukkipati N. Stavrakakis I. Kuri J. 《Networking, IEEE/ACM Transactions on》2004,12(5):865-878
The problem of call admission control (CAC) is considered for leaky bucket constrained sessions with deterministic service guarantees (zero loss and finite delay bound) served by a generalized processor sharing scheduler at a single node in the presence of best effort traffic. Based on an optimization process, a CAC algorithm capable of determining the (unique) optimal solution is derived. The derived algorithm is also applicable, under a slight modification, in a system where the best effort traffic is absent and is capable of guaranteeing that if it does not find a solution to the CAC problem, then a solution does not exist. The numerical results indicate that the CAC algorithm can achieve a significant improvement on bandwidth utilization as compared to a (deterministic) effective bandwidth-based CAC scheme. 相似文献
15.
Yuguang Fang Yi Zhang 《Vehicular Technology, IEEE Transactions on》2002,51(2):371-382
Call admission control (CAC) plays a significant role in providing the desired quality of service in wireless networks. Many CAC schemes have been proposed. Analytical results for some performance metrics such as call blocking probabilities are obtained under some specific assumptions. It is observed, however, that due to the mobility, some assumptions may not be valid, which is the case when the average values of channel holding times for new calls and handoff calls are not equal. We reexamine some of the analytical results for call blocking probabilities for some call admission control schemes under more general assumptions and provide some easier-to-compute approximate formulas 相似文献
16.
For a single network switch allocating link bandwidth to connections of a single class, an optimal call admission control (CAC) policy is found by the solution of a linear programming (LP) problem. Our optimization differs from previous work in that we include the effect of an output buffer in the switch for the temporary storage of packets bound for transmittal across the link. We find a policy that is optimal in the sense of minimizing call blocking subject to a packet level quality of service (QoS) requirement that limits the packet loss ratio. Such a policy's call blocking probability, if it is small enough to satisfy a call level QoS requirement, then establishes the feasibility of satisfying both the packet and call level QoS requirements for a given call request rate. We show with a previously described example that the addition of even a small output buffer can significantly increase the range of call request rates for which there exists a feasible policy, i.e. one that satisfies both QoS requirements. Also presented is an upper bound, valid for any fixed buffer size, on the range of call request rates for which there exists a feasible CAC policy. Copyright © 2003 John Wiley & Sons, Ltd. 相似文献
17.
A probabilistic approach for fair-efficient call admission control in wireless multiservice networks
Dimitrios G. Stratogiannis John D. Kanellopoulos Panayotis G. Cottis 《International Journal of Electronics》2013,100(12):1405-1422
The efficiency of call admission control (CAC) schemes in multiclass wireless networks should be evaluated not only with regard to the call blocking probability (CBP) achieved for every service class (SC) supported but also with regard to quality of service (QoS) and network efficiency criteria. In this article, four CAC schemes offering priority to SCs of advanced QoS requirements, based on guard channel policy, are studied and evaluated taking into account fairness and throughput criteria in addition to CBP. For the performance evaluation of the proposed CAC schemes and to examine fairness issues, two fairness indices are introduced along with a throughput metric. The analytical results, validated through extensive simulations, indicate that by appropriate selection of the CAC parameters satisfactory fairness and throughput are achieved while achieving low CBP. 相似文献
18.
In wireless cellular communication systems, call admission control (CAC) is to ensure satisfactory services for mobile users and maximize the utilization of the limited radio spectrum. In this paper, we propose a new CAC scheme for a code division multiple access (CDMA) wireless cellular network supporting heterogeneous self-similar data traffic. In addition to ensuring transmission accuracy at the bit level, the CAC scheme guarantees service requirements at both the call level and the packet level. The grade of service (GoS) at the call level and the quality of service (QoS) at the packet level are evaluated using the handoff call dropping probability and the packet transmission delay, respectively. The effective bandwidth approach for data traffic is applied to guarantee QoS requirements. Handoff probability and cell overload probability are derived via the traffic aggregation method. The two probabilities are used to determine the handoff call dropping probability, and the GoS requirement can be guaranteed on a per call basis. Numerical analysis and computer simulation results demonstrate that the proposed CAC scheme can meet both QoS and GoS requirements and achieve efficient resource utilization. 相似文献
19.
Levendovszky J. Fancsali A. 《IEEE transactions on circuits and systems. I, Regular papers》2004,51(6):1172-1183
In this paper, novel call admission control (CAC) algorithms are developed based on cellular neural networks. These algorithms can achieve high network utilization by performing CAC in real-time, which is imperative in supporting quality of service (QoS) communication over packet-switched networks. The proposed solutions are of basic significance in access technology where a subscriber population (connected to the Internet via an access module) needs to receive services. In this case, QoS can only be preserved by admitting those user configurations which will not overload the access module. The paper treats CAC as a set separation problem where the separation surface is approximated based on a training set. This casts CAC as an image processing task in which a complex admission pattern is to be recognized from a couple of initial points belonging to the training set. Since CNNs can implement any propagation models to explore complex patterns, CAC can then be carried out by a CNN. The major challenge is to find the proper template matrix which yields high network utilization. On the other hand, the proposed method is also capable of handling three-dimensional separation surfaces, as in a typical access scenario there are three traffic classes (e.g., two type of Internet access and one voice over asymmetric digital subscriber line. 相似文献
20.
Bandwidth management and traffic control are critical issues to guarantee the quality of service in cognitive radio networks. This paper exploits a network load refinement approach to achieve the efficient resource utilization and provide the required quality of service. A connection admission control approach is introduced in cognitive radio multimedia sensor networks to provide the data transmission reliability and decrease jitter and packet end‐to‐end delay. In this approach, the admission of multimedia flows is controlled based on multimedia sensors' correlation information and traffic characteristics. We propose a problem, connection admission control optimization problem, to optimize the connection admission control operation. Furthermore, using a proposed weighting scheme according to the correlation of flows issued by multimedia sensors enables us to convert the connection admission control optimization problem to a binary integer‐programming problem. This problem is a kind of a Knapsack problem that is solved by a branch and bound method. Simulation results verify the proposed admission control method's effectiveness and demonstrate the benefits of admission control and traffic management in cognitive radio multimedia sensor networks. Copyright © 2015 John Wiley & Sons, Ltd. 相似文献