Harish Sethu

List of publications from the DBLP Bibliography Server - FAQ
Coauthor Index - Ask others: ACM DL/Guide - CiteSeer - CSB - Google - MSN - Yahoo

23EEMadhusudan Hosaagrahara, Harish Sethu: Max-Min Fair Scheduling in Input-Queued Switches. IEEE Trans. Parallel Distrib. Syst. 19(4): 462-475 (2008)
22EEHarish Sethu, Thomas Gerety: A Distributed Topology Control Algorithm in the Presence of Multipath Propagation. MobiQuitous 2007: 1-8
21EEHarish Sethu, Thomas Gerety: A Distributed Topology Control Algorithm in the Presence of Multipath Propagation CoRR abs/0709.0961: (2007)
20EEHarish Sethu: The Induced Bounded-Degree Subgraph Problem and Stream Control in MIMO Networks CoRR abs/0709.0965: (2007)
19EEMadhusudan Hosaagrahara, Harish Sethu: Degree-sequenced matching algorithms for input-queued switches. Telecommunication Systems 34(1-2): 37-49 (2007)
18EEYunkai Zhou, Harish Sethu: On achieving fairness in the joint allocation of buffer and bandwidth resources: Principles and algorithms. Computer Networks 50(13): 2239-2254 (2006)
17EEAdam J. O'Donnell, Harish Sethu: Software Diversity as a Defense against Viral Propagation: Models and Simulations. PADS 2005: 247-253
16EEHongyuan Shi, Harish Sethu, Salil S. Kanhere: An evaluation of fair packet schedulers using a novel measure of instantaneous fairness. Computer Communications 28(17): 1925-1937 (2005)
15EEYunkai Zhou, Harish Sethu: Toward end-to-end fairness: a framework for the allocation of multiple prioritized resources in switches and routers. Computer Communications 28(18): 2105-2118 (2005)
14EEYunkai Zhou, Harish Sethu: On achieving fairness in the joint allocation of processing and bandwidth resources: principles and algorithms. IEEE/ACM Trans. Netw. 13(5): 1054-1067 (2005)
13EEAdam J. O'Donnell, Harish Sethu: On achieving software diversity for improved network security using distributed coloring algorithms. ACM Conference on Computer and Communications Security 2004: 121-131
12EESalil S. Kanhere, Harish Sethu: On the latency and fairness characteristics of pre-order deficit round Robin. Computer Communications 27(7): 664-678 (2004)
11EEYunkai Zhou, Harish Sethu: On Achieving Fairness in the Joint Allocation of Processing and Bandwidth Resources. IWQoS 2003: 97-114
10EEHongyuan Shi, Harish Sethu: Greedy Fair Queueing: A Goal-Oriented Strategy for Fair Real-Time Packet Scheduling. RTSS 2003: 345-
9EEAdam J. O'Donnell, Harish Sethu: Congestion control, differentiated services, and efficient capacity management through a novel pricing strategy. Computer Communications 26(13): 1457-1469 (2003)
8EESalil S. Kanhere, Harish Sethu: Anchored opportunity queueing: a low-latency scheduler for fair arbitration among virtual channels. J. Parallel Distrib. Comput. 63(12): 1288-1299 (2003)
7EESalil S. Kanhere, Harish Sethu: On the Latency Bound of Pre-Order Deficit Round Robin. LCN 2002: 508-517
6EESalil S. Kanhere, Harish Sethu: Low-latency guaranteed-rate scheduling using Elastic Round Robin. Computer Communications 25(14): 1315-1322 (2002)
5EESalil S. Kanhere, Harish Sethu, Alpa B. Parekh: Fair and Efficient Packet Scheduling Using Elastic Round Robin. IEEE Trans. Parallel Distrib. Syst. 13(3): 324-336 (2002)
4EESalil S. Kanhere, Alpa B. Parekh, Harish Sethu: Fair and Efficient Packet Scheduling in Wormhole Networks. IPDPS 2000: 623-632
3EEHarish Sethu: Congestion-Free Routing of Streaming Multimedia Content in BMIN-Based Parallel Systems. IPDPS Workshops 2000: 234-241
2EEHarish Sethu, Craig B. Stunkel, Robert F. Stucke: IBM RS/6000 SP Interconnection Network Topologies for Large Systems. ICPP 1998: 620-
1 Harish Sethu, Meghanad D. Wagh: Design of Time-Optimal Hardware-Efficient Divide-and-Conquer Algorithms. ICPP (3) 1992: 237-240

Coauthor Index

1Thomas Gerety [21] [22]
2Madhusudan Hosaagrahara [19] [23]
3Salil S. Kanhere [4] [5] [6] [7] [8] [12] [16]
4Adam J. O'Donnell [9] [13] [17]
5Alpa B. Parekh [4] [5]
6Hongyuan Shi [10] [16]
7Robert F. Stucke [2]
8Craig B. Stunkel [2]
9Meghanad D. Wagh [1]
10Yunkai Zhou [11] [14] [15] [18]

Colors in the list of coauthors

Copyright © Sun May 17 03:24:02 2009 by Michael Ley (ley@uni-trier.de)