Learning-Based Admission Control for Low-Earth-Orbit Satellite Communication Networks

Satellite communications has been regarded as an indispensable technology for future mobile networks to provide extremely high data rates,ultra-reliability,and ubiquitous coverage.However,the high dynamics caused by the fast movement of low-earth-orbit(LEO)satellites bring huge challenges in designing and optimizing satellite communication systems.Especially,admission control,deciding which users with diversified service requirements are allowed to access the network with limited resources,is of paramount importance to improve network resource utilization and meet the service quality requirements of users.In this paper,we propose a dynamic channel reservation strategy based on the Actor-Critic algorithm(AC-DCRS)to perform intelligent admission control in satellite networks.By carefully designing the longterm reward function and dynamically adjusting the reserved channel threshold,AC-DCRS reaches a long-run optimal access policy for both new calls and handover calls with different service priorities.Numerical results show that our proposed AC-DCRS outperforms traditional channel reservation strategies in terms of overall access failure probability,the average call success rate,and channel utilization under various dynamic traffic conditions.

Admission Control Based on QoS for Third Generation Broadband Mobile Communication Systems

In this paper, a novel admission scheme is proposed which provides high degrees of quality of service (QoS) guarantees for multimedia traffic carried in mobile networks. The proposed scheme combines the admission control and bandwidth reservation to guarantee QoS requirements. It considers both local information and remote information to determine whether to accept or reject a connection. In order to embody the characteristics of the algorithms proposed in the article, two traditional algorithms of admission control are used for comparison. In the end of the paper the simulation analyses are given and the results show that the proposed algorithm can adjust the bandwidth according to the current status of networks and decrease the probability of connections forcibly dropped. The most important thing is that the algorithm is based on the multimedia communications and can guarantee the QoS of real time connections through decreasing the bandwidth of non real time connections.

Distributed Power Control for Energy Conservation in Hybrid Cellular Network with Device-to-Device Communication

Device-to-Device(D2D) communication has been proposed as a promising implementation of green communication to benefit the existed cellular network.In order to limit cross-tier interference while explore the gain of short-range communication,we devise a series of distributed power control(DPC) schemes for energy conservation(EC)and enhancement of radio resource utilization in the hybrid system.Firstly,a constrained opportunistic power control model is built up to take advantage of the interference avoidance methodology in the presence of service requirement and power constraint.Then,biasing scheme and admission control are added to evade ineffective power consumption and maintain the feasibility of the system.Upon feasibility,a non-cooperative game is further formulated to exploit the profit in EC with minor influence on spectral efficiency(SE).The convergence of the DPC schemes is validated and their performance is confirmed via simulation results.

A Combining Call Admission Control and Power Control Scheme for D2D Communications Underlaying Cellular Networks

As device-to-device(D2D) communications usually reuses the resource of cellular networks, call admission control(CAC) and power control are crucial problems. However in most power control schemes, total data rates or throughput are regarded as optimization criterion. In this paper, a combining call admission control(CAC) and power control scheme under guaranteeing QoS of every user equipment(UE) is proposed. First, a simple CAC scheme is introduced. Then based on the CAC scheme, a combining call admission control and power control scheme is proposed. Next, the performance of the proposed scheme is evaluated. Finally, maximum DUE pair number and average transmitting power is calculated. Simulation results show that D2 D communications with the proposed combining call admission control and power control scheme can effectively improve the maximum DUE pair number under the premise of meeting necessary QoS.

Joint Resource Allocation and Admission Control in Sliced Fog Radio Access Networks

Network slicing based fog radio access network(F-RAN) has emerged as a promising architecture to support various novel applications in 5 G-and-beyond wireless networks. However, the co-existence of multiple network slices in F-RANs may lead to significant performance degradation due to the resource competitions among different network slices. In this paper, the downlink F-RANs with a hotspot slice and an Internet of Things(Io T) slice are considered, in which the user equipments(UEs) of different slices share the same spectrum. A novel joint resource allocation and admission control scheme is developed to maximize the number of UEs in the hotspot slice that can be supported with desired quality-of-service, while satisfying the interference constraint of the UEs in the Io T slice. Specifically, the admission control and beamforming vector optimization are performed in the hotspot slice to maximize the number of admitted UEs, while the joint sub-channel and power allocation is performed in the Io T slice to maximize the capability of the UEs in the Io T slice tolerating the interference from the hotspot slice. Numerical results show that our proposed scheme can effectively boost the number of UEs in the hotspot slice compared to the existing baselines.

