activity
20122021
most citedLow-Complexity Interactive Algorithms for Synchronization from Deletions, Insertions, and Substitutions

23 citations · 28 across the 6 of their papers we have counts for

collaborators

6 papers

cs.IT2021

Connection Management xAPP for O-RAN RIC: A Graph Neural Network and Reinforcement Learning Approach

Oner Orhan, Vasuki Narasimha Swamy, Thomas Tetzlaff +3

Connection management is an important problem for any wireless network to ensure smooth and well-balanced operation throughout. Traditional methods for connection management (speci…

cs.IT2018★ 1 cited

Wireless Channel Dynamics and Robustness for Ultra-Reliable Low-Latency Communications

Vasuki Narasimha Swamy, Paul Rigge, Gireeja Ranade +2

Interactive, immersive and critical applications demand ultra-reliable low-latency communication (URLLC). To build wireless communication systems that can support these application…

cs.IT2018★ 1 cited

Network Coding for Real-time Wireless Communication for Automation

Vasuki Narasimha Swamy, Paul Rigge, Gireeja Ranade +2

Real-time applications require latencies on the order of a millisecond with very high reliabilities, paralleling the requirements for high-performance industrial control. Current w…

eess.SY2017★ 2 cited

Modeling Actuation Constraints for IoT Applications

Bharathan Balaji, Brad Campbell, Amit Levy +8

Internet of Things (IoT) promises to bring ease of monitoring, better efficiency and innovative services across many domains with connected devices around us. With information from…

cs.IT2013★ 23 cited

Low-Complexity Interactive Algorithms for Synchronization from Deletions, Insertions, and Substitutions

Ramji Venkataramanan, Vasuki Narasimha Swamy, Kannan Ramchandran

Consider two remote nodes having binary sequences and , respectively. is an edited version of , where the editing involves random deletions, insertions, and substit…

cs.IT2012★ 1 cited

An asymptotically optimal push-pull method for multicasting over a random network

Vasuki Narasimha Swamy, Srikrishna Bhashyam, Rajesh Sundaresan +1

We consider allcast and multicast flow problems where either all of the nodes or only a subset of the nodes may be in session. Traffic from each node in the session has to be sent…