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.

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.

Game-theoretic approach to power and admission control in hierarchical wireless sensor networks

Power efficiency and link reliability are of great impor- tance in hierarchical wireless sensor networks （HWSNs）, espe- cially at the key level, which consists of sensor nodes located only one hop away from the sink node called OHS. The power and admission control problem in HWSNs is comsidered to improve its power efficiency and link reliability. This problem is modeled as a non-cooperative game in which the active OHSs are con- sidered as players. By applying a double-pricing scheme in the definition of OHSs＇ utility function, a Nash Equilibrium solution with network properties is derived. Besides, a distributed algorithm is also proposed to show the dynamic processes to achieve Nash Equilibrium. Finally, the simulation results demonstrate the effec- tiveness of the proposed algorithm.

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.

Terminal-Modality-Based Joint Call Admission Control Algorithm for Fair Radio Resource Allocation in Heterogeneous Cellular Networks

There is a problem of unfairness in allocation of radio resources among heterogeneous mobile terminals in heterogeneous wireless networks. Low-capability mobile terminals (such as single-mode terminals) suffer high call blocking probability whereas high-capability mobile terminals (such as quad-mode terminals) experience very low call blocking probability, in the same heterogeneous wireless network. This paper proposes a Terminal-Modality-Based Joint Call Admission Control (TJCAC) algorithm to reduce this problem of unfairness. The proposed TJCAC algorithm makes call admission decisions based on mobile terminal modality (capability), network load, and radio access technology (RAT) terminal support index. The objectives of the proposed TJCAC algorithm are to reduce call blocking/dropping probability, and ensure fairness in allocation of radio resources among heterogeneous mobile terminals in heterogeneous networks. An analytical model is developed to evaluate the performance of the proposed TJCAC scheme in terms of call blocking/dropping probability in a heterogeneous wireless network. The performance of the proposed TJCAC algorithm is compared with that of other JCAC algorithms. Results show that the proposed algorithm reduces call blocking/dropping probability in the networks, and ensure fairness in allocation of radio resources among heterogeneous terminals.

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.

Adaptive Terminal-Modality-Based Joint Call Admission Control for Heterogeneous Cellular Networks

The coexistence of different Radio Access Technologies (RATs) requires a need for Common Radio Resource Management (CRRM) to support the provision of Quality of Service (QoS) and the efficient utilization of radio resources. The provision of QoS is an important and challenging issue in the design of integrated services packet networks. Call admission control (CAC) is an integral part of the problem. Clearly, without CAC, providing QoS guarantees will be impossible. There is unfairness in allocation of radio resources among heterogeneous mobile terminals in heterogeneous wireless networks. In this paper, an Adaptive-Terminal Modality-Based Joint Call Admission Control (ATJCAC) algorithm is proposed to enhance connection-level QoS and reduce call blocking/dropping probability. The proposed ATJCAC algorithm makes call admission decisions based on mobile terminal modality (capability), network load, adaptive the bandwidth of ongoing call and radio access technology (RAT) terminal support index. Simulation results show that the proposed ATJCAC scheme reduces call blocking/dropping probability.

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 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.

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.

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%.

Joint Resource Allocation and Admission Control Mechanism in Software Defined Mobile Networks

This paper presented a joint resource allocation(RA) and admission control(AC) mechanism in software defined mobile networks(SDMNs). In this mechanism, the joint RA and AC problem can be formulated as an optimization problem with the aim of maximizing the number of admitted users while simultaneously minimizing the number of allocated channels. Since the primal problem is modeled to be a mixed integer nonlinear problem(MINLP), we attain the suboptimal solutions to the primal MINLP by convex relaxation. Additionally, with the global information collected by the SDMNs controller, a centralized joint RA and AC(CJRA)algorithm is proposed by the Lagrange dual decomposition technique to obtain the global optimum. Meanwhile, we propose an OpenFlow rules placement strategy to realize CJRA in an efficient way. Moreover, a distributed algorithm is also developed to find the local optimum, showing a performance benchmark for the centralized one. Finally, simulation results show that the proposed centralized algorithm admits more users compared with the distributed.

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.

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.

Study on the Class-Based Admission Control Scheme for DiffServ in MPLS Networks

Differentiated services (DiffServ) and MPLS are two major building blocks for providing multi-class services over IP networks. In order to respond to the need for relatively simple, coarse methods of providing different levels of service for Internet traffic, to support various types of applications and specific business requirements, the MPLS network infrastructure and the DiffServ traffic model will work together. Meanwhile, in today’s environment of multiple service networks, it is necessary for the node in the networks to perform the control mechanism to guarantee various QoS. In

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.

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.

A CONNECTION ADMISSION CONTROL SCHEME BASED ON GAME THEORETICAL MODEL IN ATM NETWORKS

In this paper, the main schemes of connection admission control (CAC) in ATM networks are briefly discussed especially the principle of dynamic bandwidth allocation. Then the fair share of the bandwidth among different traffic sources is analyzed based on cooperative game model. A CAC scheme is proposed using the genetic algorithm (GA) to optimize the bandwidth-delay-product formed utilization function that ensures the fair share and accuracy of accepting/rejecting the incoming calls. Simulation results show that the proposed scheme ensures fairness of the shared bandwidth to different traffic sources.

COMBINED ADMISSION CONTROL AND SCHEDULING IN MULTI-SERVICE NETWORKS

Providing the required metrics for different service respectively is a basic characteristic in multi-service networks. The different service can be accessed and forwarded differently to provide the different transmission performance. The state information between admission control and scheduling can be exchanged each other by the defined correlation coefficient to adjust the flow distribution in progress. The priority queue length measured by scheduler implicitly can describe the priority flows load. And the fair rate can describe the non-priority flows load. Different admission decision will be made according to the state of scheduler to assure the time-delay upper threshold for the priority flows under heavy load and the fairness for elastic flows in light load, respectively. The stability condition was conduced and proved. Simulation results show the policy can ensure both the delay for the priority flows and the minimal throughput for non-priority flows.

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.