MURAL - Maynooth University Research Archive Library



    Fairness and Convergence Results for Additive-Increase Multiplicative-Decrease Multiple-Bottleneck Networks.


    Middleton, Richard H. and Kellett, Christopher M. and Shorten, Robert N. (2006) Fairness and Convergence Results for Additive-Increase Multiplicative-Decrease Multiple-Bottleneck Networks. In: 45th IEEE Conference on Decision and Control The Manchester Grand Hyatt December 13-15, 2006. San Diego, CA, USA. IEEE, pp. 1864-1869. ISBN 1-4244-0171-2

    [img] Download (198kB)
    Official URL: http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arn...


    Share your research

    Twitter Facebook LinkedIn GooglePlus Email more...



    Add this article to your Mendeley library


    Abstract

    We examine the behavior of the Additive-Increase Multiplicative-Decrease (AIMD) congestion control algorithm. We present a variant of a recently proposed matrix model that allows us to obtain previous results for competition via a single bottleneck link. We then extend these results to the case of multiple bottleneck links paying particular attention to some aspects of fairness and convergence properties for multiple bottleneck systems. We examine both the synchronous (deterministic) and asynchronous (stochastic) cases. A simple simulation example illustrates the results.

    Item Type: Book Section
    Additional Information: "© 2006 IEEE. Reprinted from 45th IEEE Conference on Decision and Control The Manchester Grand Hyatt December 13-15, 2006. San Diego, CA, USA. Personal use of this material is permitted. However, permission to reprint/republish this material for advertising or promotional purposes or for creating new collective works for resale or redistribution to servers or lists, or to reuse any copyrighted component of this work in other works must be obtained from the IEEE." http://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=4177305&isnumber=4176993
    Keywords: Convergence; Matrix algebra; Telecommunication congestion control; Additive-increase multiplicative-decrease congestion control; Additive-increase multiplicative-decrease multiple-bottleneck networks; Deterministic cases; Fairness; Matrix model; Stochastic cases; Hamilton Institute.
    Academic Unit: Faculty of Science and Engineering > Computer Science
    Faculty of Science and Engineering > Research Institutes > Hamilton Institute
    Item ID: 1771
    Identification Number: https://doi.org/10.1109/CDC.2006.376806
    Depositing User: Hamilton Editor
    Date Deposited: 11 Jan 2010 11:51
    Publisher: IEEE
    Refereed: Yes
    URI:

    Repository Staff Only(login required)

    View Item Item control page

    Downloads

    Downloads per month over past year