Reginald A. Banez

Reginald A. Banez

Auto-generated profile, based on publicly available information

Reginald A. Banez

Department of Electrical and Computer Engineering, University of Houston, Houston, TX, USA

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
14 September 2020 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
RBReginald A. Banez
Reginald A. Banez
Hamidou TembineHamidou Tembine
Hamidou Tembine
LLLixin Li
Lixin Li
CYChungang Yang
Chungang Yang
LSLingyang Song
Lingyang Song
H. Vincent PoorH. Vincent Poor
H. Vincent Poor
Multi-access edge computing (MEC) has been proposed to reduce latency inherent in traditional cloud computing. One of the services offered in an MEC network (MECN) is computation offloading in which computing nodes, with limited capabilities and performance, can offload computation-intensive tasks to other computing nodes in the network. Recently, meanfield- type game (MFTG) has been applied in engineering applications in which the number of decision makers is finite and where a decision maker can be distinguishable from other decision makers and have a non-negligible effect on the total utility of the network. Since MECNs are implemented through finite number of computing nodes and the computing capability of a computing node can affect the state (i.e., the number of computation tasks) of the network, we propose non-cooperative and cooperative MFTG approaches to formulate computation offloading problems. In these scenarios, the goal of each computing node is to offload a portion of the aggregate computation tasks from the network that minimizes a specific cost. Then, we utilize a direct approach to calculate the optimal solution of these MFTG problems that minimizes the corresponding cost. Finally, we conclude the paper with simulations to show the significance of the approach.

8 April 2022 in IEEE Transactions on Signal and Information Processing over Networks
Verified
Journal Article
Open access
RBReginald A. Banez
Reginald A. Banez
HGHao Gao
Hao Gao
LLLixin Li
Lixin Li
CYChungang Yang
Chungang Yang
ZHZhu Han
Zhu Han
H. Vincent PoorH. Vincent Poor
H. Vincent Poor
The dominanceof social networks has advanced immensely as many users become more dependent on these networks to be able to engage on social discussions and activities. The behavior of these users about a specific topic or issue can be extracted from their own belief or opinion as well as that of their connections. In order to derive meaningful and important behavioral information, these users can be modeled and analyzed together according to similarities in attributes such as political orientation, race, gender, and age. In this research work, the opinion dynamics of a multiple-population social network is investigated through the application of multiple-population mean field game (MPMFG) for behavior modeling and analysis. As a consequence of the proposed MPMFG model, information can be gained on the behavior of social network users belonging to different populations or groups. Specifically, the proposed MPFMG model can be utilized to estimate and predict the behavior of a social network group as well as their effect on the belief and opinion of other groups. Simulations are provided to demonstrate the belief and opinion dynamics of social network users in multiple-population settings. Moreover, theoretical and experimental results as well as comprehensive performance analysis are presented to demonstrate the effectiveness and validity of the proposed MPMFG approach in modeling and analyzing the evolution of opinions in multiple-population social networks.

21 August 2020 in IEEE Transactions on Wireless Communications
Verified
Journal Article
Closed access
HGHao Gao
Hao Gao
WLWuchen Li
Wuchen Li
RBReginald A. Banez
Reginald A. Banez
ZHZhu Han
Zhu Han
H. Vincent PoorH. Vincent Poor
H. Vincent Poor
Multi-access edge computing (MEC) can use the distributed computing resources to serve the large numbers of mobile users in the next generation of communication systems. In this new architecture, a limited number of mobile edge servers will serve a relatively large number of mobile users. Heterogeneous servers can provide either single resource or multiple different resources to the massive number of selfish mobile users. To achieve high quality of service (QoS) and low latency under these two cases, we construct two system models and formulate our problems as two non-cooperative population games. Then we apply our proposed mean field evolutionary approach with two different strategy graphs to solve the load balancing problems under those two cases. Finally, to evaluate the performance of our algorithms, we employ the following performance indicators: overall response time (average response time of the whole system), individual response time (response time of each server), and fairness index (equality of users’ response time).

