Delay analysis for interfered paths under general cut-through switching
暂无分享,去创建一个
[1] Leonard Kleinrock,et al. A Tradeoff Study of Switching Systems in Computer Communication Networks , 1980, IEEE Transactions on Computers.
[2] Chong Kwan Un,et al. Performance Analysis of a Quasi-M/D/1 Cut-Through Switching Network with Noisy Channels , 1986, IEEE Trans. Commun..
[3] D. L. Schilling,et al. Delay Decomposition at a Single Server queue with Constant Service Time and Multiple Inputs , 1978, IEEE Trans. Commun..
[4] H. Mouftah,et al. Performance evaluation of computer communications networks , 1985, IEEE Communications Magazine.
[5] Leonard Kleinrock,et al. Virtual Cut-Through: A New Computer Communication Switching Technique , 1979, Comput. Networks.
[6] H. T. Mouftah,et al. Delay Analysis Under a General Cut-Through Switching Technique in Computer Networks , 1987, IEEE Trans. Commun..
[7] Ronald W. Wolff,et al. Poisson Arrivals See Time Averages , 1982, Oper. Res..
[8] Izhak Rubin. An Approximate Time-Delay Analysis for Packet-Switching Communication Networks , 1976, IEEE Trans. Commun..
[9] Linus Schrage. Letter to the Editor - An Alternative Proof of a Conservation Law for the Queue G/G/1 , 1970, Oper. Res..
[10] H. T. Mouftah,et al. Quasi cut-through: New hybrid switching technique for computer communication networks , 1984 .
[11] Donald L. Schilling,et al. Waiting Times at Very Fast, Constant Service Time Merger Nodes , 1984, IEEE Trans. Commun..