• Publications
  • Influence
Cooperative topology control with adaptation for improved lifetime in wireless ad hoc networks
Topology control algorithms allow each node in a wireless multi-hop network to adjust the power at which it makes its transmissions and choose the set of neighbors with which it communicatesExpand
  • 61
  • 7
On the latency bound of deficit round robin
The emerging high-speed broadband packet-switched networks are expected to simultaneously support a variety of services with different quality-of-service (QoS) requirements over the same physicalExpand
  • 32
  • 7
Fair and Efficient Packet Scheduling Using Elastic Round Robin
Parallel systems are increasingly being used in multiuser environments with the interconnection network shared by several users at the same time. Fairness is an intuitively desirable property in theExpand
  • 130
  • 6
On achieving software diversity for improved network security using distributed coloring algorithms
It is widely believed that diversity in operating systems, software packages, and hardware platforms will decrease the virulence of worms and the effectiveness of repeated applications of singleExpand
  • 110
  • 6
Fair, efficient and low-latency packet scheduling using nested deficit round robin
In the emerging high-speed integrated-services packet-switched networks, packet scheduling algorithms in switches and routers play a critical role in providing the quality of-service (QoS) guaranteesExpand
  • 55
  • 6
Waddling Random Walk: Fast and Accurate Mining of Motif Statistics in Large Graphs
  • Guyue Han, H. Sethu
  • Computer Science
  • IEEE 16th International Conference on Data Mining…
  • 31 May 2016
Algorithms for mining very large graphs, such as those representing online social networks, to discover the relative frequency of small subgraphs within them are of high interest to sociologists,Expand
  • 29
  • 3
A Round-Robin Scheduling Strategy for Reduced Delays in Wormhole Switches with Virtual Lanes ∗
The forwarding of flits from one switch to another in wormhole networks with virtual lanes is typically accomplished using Flit-by-Flit Round-Robin (FFRR) scheduling. This paper presents the AnchoredExpand
  • 6
  • 3
A new distributed topology control algorithm for wireless environments with non-uniform path loss and multipath propagation
Each node in a wireless multi-hop network can adjust the power level at which it transmits and thus change the topology of the network to save energy by choosing the neighbors with which it directlyExpand
  • 40
  • 2
On the relationship between absolute and relative fairness bounds
The fairness of scheduling disciplines used in communication networks has frequently been evaluated using one of two fairness measures: the absolute fairness bound (AFB) and the relative fairnessExpand
  • 30
  • 2
Greedy fair queueing: a goal-oriented strategy for fair real-time packet scheduling
Fair scheduling algorithms are an important component of most QoS mechanisms designed to support the performance guarantees required by real-time applications. In this paper, we present greedy fairExpand
  • 19
  • 2