Salahuddin Muhammad Salim Zabir
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
Salahuddin Muhammad Salim Zabir has a total of 14 co-authors. Here are the top co-authors by number of shared publications:
- Satoshi Utsumi
Fukushima University, Fukushima, Japan
4 shared publications - Go Hasegawa
Tohoku University, Sendai, Miyagi, Japan
2 shared publications A. Chayabejara
Res. Inst. of Electr. Commun., Tohoku Univ., Sendai, Japan
1 shared publication- Ashir Ahmed
Faculty of Information Science and Electrical Engineering, Kyushu University, Fukuoka 819-0395, Japan
1 shared publication - Fuya Ohba
Fukushima University, Fukushima, Japan
1 shared publication - Junya Ishikawa
Fukushima University, Fukushima, Japan
1 shared publication
Latest Publications
- Open Access
- 11 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 2244-2246
POSTER: Efficient Bandwidth Estimation through Integration of Machine Learning and Queueing Theory
In this paper, we propose a novel method for estimating both the bottleneck and available bandwidths with reasonable accuracy while minimizing network overhead by adopting machine learning. Our proposed method selects features of interest based on queueing theory for training machine learning models. Results from emulation experiments show that the model built with Extremely Randomized Trees (Extra Trees) algorithm achieves the best mean absolute percentage error (MAPE) of 28% and 26% for the bottleneck and available bandwidths, respectively.
- 11 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 2244-2246
Open AccessPOSTER: Efficient Bandwidth Estimation through Integration of Machine Learning and Queueing Theory
In this paper, we propose a novel method for estimating both the bottleneck and available bandwidths with reasonable accuracy while minimizing network overhead by adopting machine learning. Our proposed method selects features of interest based on queueing theory for training machine learning models. Results from emulation experiments show that the model built with Extremely Randomized Trees (Extra Trees) algorithm achieves the best mean absolute percentage error (MAPE) of 28% and 26% for the bottleneck and available bandwidths, respectively.
- Open Access
- 11 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 1798-1803
Lynx: Queueing-theoretic Congestion Control Robust to Large Number of Flows
In this paper, we propose a novel congestion control algorithm (CCA) that can maintain a low and nearly constant buffering delay while ensuring high throughput and high throughput fairness even when the number of flows sharing the same bottleneck link increases significantly. Our proposed CCA uses methods formalized in Markovian queueing models for predicting future congestion and determining its congestion window accordingly. We name this CCA as Lynx. We evaluate Lynx through emulations and experiments over the live Internet by comparing it with other CCAs, including Copa, which is known to achieve high performance relative to other CCAs and is being increasingly used by Meta/Facebook. Results show that even when sharing the bottleneck link with many flows, compared with Copa, Lynx can improve buffering delay by up to 56% and Jain's fairness index (JFI) by up to 46% while maintaining high throughput. In addition, the live Internet experiments confirm that Lynx can lead to high performance in terms of (i) throughput, (ii) round-trip time (RTT), and (iii) throughput fairness.
- 11 August 2026
- Published by Association for Computing Machinery (ACM)
- p. 1798-1803
Open AccessLynx: Queueing-theoretic Congestion Control Robust to Large Number of Flows
In this paper, we propose a novel congestion control algorithm (CCA) that can maintain a low and nearly constant buffering delay while ensuring high throughput and high throughput fairness even when the number of flows sharing the same bottleneck link increases significantly. Our proposed CCA uses methods formalized in Markovian queueing models for predicting future congestion and determining its congestion window accordingly. We name this CCA as Lynx. We evaluate Lynx through emulations and experiments over the live Internet by comparing it with other CCAs, including Copa, which is known to achieve high performance relative to other CCAs and is being increasingly used by Meta/Facebook. Results show that even when sharing the bottleneck link with many flows, compared with Copa, Lynx can improve buffering delay by up to 56% and Jain's fairness index (JFI) by up to 46% while maintaining high throughput. In addition, the live Internet experiments confirm that Lynx can lead to high performance in terms of (i) throughput, (ii) round-trip time (RTT), and (iii) throughput fairness.
- Open Access
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-3
Ensuring Low Latency When Number of Flows Increases over Bottleneck Link
- 8 September 2025
- Published by Association for Computing Machinery (ACM)
- p. 1-3
Open AccessEnsuring Low Latency When Number of Flows Increases over Bottleneck Link
- Open Access
- 4 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 739-740
Poster: Toward Achieving Inter-protocol Friendliness through Estimation of BBR Behaviors using Machine Learning
In this paper, we present a new mechanism for estimating the data sending rates of BBR congestion control algorithm using machine learning. Results show that machine learning can estimate the data sending rates of BBR with high accuracy.
- 4 November 2024
- Published by Association for Computing Machinery (ACM)
- p. 739-740
Open AccessPoster: Toward Achieving Inter-protocol Friendliness through Estimation of BBR Behaviors using Machine Learning
In this paper, we present a new mechanism for estimating the data sending rates of BBR congestion control algorithm using machine learning. Results show that machine learning can estimate the data sending rates of BBR with high accuracy.
- 1 May 2014
- Published by Elsevier in Journal of Network and Computer Applications
- Vol. 41, 369-378
A new high-performance TCP friendly congestion control over wireless networks
- 1 May 2014
- Published by Elsevier in Journal of Network and Computer Applications
- Vol. 41, 369-378
A new high-performance TCP friendly congestion control over wireless networks
- 1 April 2004
- Published by World Scientific Pub Co Pte Ltd in Journal of Circuits, Systems and Computers
- Vol. 13 (02) , 341-360
AN EFFICIENT FLOW CONTROL APPROACH FOR TCP OVER WIRELESS NETWORKS
Recently, mobile and wireless devices are being incorporated to the Internet at a rapid pace. This initiates the need for optimizing major applications to perform satisfactorily over wireless links. TCP performance over wireless networks is affected by high link errors, low bandwidth and large delay. Existing well established solutions like the Eifel algorithm, TCP I&RW, TCP SACK and D-SACK attempt to address these issues. However, Eifel or TCP I&RW suffer from ACK losses, while TCP SACK or D-SACK introduce overhead in addition to failure in the presence of multiple packet loss. In this paper, we propose a scheme that overcomes the above problems by introducing a concept of indirect acknowledgment. We name this scheme as TCP IACK. Our proposal exploits TCP timestamp option as an additional identifier to TCP segments for the purpose. Furthermore, it deploys one padding byte following TCP timestamp option to recover from ACK loss. Our proposal is therefore, lightweight, more efficient and robust than existing approaches. We also verify these performance implications through experiments.
- 1 April 2004
- Published by World Scientific Pub Co Pte Ltd in Journal of Circuits, Systems and Computers
- Vol. 13 (02) , 341-360
AN EFFICIENT FLOW CONTROL APPROACH FOR TCP OVER WIRELESS NETWORKS
Recently, mobile and wireless devices are being incorporated to the Internet at a rapid pace. This initiates the need for optimizing major applications to perform satisfactorily over wireless links. TCP performance over wireless networks is affected by high link errors, low bandwidth and large delay. Existing well established solutions like the Eifel algorithm, TCP I&RW, TCP SACK and D-SACK attempt to address these issues. However, Eifel or TCP I&RW suffer from ACK losses, while TCP SACK or D-SACK introduce overhead in addition to failure in the presence of multiple packet loss. In this paper, we propose a scheme that overcomes the above problems by introducing a concept of indirect acknowledgment. We name this scheme as TCP IACK. Our proposal exploits TCP timestamp option as an additional identifier to TCP segments for the purpose. Furthermore, it deploys one padding byte following TCP timestamp option to recover from ACK loss. Our proposal is therefore, lightweight, more efficient and robust than existing approaches. We also verify these performance implications through experiments.
- 1 January 2003
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 5 (10903038) , 3020-3024 Vol.5
An enhancement of the IEEE 802.11 MAC for multihop ad hoc networks
The IEEE 802.11 protocol solves hidden terminal problem using a four way handshaking mechanism. In this protocol, channel probing and reservation are made by using a small request-to-send (RTS) frame at the beginning of a transmission. This effectively detects and avoids collisions. However, the protocol lacks the ability to release or reallocate a channel that was reserved but not used. For multihops, like mobile ad hoc networks (MANET), this often keeps the channel unnecessarily inaccessible resulting in inefficient channel utilization. In this paper, we therefore propose a new mechanism to improve performance of IEEE 802.11 in MANET. Our mechanism utilizes channel capacity that is otherwise wasted. This leads to a higher yield in throughput by up to 10%. In addition, our proposed mechanism is free from compatibility problems with standard IEEE 802.11. Results from extensive simulations verify the effectiveness of our scheme.
- 1 January 2003
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 5 (10903038) , 3020-3024 Vol.5
An enhancement of the IEEE 802.11 MAC for multihop ad hoc networks
The IEEE 802.11 protocol solves hidden terminal problem using a four way handshaking mechanism. In this protocol, channel probing and reservation are made by using a small request-to-send (RTS) frame at the beginning of a transmission. This effectively detects and avoids collisions. However, the protocol lacks the ability to release or reallocate a channel that was reserved but not used. For multihops, like mobile ad hoc networks (MANET), this often keeps the channel unnecessarily inaccessible resulting in inefficient channel utilization. In this paper, we therefore propose a new mechanism to improve performance of IEEE 802.11 in MANET. Our mechanism utilizes channel capacity that is otherwise wasted. This leads to a higher yield in throughput by up to 10%. In addition, our proposed mechanism is free from compatibility problems with standard IEEE 802.11. Results from extensive simulations verify the effectiveness of our scheme.