Robust non-probabilistic bounds for delay and throughput in credit-based flow control
暂无分享,去创建一个
[1] Aurel A. Lazar,et al. Cooperative distributed scheduling for ATS-based broadband networks , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.
[2] Partho Pratim Mishra,et al. A hop by hop rate-based congestion control scheme , 1992, SIGCOMM 1992.
[3] Jon W. Mark,et al. Design and analysis of a credit-based controller for congestion control in B-ISDN/ATM networks , 1995, Proceedings of INFOCOM'95.
[4] H. T. Kung,et al. Gigabit local area networks: a systems perspective , 1992, IEEE Communications Magazine.
[5] Robert Morris,et al. Use of Link-by-Link Flow Control in Maximizing ATM Network Performance: Simulation Results , 1993 .
[6] George Varghese,et al. Reliable and efficient hop-by-hop flow control , 1994, SIGCOMM 1994.
[7] S. Jamaloddin Golestani,et al. A self-clocked fair queueing scheme for broadband applications , 1994, Proceedings of INFOCOM '94 Conference on Computer Communications.
[8] Abhay Parekh,et al. A generalized processor sharing approach to flow control in integrated services networks: the single-node case , 1993, TNET.
[9] Rene L. Cruz,et al. A calculus for network delay, Part II: Network analysis , 1991, IEEE Trans. Inf. Theory.
[10] Gopalakrishnan Ramamurthy,et al. A predictive hop-by-hop congestion control policy for high speed networks , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.
[11] Trevor Blackwell,et al. Credit-based flow control for ATM networks: credit update protocol, adaptive credit allocation and statistical multiplexing , 1994, SIGCOMM 1994.