Department of Computer Science and Engineering

Indian Institute of Technology Palakkad&nbsp;(IIT Palakkad or IIT PKD) is a public autonomous&nbsp;engineering&nbsp;and&nbsp;research&nbsp;institute located in&nbsp;Palakkad,&nbsp;Kerala. It was&nbsp;one of the five new&nbsp;IITs&nbsp;proposed in the&nbsp;2014 Union budget of India. The campus was inaugurated on 3 August 2015. The institute has 94 faculty, 978 students, and 63 non-teaching staffs.

IT Palakkad currently offers four-year Bachelor of Technology (B.Tech) and two years MS programmes in 8 different engineering disciplines including&nbsp;Computer Science, Electrical, Mechanical, Civil among others.

&nbsp;

IIT Palakkad

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 relationships between network entities. It also enables efficient querying of 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. © 2013 IEEE.

World University root node

IEEE Access

Building a Digital Twin Network of SDN Using Knowledge Graphs

Arrayed Waveguide Grating Router (AWGR) based optical networks are emerging as a promising solution for handling modern data centers due to their wide bandwidth, scalability, high data rates, and lower latency. However, link failures in AWGR based optical networks can significantly impact the network performance and lead to the loss of reachability due to the rigid, passive wavelength routing. In this paper, we present ResiConnect, a scalable, and resilient optical network architecture. ResiConnect is a 3-stage Clos network of AWGR, space switches, and AWGR (ASA) which is managed by a centralized controller. ResiConnect introduces an alternative path to redirect the affected traffic by vertically connecting transmitters, and incorporates an active link fault detection and the failover traffic steering. The evaluation results on various performance metrics confirm that ResiConnect is 1) resilient and scalable against multiple link faults, 2) efficient in detecting any link fault with minimum resource overhead, and 3) efficient in handling uneven traffic demand during link failure. © 2022 IEICE.

APNOMS 2022 - 23rd Asia-Pacific Network Operations and Management Symposium: Data-Driven Intelligent Management in the Era of beyond 5G

ResiConnect - Fault Detection and Resilience for Multi-Stage AWGR-based Optical Networks

US Patent App. 17/492,264

Communication entity and a method for transmitting a video data stream

B0-VPG graphs are intersection graphs of axis-parallel line segments in the plane. Cohen et al. (Order 33(1), 39–49, 2016) pose the question of characterizing B0-VPG permutation graphs. We respond here by characterizing B0-VPG cocomparability graphs. This helps us show that a simple necessary condition in fact characterizes B0-VPG permutation graphs. The characterization also leads to a polynomial time recognition algorithm and its proof gives us a B0-VPG drawing algorithm for the class of B0-VPG cocomparability graphs. Our drawing algorithm starts by fixing any one of the many posets P whose cocomparability graph is the input graph G. On the set of axis-parallel line segments in the plane, we define a binary relation “≺2” as p ≺2q if and only if they are non-intersecting and the bottom-left endpoint of p precedes the top-right endpoint of q in the product order on ℝ2. The reflexive closure ≼2 of the relation ≺2 restricted to the line segments of our drawing turns out to be a partial order isomorphic to the poset P. © 2021, The Author(s), under exclusive licence to Springer Nature B.V.

Order

Characterization of B0-VPG Cocomparability Graphs and a 2D Visualization of their Posets

arXiv preprint arXiv:2201.

Eternal vertex cover number of maximal outerplanar graphs

13th Innovations in Theoretical Computer Science Conference (ITCS 2022)

Bounded Indistinguishability for Simple Sources

Almost full rank matrices arising from transitive tournaments

B0-VPG graphs are intersection graphs of axis-parallel line segments in the plane. We show that all AT-free outerplanar graphs are B0-VPG. In the course of the argument, we show that any AT-free outerplanar graph can be identified as an induced subgraph of a 2-connected outerplanar graph whose weak dual is a path. Our B0-VPG drawing procedure works for such graphs and has the potential to be extended to larger classes of outerplanar graphs.

Conference on Algorithms and Discrete Applied Mathematics

B0-VPG Representation of AT-free Outerplanar Graphs

A mixed multigraph is a multigraph which may contain both undirected and directed edges. An orientation of a mixed multigraph G is an assignment of exactly one direction to each undirected edge of G. A mixed multigraph G can be oriented to a strongly connected digraph if and only if G is bridgeless and strongly connected [Boesch and Tindell, Am. Math. Mon., 1980]. For each r∈N, let f(r) denote the smallest number such that any strongly connected bridgeless mixed multigraph with radius r can be oriented to a digraph of radius at most f(r). We improve the current best upper bound of 4r2+4r on f(r) [Chung, Garey and Tarjan, Networks, 1985] to 1.5r2+r+1. Our upper bound is tight upto a multiplicative factor of 1.5 since, ∀r∈N, there exists an undirected bridgeless graph of radius r such that every orientation of it has radius at least r2+r [Chvátal and Thomassen, J. Comb. Theory. Ser. B., 1978]. We prove a marginally better lower bound, f(r)≥r2+3r+1, for mixed multigraphs. While this marginal improvement does not help with asymptotic estimates, it clears a natural suspicion that, like undirected graphs, f(r) may be equal to r2+r even for mixed multigraphs. En route, we show that if each edge of G lies in a cycle of length at most η, then the oriented radius of G is at most 1.5rη. All our proofs are constructive and lend themselves to polynomial time algorithms.