Praveen Tammana

Praveen Tammana

Auto-generated profile, based on publicly available information

Praveen Tammana

Indian Institute of Technology Hyderabad, Hyderabad, India

Research Focus & Metrics

Academic Career Length

5Years (2022-Present)

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

Representative Publications

View All Publications
22 June 2023 in IEEE Access
Verified
Journal Article
Open access
DRDeepu Raj Ramachandran Raj
Deepu Raj Ramachandran Raj
TSTahir Ahmed Shaik
Tahir Ahmed Shaik
AHAnish Hirwe
Anish Hirwe
PTPraveen Tammana
Praveen Tammana
KKKotaro Kataoka
Kotaro Kataoka
In SDN-based networks, contextual understanding of network behaviour and safe execution of operational decisions are important as part of the network management process. Digital Twin Network (DTN) is a promising concept which creates a virtual twin of a live SDN-based network to monitor the network from different angles with various granularities and enables it to verify an operational change without disturbing the live one. However, modelling the arbitrary decisions by an SDN Controller to form a DTN and managing the contextual information in a DTN are challenging tasks in various aspects. This paper proposes a data representation based DTN architecture integrating Knowledge Graph (KG) for data modelling and storage and Template as the context description approach. The combination of KG and Template can make the DTN management scalable with the flexibility of defining the contextual information with the relationship between network entities. It also enables efficient querying to the data storage and provides the reusability of functions and data storage for the DTN applications development. The proposed DTN architecture was implemented using an ONOS-based SDN Controller and Neo4j-based KG with built-in DTN applications for practical use. The PoC implementation exhibited short query response time and high query throughput in reading from and updating a KG, though the initial creation of a KG incurs a considerable delay which increases with its size.

9 December 2024
Verified
Conference Paper
Open access
SMSankalp Mittal
Sankalp Mittal
HVHarikrishnan V.
Harikrishnan V.
PHPatel Heetkumar
Patel Heetkumar
PTPraveen Tammana
Praveen Tammana
Deploying machine learning (ML) models in programmable switch data planes facilitates low latency and high throughput traffic inference at line speed. However, data planes pose significant constraints due to the limited memory and minimal support for mathematical operations and data types. As a result, the only unsupervised ML models implemented in data planes to date are Isolation Forests (iForests). However, conventional iForest models yield suboptimal malicious traffic detection performance in various traffic use cases. To address this limitation, this paper proposes iGuard, the first iForest implementation that can accurately detect malicious traffic by incorporating the "knowledge" of more powerful autoencoders. We deploy iGuard in the form of a small set of whitelist rules that could be easily installed in the switch data planes. We implement iGuard using the P4 language, and assess its performance in an experimental platform based on Intel Tofino switches. Upon evaluating iGuard on various attack traffic use cases, our model can improve accuracy up to 48.3% while maintaining a similar or lower switch memory footprint over previous approaches to implement iForest models in real-world equipment.

1 July 2022
Verified
Conference Paper
Open access
SVS. VenkataKeerthy
S. VenkataKeerthy
YAYashas Andaluri
Yashas Andaluri
SDSayan Dey
Sayan Dey
RSRinku Shah
Rinku Shah
PTPraveen Tammana
Praveen Tammana
RURamakrishna Upadrasta
Ramakrishna Upadrasta
To keep up with the network speeds, many recent works propose to offload network functions to SmartNICs. The process involves identifying packet-processing algorithms in a network function program then offloading them to appropriate accelerators available on SmartNICs. This process is often done manually for each architecture and is error-prone and laborious. In this work, we propose an automated solution to identify algorithms in network function programs. We model our approach as a classification problem of Machine Learning (ML) and propose using sophisticated program embeddings for representing the network function programs. We also identify the limited availability of datasets and propose a way of extrapolating them by systematically generating equivalent programs using (existing) compiler transformations in popular compiler infrastructures. Our approach relies on modeling programs as embeddings, uses ML models trained on such extrapolated datasets, and shows superior results over the recent works.

29 June 2023
Verified
Conference Paper
Open access
HAHarish S A
Harish S A
KKK Shiv Kumar
K Shiv Kumar
AMAnibrata Majee
Anibrata Majee
ABAmogh Bedarakota
Amogh Bedarakota
PTPraveen Tammana
Praveen Tammana
RSRinku Shah
Rinku Shah

8 September 2025 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
SMSankalp Mittal
Sankalp Mittal
PTPraveen Tammana
Praveen Tammana
In-network ML-based traffic classification using programmable switches has enabled faster decisions and reduced the cost of the security infrastructure and management overheads. However, due to constraints on per-packet operations and limited stateful memory in the switch data plane, there is a fundamental tradeoff between traffic classification accuracy and switch memory requirements. Existing works fall short of accurately classifying traffic with diverse flow characteristics while keeping the memory footprint low. In this paper, we propose AdaFlow, a system that aims to address this gap by incorporating traffic-specific heuristics while designing the in-network classifier. We evaluate the AdaFlow prototype via simulations and also on a testbed with an Intel Barefoot Tofino switch. Compared to the state-of-the-art, AdaFlow improves accuracy up to 7% for various use-cases while keeping the memory overheads similar to or lower than those of the existing systems.

1 January 2026 in IEEE Transactions on Network and Service Management
Verified
Journal Article
Closed access
SHS. A. Harish
S. A. Harish
SVS. Vignesh
S. Vignesh
DPDivya Pathak
Divya Pathak
ASAnil Kumar Sharma
Anil Kumar Sharma
PTPraveen Tammana
Praveen Tammana