Sidharth Sharma

Sidharth Sharma

Auto-generated profile, based on publicly available information

Sidharth Sharma

Computer Science and Engineering, Indian Institute of Technology Jodhpur, Jodhpur, Rajasthan, India

Research Focus & Metrics

Academic Career Length

14Years (2013-Present)

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

Representative Publications

View All Publications
1 January 2020 in IEEE Access
Verified
Journal Article
Open access
SSSidharth Sharma
Sidharth Sharma
AEAnna Engelmann
Anna Engelmann
AJAdmela Jukan
Admela Jukan
AGAshwin Gumaste
Ashwin Gumaste
This paper considers service provider network design with a view of meeting application availability. Our primary goal is to design a service provider network using disparate network components and low-availability Virtual Network Functions (VNFs) while achieving high-availability Service Function Chains (SFCs). To this end, we attempt to answer the questions as to how much redundancy, and what type of redundancy should be incorporated in the network. Initially, we model a state-of-the-art provider architecture that is spread across the access, metro-core and backbone networks with associated discrete components such as switches, routers, optical equipment and data-centers. Our network design model leads to computing the amount of over-the-top (OTT) services that can be provisioned over a given network while achieving a particular availability. To this end, we formulate a constrained optimization model whose objective is profit maximization subject to availability measures that OTT services demand. We provide constraints of robustness that facilitate traffic churn. Four heuristics are also proposed with objectives that consider the breadth of the three key impacting parameters: VNF licensing cost, server utilization and delay optimization and the case for dynamic traffic. A simulation model presents comparative data for efficiency, latency and server utilization as well as validates our optimization model. The results stress the importance of an efficient optimization model in planning the network, as well as planning VNF placement ahead in time.

9 December 2021 in IEEE Transactions on Network Science and Engineering
Verified
Journal Article
Closed access
ASAbhiram Singh
Abhiram Singh
SSSidharth Sharma
Sidharth Sharma
AGAshwin Gumaste
Ashwin Gumaste
JWJianping Wang
Jianping Wang
Grafnet, a Graph Neural-Network (GNN)-based scheme learns IP-address-to-port mapping, leading to forwarding table-less routers. GNNs allow mapping network-wide features like adjacencies and addresses to generate new representations. Grafnet converts network-wide IP-addresses to a feature space using GNNs. GNNs extrapolate node adjacencies onto a feature matrix, whose output tells which address / subnet is connected to a node and port. To do so, we use a GNN in conjunction with an Artificial Neural Network (ANN), whose output transforms graph adjacencies to address-based adjacencies. We exploit the fact that IP-addresses are present in contiguous groups (subnets) or 'ranges'. Large range sizes imply better likelihood of Grafnets approximation, though with \textit{enough} learning Grafnet learns just about all networkwide IP-addresses, irrespective of range sizes. Grafnet is evaluated as a SDN scheme on (1) 75-node US-core network and (2) 2000-node, 5 million IP address-based random WAN topology. Analytically, we show equivalence between Grafnet and a Feed-forward neural-network implying exhaustiveness and correctness. The proposed Grafnet model is able to work as a direct address translator, without the need for tables in the forwarding plane of a router. Engineering considerations to implement Grafnet are also discussed.

26 March 2018 in Journal of Lightwave Technology
Verified
Journal Article
Closed access
AKAniruddha Kushwaha
Aniruddha Kushwaha
SSSidharth Sharma
Sidharth Sharma
NBNaveen Bazard
Naveen Bazard
TDTamal Das
Tamal Das
AGAshwin A. Gumaste
Ashwin A. Gumaste
Software Defined Networks (SDNs) could be a game changer for next generation provider networks. OpenFlow (OF) - the dominant SDN protocol, is rigid in its South Bound Interface (SBI) - any new protocol field that the hardware must support, must await complete OF standardization. In contrast, OF alternatives such as Protocol Oblivious Forwarding (POF) and Forwarding and Control Element Separation (ForCES) have simpler schemes for insertion of new protocol identifiers. Even with these there is an inherent limitation on network hardware - the tables must support specific formats and configuration at each node as per protocol semantics. We ask the question - can we design an open system (white-box) - one that is carrier-class, yet able to meet the requirements of any protocol forwarding/action with a minimal set of data-plane functions. We propose bitstream, a low-latency, source-routing based scheme that can support addition of new protocols, be compatible with existing protocols and facilitate a minimum semantic set for acting on a packet. A prototype is built to show bitstream working. The controller architecture is detailed from a provider perspective, as to how it can be integrated in a provider network using YANG models. The hardware architecture is also presented, showing the functioning of a bitstream capable 400Gbps whitebox. The issue of protocol processing optimization is considered and its impact on service latency is shown. The results from the test-bed validate the carrier-class features of the bitstream model.

