Name
Abstract | ||
|---|---|---|
The performance analysis of the variable packet size crosspoint queued switch is presented in this paper. Packet switch throughput and average latency are evaluated under Interrupted Bernoulli Process incoming traffic pattern. It is shown that among the observed algorithms, the longest queue first algorithm has the highest throughput with short crosspoint buffers, but the highest average latency. Also, we establish that the choice of the scheduling algorithm does not play a significant role in the switch performance if the buffers are long enough. Therefore, the round robin algorithm becomes the best choice for implementation due to its simplicity. |
Year | DOI | Venue |
|---|---|---|
2013 | 10.1109/EUROCON.2013.6625053 | EUROCON |
Keywords | Field | DocType |
packet switching,queueing theory,Interrupted Bernoulli Process,crosspoint-queued switch,performance analysis,queue first algorithm,round robin algorithm,scheduling algorithm,short crosspoint buffers,switch performance,variable packet size,Average latency,Buffer length,Crosspoint-queued switch,Throughput,Variable packet size | Computer science,Network packet,Queue,Bernoulli process,Computer network,Burst switching,Queueing theory,Packet switching,Throughput,Round-robin scheduling | Conference |
ISBN | Citations | PageRank |
978-1-4673-2230-0 | 1 | 0.36 |
References | Authors | |
9 | 4 | |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Milutin Radonjic | 1 | 31 | 4.12 |
| Maljevic, I. | 2 | 1 | 0.70 |
| Nedjeljko Lekic | 3 | 1 | 0.36 |
| Igor Radusinovic | 4 | 96 | 15.03 |