Salahuddin Muhammad Salim Zabir

Salahuddin Muhammad Salim Zabir

Auto-generated profile, based on publicly available information

Salahuddin Muhammad Salim Zabir

Fukushima University

Research Focus & Metrics

Academic Career Length

24Years (2003-Present)

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

Representative Publications

View All Publications
1 May 2014 in Journal of Network and Computer Applications
Verified
Journal Article
Closed access
SUSatoshi Utsumi
Satoshi Utsumi
SZSalahuddin Muhammad Salim Zabir
Salahuddin Muhammad Salim Zabir

1 January 2003
Verified
Conference Paper
Closed access
ACA. Chayabejara
A. Chayabejara
SZS.M.S. Zabir
S.M.S. Zabir
NSN. Shiratori
N. Shiratori
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.

4 November 2024
Verified
Conference Paper
Open access
SUSatoshi Utsumi
Satoshi Utsumi
JIJunya Ishikawa
Junya Ishikawa
FOFuya Ohba
Fuya Ohba
SZSalahuddin Muhammad Salim Zabir
Salahuddin Muhammad Salim Zabir
MAMohammed Atiquzzaman
Mohammed Atiquzzaman
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.

8 September 2025
Verified
Conference Paper
Open access
SUSatoshi Utsumi
Satoshi Utsumi
KKKeisuke Kano
Keisuke Kano
SZSalahuddin Muhammad Salim Zabir
Salahuddin Muhammad Salim Zabir
GHGo Hasegawa
Go Hasegawa

1 April 2004 in Journal of Circuits, Systems and Computers
Verified
Journal Article
Closed access
SZSalahuddin Muhammad Salim Zabir
Salahuddin Muhammad Salim Zabir
AAAshir Ahmed
Ashir Ahmed
NSNorio Shiratori
Norio Shiratori

11 August 2026
Verified
Conference Paper
Open access
SUSatoshi Utsumi
Satoshi Utsumi
SZSalahuddin Muhammad Salim Zabir
Salahuddin Muhammad Salim Zabir
GHGo Hasegawa
Go Hasegawa
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.