Past and Current Students

Ph.D. students


Guyue Han

Guyue Han

Previous degree from: Fudan University, China
Ph.D. Dissertation: Mining of Large Social Graphs through Sampling
Graduation date: June 2018
Most significant publications:

  1. Guyue Han and Harish Sethu, "Waddling Random Walk: Fast and Accurate Mining of Motif Statistics in Large Graphs," Proceedings of the IEEE International Conference on Data Mining (ICDM), December 2016. (acceptance rate: 8.5%)
    A preliminary version is available as an arXiv report.

Tingshan Huang

Tingshan Huang

Previous degree from: Shanghai Jiao Tong University, China
Ph.D. Dissertation: Adaptive sampling and statistical inference for anomaly detection (jointly advised by Drs. Sethu and Kandasamy)
Graduation date: December 2015
Most significant publications:

  1. Tingshan Huang, Nagarajan Kandasamy and Harish Sethu, "Anomaly detection in computer systems using compressed measurements," Proceedings of the IEEE International Symposium on Software Reliability Engineering (ISSRE), November 2015. (link) (Best Paper Award runner-up)
  2. Tingshan Huang, Nagarajan Kandasamy and Harish Sethu, "An efficient strategy for online performance monitoring of datacenters via adaptive sampling," to appear in IEEE Transactions on Cloud Computing, 2016.
    A preliminary version appeared in Proceedings of the ACM International Conference on Autonomic Computing, September 2012, pp. 201–210. (link)
  3. Tingshan Huang, Harish Sethu and Nagarajan Kandasamy, "A new approach to dimensionality reduction for anomaly detection in data traffic," to appear in IEEE Transactions on Network and Service Management, 2016.
    A preliminary version is available as an arXiv report.

Xiaoyu Chu

Xiaoyu Chu

Previous degree from: Dalian University of Technology, China
Ph.D. Dissertation: Distributed algorithms for extending the functional lifetime of wireless sensor networks
Graduation date: June 2015
Most significant publications:

  1. Xiaoyu Chu and Harish Sethu, "Cooperative topology control with adaptation for improved lifetime in wireless sensor networks," Ad Hoc Networks, vol. 30, pp. 99-114, July 2015. (link)
    A preliminary version appeared in IEEE INFOCOM 2012.
  2. Xiaoyu Chu and Harish Sethu, "On estimating the spectral radius of large graphs through subgraph sampling," Proceedings of IEEE International Workshop on Network Science for Communication Networks held in conjunction with IEEE INFOCOM, April 2015. (link)
  3. Xiaoyu Chu and Harish Sethu, "On improving the representation of a region achieved by a sensor network," Ad Hoc Networks, vol. 10, no. 3, pp. 552-568, May 2012. (link)
    A preliminary version appeared in IEEE INFOCOM 2009.
  4. Xiaoyu Chu and Harish Sethu, "A new power-aware distributed topology control algorithm for wireless ad hoc networks," Proceedings of IEEE GLOBECOM, December 2011, Houston, TX, USA. (link)
  5. Xiaoyu Chu and Harish Sethu, "The energy cost of mandatory bidirectionality in wireless multimedia communication," Proceedings of the IEEE Int'l Workshop on Multimedia Communications (MMCOM) held in conjunction with IEEE GLOBECOM, December 2011, Houston, TX, USA. (link)

Madhusudan Hosaagrahara

Madhusudan Hosaagrahara

Previous degree from: IIT Kharagpur, India (B. Tech.)
Ph.D. Dissertation: A generalized framework for achieving max-min fairness: theory and applications
Graduation date: June 2006
Employed upon graduation by: Google, Inc., Kirkland, WA
Most significant publications:

  1. Madhusudan R. Hosaagrahara and Harish Sethu, “Max-min fair scheduling in input-queued switches,” IEEE Transactions on Parallel and Distributed Systems, vol. 19, no. 4, pp. 462-475, April 2008. (link)
  2. Madhusudan R. Hosaagrahara and Harish Sethu, “Degree-sequenced matching algorithms for input-queued switches,” Telecommunication Systems, vol. 34, no. 1–2, pp. 37–49, February 2007. (link)

Adam J. O'Donnell

Adam J. O'Donnell

Previous degree from: Drexel University (BSEE and MSCE)
Ph.D. Dissertation: Security through network-wide diversity assignment
Graduation date: October 2005
Employed upon graduation by: Cloudmark, Inc., San Francisco, CA
Most significant publications:

  1. Adam J. O’Donnell and Harish Sethu, “On achieving software diversity for improved network security using distributed coloring algorithms,” Proceedings of the ACM Conference on Computer and Communications Security (CCS), October 2004, pp. 121–131. (link)
  2. Adam J. O’Donnell and Harish Sethu, “Congestion control, differentiated services, and efficient capacity management through a novel pricing strategy,” Computer Communications, vol. 26, no. 13, pp. 1457–1469, August 2003. (link)

Hongyuan Shi

Hongyuan Shi

