Hardik Soni
  • About
  • Publications
  • Projects
  • Services
Hardik Soni
  • About
  • Publications
  • Projects
  • Services

Address:
Am Kronberger Hang 8, 65824 Schwalbach am Taunus, Germany

hardik.soni@hpe.com
https://github.com/hksoni
https://linkedin.com/in/sonihk
https://twitter.com/hardiksonik
Hardik Soni
Curriculum vitae

In January 2023, I joined Puneet Sharma’s Networking & Distributed Systems Lab (NDSL) at Hewlett-Packard-Labs as a Research Scientist.

Earlier, I worked at NEC Laboratories Europe GmbH for two years. I was a post-doctoral research associate at the Computer Science department of Cornell University from 2018 to 2020. I worked with Professor Nate Foster. Before joining Cornell, I was a PhD student advised by Thierry Turletti and Walid Dabbous in the DIANA team at INRIA Sophia, France. I received my PhD in Informatique from l’UNIVERSITÉ CÔTE D’AZUR. Earlier I worked as a Senior Software Engineer at Alcatel-Lucent India for a couple of years.

Research Interests: Programmable Networks, Networking, Systems, Compilers, Distributed Data Processing,

My Reseach:

  • Composition Framework for Packet-processing Programs: The goal is to build a composition framework for network programs developed for programmable switches and edge hosts with SmartNICs. Read more…

    If you are interested in the project, I would like to hear from you.

news

Jan 2023 Joined Puneet Sharma’s NDSL group at Hewlett-Packard Labs as a Researcher.
Jan 2021 Joined ISS group at NEC Laboratories Europe GmbH as a Senior Researcher.
Aug 2020 µP4 received All the reproducibility badges.
Jul 2020 We have released source-code for µP4.
May 2020 Composing Dataplane Programs with μP4 accepted to SIGCOMM ‘20

Publications

  1. Composing Dataplane Programs with μP4 Hardik Soni, Myriana Rifai, Praveen Kumar, Ryan Doenges, and Nate Foster In Proceedings of the Annual Conference of the ACM Special Interest Group on Data Communication, SIGCOMM ’20 2020 [Abs] [PDF] [Code]

    Dataplane languages like P4 enable flexible and efficient packet-processing using domain-specific primitives such as programmable parsers and match-action tables. Unfortunately, P4 programs tend to be monolithic and tightly coupled to the hardware architecture, which makes it hard to write programs in a portable and modular way—e.g., by composing reusable libraries of standard protocols.To address this challenge, we present the design and implementation of a novel framework (μP4) comprising a lightweight logical architecture that abstracts away from the structure of the underlying hardware pipelines and naturally supports powerful forms of program composition. Using examples, we show how enables modular programming. We present a prototype of the compiler that generates code for multiple lower-level architectures, including Barefoot’s Tofino Native Architecture. We evaluate the overheads induced by our compiler on realistic examples.

  2. Towards network softwarization : a modular approach for network control delegation Hardik Soni PhD. Thesis at Université Côte d’Azur https://tel.archives-ouvertes.fr/tel-01867973 2018 [PDF]
  3. P4Bricks: Enabling multiprocessing using Linker-based network data plane architecture Hardik Soni, Thierry Turletti, and Walid Dabbous Technical Report. HAL-Inria at https://hal.inria.fr/hal-01632431 2018 [Abs] [PDF] [Code]

    Packet-level programming languages such as P4 usually require to describe all packet processing functionalities for a given programmable network device within a single program. However, this approach monopolizes the device by a single large network application program, which prevents possible addition of new functionalities by other independently written network applications. We propose P4Bricks, a system which aims to deploy and execute multiple independently developed and compiled P4 programs on the same reconfigurable hardware device. P4Bricks is based on a Linker component that merges the programmable parsers/deparsers and restructures the logical pipeline of P4 programs by refactoring, decomposing and scheduling the pipelines’ tables. It merges P4 programs according to packet processing semantics (parallel or sequential) specified by the network operator and runs the programs on the stages of the same hardware pipeline, thereby enabling multiprocessing. This paper presents the initial design of our system with an ongoing implementation and studies P4 language’s fundamental constructs facilitating merging of independently written programs.

  4. NFV-Based Scalable Guaranteed-Bandwidth Multicast Service for Software Defined ISP Networks Hardik Soni, Walid Dabbous, Thierry Turletti, and Hitoshi Asaeda IEEE Transactions on Network and Service Management 2017 [Abs] [PDF] [Code]

    New applications where anyone can broadcast high quality video are becoming very popular. Internet services providers (ISPs) may take the opportunity to propose new high quality multicast services to their clients. Because of its centralized control plane, software defined networking (SDN) enables the deployment of such a service in a flexible and bandwidth-efficient way. But deploying large-scale multicast services on SDN requires smart group membership management and a bandwidth reservation mechanism with QoS guarantees that should neither waste bandwidth nor impact too severely best effort traffic. In this paper, we propose: 1) a scalable multicast group management mechanism based on a network function virtualization approach for software defined ISP networks to implement and deploy multicast services on the network edge and 2) the lazy load balancing multicast (L2BM) routing algorithm for sharing the core network capacity in a friendly way between guaranteed-bandwidth multicast traffic and best-effort traffic and that does not require costly real-time monitoring of link utilization. We have implemented the mechanism and algorithm, and evaluated them both in a simulator and a testbed. In the testbed, we experimented the group management at the edge and L2BM in the core with an open vSwitch-based QoS framework and evaluated the performance of L2BM with an exhaustive set of experiments on various realistic scenarios. The results show that L2BM outperforms other state-of-the art algorithms by being less aggressive with best-effort traffic and accepting about 5%–15% more guaranteed-bandwidth multicast join requests.

  5. Scalable guaranteed-bandwidth multicast service in software defined ISP networks H. Soni, W. Dabbous, T. Turletti, and H. Asaeda In 2017 IEEE International Conference on Communications (ICC) 2017 [Abs] [PDF] [Code]

    New applications where anyone can broadcast video are becoming very popular on smartphones. With the advent of high definition video, ISP providers may take the opportunity to propose new high quality broadcast services to their clients. Because of its centralized control plane, Software Defined Networking (SDN) seems an ideal way to deploy such a service in a flexible and bandwidth-efficient way. But deploying large scale multicast services on SDN requires smart group membership management and a bandwidth reservation mechanism to support QoS guarantees that should neither waste bandwidth nor impact too severely best effort traffic. In this paper, we propose a Network Function Virtualization based solution for Software Defined ISP networks to implement scalable multicast group management. Then, we propose the Lazy Load balancing Multicast (L2BM) routing algorithm for sharing the network capacity in a friendly way between guaranteed-bandwidth multicast traffic and best-effort traffic. Our implementation of the framework made on Floodlight controllers and Open vSwitches is used to study the performance of L2BM.

Projects

Ongoing Research Projects

Composition Framework for Packet-processing Programs

Services

* SmartNICS Summit 2022 Organizing Committee
* ACM CoNEXT 2021 Artefact Evaluation Committee
* Reviewer for IEEE Transactions on Network and Service Management 2021
* ACM SIGCOMM 2020 Artifact Evaluation Committee
© Copyright 2023 Hardik Soni. Last updated: February 08, 2023.