7 June 2021 in Journal of Lightwave Technology
Verified
Journal Article
Closed access
SSSidharth Sharma
Sidharth Sharma
ASAbhiram Singh
Abhiram Singh
AGAshwin Gumaste
Ashwin Gumaste
BMBiswanath Mukherjee
Biswanath Mukherjee
5G promises to be revolutionary from the perspective of offering unprecedented bandwidth to the end user. In this pursuit, the limited spectrum of the wireless overlay, further constricted by distance, requires strong support from a backhaul network. Such a strong backhaul network should provide large bandwidth pipes with near proximity to the end user at low costs and using pragmatic technology. Naturally, an optical solution is best suited to meet the voluminous bandwidth requirements of the backhaul. This optical solution has to cater to dynamic bandwidth needs among base stations and provide rapid and smart provisioning to meet the requirement of new features such as Coordinated Multipoint (CoMP) among base stations, and yet be low cost. To this end, we propose the use of light-trails (LTs), which are a generalization of a lightpath that provides for dynamic bandwidth communication, sub-wavelength optical grooming and optical layer multicasting using contemporary optics. We observe that each feature of a LT, i.e., dynamic provisioning, optical multicast, and sub-wavelength grooming is strongly desired by the 5G backhaul, implying a clear mapping between them. We investigate the usage of light-trails as a 5G backhaul solution. We discuss the proposed architecture of light-trails for micro cells, pico cells, and femto cells. We present the LT design problem for 5G backhaul as a constrained optimization problem. We also present a mechanism to achieve coordinated multipoint using light-trails. A dynamic virtual topology growth algorithm for the backhaul is also presented and extensively evaluated. The light-trails approach is compared to other approaches, the use of an SDN controller is discussed and significant performance benefits are observed.

23 February 2023 in ACM Transactions on Internet Technology
Verified
Journal Article
Open access
SSSidharth Sharma
Sidharth Sharma
AKAniruddha Kushwaha
Aniruddha Kushwaha
MAMohammad Alizadeh
Mohammad Alizadeh
GVGeorge Varghese
George Varghese
AGAshwin Gumaste
Ashwin Gumaste
We examine how to provide applications with dedicated bandwidth and guaranteed latency in a programmable mission-critical network. Unlike other SDN approaches such as B4 or SWAN, our system Tuneman optimizes both routes and packet schedules at each node to provide flows with sub-second bandwidth changes. Tuneman uses node-level optimization to compute node schedules in a slotted switch and does dynamic routing using a search procedure with Quality of Service– (QoS) based weights. This allows Tuneman to provide an efficient solution for mission-critical networks that have stringent QoS requirements. We evaluate Tuneman on a telesurgery network using a switch prototype built using FPGAs and also via simulations on India’s Tata Network. For mission-critical networks with multiple QoS levels, Tuneman has comparable or better utilization than SWAN while providing delay bounds guarantees.

18 November 2024 in ACM Transactions on Internet Technology
Verified
Journal Article
Open access
SSSidharth Sharma
Sidharth Sharma
AJAdmela Jukan
Admela Jukan
AMAashi Malik
Aashi Malik
AGAshwin Gumaste
Ashwin Gumaste
Network Function Virtualization (NFV) is a promising technology that can transform how internet service providers deliver their services. However, recent studies have identified several challenges in adopting NFV. Two key challenges are central to the operation and capacity planning of NFV Data Centers (DCs): (i) Service Function Chain (SFC) realization —determining if a new request with a known profile can be accommodated—and (ii) Network Function Virtualization (NFV) traffic bounds estimation —estimating the total traffic that a data center can handle considering all service requests and their performance constraints. To address these challenges, we propose a model that leverages stochastic network calculus to effectively dimension an NFV DC while ensuring delay and availability bounds for all service requests. Our theoretical model provides a mathematical framework to assess the realization of a single SFC request without delving into the specifics of the realization process. We utilize established availability-aware Virtual Network Function (VNF) placement patterns to obtain traffic bounds essential to planning data center capacity. We analyze NFV data center traffic under various scenarios over a Fat-tree DC topology. The results demonstrate that data center capacity is significantly influenced by the VNF placement strategy. Additionally, for data centers hosting latency-sensitive services, Service Level Objective (SLO) constraints on availability and delay are crucial in determining the number of such requests that can be accommodated.