Jorge Ortega-Arjona

Jorge Ortega-Arjona

Auto-generated profile, based on publicly available information

Jorge Ortega-Arjona

Universidad Nacional Autónoma de México

Research Focus & Metrics

Academic Career Length

15Years (2012-Present)

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

Representative Publications

View All Publications
21 September 2012 in International Journal of Parallel, Emergent and Distributed Systems
Verified
Journal Article
Closed access
OEOscar Esquivel-Flores
Oscar Esquivel-Flores
HBHéctor Benitez-perez
Héctor Benitez-perez
PMPaul Mendez Monroy
Paul Mendez Monroy
JOJ. Ortega-Arjona
J. Ortega-Arjona
In a networked control system, several nodes exchange information through a network, to achieve specific control goals and thus increasing network traffic. This affects the overall system performance. Several approaches try to satisfy requirements of both control and communication performance. Particularly, some methodologies have been proposed to save bandwidth. One of such methodologies has been scheduling, which has been studied in depth through the last decade. Commonly, the objective of using scheduling to save bandwidth is to accurately use the computing resources. This paper shows two scheduling strategies, one performing static scheduling and the other carrying out dynamic scheduling, in order to expose the advantages of using dynamic scheduling in an ad hoc implementation. Both strategies execute on a real-time distributed system, and both are able to modify the frequency of transmission as well as the periods of tasks in individual components. Hence, both of them tend to impact on the quality of performance of the system, due to network use. The first scheduling strategy modifies the periods of task, and network access is assigned through a static scheduling algorithm. On the other hand, the second strategy, schedulability, is dynamically achieved by controlling the rate of frequency transmission into a frequency region, bounded by minimum and maximum transmission rates. Numerical simulations are used as implementations of both strategies.

26 January 2016 in International Journal of Computers Communications & Control
Verified
Journal Article
Open access
PDF file
HBHéctor Benitez-perez
Héctor Benitez-perez
JOJorge Ortega-Arjona
Jorge Ortega-Arjona
JRJared A. Rojas-Vargas
Jared A. Rojas-Vargas
ACAdrian Duran Chavesti
Adrian Duran Chavesti
This work presents a supervisory control strategy for Networked Control Systems (NCSs). This shows the identification and control of the plant using fuzzy theory. The fuzzy model incorporates the delay dynamics within the fuzzy rules based upon a real-time hierarchical scheduling strategy. A hierarchical scheduling Priority Exchange algorithm is used based upon codesign strategy following mutual correlation among control and network algorithms in order to bounded time delays. A system of magnetic levitation is presented as a case study.

4 March 2024 in Journal of Internet Services and Applications
Verified
Journal Article
Open access
PDF file
GWGunnar Wolf
Gunnar Wolf
JOJorge Luis Ortega-Arjona
Jorge Luis Ortega-Arjona
The OpenPGP encryption standard builds on a transitive trust distribution model for identity assertion, using a non-authenticated, distributed keyserver network for key distribution and discovery. An attack termed “certificate poisoning”, surfaced in 2019 and consisting in adding excessive trust signatures from inexistent actors to the victim key so that it is no longer usable, has endangered the continued operation of said keyserver network. In this article, we explore a protocol modification in the key acceptance and synchronization protocol termed First-party attested third-party certification that, without requiring the redeployment of updated client software, prevents the ill effects of certificate poisoning without breaking compatibility with the OpenPGP installed base. We also discuss some potential challenges and limitations of this approach, providing recommendations for its adoption.

18 October 2015 in International Journal of Distributed Sensor Networks
Verified
Journal Article
Open access
PDF file
MVMagali Arellano Vazquez
Magali Arellano Vazquez
HBHéctor Benitez-perez
Héctor Benitez-perez
JOJ. Ortega-Arjona
J. Ortega-Arjona
This paper introduces aconsensus routing algorithmbased on an availability function. Such a function obtains a consensus among a group of nodes by evaluating the idle time in the scheduler of each node, along with the general conditions of the network and determining the next step of the route. In this regard, the algorithm proposed here makes it possible to avoid flooding while reducing bandwidth use and keeping changes of the network only at a local scale.

16 November 2015 in International Journal of Computers Communications & Control
Verified
Journal Article
Open access
PDF file
HBHéctor Benitez-perez
Héctor Benitez-perez
JOJorge Ortega-Arjona
Jorge Ortega-Arjona
OEOscar Esquivel-Flores
Oscar Esquivel-Flores
JRJared A. Rojas-Vargas
Jared A. Rojas-Vargas
AÁAndrés Álvarez-Cid
Andrés Álvarez-Cid
At present, network control systems employ a common approximation to solve the connectivity issue due to time delays coupled with external factors . However, this approach tends to be complex in terms of time delays, and the inherent local phase is missing. Therefore, it is necessary to study the behavior of the delays as well as the integration of the differential equations of these bounded delays. The related time delays need to be known a priori, but from a dynamic real-time perspective in order to understand the dynamic phase behavior. The objective of this paper is to demonstrate the inclusion of the data frequency transmission and time delays that are bounded as parameters of the dynamic response from a real-time scheduling approximation, considering the local phase situation. The related control law is designed considering a fuzzy logic approximation for nonlinear time delays coupling. The main advantage is the integration of this behavior through extended state space representation. This keeps certain linear and bounded behavior leading to a stable situation during an events presentation, based on an accurate data transmission rate. An expected result is that the basics of the local phase missing as a result of the local bounded time delays from the lack of tide synchronization conforms to the modeling approximation.

1 December 2020 in Electronic Notes in Theoretical Computer Science
Verified
Journal Article
Open access
KPKarla Ramírez Pulido
Karla Ramírez Pulido
JOJorge Luis Ortega-Arjona
Jorge Luis Ortega-Arjona
LHLourdes del Carmen González Huesca
Lourdes del Carmen González Huesca