On the behavior of PHM distributed schedulers for input buffered packet switches

Author

Asorey-Cacheda, R. ; González-Castaño, F.J. ; López-Bravo, C. ; Pousada-Carballo, J.M. ; Rodríguez-Hernández, P.S.

Author_Institution

Dept. de Ingenieria Telematica, Univ. de Vigo, Spain

Volume

51

Issue

7

fYear

2003

fDate

7/1/2003 12:00:00 AM

Firstpage

1057

Lastpage

1060

Abstract

iSLIP and parallel hierarchical matching (PHM) are distributed maximal size matching schedulers for input-buffered switches. Previous research has analyzed the hardware cost of those schedulers and their performance after a small number of iterations. In this paper, we formulate an upper bound for the number of iterations required by PHM to converge. Then, we compare the number of iterations required by iSLIP and PHM to achieve a maximal throughput under uniform Bernoulli traffic, by means of simulation. Finally, we obtain the corresponding delay performances, which are similar. The results suggest that PHM has both the advantages of previous hierarchical matching algorithms (low hardware complexity) and iSLIP (low number of iterations).

Keywords

buffer storage; convergence; iterative methods; optimisation; packet switching; scheduling; telecommunication traffic; PHM; convergence; delay performance; distributed schedulers; hardware complexity; iSLIP; input buffered packet switches; iterations; maximal size matching schedulers; maximal throughput; parallel hierarchical matching; uniform Bernoulli traffic; upper bound; Costs; Hardware; Impedance matching; Packet switching; Performance analysis; Prognostics and health management; Switches; Throughput; Traffic control; Upper bound;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/TCOMM.2003.814201

Filename

1214825