首页 | 本学科首页   官方微博 | 高级检索  
相似文献
 共查询到10条相似文献,搜索用时 234 毫秒
1.
In this paper, we utilize admission control algorithms designed for revenue optimization with QoS guarantees to derive optimal pricing of multiple service classes in wireless cellular networks. A service provider typically adjusts pricing only periodically. Once a “global” optimal pricing is derived, it would stay static for a period of time, allowing users to be charged with the same rate while roaming. We utilize a hybrid partitioning-threshold admission control algorithm to analyze a pricing scheme that correlates service demand with pricing, and to periodically determine optimal pricing under which the system revenue is maximized while guaranteeing that QoS requirements of multiple service classes are satisfied.  相似文献   

2.
Next generation of wireless cellular networks aim at supporting a diverse range of multimedia services to mobile users with guaranteed quality of service (QoS). Resource allocation and call admission control (CAC) are key management functions in future 3G and 4G cellular networks, in order to provide multimedia applications to mobile users with QoS guarantees and efficient resource utilization. There are two main strategies for radio resource allocations in cellular wireless networks known as complete partitioning (CP) and complete sharing (CS). In this paper, theses strategies are extended for operation in 3G and beyond network. First, two CS-based call admission controls, referred to herein as queuing priority call admission control (QP-CAC) and hybrid priority call admission control (HP-CAC), and one CP-based call admission control referred to as complete partitioning call admission control (CP-CAC) are presented. Then, this study proposes a novel dynamic procedure, referred to as the dynamic prioritized uplink call admission control (DP-CAC) designed to overcome the shortcomings of CS and CP-based CACs. Results indicate the superiority of DP-CAC as it is able to achieve a better balance between system utilization, revenue, and quality of service provisioning. CS-based algorithms achieve the best system utilization and revenue at the expense of serious unfairness for the traffic classes with diverse QoS requirements. DP-CAC manages to attain equal system utilization and revenue to CS-based algorithms without the drawbacks in terms of fairness and service differentiation.  相似文献   

3.
We propose and analyze a self-adjusting Quality of Service (QoS) control scheme with the goal of optimizing the system reward as a result of servicing different priority clients with varying workload, QoS and reward/penalty requirements. Our scheme is based on resource partitioning and designated “degrade QoS areas” such that system resources are partitioned into priority areas each of which is reserved specifically to serve only clients in a corresponding class with no QoS degradation, plus one “degraded QoS area” into which all clients can be admitted with QoS adjustment being applied only to the lowest priority clients. We show that the best partition is dictated by the workload and the reward/penalty characteristics of clients in difference priority classes. The analysis results can be used by a QoS manager to optimize the system total reward dynamically in response to changing workloads at run time. We demonstrate the validity of our scheme by means of simulation and comparing the proposed QoS self-adjusting scheme with those that do not use resource partitioning or designated degraded QoS areas.  相似文献   

4.
In this paper, a distributed-request-based CDMA DiffServ (differentiated service) call admission control (CAC) scheme is proposed to provide various multimedia services seamlessly in wireless mobile Internet. Conventional CDMA CAC schemes cannot fully support DiffServ QoS (Quality of Service) and seamless handoff due to lack of consideration on service priority and seamless mobility. Therefore, in order to achieve QoS guarantee for each service class, seamless fast-handoff, and high utilization of the scarce wireless resource, we define a code assignment policy and an adaptive access permission scheme taking each user’s service priority and mobility into consideration. For that purpose, in the proposed scheme, the DQRUMA/CDMA is combined with the new code assignment scheme and the adaptive access permission probability (APP). Numerical examples show that the forced termination ratio of handoff calls is guaranteed to be much less than the blocking ratio of new calls for a seamless fast-handoff while proposed scheme provides QoS guarantee for each service class efficiently.  相似文献   

5.
无线网络包调度算法综述   总被引:4,自引:0,他引:4  
无线网络介质的广播特性使得相邻用户的业务传输产生竞争,并且网络所支持的支持业务也呈多样发展,而调度规则不仅可以解决竞争问题,还可以保证不同业务的QoS。该文概述了当前提出的用于无线网络的包调度算法,提出了还需解决的问题。  相似文献   

6.
高延迟及低效益是无线Mesh网络中开展流媒体业务面临的主要问题。为解决该问题,首先赋予组播业务价值,该值反映了业务的网络优先级及效益优先级,并提出一个基于组播价值优先级的组播带宽分配方案。该方案第一阶段实施基于价值优先级的不区分业务类型的静态分配,通过对高价值业务的优先调度,实现了组播价值最大化及带宽效益最大化。在拥塞时,实施第二阶段的基于业务带宽需求调整及抢占的动态分配,保证了低时延约束业务的服务质量。仿真与常见算法的比较表明,所提出的方案在保证业务网络服务质量的同时,能实现带宽效益最大化。  相似文献   

