Abhay Parekh received a B.E.S. in Mathematical Sciences from Johns Hopkins University in 1983, an S.M. in Operations Research from the Sloan School of Management at MIT in 1985, and the Ph.D. in Electrical Engineering and Computer Science from MIT, where he was affiliated with the Laboratory for Information and Decision Systems. After obtaining his doctorate, Dr. Parekh was a postdoc with the MIT Laboratory for Computer Sciences. Before coming to the EECS Department at U.C. Berkeley as an Adjunct Professor in 2003, Dr. Parekh spent a number of years in industry (AT&T Bell Laboratories, T. J. Watson Research Center IBM, Sun Microsystems) working on various research problems, mostly in the area of computer networking. He was co-founder, as well as President and CEO of San Francisco-based FastForward Networks, which developed products to enable the large-scale distribution of broadcast video on the Internet. In 2000, FastForward Networks was sold to Inktomi, where its technology and products formed the basis of Inktomi's content networking offerings. After the merger, Dr. Parekh remained with Inktomi for a brief time as General Manager of the Media Products Division. From 2002-2008, he was associated with Accel Partners, an early stage venture capital firm as a Venture Partner. In 2009, he founded Flowgram, Inc. Prof. Parekh's papers on generalized processor sharing, which is a way of achieving quality of service in data networks, are among the most highly cited in the networking literature. In particular, his paper co-authored with Robert G. Gallager, "A generalized processor sharing approach to flow control in integrated services networks: The single-node case" was the recipient of the IEEE Communication Society's William Bennett Prize Paper Award in 1994 "for the best original paper published in the
IEEE/ACM Transactions on Networking in the past year." (A preliminary version of the paper received the Best Paper Award at INFOCOM 1993.) In 2002, the IEEE Communications Society selected it as one of the 16 most influential papers on networking to appear in the last 50 years. Prof. Parekh is also a co-author of two patents. Recently, Prof. Parekh has turned his research focus on understanding the nature of interference in wireless communication systems. He carries out this research at the Wireless Foundations Center.
- G. Bresler, A. Parekh, and D. Tse, "The Approximate Capacity of the Many-to-One and One-to-Many Gaussian Interference Channels," IEEE Trans. Inform. Theory, vol. 46, pp. 4566--4592, Sep. 2010.
- R. Etkin, A. Parekh, and D. Tse, "Spectrum sharing for unlicensed bands," IEEE J. Selected Areas in Communications, vol. 25, no. 3, pp. 517-528, April 2007.
- W. Welch, S. McCanne, and A. K. Parekh, "System for bandwidth allocation in a computer network," U.S. Patent 6,735,633. May 2004.
- A. Parekh, "Why There Is No Network QoS and What To Do About It (Invited Talk)," presented at 11th International Workshop on Quality of Service (IWQoS 2003), Monterey, CA, June 2003.
- I. Cidon, T. Hsiao, A. Khamisy, A. Parekh, R. Rom, and M. Sidi, "OPENET: An open and efficient control platform for ATM networks," J. High Speed Networks, vol. 8, no. 3, pp. 195-210, Sep. 1999.
- P. Chang, R. A. Guerin, A. K. Parekh, and J. T. Rayfield, "Method and system for implementing multiple leaky bucket checkers using a hybrid synchronous/asynchronous update mechanism," U.S. Patent 5,835,711. Nov. 1998.
- L. Georgiadis, R. Guerin, and A. Parekh, "Optimal multiplexing on a single link: Delay and buffer requirements," IEEE Trans. Information Theory, vol. 43, no. 5, pp. 1518-1535, Sep. 1997.
- A. Parekh and R. G. Gallager, "A generalized processor sharing approach to flow control in integrated services networks: The multiple node case," IEEE/ACM Trans. Networking, vol. 2, no. 2, pp. 137-150, April 1994.
- A. Parekh and R. G. Gallager, "IEEE Communication Society's William Bennett Prize Paper Award, 1994: A generalized processor sharing approach to flow control in integrated services networks: The single-node case," IEEE/ACM Trans. Networking, vol. 1, no. 3, pp. 344-357, June 1993.
- A. Parekh, "Analysis of a greedy heuristic for finding small dominating sets in graphs," Information Processing Letters, vol. 39, no. 5, pp. 237-240, Sep. 1991.