Previous degree from: Tsinghua University, Beijing, China
Ph.D. Dissertation: Packet scheduling strategies for emerging service models in the Internet
Graduation date: October 2003
Employed upon graduation by: Stevens Institute of Technology, Hoboken, NJ
Most significant publications:

  1. Hongyuan Shi, Harish Sethu, and Salil S. Kanhere, “An evaluation of fair packet schedulers using a novel measure of instantaneous fairness,” Computer Communications, vol. 28, no. 17, pp. 1925–1937, October 2005. (link)
  2. Hongyuan Shi and Harish Sethu, “Greedy fair queueing: A goal-oriented strategy for fair real-time packet scheduling,” Proceedings of the IEEE International Real-Time Systems Symposium (RTSS), December 2003, pp. 345–356. (link)
  3. Hongyuan Shi and Harish Sethu, “On scheduling real-time traffic under controlled load service in an Integrated Services Internet,” Journal of Communications and Networks, vol. 5, no. 1, pp. 73–81, March 2003. (link)

Salil S. Kanhere

Salil S. Kanhere

Previous degree from: VJTI, University of Bombay, India
Ph.D. Dissertation: Design and analysis of fair, efficient and low-latency schedulers for high-speed packet-switched networks
Graduation date: June 2003
Employed upon graduation by: University of New South Wales, Sydney, Australia
Most significant publications:

  1. Hongyuan Shi, Harish Sethu, and Salil S. Kanhere, “An evaluation of fair packet schedulers using a novel measure of instantaneous fairness,” Computer Communications, vol. 28, no. 17, pp. 1925–1937, October 2005. (link)
  2. Salil S. Kanhere and Harish Sethu, “On the latency and fairness characteristics of pre-order deficit round robin,” Computer Communications, vol. 27, no. 7, pp. 664–678, May 2004. (link)
  3. Salil S. Kanhere and Harish Sethu, “Anchored opportunity queueing: A low-latency scheduler for fair arbitration among virtual channels,” Journal of Parallel and Distributed Computing, vol. 63, no. 12, pp. 1288–1299, December 2003. (link)
  4. Salil S. Kanhere and Harish Sethu, “Low-latency guaranteed-rate scheduling using elastic round robin,” Computer Communications, vol. 25, no. 14, pp. 1315–1322, September 2002. (link)
  5. Salil S. Kanhere, Harish Sethu, and Alpa B. Parekh, “Fair and efficient packet scheduling using elastic round robin,” IEEE Transactions on Parallel and Distributed Systems, vol. 13, no. 3, pp. 324–336, March 2002. (link)

Yunkai Zhou

Yunkai Zhou

Previous degree from: Tsinghua University, Beijing, China
Ph.D. Dissertation: Resource allocation in computer networks: Fundamental principles and practical strategies
Graduation date: June 2003
Employed upon graduation by: Google, Inc., Pittsburgh, PA
Most significant publications:

  1. Yunkai Zhou and Harish Sethu, “On achieving fairness in the joint allocation of buffer and bandwidth resources: Principles and algorithms,” Computer Networks, vol. 50, no. 13, pp. 2239–2254, September 2006. (link)
  2. Yunkai Zhou and Harish Sethu, “Toward end-to-end fairness: A framework for the allocation of multiple prioritized resources in switches and routers,” Computer Communications, vol. 28, no. 18, pp. 2105–2118, November 2005. (link)
  3. Yunkai Zhou and Harish Sethu, “On achieving fairness in the joint allocation of processing and bandwidth resources: Principles and algorithms,” IEEE/ACM Transactions on Networking, vol. 13, no. 5, pp. 1054–1067, October 2005. (link)
  4. Yunkai Zhou and Harish Sethu, “On the relationship between absolute and relative fairness bounds,” IEEE Communications Letters, vol. 6, no. 1, pp. 37–39, January 2002. (link)

Graduate research participants

The following students have either worked on a funded project with Harish during their graduate program at Drexel or have completed their M.S. thesis under his supervision.

Thomas Gerety

Thomas Gerety

Previous degree from: Georgia Institute of Technology (MSEE)
Research topic: Topology control in ad hoc networks

Valli A. RamMohan

Valli A. RamMohan

Previous degree from: Sathyabama Engineering College, Chennai, India (BS in EE)
Research topic: Smart antennas in mobile ad hoc networks
Graduated in: June 2007 (with MS in computer engineering)

Michelle Sipics

Michelle Sipics

Previous degree from: Drexel University (BS in computer engineering)
Research topic: Mobile ad hoc network simulation
Graduated in: June 2005 (with MS in computer engineering)

Harpreet S. Arora

Harpreet S. Arora

Previous degree from: VJTI, University of Bombay, India
Research topic: Quality of service in mobile ad hoc networks
Graduated in: June 2003 (with MS in computer engineering)

Kunal A. Shah

Kunal A. Shah

Research topic: Fairness of TCP in multi-hop wireless networks
Graduated in: June 2003 (with BS/MS in electrical/computer engineering)

Jie Zeng

Jie Zeng

Previous degree from: Tsinghua University, Beijing, China.
Research topic: Power management in mobile ad hoc networks
Graduated in: June 2002 (with MS in software engineering)

Alpa B. Parekh

Alpa B. Parekh

Previous degree from: VJTI, University of Bombay, India
Research topic: Fair packet scheduling algorithms
Graduated in: June 2000 (with MS in computer engineering)



Undergraduate research assistants

Alexey Razuvaev

Alexey Razuvaev

Research topic: Boundary effects in topology control algorithm simulations
Anticipated graduation: June 2011 (BS in computer engineering)

Raynald J. Sajous, Jr.

Raynald J. Sajous, Jr.

Research topic: Implementation of fair packet scheduling algorithms
Graduated in: June 2005 (BS in computer engineering)

Emily S. Record

Emily S. Record

Research topic: Implementation of fair packet scheduling algorithms
Graduated in: June 2004 (with BS/MS in computer engineering)