Analytical evaluation of PHM convergence

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 t...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on communications 2006-09, Vol.54 (9), p.1547-1553
Main Authors: Gonzalez-Castano, F.J., Lopez-Bravo, C., Asorey-Cacheda, R., Rodriguez-Hernandez, P.S., Pousada-Carballo, J.M.
Format: Article
Language:English
Subjects:
Algorithms
Application specific integrated circuits
Applied sciences
Computational efficiency
Computational modeling
Convergence
Delay
Exact sciences and technology
Iterative methods
Matching
Mathematical analysis
Parallel hierarchical matching (PHM)
Prognostics and health management
scheduling
Scheduling algorithm
Switches
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Teletraffic
Traffic control
Traffic engineering
Traffic flow
Upper bound
virtual output-queued (VOQ)
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary: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(log 2 N), as in the case of iSLIP-like algorithms
ISSN:0090-6778
1558-0857
DOI:10.1109/TCOMM.2006.881205