New degradation call admission control for increasing WCDMA system capacity

Propose a new degradation call admission control（DCAC）scheme, which can be used in wideband code division multiple access communication system. So-called degradation is that non-real time call has the characteristic of variable bit rate, so decreasing its bit rate can reduce the load of the system, consequently the system can admit new call which should be blocked when the system is close to full load, therefore new call＇s access probability increases. This paper brings forward design project and does system simulation, simulation proves that DCAC can effectively decrease calls＇ blocking probability and increase the total number of the on-line users.

SERVICE-AWARE BASED FUZZY ADMISSION CONTROL SCHEME IN MULTI-SERVICE NETWORKS

Multi-service aggregated transmission is the direction of IP network. Providing different Quality of Service (QoS) assurance for different services has become a crucial problem in future network. Admission control is a vital function for multi-service IP network. This paper proposes a novel fuzzy admission control scheme based on coarse granularity service-aware technique. Different service has discriminative sensitivity to the same QoS characteristic parameter in general. The traffic class can be perceived by the service request parameter and the proposed QoS function. And requirements of dif- ferent applications can be met by maintaining the life parameter. From simulation results, the proposed scheme shows a better QoS provisioning than those traditional fuzzy logic based methods under the same admission probability.

Admission control based on beamforming and interference alignment for D2D communication underlaying cellular networks

An admission control algorithm based on beamforming and interference alignment for device-to-device( D2D) communication underlaying cellular networks is proposed. First, some portion of D2D pairs that are the farthest away from the base station( BS) is selected to perform joint zero-forcing beamforming together with the cellular user equipments( UEs) and is admitted to the cellular network. The interference of the BS transmitting signal to the cellular UEs and the portion of D2D pair is eliminated completely at the same time. Secondly,based on the idea of interference alignment,the definition of channel parallelism is given. The channel parallelism of the remaining D2D pairs which are not involved in joint zero-forcing beamforming is computed by using the channel state information from the BS to the D2D devices. The higher the channel parallelism,the less interference the D2D pair suffers from the BS. Finally,in a descending order of channel parallelism,the remaining D2D pairs are reviewed in succession to determine admission to the cellular network. The algorithm stops when the admission of a D2D pair decreases the system sum rate. Simulation results show that the proposed algorithm can effectively reduce the interference of the BS transmitting signal for D2D pairs and significantly improve system capacity. Furthermore, D2D communication is more applicable to short-range links.

A novel dynamic call admission control policy for wireless network

To address the issue of resource scarcity in wireless communication, a novel dynamic call admission control scheme for wireless mobile network was proposed. The scheme established a reward computing model of call admission of wireless cell based on Markov decision process, dynamically optimized call admission process according to the principle of maximizing the average system rewards. Extensive simulations were conducted to examine the performance of the model by comparing with other policies in terms of new call blocking probability, handoff call dropping probability and resource utilization rate. Experimental results show that the proposed scheme can achieve better adaptability to changes in traffic conditions than existing protocols. Under high call traffic load, handoff call dropping probability and new call blocking probability can be reduced by about 8%, and resource utilization rate can be improved by 2%-6%. The proposed scheme can achieve high source utilization rate of about 85%.

The Impact of the Superposition Coding Concept on Admission Control Strategy in OFDMA-Based Network

Admission control is a key mechanism to manage the increasing number of the simultaneous demanding services, requiring a desired Quality of Service(QoS) in a spectrum efficient manner. To address this issue,we investigate in this work, the use of the superposition coding technique to increase the system capacity through multiuser diversity exploitation. We propose a novel joint admission control and superposition coding formalism based on different utility functions:Opportunistic(OPSC), Great Fairness(GFSC)and Proportional Fairness(PFSC). Simulation results show the superiority of our proposed approaches over other by providing higher mean of served VoIP users and higher throughput while maintaining an average VoIP packet transmission delay lower than 0.6 ms.

A NOVEL CALL ADMISSION CONTROL SCHEME IN CELLULAR/WLAN INTEGRATION AND PERFORMANCE ANALYSIS

