Analytical evaluation of PHM convergence

  • F. Javier González-Castaño /
  • C. López-Bravo /
  • R. Asorey-Cacheda /
  • Pedro S. Rodríguez-Hernández /
  • J. M. Pousada-Carballo
Journal ar
IEEE Transactions on Communications
  • Volumen: 54
  • Número: 9
  • Fecha: 01 septiembre 2006
  • Páginas: 1547-1553
  • ISSN: 00906778
  • Tipo de fuente: Revista
  • DOI: 10.1109/TCOMM.2006.881205
  • Tipo de documento: Artículo
The parallel hierarchical matching (PHM) algorithm is a distributed maximal size matching scheduler for virtual output-queued switches. In a previous letter, we formulated an upper bound on the maximum number of iterations PHM requires to achieve a maximal size matching in any traffic scenario. In this letter, we follow an analytical approach to find the average number of iterations for PHM to achieve a maximal size matching under diverse traffic models. The estimated number of iterations is O(log2 N), as in the case of iSLIP-like algorithms. © 2006 IEEE.

Palabras clave del autor

    Palabras clave indexadas

      Detalles de financiación