Performance Of Real-time Service Research Articles

Efficient service deployment in mobile edge computing environment

Mobile applications' requirements for compute capability grow up daily. Providing mobile service in remote cloud is one of the solutions to this issue. However, due to the long geographical distance of clouds, it is difficult to ensure the claimed performance of real-time service. As a result, mobile edge computing has become the main solution to solve this problem. The present researches are concerned with cloudlet placement, and computation offloading, while the problem about how to deploy services on cloudlets based on the user's geographical distribution is overlooked. We address this issue in our paper. With the consideration of minimising the number of services and guaranteeing access delay constraint at the same time, this problem is formulated into an optimisation problem. For the NP-hardness of the problem, an efficient heuristic algorithm is proposed to resolve it. The simulation experiment at the end of this paper evaluates the performance of this algorithm. Experiment results demonstrate that the proposed heuristic algorithm is effective.

Performance Analysis of Service Based Scheduler in LTE OFDMA System

Long Term Evolution (LTE) is the wireless broadband technology developed by Third Generation Partnership Project (3GPP) to support higher data rate. Resource scheduling in LTE plays an important role in deciding the overall network performance. In this paper, a new scheduling approach called Service Based Scheduler (SBS) is proposed that is suitable for real time services. In this method, two tag values called maximum tag value (Tmax) and minimum tag value (Tmin) are estimated for the packets based on the type of bearers. Tmax is calculated for Guaranteed Bit Rate (GBR) bearers and Tmin is calculated for non GBR bearers. Then, separate ascending sorted lists are formed for Tmax and Tmin. The packets from the Tmax list are allocated first in spite of users' channel condition. After the allocation of packets from Tmax list, if the current Transmit Time Interval (TTI) has more resources, then packets from Tmin list are allocated strictly based on users' channel conditions. The proposed scheduling approach provides better performance for real time services compared to other schemes like Proportional Fairness (PF), Modified Largest Weighted Delay First (MLWDF), Exponential rule (EXP rule) and Logarithmic rule (LOG rule).

Study of Heuristic MAP Selection and Abstraction Schemes with Load Balance in HMIPv6

In order to improve the performance of real time services in the mobile environment, the hierarchical approach was proposed to reduce the frequency of handoffs in the mobile IPv6 environment. The mobility anchor point (MAP) is adopted in a hierarchical manner to handle the location management of the mobile node within the MAP domain. An enhanced speed estimation scheme is provided in this paper to select the appropriate MAP so that the overhead of handoff can be minimized. Furthermore, the concept of abstract MAP (AMAP) node is proposed to extend the coverage domain of MAP. In addition to selecting a MAP with respect to the speed estimation of the mobile node in a heuristic way, the criteria of load balance is also investigated in this study. The performance of the proposed scheme is examined through exhaustive simulations. And the simulation results show that the proposed scheme can effectively achieve the above objectives.