• DocumentCode
    379441
  • Title

    Resource marking and fair rate allocation

  • Author

    Zimmermann, S. ; Killat, U.

  • Author_Institution
    Dept. of Commun. Networks, Technische Univ. Hamburg-Harburg, Hamburg, Germany
  • Volume
    2
  • fYear
    2002
  • fDate
    2002
  • Firstpage
    1310
  • Abstract
    In resource marking theory, users adapt their rates according to their utility functions and congestion signals from the network. Using a special type of utility function, this leads to a proportionally fair rate allocation among the users. We examine the ability of two proposed resource marking implementations, random exponential marking (see Athuraliya, S. et al., Teletraffic Science and Engineering, vol. 4, p.817-28, 2001) and the virtual queue mechanism (see Gibbens, R.J. and Kelly, F.P., Automatica, vol.35, p.1969-85, 1999), to yield a proportionally fair rate allocation. We also propose a third and less complex algorithm, single bit resource marking, that combines the advantages of both.
  • Keywords
    optimisation; queueing theory; resource allocation; telecommunication congestion control; congestion control; congestion signals; fair rate allocation; optimization theory; random exponential marking; single bit resource marking; utility function; virtual queue mechanism; Bandwidth; Communication networks; Costs; Distributed algorithms; Intelligent networks; Intserv networks; Negative feedback; Pricing; Resource management; Signal generators;
  • fLanguage
    English
  • Publisher
    ieee
  • Conference_Titel
    Communications, 2002. ICC 2002. IEEE International Conference on
  • Print_ISBN
    0-7803-7400-2
  • Type

    conf

  • DOI
    10.1109/ICC.2002.997061
  • Filename
    997061