In order to achieve the Quality of Service(QoS) provisioning and efficient resource utili-zation in cellular network and Wireless Local Area Network(WLAN) integration,an Integrated Ser-vice-Based Call Admission Control(ISB-CAC) scheme is proposed in this paper.The integrated network is modeled by using multi-dimensional Markov chains.The numerical analysis is presented to evaluate the important performance measures such as the blocking probability of originating calls,the dropping probability,and the average transfer time,etc.The steady-state probabilities of the multi-dimensional Markov chains are obtained by using an iterative approach,and the CAC pa-rameters are optimally designed.The analytical model is validated by the computer simulation.It is shown that compared with the conventional WLAN-First Call Admission Control(WF-CAC) scheme,the proposed ISB-CAC scheme not only provides better QoS for mobile users but also utilizes the bandwidth resources more efficiently.

MODELING MULTI-TRAFFIC ADMISSION CONTROL IN OFDMA SYSTEM USING COLORED PETRI NET

Call Admission Control (CAC) is one of the key traffic management mechanisms that must be deployed in order to meet the strict requirements for dependability imposed on the services provided by modern wireless networks. In this paper, we develop an executable top-down hierarchical Colored Petri Net (CPN) model for multi-traffic CAC in Orthogonal Frequency Division Multiple Access (OFDMA) system. By theoretic analysis and CPN simulation, it is demonstrated that the CPN model is isomorphic to Markov Chain (MC) assuming that each data stream follows Poisson distribution and the corresponding arrival time interval is an exponential random variable, and it breaks through MC's explicit limitation, which includes MC's memoryless property and proneness to state space explosion in evaluating CAC process. Moreover, we present four CAC schemes based on CPN model taking into account call-level and packet-level Quality of Service (QoS). The simulation results show that CPN offers significant advantages over MC in modeling CAC strategies and evaluating their performance with less computational complexity in addition to its flexibility and adaptability to different scenarios.

A New Self-Adapting Admission Control Algorithm for Differential Service in Web Clusters

A new admission control algorithm considering the network self-similar access characteristics is proposed. Taking advantage of the mathematical model of the network traffic admission control which can effectively overcome the self-similar characteristics of the network requests, through the scheduling of the differential service qucue based on priority while at the same time taking into account various factors including access characteristics of requests, load information, etc, smoothness of the admission control is ensured by the algorithm proposed in this paper. We design a non-linear self-adapting control algorithm by introducing an exponential admission function, thus overcomes the negative aspects introduced by static threshold parameters. Simulation results show that the scheme proposed in this paper can effectively improve the resource utilization of the clusters, while at the same time protecting the service with high priority. Our simulation results also show that this algorithm can improve system stability and reliability too. Key words Web cluster - admission control - differential service - self-similar - self-adapting CLC number TP 393 Foundation item: Supported by the National Natural Science Foundation of China (10375024) and the Hunan Natural Science Foundation of China(03JJY4054)Biography: LIU An-feng(1971-), male, Ph. D candidate, majoring in network computing, Web QoS.

Downlink call admission control with power allocation and rate scheduling for IDMA-based multi-beam satellite systems

Considering the advantage of interleave-division multiple-access(IDMA) technique and the technical bottlenecks in the existing satellite systems,IDMA is introduced into satellite communication networks.To further validate the IDMA into satellite systems,an effective call admission control(CAC) is proposed to maximize the resource utilization.After establishing the multi-beam satellite system model based on variable spreading gain(VSG) IDMA,the power allocation scheme based on SINR evolution technique and transmission rate adaptation for nonreal time interactive traffic are designed as integrated parts of the CAC,working together to improve the system performance in terms of power efficiency and throughput.Further,the analysis and simulation results show that IDMA under the proposed scheme can provide better QoS,in terms of the blocking/dropping probability,outage probability as well as delay performance.

Reservation-based dynamic admission control scheme for wideband code division multiple access systems