7.
Next generation networks (NGN) are designed to support a wide range of applications with various service classes (SCs) guaranteeing the respective quality of service (QoS) levels. Since such networks are resource constrained, call admission control (CAC) is imperative to achieve the required QoS levels. In this paper, a new probabilistic framework for CAC schemes is proposed based on controlling each SC independently by admitting low priority SC calls with a variable imposed probability. The incorporation of such a probabilistic framework is considered under a bandwidth-centric approach named probabilistic bandwidth reservation scheme (PBRS). Though equal service times are usually assumed in the literature, the present analysis considers SCs of different service times. By employing Markov chain analysis to treat the independent SCs that correspond to different call specifications, analytical expressions for the call blocking probabilities (CBPs) are derived. The performance of the proposed CAC scheme is studied not only with regard to CBP but, also, taking into account the priorities assigned to different SCs as well as fairness among various SCs and total network throughput. The proposed probabilistic framework allows the dynamic control of network resources considering also priority assignment, fairness and throughput. Analytical results concerning delay tolerant (DT) and delay-non-tolerant (DNT) traffic have been obtained applying the proposed scheme. Moreover, the relevant simulations have verified the accuracy of the proposed analysis.  相似文献   

8.
We are currently witnessing a growing interest of network operators to migrate their existing 2G/3G networks to 4G technologies such as long-term evolution (LTE) to enhance the user experience and service opportunities in terms of providing multi-megabit bandwidth, more efficient use of radio networks, latency reduction, and improved mobility. Along with this, there is a strong deployment of packet data networks such as those based on IEEE 802.11 and 802.16 standards. Mobile devices are having increased capabilities to access many of these wireless networks types at the same time. Reinforcing quality of service (QoS) in 4G wireless networks will be a major challenge because of varying bit rates, channel characteristics, bandwidth allocation and global roaming support among heterogeneous wireless networks. As a mobile user moves across access networks, to the issue of mapping resource reservations between different networks to maintain QoS behavior becomes crucial. To support global roaming and interoperability across heterogeneous wireless networks, it is important for wireless network operators to negotiate service level agreement (SLA) contracts relevant to the QoS requirements. Wireless IP traffic modeling (in terms of providing assured QoS) is still immature because the majority of the existing work is merely based on the characterization of wireless IP traffic without investigating the behavior of queueing systems for such traffic. To overcome such limitations, we investigate SLA parameter negotiation among heterogeneous wireless network operators by focusing on traffic engineering and QoS together for 4G wireless networks. We present a novel mechanism that achieves service continuity through SLA parameter negotiation by using a translation matrix, which maps QoS parameters between different access networks. The SLA matrix composition is modeled analytically based on the G/M/1 queueing system. We evaluate the model using two different scheduling schemes and we derive closed form expressions for different QoS parameters for performance metrics such as packet delay and packet loss rate. We also develop a discrete event simulator and conduct a series of simulation experiments in order to understand the QoS behavior of corresponding traffic classes.  相似文献   

9.
Scheduling algorithms for high-speed wireless networks need to be simple to implement for serving packets while ensuring quality-of-service (QoS). The ordinary frame-based scheduling principle is well-known for providing fair service with low implementation complexity. However, existing frame-based scheduling algorithms cannot properly handle location-dependent burst errors in wireless networks. To utilize the advantages of frame-based scheduling algorithms in error-prone wireless networks, we propose an elastic compensation model that provides not only smooth compensations without any service disruptions of flows but also flexible compensations to flows that experience frequent errors to provide flows with fairness of service. From our analysis and simulation studies, we found that the proposed compensation model shows smooth compensation performance without any service disruption periods and good fairness performance when channel errors occur.  相似文献   

10.
Design and implementation of QoS-provisioning system for voice over IP   总被引:1,自引:0,他引:1  
In this paper, we address issues in implementing voice over IP (VoIP) services in packet switching networks. VoIP has been identified as a critical real-time application in the network QoS research community and has been implemented in commercial products. To provide competent quality of service for VoIP systems comparable to traditional PSTN systems, a call admission control (CAC) mechanism has to be introduced to prevent packet loss and over-queuing. Several well-designed CAC mechanisms, such as the site-utilization-based CAC-and the link-utilization-based CAC mechanisms have been in place. However, the existing commercial VoIP systems have not been able to adequately apply and support these CAC mechanisms and, hence, have been unable to provide QoS guarantees to voice over IP networks. We have designed and implemented a QoS-provisioning system that can be seamlessly integrated with the existing VoIP systems to overcome their weakness in offering QoS guarantees. A practical implementation of our QoS-provisioning system has been realized.  相似文献   

设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号