Cycle Time Properties Of The FDDI Token Ring Protocol
暂无分享,去创建一个
[1] Edward G. Coffman,et al. A continuous polling system with constant service times , 1986, IEEE Trans. Inf. Theory.
[2] Werner Bux,et al. Architecture and Design of a Reliable Token-Ring Network , 1983, IEEE Journal on Selected Areas in Communications.
[3] 高木 英明,et al. Analysis of polling systems , 1986 .
[4] Onno J. Boxma. Two Symmmetric Queues with Alternating Service and Switching Times , 1984, Performance.
[5] K. Mani Chandy,et al. Performance models of token ring local area networks , 1983, SIGMETRICS '83.
[6] Michael J. Ferguson,et al. Exact Results for Nonsymmetric Token Ring Systems , 1985, IEEE Trans. Commun..
[7] Onno Boxma,et al. The M/G/1 queue with alternating service formulated as a Riemann-Hilbert problem , 1981 .
[8] E. Newhall,et al. A Simplified Analysis of Scan Times in an Asymmetrical Newhall Loop with Exhaustive Service , 1977, IEEE Trans. Commun..
[9] M. Johnson,et al. Proof that Timing Requirements of the FDDI Token Ring Protocol are Satisfied , 1987, IEEE Trans. Commun..
[10] Bernd Meister,et al. Waiting Lines and Times in a System with Polling , 1974, JACM.
[11] Marjory J. Johnson. Reliability Mechanisms of the FDDI High Bandwidth Token Ring Protocol , 1986, Comput. Networks.