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.
| Original language | English (US) |
|---|---|
| Pages (from-to) | 2176-2179 |
| Number of pages | 4 |
| Journal | IEICE Transactions on Communications |
| Volume | E93-B |
| Issue number | 8 |
| DOIs | |
| State | Published - Aug 2010 |
All Science Journal Classification (ASJC) codes
- Software
- Computer Networks and Communications
- Electrical and Electronic Engineering
Keywords
- Analysis
- Performance
- Switch
- Throughput