Abhay K. Parekh - researchr alias

researchr

You are not signed in
Sign in
Sign up

Viewing Publication 1 - 12 from 12

2013

Congestion Control, Routing and Scheduling in Communication Networks: A TutorialJean C. Walrand, Abhay K. Parekh. ieicet, 96-B(11):2714-2723, 2013. [doi]

1999

OPENET: an open and efficient control platform for ATM networks[1]This work was performed in and sponsored by Sun Microsystems LabsIsrael Cidon, Tony Hsiao, Asad Khamisy, Abhay K. Parekh, Raphael Rom, Moshe Sidi. jhsn, 8(3):195-210, 1999. [doi]

1998

OPENET: An Open and Efficient Control Platform for ATM NetworksIsrael Cidon, Tony Hsiao, Asad Khamisy, Abhay K. Parekh, Raphael Rom, Moshe Sidi. infocom 1998: 824-831

1997

Optimal multiplexing on a single link: delay and buffer requirementsLeonidas Georgiadis, Roch Guérin, Abhay K. Parekh. TIT, 43(5):1518-1535, 1997.

1994

Optimal Multiplexing on a Single Link: Delay and Buffer RequirementsLeonidas Georgiadis, Roch Guérin, Abhay K. Parekh. infocom 1994: 524-532

A generalized processor sharing approach to flow control in integrated services networks: the multiple node caseAbhay K. Parekh, Robert G. Gallager. ton, 2(2):137-150, 1994. [doi]

Guest Editor's Introduction: Quality of Service in Integrated Services NetworksAbhay K. Parekh. jhsn, 3(4):331-333, 1994. [doi]

1993

A generalized processor sharing approach to flow control in integrated services networks: the single-node caseAbhay K. Parekh, Robert G. Gallager. ton, 1(3):344-357, 1993. [doi]

A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks: The Multiple Node CaseAbhay K. Parekh, Robert G. Gallager. infocom 1993: 521-530

1992

A Generalized Processor Sharing Approach to Flow Control in Integrated Services Networks - The Single Node CaseAbhay K. Parekh, Robert G. Gallager. infocom 1992: 915-924

A generalized processor sharing approach to flow control in integrated services networksAbhay K. Parekh. PhD thesis, Massachusetts Institute of Technology, Cambridge, MA, USA, 1992. [doi]

1991

Analysis of a Greedy Heuristic for Finding Small Dominating Sets in GraphsAbhay K. Parekh. ipl, 39(5):237-240, 1991.

Sign in or sign up to see more results.

runs on WebDSL