Harish Sethu

Orcid: 0000-0002-0724-0707

According to our database1, Harish Sethu authored at least 55 papers between 1992 and 2020.

Collaborative distances:
  • Dijkstra number2 of four.
  • Erdős number3 of four.

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2020
Closed Walk Sampler: An Efficient Method for Estimating Eigenvalues of Large Graphs.
IEEE Trans. Big Data, 2020

2019
An Efficient Strategy for Online Performance Monitoring of Datacenters via Adaptive Sampling.
IEEE Trans. Cloud Comput., 2019

2017
Closed walk sampler: An efficient method for estimating the spectral radius of large graphs.
Proceedings of the 2017 IEEE International Conference on Big Data (IEEE BigData 2017), 2017

Edge Sample and Discard: A New Algorithm for Counting Triangles in Large Dynamic Graphs.
Proceedings of the 2017 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining 2017, Sydney, Australia, July 31, 2017

2016
A New Approach to Dimensionality Reduction for Anomaly Detection in Data Traffic.
IEEE Trans. Netw. Serv. Manag., 2016

Waddling Random Walk: Fast and Accurate Sampling of Motif Statistics in Large Graphs.
CoRR, 2016

Waddling Random Walk: Fast and Accurate Mining of Motif Statistics in Large Graphs.
Proceedings of the IEEE 16th International Conference on Data Mining, 2016

2015
Cooperative Topology Control with Adaptation for improved lifetime in wireless sensor networks.
Ad Hoc Networks, 2015

Anomaly detection in computer systems using compressed measurements.
Proceedings of the 26th IEEE International Symposium on Software Reliability Engineering, 2015

On estimating the Spectral Radius of large graphs through subgraph sampling.
Proceedings of the 2015 IEEE Conference on Computer Communications Workshops, 2015

A fast algorithm for detecting anomalous changes in network traffic.
Proceedings of the 11th International Conference on Network and Service Management, 2015

2014
An Energy Balanced dynamic Topology Control algorithm for improved network lifetime.
Proceedings of the IEEE 10th International Conference on Wireless and Mobile Computing, 2014

A modular multi-location anonymized traffic monitoring tool for a WiFi network.
Proceedings of the Fourth ACM Conference on Data and Application Security and Privacy, 2014

2012
A new algorithm for extracting a small representative subgraph from a very large graph
CoRR, 2012

On improving the representation of a region achieved by a sensor network.
Ad Hoc Networks, 2012

Evaluating compressive sampling strategies for performance monitoring of data centers.
Proceedings of the 2012 IEEE Network Operations and Management Symposium, 2012

Cooperative topology control with adaptation for improved lifetime in wireless ad hoc networks.
Proceedings of the IEEE INFOCOM 2012, Orlando, FL, USA, March 25-30, 2012, 2012

2011
The energy cost of mandatory bidirectionality in wireless multimedia communication.
Proceedings of the Workshops Proceedings of the Global Communications Conference, 2011

A New Power-Aware Distributed Topology Control Algorithm for Wireless Ad Hoc Networks.
Proceedings of the Global Communications Conference, 2011

2010
A new distributed topology control algorithm for wireless environments with non-uniform path loss and multipath propagation.
Ad Hoc Networks, 2010

Using Text Analysis to Understand the Structure and Dynamics of the World Wide Web as a Multi-Relational Graph.
Proceedings of the 2010 IEEE Second International Conference on Social Computing, 2010

2009
A New Distributed Algorithm for Improved Coverage and Increased Lifetime in Sensor Networks
CoRR, 2009

A New Distributed Algorithm for Even Coverage and Improved Lifetime in a Sensor Network.
Proceedings of the INFOCOM 2009. 28th IEEE International Conference on Computer Communications, 2009

2008
Max-Min Fair Scheduling in Input-Queued Switches.
IEEE Trans. Parallel Distributed Syst., 2008

2007
Degree-sequenced matching algorithms for input-queued switches.
Telecommun. Syst., 2007

The Induced Bounded-Degree Subgraph Problem and Stream Control in MIMO Networks
CoRR, 2007

