Table Of Content

ELSEVIER Performance Evaluation 25 (1996) 317-318 Author Index Volume 25 (The issue number is given in front of the page numbers) Awater, G.A. and H.A.B. van de Vlag, Ex- Kim, D.S. and C.K. Un, Performance of con- act computation of time and call blocking tention processing schemes for WDM net- probabilities in large, multi-traffic, multi- works with control channels (2) 85-104 resource loss systems (1) 41- 58 Lee, T.T., see Liew, S.C. (4) 247-266 Bouras, C.J. and P.G. Spirakis, Performance Liew, S.C. and T.T. Lee, SKEL: A fundamen- modeling of distributed timestamp order- tal property desirable in ATM switches ing: Perfect and imperfect clocks (2) 105-130 for simple traffic management — illustra- tions with generic output-buffered and Brassil, J. and R. Cruz, Nonuniform traffic in the Manhattan street network (3) 233-242 input-buffered switches (4) 247-266 Bruneel, H. and B. Steyaert, Storage require- Magazine, M.J. and K.E. Stecke, Through- ments in ATM switching elements with put for production lines with serial work correlated arrivals and independent uni- stations and parallel service facilities (3) 211-232 form routing (3) 193-209 Meempat, G., G. Ramamurthy and B. Sen- gupta, A new performance measure for Chang, C.-J. and L.-C. Hwang, Analysis of a statistical multiplexing: perspective of the general service nonexhaustive polling sys- individual user (1) 59- 80 tem using a heuristic combination method Morrison, J.A., Blocking probabilities for and pseudoconservation law (3) 173-191 multiple class batched Poisson arrivals to Chiamtac, I., A. Ganz and M.G. Kienzle, a shared resource (2) 131-150 A performance model of a connection- oriented hypercube interconnection system (2) 151-167 Niemegeers, 1.G., see Haverkort, B.R. (1) 17- 40 Choudhury, G.L. and W. Whitt, Computing distributions and moments in polling mod- Ramamurthy, G., see Meempat, G. (1) 59- 80 els by numerical transform inversion (4) 267-292 Cruz, R., see Brassil, J. (3) 233-242 Sengupta, B., see Meempat, G. (1) 59- 80 Spirakis, P.G., see Bouras, C.J. (2) 105-130 Ganz, A., see Chiamtac, I. (2) 151-167 Stavrakakis, I., see Tsakiridou, S. (1) 1-15 Stecke, K.E., see Magazine, M.J. (3) 211-232 Haverkort, B.R. and LG. Niemegeers, Per- Steyaert, B., see Bruneel, H. (3) 193-209 formability modelling tools and techniques (1) 17-— 40 Tsakiridou, S. and I. Stavrakakis, Mean de- Hwang, L.-C., see Chang, C.-J. (3) 173-191 lay analysis of a statistical multiplexer with batch arrival processes—a generalization to Kienzle, M.G., see Chiamtac, I. (2) 151-167 Viterbi’s formula (i) 1-15 318 Author Index/ Performance Evaluation 25 (1996) 317-318 Youn, Y.S. and C.K. Un, Performance anal- Un, C.K., see Kim, D.S. (2) 85-104 ysis of cut-through buffered banyan net- Un, C.K., see Youn, Y.S. (4) 293-311 works with finite buffer size (4) 293-311 van de Viag, H.A.B., see Awater, G.A. (1) 41- 58 Whitt, W., see Choudhury, G.L. (4) 267-292 Performance Evaluation 25 (1996) 319 Subject Index to Volume 25 ATM Loss systems ATM switch Manufacturing system design ATM switches Markov reward models Batched arrivals Mean waiting time Blocking probabilities Multiple classes Boundary probabilities Nonexhaustive service discipline BPP arrival process Broadband networks Nonuniform traffic Numerical transform inversion Buffer allocation Buffer overflow Optical communication Buffered banyan network Packet switching Call congestion Performability Clock drifts Performance Closed-queueing model Performance analysis Concurrency control Polling models Conflicts Pseudoconservation law Connection-oriented communication Contention processing schemes Queueing networks Contention resolution Queueing Customer perception Regular networks Cut-through switching Reordering Deflection routing Resource sharing Dependability Serial production lines Discrete-time Shared resource Distributed databases Stochastic Petri nets Efficient computation Switch performance Erlang formula Switching Exhaustive service discipline Tail probabilities Fixed point approximation Throughput maximization Fourier-series method Timestamp Time congestion General modelling tool framework Traffic control and management General service order sequence Transient analysis Generating functions Unbalancing workload Hot-potato routing Uniform asymptotic approximation Hypercube Wavelength division multiplexing networks Independent routing Workload allocation Interconnection network B-ISDN