Dynamics of random early detection
SIGCOMM '97 Proceedings of the ACM SIGCOMM '97 conference on Applications, technologies, architectures, and protocols for computer communication
Using name-based mappings to increase hit rates
IEEE/ACM Transactions on Networking (TON)
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
Providing guaranteed services without per flow management
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Promoting the use of end-to-end congestion control in the Internet
IEEE/ACM Transactions on Networking (TON)
Endpoint admission control: architectural issues and performance
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Proceedings of the conference on Applications, Technologies, Architectures, and Protocols for Computer Communication
Coupon TFRC: a mechanism being friendly to both TCP and continuous stream
Computer Networks: The International Journal of Computer and Telecommunications Networking
The Algorithm and Model of Trash: A Scheme Enforcing Equal Share
ICCNMC '01 Proceedings of the 2001 International Conference on Computer Networks and Mobile Computing (ICCNMC'01)
Providing deterministic quality-of-service guarantees on WDM optical networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
Multiple Flow Regulator (MFR), a novel network component that is easy to implement, is proposed in this paper. Different from well-known single flow regulator such as leaky bucket, MFR regulates mutual relations among individual flows within an aggregated flow. A MFR based on the random sampling are proposed and its flow rate regulating property is identified in this paper. As a rate flow regulator, this kind of MFR regulates the output rate of each flow according to the input rates of all flows. MFR can not only be used to identify and detach the flow with the maximum rate from an aggregated flow, but also to measure characters of an aggregated flow, and to penalize nonresponsive flows. Static mathematical model of MFR with finite memory and infinite memory are formulated and analyzed respectively. The approaching process of MFR's behavior with finite memory to the limiting form is studied numerically. Simulation results, conducted with ns2 and real measured flows, show that the behavior of a MFR fits the mathematical descriptions provided in this paper. Large application potentials of MFR are revealed as well.