Analysis of Matching Dynamics of PIM with Multiple Iterations in an Input-Buffered Packet Switch

被引：1

作者：

Kitsuwan, Nattapong ^{[1
]}

Oki, Eiji ^{[1
]}

Rojas-Cessa, Roberto ^{[2
,3
]}

机构：

[1] Univ Electrocommun, Dept Informat & Commun Engn, Chofu, Tokyo 1828585, Japan

[2] New Jersey Inst Technol, Dept Elect & Comp Engn, Newark, NJ 07102 USA

[3] Japan Soc Promot Sci, Tokyo, Japan

来源：

IEICE TRANSACTIONS ON COMMUNICATIONS | 2010年 / E93B卷 / 08期

关键词：

switch; analysis; throughput; performance;

D O I：

10.1587/transcom.E93.B.2176

中图分类号：

TM [电工技术]; TN [电子技术、通信技术];

学科分类号：

0808 ; 0809 ;

摘要：

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.

引用

页码：2176 / 2179

页数：4

共 7 条

[1]

Abramowitz M., 1972, HDB MATH FUNCTIONS F, P824

[2] HIGH-SPEED SWITCH SCHEDULING FOR LOCAL-AREA NETWORKS [J].

ANDERSON, TE ;

OWICKI, SS ;

SAXE, JB ;

THACKER, CP .

ACM TRANSACTIONS ON COMPUTER SYSTEMS, 1993, 11 (04) :319-352

[3]

Apostol T., 1990, Modular Functions and Dirichlet Series in Number Theory (Graduate Texts in Mathematics), Vvol 41

[4] Achieving 100% throughput in an input-queued switch [J].

McKeown, N ;

Mekkittikul, A ;

Anantharam, V ;

Walrand, J .

IEEE TRANSACTIONS ON COMMUNICATIONS, 1999, 47 (08) :1260-1267

[5] The iSLIP scheduling algorithm for input-queued switches [J].

McKeown, N .

IEEE-ACM TRANSACTIONS ON NETWORKING, 1999, 7 (02) :188-201

[6]

MEKKITTIKUL A, 1996, P ICCCN 96, P226

[7] Analysis of nonblocking ATM switches with multiple input queues [J].

Nong, G ;

Muppala, JK ;

Hamdi, M .

IEEE-ACM TRANSACTIONS ON NETWORKING, 1999, 7 (01) :60-74

← 1 →