Evaluating the relative operational efficiency of large-scale computer networks : an approach via data envelopment analysis

Abstract The objective of the present study was the development of a methodology to be used as an aid in decision making for the attainment of optimum operational efficiency in large-scale computer communications networks. The above methodology is realized in two stages. In the first stage, a queueing model (M/M/1/K) of a typical network is developed, and analytical results for the main performance indicators are obtained. The results are used, in the second stage, as a starting point for the application of a data envelopment analysis (DEA) procedure to obtain characteristics of network operational efficiency. Emphasis is placed on suggestions for improving the efficiency level of (relatively) inefficient nodes; numerical examples are also provided to illustrate the applicability of various options. Finally, possible routes for achieving a higher level of overall network efficiency are discussed, within the context of a performance tuning procedure, which are aimed at reducing the effects of performance bottlenecks.

[1]  Gary D. Ferrier,et al.  Measuring cost efficiency in banking: Econometric and linear programming evidence , 1990 .

[2]  G. C. Pentzaropoulos.  Steady-state and asymptotic performance of SATNET under variable packet flow conditions , 1991, Comput. Commun..

[3]  G. C. Barney,et al.  PERFORMANCE COMPARISONS WITHIN A COMPUTER NETWORK OF PRIME SYSTEMS , 1983 .

[4]  Rc Morey,et al.  Comparing the allocative efficiencies of hospitals , 1990 .

[5]  D. Giokas,et al.  A Study of the Relative Efficiency of Bank Branches: An Application of Data Envelopment Analysis , 1990 .

[6]  H. Sherman.  Hospital Efficiency Measurement and Evaluation: Empirical Test of a New Technique , 1984, Medical care.

[7]  John E. Beasley,et al.  Comparing university departments , 1990 .

[8]  Lennart Hjalmarsson,et al.  Deterministic parametric and nonparametric estimation of efficiency in service production: A comparison , 1990 .

[9]  J. Little.  A Proof for the Queuing Formula: L = λW , 1961 .

[10]  Abraham Charnes,et al.  Measuring the efficiency of decision making units , 1978 .

[11]  A. Charnes,et al.  Some Models for Estimating Technical and Scale Inefficiencies in Data Envelopment Analysis , 1984 .

[12]  M. Farrell.  The Measurement of Productive Efficiency , 1957 .

[13]  H. Sherman,et al.  Bank branch operating efficiency: Evaluation with Data Envelopment Analysis , 1985 .

[14]  D. Giokas.  Bank branch operating efficiency: A comparative application of DEA and the loglinear model , 1991 .

[15]  Emmanuel Thanassoulis,et al.  Applied data envelopment analysis , 1991 .

[16]  Arnold O. Allen,et al.  Probability, statistics and queueing theory - with computer science applications (2. ed.) , 1981, Int. CMG Conference.

[17]  G. C. Pentzaropoulos,et al.  Cost-performance modelling and optimization of network flow balance via linear goal programming analysis , 1993, Comput. Commun..

[18]  Arnold O. Allen,et al.  Probablity, Statistics and Queueing Theory with Computer Science Applications, Second Edition , 1990, Int. CMG Conference.

[19]  Hideaki Takagi,et al.  Stochastic Analysis of Computer and Communication Systems , 1990 .

[20]  John N. Daigle.  Queueing theory for telecommunications , 1992, Addison-Wesley series in telecommunications.

[21]  Lawrence M. Seiford,et al.  Recent developments in dea : the mathematical programming approach to frontier analysis , 1990 .

[22]  Jeff Kennington,et al.  An Application of Mathematical Programming to Assess Productivity in the Houston Independent School District , 1982 .