Solving multicommodity integral flow problems by simulated allocation Michal PióroPiotr Gajowniczek OriginalPaper Pages: 17 - 28
A depth‐first dynamic programming procedure for the extended tree knapsack problem in local access network design Dong X. ShawGeon ChoHsuliang Chang OriginalPaper Pages: 29 - 43
Modified least loaded routing in virtual path based ATM networks Hon‐Wai ChuDanny H.K. Tsang OriginalPaper Pages: 45 - 57
Real‐time causal message ordering in multimedia systems Frank AdelsteinMukesh Singhal OriginalPaper Pages: 59 - 74
A new model for fault and availability in complex multimedia services Theodora A. VarvarigouSid Ahuja OriginalPaper Pages: 75 - 94
Some applications of counting process models with partially observed covariates Eric V. Slud OriginalPaper Pages: 95 - 104
Buffer losses vs. deadline violations for ABR traffic in an ATM switch: A computational approach Meera BalakrishnanAntonio PuliafitoYannis Viniotis OriginalPaper Pages: 105 - 123
Call admission control schemes under generalized processor sharing scheduling Zhi‐Li ZhangZhen LiuDon Towsley OriginalPaper Pages: 125 - 152
Dynamic connection admission mechanisms for the Networking BroadBand Services architecture L. GünT.E. TedijantoP.F. Chimento OriginalPaper Pages: 153 - 183
Admission control and resource management for multi‐service ATM networks Ivy HsuJean Walrand OriginalPaper Pages: 185 - 207
Stochastic geometry and architecture of communication networks François BaccelliMaurice KleinSergei Zuyev OriginalPaper Pages: 209 - 227
A modified offered load approximation for nonstationary circuit switched networks Otis B. JenningsWilliam A. Massey OriginalPaper Pages: 229 - 251
The time‐dependent Erlang loss model with retrials Nathaniel GrierWilliam A. MasseyWard Whitt OriginalPaper Pages: 253 - 265
Economies of scale for long‐range dependent traffic in short buffers N.G. Duffield OriginalPaper Pages: 267 - 280
Semi‐Markovian modelling and performance analysis of variable rate traffic in ATM networks Gerhard Haßlinger OriginalPaper Pages: 281 - 298
Call routing to distributed queues: Is FIFO really better than MED? Yaakov KoganYonatan LevyRodolfo A. Milito OriginalPaper Pages: 299 - 312