A Distributed Topology Control Algorithm in the Presence of Multipath Propagation.
Proceedings of the 4th Annual International Conference on Mobile and Ubiquitous Systems (MobiQuitous 2007), 2007

2006
On achieving fairness in the joint allocation of buffer and bandwidth resources: Principles and algorithms.
Comput. Networks, 2006

2005
Rate-limited EAFRP - a new improved model for high-speed network traffic.
IEEE Trans. Signal Process., 2005

On achieving fairness in the joint allocation of processing and bandwidth resources: principles and algorithms.
IEEE/ACM Trans. Netw., 2005

Toward end-to-end fairness: a framework for the allocation of multiple prioritized resources in switches and routers.
Comput. Commun., 2005

An evaluation of fair packet schedulers using a novel measure of instantaneous fairness.
Comput. Commun., 2005

Synchronization effects in mobile ad hoc networks.
Proceedings of the 2005 IEEE International Conference on Wireless And Mobile Computing, 2005

Software Diversity as a Defense against Viral Propagation: Models and Simulations.
Proceedings of the 19th Workshop on Parallel and Distributed Simulation, 2005

A new low-delay matching algorithm for input-queued switches.
Proceedings of the 14th International Conference On Computer Communications and Networks, 2005

2004
On the latency and fairness characteristics of pre-order deficit round Robin.
Comput. Commun., 2004

On achieving software diversity for improved network security using distributed coloring algorithms.
Proceedings of the 11th ACM Conference on Computer and Communications Security, 2004

2003
Anchored opportunity queueing: a low-latency scheduler for fair arbitration among virtual channels.
J. Parallel Distributed Comput., 2003

On scheduling real-time traffic under controlled load service in an integrated services Internet.
J. Commun. Networks, 2003

Congestion control, differentiated services, and efficient capacity management through a novel pricing strategy.
Comput. Commun., 2003

Greedy Fair Queueing: A Goal-Oriented Strategy for Fair Real-Time Packet Scheduling.
Proceedings of the 24th IEEE Real-Time Systems Symposium (RTSS 2003), 2003

On Achieving Fairness in the Joint Allocation of Processing and Bandwidth Resources.
Proceedings of the Quality of Service, 2003

Toward end-to-end fairness: a framework for the allocation of multiple prioritized resources.
Proceedings of the 22nd IEEE International Performance Computing and Communications Conference, 2003

An evaluation of timestamp-based packet schedulers using a novel measure of instantaneous fairness.
Proceedings of the 22nd IEEE International Performance Computing and Communications Conference, 2003

2002
Fair and Efficient Packet Scheduling Using Elastic Round Robin.
IEEE Trans. Parallel Distributed Syst., 2002

On the relationship between absolute and relative fairness bounds.
IEEE Commun. Lett., 2002

Low-latency guaranteed-rate scheduling using Elastic Round Robin.
Comput. Commun., 2002

On the Latency Bound of Pre-Order Deficit Round Robin.
Proceedings of the 27th Annual IEEE Conference on Local Computer Networks (LCN 2002), 2002

On the latency bound of deficit round robin.
Proceedings of the 11th International Conference on Computer Communications and Networks, 2002

On the effectiveness of buffer sharing in multimedia server network switches with self-similar traffic.
Proceedings of the IEEE International Conference on Communications, 2002

A novel, practical pricing strategy for congestion control and differentiated services.
Proceedings of the IEEE International Conference on Communications, 2002

2000
Congestion-Free Routing of Streaming Multimedia Content in BMIN-Based Parallel Systems.
Proceedings of the Parallel and Distributed Processing, 2000

Fair and Efficient Packet Scheduling in Wormhole Networks.
Proceedings of the 14th International Parallel & Distributed Processing Symposium (IPDPS'00), 2000

1998
IBM RS/6000 SP Interconnection Network Topologies for Large Systems.
Proceedings of the 1998 International Conference on Parallel Processing (ICPP '98), 1998

1992
Design of Time-Optimal Hardware-Efficient Divide-and-Conquer Algorithms.
Proceedings of the 1992 International Conference on Parallel Processing, 1992


  Loading...