K. G. Ramakrishnan

According to our database1, K. G. Ramakrishnan authored at least 29 papers between 1976 and 2002.

Collaborative distances:

Awards

IEEE Fellow

IEEE Fellow 2005, "For contributions to congestion control and traffic management in communication networks.".

Timeline

Legend:

Book 
In proceedings 
Article 
PhD thesis 
Dataset
Other 

Links

On csauthors.net:

Bibliography

2002
Asymptotic Solution to an Inverse Problem for a Shared Unbuffered Resource.
SIAM J. Appl. Math., 2002

The structure and management of service level agreements in networks.
IEEE J. Sel. Areas Commun., 2002

2001
Optimal routing in shortest-path data networks.
Bell Labs Tech. J., 2001

A*prune: An Algorithm for Finding K Shortest Paths Subject to Multiple Constraints.
Proceedings of the Proceedings IEEE INFOCOM 2001, 2001

Efficient Computation of Delay-sensitive Routes from One Source to All Destinations.
Proceedings of the Proceedings IEEE INFOCOM 2001, 2001

Efficient algorithms for location and sizing problems in network design.
Proceedings of the Global Telecommunications Conference, 2001

2000
Optimal Design of Signaling Networks for Internet Telephony.
Proceedings of the Proceedings IEEE INFOCOM 2000, 2000

1999
Optimization and Design of Network Routing Using Refined Asymptotic Approximations.
Perform. Evaluation, 1999

Virtual Private Networks: Joint Resource Allocation and Routing Design.
Proceedings of the Proceedings IEEE INFOCOM '99, 1999

1998
Refined Asymptotic Approximations to Loss Probabilities and Their Sensitivities in Shared Unbuffered Resources.
SIAM J. Appl. Math., 1998

Dynamic bandwidth allocation algorithms for high-speed data wireless networks.
Bell Labs Tech. J., 1998

VPN DESIGNER: A tool for design of multiservice virtual private networks.
Bell Labs Tech. J., 1998

1997
Implementation of a Variance Reduction-Based Lower Bound in a Branch-and-Bound Algorithm for the Quadratic Assignment Problem.
SIAM J. Optim., 1997

An overview of the multimedia communications exchange (MMCX) and its performance characterization.
Bell Labs Tech. J., 1997

1996
ATM network design and optimization: a multirate loss network framework.
IEEE/ACM Trans. Netw., 1996

On-line routing for permanent virtual circuits.
Comput. Commun., 1996

1995
The allocation of value for jointly provided services.
Telecommun. Syst., 1995

Computing Lower Bounds for the Quadratic Assignment Problem with an Interior Point Algorithm for Linear Programming.
Oper. Res., 1995

On-Line Routing for Permanent Virtural Circuits.
Proceedings of the Proceedings IEEE INFOCOM '95, 1995

1994
Lower bounds for the quadratic assignment problem.
Ann. Oper. Res., 1994

1993
On the expected optimal value of random assignment problems: Experimental results and open questions.
Comput. Optim. Appl., 1993

1992
A continuous approach to inductive inference.
Math. Program., 1992

1991
A Unified Set of Proposals for Control and Design of High Speed Data Networks.
Queueing Syst. Theory Appl., 1991

An interior point algorithm to solve computationally difficult set covering problems.
Math. Program., 1991

Computational results of an interior point algorithm for large scale linear programming.
Math. Program., 1991

An Approximate Dual Projective Algorithm for Solving Assignment Problems.
Proceedings of the Network Flows And Matching, 1991

1990
Computational Experience with an Interior Point Algorithm on the Satisfiability Problem.
Proceedings of the 1st Integer Programming and Combinatorial Optimization Conference, 1990

1980
Solving Two-Commodity Transportation Problems with Coupling Constraints.
J. ACM, 1980

1976
A numerically stable optimization method based on A homogeneous function.
Math. Program., 1976


  Loading...