Load Balancing Based on Cache Resource Allocation in Satellite Networks

35Citations
Citations of this article
18Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

During a high-speed movement, the satellites are connected intermittently, so the queue length becomes larger and a cache overflow appears. In this paper, the abundant storage resources of the multilayered satellite network (MLSN) are used to avoid the packet loss caused by a cache overflow of the Low Earth Orbit (LEO) satellites. However, due to the limited storage space of the Geostationary Earth Orbit (GEO) satellites, an effective load balance scheme which addresses two problems: LEO satellites competition in a non-cooperative fashion and content popularity utilization, is needed. Therefore, we propose a load balancing scheme based on the Stackelberg game, containing Members of a Game Algorithm and Distributed Cache Price Bargaining Algorithm. In addition, a storage technology based on content popularity (Popularity Matching Algorithm) is introduced. The numerical results show that the proposed methods are effective in pricing, cache resource allocation of GEO satellites, and load balancing of LEO satellites.

Cite

CITATION STYLE

APA

Wang, E., Li, H., & Zhang, S. (2019). Load Balancing Based on Cache Resource Allocation in Satellite Networks. IEEE Access, 7, 56864–56879. https://doi.org/10.1109/ACCESS.2019.2914167

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free