J. J. Garcia-Luna-Aceves
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
J. J. Garcia-Luna-Aceves has a total of 44 co-authors. Here are the top co-authors by number of shared publications:
- Rolando Menchaca-Mendez
Instituto Politécnico Nacional
4 shared publications - Canshu Lin
College of Computer Science and Software Engineering, Shenzhen University, Shenzhen, China
2 shared publications - Cedric Westphal
University of California, Santa Cruz, Santa Cruz, California, USA
2 shared publications - Dongbiao He
Southeast University, Nanjing, China
2 shared publications - Duy Nguyen
Bayer AG Research & Development, Pharmaceuticals Müllerstrasse 178 13342 Berlin Germany
2 shared publications - Hamid R. Sadjadpour
University of California at Santa Cruz
2 shared publications
Latest Publications
- Open Access
- 27 February 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Multimedia Computing, Communications, and Applications
- Vol. 22 (3) , 1-24
Enhancing Video Conference Applications with VCApather : A Network as a Service Perspective
The provision of performance-aware video conferencing services today relies on approaches that focus on data compression and client-side bitrate adaptation techniques to optimize transmission. However, these methods fail to quickly respond to fluctuations in network conditions, thereby compromising the quality of service for transmissions. For this reason, this article aims to propose a novel traffic scheduling-based video transmission optimization solution from the perspective of the network service provider. We first investigate the resource requirements of video conferences and present the experiential performance of video conferences under different network conditions and network competition. Based on these results, we design a service-customized routing mechanism called VCApather that minimizes network contention. We then provide implementation solutions for the control plane and the data plane of VCApather . We evaluate VCApather using a fully meshed topology with five nodes and real-world video conference traffic. The results show that VCApather is capable of achieving high link utilization and balance, while also meeting predefined user metrics. Compared to other schemes, VCApather could satisfy 69.8% more QoE requirements and yielded an average bitrate improvement of 1.74 \(\times\) .- 27 February 2026
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Multimedia Computing, Communications, and Applications
- Vol. 22 (3) , 1-24
Open AccessEnhancing Video Conference Applications with VCApather : A Network as a Service Perspective
The provision of performance-aware video conferencing services today relies on approaches that focus on data compression and client-side bitrate adaptation techniques to optimize transmission. However, these methods fail to quickly respond to fluctuations in network conditions, thereby compromising the quality of service for transmissions. For this reason, this article aims to propose a novel traffic scheduling-based video transmission optimization solution from the perspective of the network service provider. We first investigate the resource requirements of video conferences and present the experiential performance of video conferences under different network conditions and network competition. Based on these results, we design a service-customized routing mechanism called VCApather that minimizes network contention. We then provide implementation solutions for the control plane and the data plane of VCApather . We evaluate VCApather using a fully meshed topology with five nodes and real-world video conference traffic. The results show that VCApather is capable of achieving high link utilization and balance, while also meeting predefined user metrics. Compared to other schemes, VCApather could satisfy 69.8% more QoE requirements and yielded an average bitrate improvement of 1.74 \(\times\) . - Open Access
- 20 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 31-37
DARE: Making Diffusing Computations More Efficient for Loop-Free Shortest-Path Routing
EIGRP and some other routing protocols proposed recently attain loop-free routing by using diffusing computations, which were first proposed for the Diffusing Update Algorithm (DUAL) for loop-free shortest path routing. The basic approach to diffusing computations used in DUAL has remained unchanged since its introduction about 35 years ago. This paper presents DARE, a new approach to the implementation of diffusing computations that does not require changes to the signaling used in routing protocols based on diffusing computations. It is shown that DARE is much simpler than DUAL and results in faster convergence speeds.
- 20 July 2024
- Published by Association for Computing Machinery (ACM)
- p. 31-37
Open AccessDARE: Making Diffusing Computations More Efficient for Loop-Free Shortest-Path Routing
EIGRP and some other routing protocols proposed recently attain loop-free routing by using diffusing computations, which were first proposed for the Diffusing Update Algorithm (DUAL) for loop-free shortest path routing. The basic approach to diffusing computations used in DUAL has remained unchanged since its introduction about 35 years ago. This paper presents DARE, a new approach to the implementation of diffusing computations that does not require changes to the signaling used in routing protocols based on diffusing computations. It is shown that DARE is much simpler than DUAL and results in faster convergence speeds.
- Open Access
- 15 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 57-63
VCApather: A Network as a Service Solution for Video Conference Applications
We propose a network service as a solution for video conference applications by constructing network layer routing strategies. Our approach takes into account the characteristics of conferencing flows, addresses various self-customized metrics, and proactively ensures a positive user experience by preventing contention. The performance of VCApather is evaluated using a fully-meshed topology with five nodes and real-world video conference traffic. The results show that VCApather is capable of achieving high link utilization and balance, while also meeting predefined user metrics. Compared to other schemes, VCApather was found to satisfy 69.8% more QoE requirement and to yield an average bitrate improvement of 1.74×.
- 15 April 2024
- Published by Association for Computing Machinery (ACM)
- p. 57-63
Open AccessVCApather: A Network as a Service Solution for Video Conference Applications
We propose a network service as a solution for video conference applications by constructing network layer routing strategies. Our approach takes into account the characteristics of conferencing flows, addresses various self-customized metrics, and proactively ensures a positive user experience by preventing contention. The performance of VCApather is evaluated using a fully-meshed topology with five nodes and real-world video conference traffic. The results show that VCApather is capable of achieving high link utilization and balance, while also meeting predefined user metrics. Compared to other schemes, VCApather was found to satisfy 69.8% more QoE requirement and to yield an average bitrate improvement of 1.74×.
- Open Access
- 30 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-4
Research Directions in Network Architectures and Protocols for Intelligent Digital Infrastructures
- 30 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-4
Open AccessResearch Directions in Network Architectures and Protocols for Intelligent Digital Infrastructures
- Open Access
- 30 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 47-56
Simple and Efficient Loop-Free Multipath Routing in Wireless Networks
RIPPLE-WiN (Routing Information Protocol with Probing for Looplessness and Efficiency in Wireless Networks) is introduced. RIPPLE-WiN replaces the sequence numbers that are used in popular routing protocols for wireless networks like OLSR, AODV and DSDV to validate updates or support loop freedom with hop-count reference distances. Such reference distances allow routers to eliminate routing-table loops with minimum signaling overhead. Simulation experiments based on the ns-3 simulator are used to illustrate that RIPPLE-WiN is much more effective that OLSR, DSDV and AODV. The simulation results show that RIPPLE-WiN attains better packet delivery rates and delays than the other routing protocols in the presence of failures and mobility while incurring less signaling overhead.
- 30 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 47-56
Open AccessSimple and Efficient Loop-Free Multipath Routing in Wireless Networks
RIPPLE-WiN (Routing Information Protocol with Probing for Looplessness and Efficiency in Wireless Networks) is introduced. RIPPLE-WiN replaces the sequence numbers that are used in popular routing protocols for wireless networks like OLSR, AODV and DSDV to validate updates or support loop freedom with hop-count reference distances. Such reference distances allow routers to eliminate routing-table loops with minimum signaling overhead. Simulation experiments based on the ns-3 simulator are used to illustrate that RIPPLE-WiN is much more effective that OLSR, DSDV and AODV. The simulation results show that RIPPLE-WiN attains better packet delivery rates and delays than the other routing protocols in the presence of failures and mobility while incurring less signaling overhead.
- 2 April 2023
- Published by Springer Nature
- p. 98-112
TCP-RTA: Real-time Topology Adaptive Congestion Control Strategy in TCP
- 2 April 2023
- Published by Springer Nature
- p. 98-112
TCP-RTA: Real-time Topology Adaptive Congestion Control Strategy in TCP
- 2 April 2023
- Published by Springer Nature
- p. 82-97
Optimized Network Coding with Real-Time Loss Prediction for Hybrid 5G Networks
- 2 April 2023
- Published by Springer Nature
- p. 82-97
Optimized Network Coding with Real-Time Loss Prediction for Hybrid 5G Networks
- Open Access
- 1 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 190-198
Improving Carrier-Sense Multiple Access Using Cues of Channel Utilization
A simple variation of Carrier Sense Multiple Access (CSMA), CUE-CSMA (for Channel Utilization Estimation), is introduced in which the transmission-persistence probability is a function of the perceived average length of idle periods, which is used as a cue of channel utilization. Nodes need not know or estimate the number of nodes in the network. A simple analytical model is used to derive the throughput of CUE-CSMA and compare it with non-persistent and 1-persistent CSMA without having to assume saturation mode as several prior studies have done. The model considers the effect of acknowledgments (ACK) and receive-to-transmit turnaround times. The results clearly show that using estimates of average idle periods as simple cues of channel utilization can provide the benefits of 1-persistent CSMA at light loads and match or outperform non-persistent CSMA at higher loads.
- 1 November 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 190-198
Open AccessImproving Carrier-Sense Multiple Access Using Cues of Channel Utilization
A simple variation of Carrier Sense Multiple Access (CSMA), CUE-CSMA (for Channel Utilization Estimation), is introduced in which the transmission-persistence probability is a function of the perceived average length of idle periods, which is used as a cue of channel utilization. Nodes need not know or estimate the number of nodes in the network. A simple analytical model is used to derive the throughput of CUE-CSMA and compare it with non-persistent and 1-persistent CSMA without having to assume saturation mode as several prior studies have done. The model considers the effect of acknowledgments (ACK) and receive-to-transmit turnaround times. The results clearly show that using estimates of average idle periods as simple cues of channel utilization can provide the benefits of 1-persistent CSMA at light loads and match or outperform non-persistent CSMA at higher loads.
- 3 September 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 67 (12) , 8394-8407
Carrier-Sense Multiple Access With Transmission Acquisition and Channel-Access Prioritization
Carrier-Sense Multiple Access with Transmission Acquisition (CSMA/TA) and channel-access prioritization is presented. CSMA/TA is intended for wireless local area networks of stations endowed with half-duplex transceivers and single antennas. It leverages the small turnaround times of current half-duplex radios to increase the likelihood of having the last transmission from a group of overlapping transmissions succeed, especially if turnaround times are smaller or slightly larger than propagation delays. In CSMA/TA, a station senses the channel before sending a pilot and waits for a short time after sending its pilot before sensing the channel again. If the channel is sensed idle again, the station transmits its data packet. By using appropriate pilot lengths, CSMA/TA allows traffic prioritization at the channel-access level, which supplements traditional output traffic prioritization at stations. It is shown that non-priority CSMA/TA can surpass the performance of such protocols as CSMA, FAMA-PJ, and CSMA/CD if turnaround times are larger than propagation delays, but not too much larger. In addition, it is shown that CSMA/TA can improve traffic prioritization significantly across different traffic classes, under different traffic load proportions, compared to CSMA under the same conditions.
- 3 September 2019
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Communications
- Vol. 67 (12) , 8394-8407
Carrier-Sense Multiple Access With Transmission Acquisition and Channel-Access Prioritization
Carrier-Sense Multiple Access with Transmission Acquisition (CSMA/TA) and channel-access prioritization is presented. CSMA/TA is intended for wireless local area networks of stations endowed with half-duplex transceivers and single antennas. It leverages the small turnaround times of current half-duplex radios to increase the likelihood of having the last transmission from a group of overlapping transmissions succeed, especially if turnaround times are smaller or slightly larger than propagation delays. In CSMA/TA, a station senses the channel before sending a pilot and waits for a short time after sending its pilot before sensing the channel again. If the channel is sensed idle again, the station transmits its data packet. By using appropriate pilot lengths, CSMA/TA allows traffic prioritization at the channel-access level, which supplements traditional output traffic prioritization at stations. It is shown that non-priority CSMA/TA can surpass the performance of such protocols as CSMA, FAMA-PJ, and CSMA/CD if turnaround times are larger than propagation delays, but not too much larger. In addition, it is shown that CSMA/TA can improve traffic prioritization significantly across different traffic classes, under different traffic load proportions, compared to CSMA under the same conditions.
- Open Access
- 1 February 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 785-790
CORD: Content oriented routing with directories
Recent proposals for content routing in information-centric networks (ICN) require the use of content-based routing tables listing routes to name prefixes or individual named data objects (NDO), and a single naming space for NDOs. We present CORD (Content Oriented Routing with Directories) as an alternative to content routing in ICNs. CORD eliminates the need for large content-based routing tables by establishing routes to directories using distance-vector signaling and by mapping name prefixes or names of NDOs to directories using publish-subscribe mechanisms. Simulation experiments using the topology of a real ISP network are used to compare CORD with name-based content routing approaches based on link-state and distance information. The results show that CORD attains comparable data delivery and end-to-end delays, but incurs orders of magnitude less control overhead. In addition, CORD supports multipath forwarding of content requests and content.
- 1 February 2015
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 785-790
Open AccessCORD: Content oriented routing with directories
Recent proposals for content routing in information-centric networks (ICN) require the use of content-based routing tables listing routes to name prefixes or individual named data objects (NDO), and a single naming space for NDOs. We present CORD (Content Oriented Routing with Directories) as an alternative to content routing in ICNs. CORD eliminates the need for large content-based routing tables by establishing routes to directories using distance-vector signaling and by mapping name prefixes or names of NDOs to directories using publish-subscribe mechanisms. Simulation experiments using the topology of a real ISP network are used to compare CORD with name-based content routing approaches based on link-state and distance information. The results show that CORD attains comparable data delivery and end-to-end delays, but incurs orders of magnitude less control overhead. In addition, CORD supports multipath forwarding of content requests and content.