KKK. Shiv Kumar

K. Shiv Kumar

*This is an algorithmically generated author record based on publicly available information.

Current Organizations / Institutes

The organizations/institutes from the scholar's latest article


K. Shiv Kumar has a total of 14 co-authors. Here are the top co-authors by number of shared publications:


Latest Publications

  • Open Access

    Yaksha-Prashna: Bridging the Semantic Gap in eBPF Bytecode Analysis and Diagnostics

    by Animesh Singh, K. Shiv Kumar, S. VenkataKeerthy, Pragna Mamidipaka, R. V. B. R. N. Aaseesh, Sayandeep Sen, Palanivel Kodeswaran, Theophilus A. Benson, Ramakrishna Upadrasta, Praveen Tammana

    Modern cloud infrastructures increasingly rely on eBPF-based Network Functions (NFs) for critical data-plane tasks, including observability, security, and load balancing. Because developing production-grade eBPF programs requires significant expertise, operators are increasingly deploying third-party, ''off-the-shelf'' solutions distributed as opaque bytecode. While the Linux kernel's eBPF verifier guarantees safety, it remains agnostic to the functional correctness of network logic; consequently, verifier-safe bytecode can still exhibit incorrect behavior, resulting in both intra-NF functional failures and inter-NF compositional failures. To effectively manage these opaque bytecodes, network operators require mechanisms to validate packet-processing behavior and diagnose violations when they occur. This paper presents \archp, a scalable system for validating eBPF bytecode and providing actionable diagnostic feedback. \archp pairs a network-aware analyzer—which reconstructs packet-processing semantics from opaque eBPF bytecode to build a Network Context Model (NCM)—with a unified query language and engine that supports both validation assertions and diagnostic retrieval queries. By employing control-flow-guided dataflow analysis and an '' analyze once, query multiple times '' design, \archp scales to complex, production-grade NFs while avoiding the computational overheads of state-of-the-art validation methods. Evaluation on 32 real-world NFs from production sources, including Cilium, Katran, and Suricata, demonstrates that \archp accurately extracts network context in milliseconds. Compared to Klint and DRACO, \archp matches expressivity while achieving 200--1000× lower validation time.

  • Open Access

    In-Network Probabilistic Monitoring Primitives under the Influence of Adversarial Network Inputs

    by Harish S A, K Shiv Kumar, Anibrata Majee, Amogh Bedarakota, Praveen Tammana, Pravein Govindan Kannan, Rinku Shah