Hop-by-hop flow control can be used to fairly share the bandwidth of a network among competing flows. No data is lost even in overload conditions; yet each flow gets access to the maximum throughput when the network is lightly loaded. However, some schemes for hop-by-hop flow control require too much memory; some of them are not resilient to errors. We propose a scheme for making hop-by-hop flow control resilient and show that it has advantages over schemes proposed by Kung. We also describe a novel method for
Digital Equipment Corporation, Networks Engineering/Advanced Development, LKG1-2/E1O, 550 King Street, Littleton, MA;
Digital Equipment Corporation, Networks Engineering/High Performance Networks, LKG1-2/W6, 550 King Street, Littleton, MA;
Washington University in St. Louis, work done while at Digital Equipment Corporation;
机译:可靠,高效的逐跳流量控制
机译:公平可靠的逐跳流量控制
机译:有损链路的无线网络中的跨层速率控制:管道泄漏流量,有效的网络实用程序最大化和逐跳算法
机译:对IEEE 802.3x逐跳流控制和TCP端到端流控制的交互进行建模
机译:多相环境流的高效可靠的数学建模技术。
机译:Ad-Hoc网络中基于竞争的逐跳双向拥塞控制算法
机译:可靠,高效的逐跳流量控制
机译:建模IEEE 802.3x逐跳流控制与TCp端到端流量控制的交互;概率来看