Abstract
AbstractWe study the interaction between an MIMD (Multiplicative Increase Multiplicative Decrease) congestion control algorithm and a Drop Tail buffer. We consider the problem in the framework of deterministic hybrid models. We first show that the hybrid model of the interaction between the MIMD congestion control and bottleneck router always converges to a cyclic behavior that can be of only two different types. Second, we characterize the minimum buffer size required such that the bottleneck link is fully utilized. In particular, our analysis indicates that an MIMD algorithm requires smaller buffer sizes than AIMD in order to fully utilize the link capacity.KeywordsInternet routerMIMD controlbeamformingfluid model
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
