Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data.

Mehmet Akif Yazici

dblp:136/1962 · DBLP profile ↗
← Back
4ranked-venue papers
2as first author
0since 2021 · last 2020
0000-0002-9965-2329ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Computer networks · 2 · 1 first-authorSystems, architecture and hardware · 1 · 1 first-authorSecurity and privacy · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Computer networks
1 paper
Wireless networking · 100%

Topics — the 6 heaviest of 6, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Wireless networking › WLAN › IEEE 802.11
distributed coordination function
0.212013
Running Multiple Instances of the Distributed Coordination Function for Air-Time Fairness in Multi-Rate WLANs · IEEE Trans. Commun. 2013
Wireless networking › WLAN
IEEE 802.11
0.212013
Running Multiple Instances of the Distributed Coordination Function for Air-Time Fairness in Multi-Rate WLANs · IEEE Trans. Commun. 2013
Wireless networking
medium access control
0.212013
Running Multiple Instances of the Distributed Coordination Function for Air-Time Fairness in Multi-Rate WLANs · IEEE Trans. Commun. 2013
Wireless networking
WLAN
0.212013
Running Multiple Instances of the Distributed Coordination Function for Air-Time Fairness in Multi-Rate WLANs · IEEE Trans. Commun. 2013
Wireless networking › WLAN
multi-rate WLAN
0.012013
Running Multiple Instances of the Distributed Coordination Function for Air-Time Fairness in Multi-Rate WLANs · IEEE Trans. Commun. 2013
Wireless networking › WLAN › wifi performance
performance anomaly
0.012013
Running Multiple Instances of the Distributed Coordination Function for Air-Time Fairness in Multi-Rate WLANs · IEEE Trans. Commun. 2013

Methods — techniques the papers use, named apart from their topics

simulation · 0.2analytical modeling · 0.2
YearPublicationVenuePosition
2020 Cyber security for fog-based smart grid SCADA systems: Solutions and challenges
Mohamed Amine Ferrag, Messaoud Babaghayou, Mehmet Akif Yazici
J. Inf. Secur. Appl.3
2016 A hybrid asymmetric traffic classifier for deep packet inspection systems with route asymmetry
abstract
A flow is said to be asymmetrically routed if its packets follow separate paths for forward and reverse directions. Routing asymmetry leads to problems in flow identification, policy enforcement, quota management, traffic shaping etc. in DPI systems. There are two existing approaches to battle routing asymmetry: clustering and state sharing. The latter fails with stateless traffic, while clustering leads to large traffic overhead. We propose the Hybrid Asymmetric Traffic Classifier (HATC) method that merges the best aspects of the two existing methods. HATC is able to handle all types of asymmetric traffic with reduced overhead compared to clustering. Numerical evaluation of HATC using two real traffic traces is also presented.
Kasim Oztoprak, Mehmet Akif Yazici
IPCCC2
2013 The workload-dependent MAP/PH/1 queue with infinite/finite workload capacity
Mehmet Akif Yazici, Nail Akar
Perform. Evaluation1
2013 Running Multiple Instances of the Distributed Coordination Function for Air-Time Fairness in Multi-Rate WLANs
abstract
Conventional multi-rate IEEE 802.11 Wireless LANs (WLANs) are associated with the so-called performance anomaly to describe the phenomenon of high bit rate nodes being dragged down by slower nodes. This anomaly is known to be an impediment to obtaining high cumulative throughputs despite the employment of effective link adaptation mechanisms. To cope with the performance anomaly, air-time fairness has been proposed as an alternative to throughput fairness, the latter being a main characteristic of the IEEE 802.11 Distributed Coordination Function (DCF). In this paper, we propose a novel distributed air-time fair MAC (Medium Access Control) without having to change the operation of the conventional DCF. In the proposed MAC, each node in the system runs multiple instances of the conventional DCF back-off algorithm where the number of DCF instances for the nodes can be chosen in a distributed manner. Both analytical and simulation-based results are provided to validate the effectiveness of the proposed air-time fair MAC.
Mehmet Akif Yazici, Nail Akar
IEEE Trans. Commun.1