Maximum throughput of an input queueing packet switch with two priority classes

1994 ◽  
Vol 42 (12) ◽  
pp. 3095-3097 ◽  
Author(s):  
Lemin Li ◽  
Caijun Hu ◽  
Pu Liu
Keyword(s):  
Maximum Throughput ◽  
Packet Switch ◽  
Input Queueing

The Analysis of Input Queueing Techniques on a Crosspoint Packet Switch

1997 ◽  
Vol 07 (04) ◽  
pp. 319-331
Author(s):  
Jung Hoon Paik ◽  
Chae Tak Lim
Keyword(s):  
Markov Chain ◽  
Packet Delay ◽  
Contention Resolution ◽  
Input Buffer ◽  
New Approach ◽  
Average Packet Delay ◽  
N Input ◽  
Packet Switch ◽  
Input Queueing ◽  
The Relationship

In this paper, an N × N input-buffered crosspoint packet switch which selects a Head of the Line, HOL, packet in contention randomly is analyzed with a new approach. The approach is based on both a Markov chain representation of the input buffer and the probability that a HOL packet is successfully served. The probability as a function of N is derived, and it makes it possible to express the average packet delay and the average number of packets in the buffer as a function of N. The new contention resolution policy based on the occupancy of the input buffer is also presented and analyzed with this same approach and the relationship between the two selection policies is analyzed.

On the Maximum Throughput of a Combined Input-Crosspoint Queued Packet Switch

2006 ◽  
Vol E89-B (11) ◽  
pp. 3120-3123 ◽  
Author(s):  
R. ROJAS-CESSA ◽  
Z. GUO ◽  
N. ANSARI
Keyword(s):  
Maximum Throughput ◽  
Packet Switch

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

2010 ◽  
Vol E93-B (8) ◽  
pp. 2176-2179
Author(s):  
Nattapong KITSUWAN ◽  
Eiji OKI ◽  
Roberto ROJAS-CESSA
Keyword(s):  
Packet Switch
Sign in / Sign up

Export Citation Format

Share Document