Although I am interested in many (too many!) things, my academic focus is on trying to understand how distributed resources can/should be shared. We tend to think about sharing well defined "things" but very often the resource is harder to grasp!
For example, recently I have looked at how autonomous wireless systems should share spectrum. The traditional notion of dividing the band into discrete frequencies which are then allocated to different systems is often an inefficient use of bandwidth. However, what is better? In this case we have a resource (spectrum) that is hard to define and there are few fundamental results to guide us. The nature of interference is inherently distributed since it so dependent on where the receivers are located vis-a-vis transmitters. This is the kind of problem I like to think about.
In the past I was interested in how the buffer and link capacity of wired link can be allocated to the traffic flows of packet network so that the allocation is efficient and flexible performance guarantees can be assured.
Finally, I have always been interested in how global problems can be solved via simple local rules. I have thought about this in the context of asynchronous distributed algorithms.
Guy Bresler, Abhay Parekh, and David Tse, "Approximate Capacity of the Many-to-One Interference Channel ", Allerton Conference, Sept. 2007.
Raul Etkin, Abhay Parekh and David Tse, "Spectrum Sharing for Unlicensed Bands":
Abhay Parekh, A Generalized Processor Sharing Approach to Flow Control, Ph.D. Thesis, MIT 1992, Presentation (1992). Citations
A. K. Parekh and R. G. Gallager, "A generalized processor sharing approach to flow control in integrated services networks: The Single Node Case," IEEE/ACM Transactions on Networking, vol. 1, no. 3, pp. 344--357, June 1993. Citations.
A. K. Parekh and R. G. Gallager. A Generalized Processor Sharing Approach to flow control in Integrated Services Networks - The Multiple Node Case. IEEE/ACM Transactions on Networking, 2(1):137150, April 1994. Citations
A. K. Parekh and R. G. Gallager. A generalized processor sharing approach to flow control-- the single node case. In Proceedings of IEEE INFOCOM'92, 1992.
Abhay K. Parekh, Robert G. Gallager: A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Multiple Node Case. INFOCOM 1993: 521-530
L. Georgiadis, R Guerin, A Parekh: "Optimal multiplexing on a single link: delay and buffer requirements" IEEE TRANSACTIONS ON INFORMATION THEORY, VOL. 43, NO. 5, SEPTEMBER, 1997. Citations.
L Georgiadis, R Guerin, A Parekh: "Optimal multiplexing on a single link: delay and buffer requirements" .PROC IEEE INFOCOM pp. 524-532, 1994.
Israel Cidon, Tony Hsiao, Asad Khamisy, Abhay K. Parekh, Raphael Rom, Moshe Sidi: OPENET: An Open and Efficient Control Platform for ATM Networks. INFOCOM 1998: 824-831
Abhay K. Parekh: Analysis of a Greedy Heuristic for Finding Small Dominating Sets in Graphs. Inf. Process. Lett. 39(5): 237-240 (1991) Citations
AK Parekh - "Selecting Routers in Ad Hoc Networks", Proceedings SBT/IEEE Intl Telecommunications Symposium. Citations.
Quality of Service Re-examined: Presented at a Networking Seminar, U. C. Berkeley, 1997
The Great Internet Deadlock, ICIR, Berkeley 2002
Why there is no Network QoS and what to do about it, IWQOS 03, Monterey, 2003.
Overview, Distributed Computation, Hierarchical Routing, Overlay Routing,
IEEE Communication Society William Bennett Prize Paper Award, 1994.
Prize Paper Award at INFOCOM '93.
Vinton Hayes Graduate Fellow 1990-1991.
Center for Intelligent Control Systems Graduate Fellow 1989-1990.
Maryland State Scholar 1982-1983.
Co-PI: ITR Grant from NSF: The 3 R's of Spectrum Management: Reduce, Reuseand Recycle. 2003-2007. University of California, Berkeley CA.
