This letter presents a theoretical analysis of the Parallel Iterative Matching (PIM)'s dynamics with multiple iterations used in an input-buffered packet switch. In our approach, by carefully categorizing all unmatched patterns into several representative patterns after each iteration, probabilities of accumulated matched pairs in a recursive manner are successfully obtained. Numerical evaluations of the analytical formulas are performed.
The copyright of the original papers published on this site belongs to IEICE. Unauthorized use of the original or translated papers is prohibited. See IEICE Provisions on Copyright for details.
Copy
Nattapong KITSUWAN, Eiji OKI, Roberto ROJAS-CESSA, "Analysis of Matching Dynamics of PIM with Multiple Iterations in an Input-Buffered Packet Switch" in IEICE TRANSACTIONS on Communications,
vol. E93-B, no. 8, pp. 2176-2179, August 2010, doi: 10.1587/transcom.E93.B.2176.
Abstract: This letter presents a theoretical analysis of the Parallel Iterative Matching (PIM)'s dynamics with multiple iterations used in an input-buffered packet switch. In our approach, by carefully categorizing all unmatched patterns into several representative patterns after each iteration, probabilities of accumulated matched pairs in a recursive manner are successfully obtained. Numerical evaluations of the analytical formulas are performed.
URL: https://global.ieice.org/en_transactions/communications/10.1587/transcom.E93.B.2176/_p
Copy
@ARTICLE{e93-b_8_2176,
author={Nattapong KITSUWAN, Eiji OKI, Roberto ROJAS-CESSA, },
journal={IEICE TRANSACTIONS on Communications},
title={Analysis of Matching Dynamics of PIM with Multiple Iterations in an Input-Buffered Packet Switch},
year={2010},
volume={E93-B},
number={8},
pages={2176-2179},
abstract={This letter presents a theoretical analysis of the Parallel Iterative Matching (PIM)'s dynamics with multiple iterations used in an input-buffered packet switch. In our approach, by carefully categorizing all unmatched patterns into several representative patterns after each iteration, probabilities of accumulated matched pairs in a recursive manner are successfully obtained. Numerical evaluations of the analytical formulas are performed.},
keywords={},
doi={10.1587/transcom.E93.B.2176},
ISSN={1745-1345},
month={August},}
Copy
TY - JOUR
TI - Analysis of Matching Dynamics of PIM with Multiple Iterations in an Input-Buffered Packet Switch
T2 - IEICE TRANSACTIONS on Communications
SP - 2176
EP - 2179
AU - Nattapong KITSUWAN
AU - Eiji OKI
AU - Roberto ROJAS-CESSA
PY - 2010
DO - 10.1587/transcom.E93.B.2176
JO - IEICE TRANSACTIONS on Communications
SN - 1745-1345
VL - E93-B
IS - 8
JA - IEICE TRANSACTIONS on Communications
Y1 - August 2010
AB - This letter presents a theoretical analysis of the Parallel Iterative Matching (PIM)'s dynamics with multiple iterations used in an input-buffered packet switch. In our approach, by carefully categorizing all unmatched patterns into several representative patterns after each iteration, probabilities of accumulated matched pairs in a recursive manner are successfully obtained. Numerical evaluations of the analytical formulas are performed.
ER -