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. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Abdul Basit Dogar

dblp:98/8767 · DBLP profile ↗
← Back
4ranked-venue papers
1as first author
1since 2021 · last 2021
0009-0003-5077-8531ORCID · corroborated

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

Computer networks · 3

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
2 papers
Routing and switching · 50% Software-defined and programmable networks · 25% Network management and operations · 25%
Computer architecture, parallel and distributed computing, and storage systems
1 paper
Cloud and datacenter computing · 100%

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

TopicWeightPapersLastEvidence papers
Network management and operations › fault management
fault diagnosis
0.312017
P4DB: On-the-fly debugging of the programmable data plane · ICNP 2017
Routing and switching › multipath routing
multipath forwarding
0.312017
VMS: Traffic balancing based on virtual switches in datacenter networks · ICNP 2017
Software-defined and programmable networks
programmable data plane
0.312017
P4DB: On-the-fly debugging of the programmable data plane · ICNP 2017
Routing and switching › traffic engineering
traffic load balancing
0.312017
VMS: Traffic balancing based on virtual switches in datacenter networks · ICNP 2017
Cloud and datacenter computing
datacenter network
0.312017
VMS: Traffic balancing based on virtual switches in datacenter networks · ICNP 2017
Cloud and datacenter computing › datacenter network
virtual switch
0.312017
VMS: Traffic balancing based on virtual switches in datacenter networks · ICNP 2017

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

packet scattering · 0.6adaptive path selection · 0.6watch-break-next primitives · 0.3runtime debugging primitives · 0.3
YearPublicationVenuePosition
2021 NUFTCP: Towards Smooth Network Updates in Software-Defined Datacenter Networks
abstract
Since the widespread deployment of the Software Defined Network in the datacenter, network updates become more and more common. However, modern TCP designs are not resilient to network updates, which introduce flow reroutes. Frequent and inconsistent network updates lead to severe performance degradation such as packet drop (caused by transient congestion) and out-of-order packets problems. In this paper, we verify and show the poor performance of common TCP implementations when there are frequent network updates. We analyze the reasons and propose a simple variant of DCTCP as a countermeasure, named NUFTCP (Network Update Friendly TCP). We evaluate NUFTCP with simulations. The results demonstrate that NUFTCP can more efficiently handle the problems of packet drop and out-of-order packets caused by network updates.
Abdul Basit Dogar
CNSM1
2017 HyperV: A High Performance Hypervisor for Virtualization of the Programmable Data Plane
abstract
P4 is a domain specific language designed to define the behavior of a programmable data plane. It facilitates offloading hardware-suitable Network Functions (NFs) to a data plane. Consequently, NFs can maximally benefit from high performance of hardware devices, meanwhile more CPU power can be reserved for user applications. However, since the programmable data plane provides an NF with an exclusive network context, different NFs cannot operate on the same data plane simultaneously. Besides, it is hardly possible to dynamically reconfigure programmable network devices without interrupting the operation of a data plane. Therefore, we propose HyperV, a high performance hypervisor for virtualization of a P4 specific data plane, to provide both non-exclusive and uninterrupted features.We implemented HyperV based on a P4-BMv2 target and a DPDK target respectively. Then we evaluated BMv2-target HyperV by comparing with Hyper4, a recently proposed hypervisor, and evaluated DPDK- target HyperV by comparing with PISCES and Open vSwitch. Results show that BMv2- target HyperV averagely prevails over Hyper4 2.5x in performance while reducing resource usage by 4x. DPDK-target HyperV performs comparably to Open vSwitch and PISCES, with the worst case of a throughput penalty in less than 7\%, while providing a powerful capability of virtualization which neither of them provides.
Cheng Zhang 0012, Jun Bi, Yu Zhou 0008, Abdul Basit Dogar
ICCCN4
2017 VMS: Traffic balancing based on virtual switches in datacenter networks
abstract
There have been many traffic balancing solutions for datacenter networks. All of them require modifications to the network fabric or/and virtual machines. In this paper, we propose Virtual Multi-channel Scatter (VMS), a new traffic balancing solution in datacenter networks. VMS works in the virtual switches between the network fabric and virtual machines. It can be deployed by datacenter operators at a relatively low cost without extra restrictions to virtual machine users. VMS scatters packets in one TCP flow to several different forwarding paths. It employs an adaptive path selection based on the virtual window size of different paths. We implemented VMS based on OVS. Our evaluation demonstrates that VMS improves traffic balancing very well, and the performance of VMS is approximate to MPTCP in almost all the cases, while only modifies virtual switches. Further, the overhead of VMS is tolerable.
Zhaogeng Li, Jun Bi, Abdul Basit Dogar, Chengwei Qin
ICNP4
2017 P4DB: On-the-fly debugging of the programmable data plane
abstract
While extending network programmability to a larger degree, P4 also raises the risks of incurring runtime bugs after the deployment of P4 programs. These runtime bugs, if not handled promptly and properly, can ruin the functionality and performance of networks. Unfortunately, the absence of runtime debuggers makes troubleshooting of P4 program bugs challenging and intricate for operators. This paper is devoted to the on-the-fly debugging of runtime bugs in P4-enabled networks. We propose P4DB, a general debugging platform that empowers operators to debug P4 programs in three levels of visibility by provisioning operator-friendly primitives. By P4DB, operators can use the watch primitive to quickly narrow the debugging scope from network level or device level to table level, then use the break and next primitives to decompose the match-action table into three steps and troubleshoot the runtime bugs step by step. We implemented a prototype of P4DB and evaluated the performance in terms of the data plane, control plane and control channel. On P4-specific programmable data plane, P4DB merely introduces a small throughput penalty (1.3%~13.8%) and imposes a little-increased delay (0.6%~11.9%).
Cheng Zhang 0012, Jun Bi, Yu Zhou 0008, Bingyang Liu, Zhaogeng Li, Abdul Basit Dogar, Yangyang Wang 0001
ICNP7