Call admission control (CAC) and resource reservation (RR) for mobile communication are two important factors that guarantee system efficiency and quality of service (QoS) required for different services in a very scarce resource as the radio spectrum. A new scheme was proposed which extends the concepts of resource sharing and reservations for wideband code division multiple access (WCDMA) systems with a unique feature of soft capacity. Voice and data traffic were considered. The traffic is further classified into handoff and new requests. The reservation thresholds were dynamically adjusted according to the traffic pattern and mobility prediction in order to achieve the maximum channel utilization, while guaranteeing different QoS constraints. The performance of proposed scheme was evaluated using Markov models. New call blocking probability, handoff call dropping probability, and channel utilization were used as benchmarks for the proposed scheme.

Admission control with long-range dependence traffic input

The admission control scheme is investigated for a FIFO self-similar queuing system with Quality of Service (QoS) performance guarantees. Since the self-similar queuing system performance analysis is often carried out under the condition of infinite buffer, it is difficult to deduce the upper boundary of buffer overflow probability. To overcome this shortcoming, a simple overflow condition is proposed, which defines a buffer overflow occurrence whenever the arrival rate exceeds the service rate. The analytic formula for the buffer overflow probability upper boundary is easily obtained under this condition. The required bandwidth upper boundary with long-range dependence input and determined overflow probability is then derived from this formula. Based on the above analytic formulas, the upper boundaries of the admission control regions for homogeneous and heterogeneous long-range dependence traffic sources are separately obtained. Finally, an effective admission control scheme for long-range dependence input is proposed. Simulation studies with real traffic have confirmed the validity of these results.

A scalable admission control scheme based on time label

Resource reservation protocols allow communicating hosts to reserve resources such as bandwidth to offer guaranteed service. However, current resource reservation architectures do not scale well for a large number of flows. In this paper, we present a simple reservation protocol and a scalable admission control algorithm, which can provide QoS guarantees to individual flows without per-flow management in the network core. By mapping each flow to a definite time, this scheme addresses the problems that limit the effectiveness of current endpoint admission control schemes. The overall admission control process is described. Analysis is used to explain the reasonability of our scheme and simulation validates its performance.

Joint Optimization of Admission Control and Rate Adaptation for Video Sharing over Multirate Wireless Community Cloud

Emerging wireless community cloud enables usergenerated video content to be shared and consumed in a social context. However, the nature of shared wireless medium and timevarying channels seriously limits the quality of service(QoS), partially owing to the lack of mechanisms for effectively utilizing multi-rate channel resources. In this paper, the joint optimization of admission control and rate adaptation is proposed, resulting in a bandwidth-aware rate-adaptive admission control(BRAC) scheme to provide bandwidth guarantee for sharing social multimedia contents. The analytical approach leads to the following major contributions:(1) a bandwidth-aware rate selection(BRS) algorithm to optimally meet the bandwidth requirement of the data session and channel conditions at the physical layer;(2) a routing-coupled rate adaption and admission control algorithm to admit data sessions with bandwidth guarantee. Moreover, extensive numerical simulations suggest that BRAC is efficient and effective in meeting the bandwidth requirements for sharing social multimedia contents. These insights will shed light on communication system implementation for multimedia content sharing over multirate wireless community cloud.

QoS awared power and admission controls based on non-cooperative game theory in wireless networks

In order to better accommodate heterogeneous quality of service (QoS) in wireless networks, an algorithm called QoS-aware power and admission controls (QAPAC) is proposed. The system is modeled as a non-cooperative game where the users adjust their transmit powers to maximize the utility, thus restraining the interferences. By using adaptive utility functions and tunable pricing parameters according to QoS levels, this algorithm can well meet different QoS requirements and improve system capacity compared with those that ignore the QoS differences.

A COMBINED ADMISSION CONTROL ALGORITHM WITH DA PROTOCOL FOR SATELLITE ATM NETWORKS

Admission control is an important strategy for Quality of Service (QoS) provisioning in Asynchro- nous Transfer Mode (ATM) networks. Based on a control-theory model of resources on-Demand Allocation (DA) protocol, the paper studies the effect of the protocol on the statistical characteristics of network traffic, and proposes a combined connection admission control algorithm with the DA protocol to achieve full utiliza- tion of link resources in satellite communication systems. The proposed algorithm is based on the cross-layer-design approach. Theoretical analysis and system simulation results show that the proposed algo- rithm can admit more connections within certain admission thresholds than one that does not take into account the DA protocol. Thus, the proposed algorithm can increase admission ratio of traffic sources for satellite ATM networks and improve satellite link utilization.