22 April 2022 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
HGHao Gao
Hao Gao
ALAlex Lin
Alex Lin
RBReginald A. Banez
Reginald A. Banez
WLWuchen Li
Wuchen Li
ZHZhu Han
Zhu Han
H. Vincent PoorH. Vincent Poor
H. Vincent Poor
Belief and opinion evolution in social networks (SNs) can aid in understanding how people influence others’ decisions through social relationships. As a large number of users are involved in SNs, the complexity of traditional optimization techniques is high as they deal with the interactions between users separately. Moreover, the state variable (opinion) is high-dimensional because a person usually has opinions about many different social issues. Incorporating classical opinion dynamics, we formulate the opinion evolution in SNs as a high-dimensional stochastic mean field game (MFG). Numerical methods for high-dimensional MFGs are practically non-existent because of the need for grid-based spatial discretization. Thus, we propose a machine-learning method to tractably solve high-dimensional stochastic MFGs. With this approach, solving MFGs can be regarded as a special case of training a generative adversarial network. In the simulation, we analyze the effect of random social issues and stubbornness on the opinion evolution. Moreover, with the Social Evolution data set, we show that the proposed algorithm can efficiently predict the diffusion of opinions in SNs.

1 May 2019
Verified
Conference Paper
Closed access
RBReginald A. Banez
Reginald A. Banez
LLLixin Li
Lixin Li
CYChungang Yang
Chungang Yang
LSLingyang Song
Lingyang Song
ZHZhu Han
Zhu Han
Mobile edge computing has been proposed to reduce latency inherent in traditional cloud computing. One of the services offered in a mobile edge computing network is computation offloading in which computing nodes with limited capabilities and performance can offload a computation-intensive task to other computing nodes in the network. Recently, mean-field-type game (MFTG) has been applied in engineering applications in which the number of decision makers is finite and where a decision maker can be distinguishable and have a non-negligible effect on the total utility of the network. Since mobile edge computing networks have a finite number of computing nodes where the computing capability of a computing node can affect the state (i.e., the amount of computation task) of the network, we propose a MFTG approach to formulate and solve a computation offloading problem. In this scenario, the goal of each computing node is to compute the portion of the aggregate computation task it can offload from the network that minimizes its cost. Then, we utilize a direct approach to solve for the optimal portion of the aggregate computation task that minimizes the cost incurred by a computing node. Finally, we conclude the paper with simulations to show the significance of the approach.

4 June 2018 in IEEE Transactions on Communications
Verified
Journal Article
Closed access
RBReginald A. Banez
Reginald A. Banez
Haitao XuHaitao Xu
Haitao Xu
NTNguyen H. Tran
Nguyen H. Tran
JSJu Bin Song
Ju Bin Song
Choong Seon HongChoong Seon Hong
Choong Seon Hong
ZHZhu Han
Zhu Han
Network virtualization (NV) allows multiple heterogeneous virtual networks (VNs) to coexist and operate over the same physical network (PN) infrastructures. Some of the benefits of this advancement include flexibility in VN topologies, heterogeneity in VN technologies, and modularity of network operations. However, there are a few areas, such as resource allocation and economics, which challenge the implementation of NV. In this paper, we first introduce some NV parameters that influence the resource allocation and economics of an NV system. Next, we formulate an economic model for NV using the preypredator food chain model. This model takes into account the dynamics in an NV system such as the service, payoff, failure, and competition rates within each VN and PN. The solution point to this model represents the resource strategy of the service provider (SP) given the number of users trying to use its VN, as well as the resource strategy of the infrastructure provider (InP) given the strategy of the VN leasing its PN. In addition, we establish economic models that relate the capacities of the end users, the SP, and the InP. Finally, we provided simulations that show how the prey-predator food chain model fits well on an NV system.