Abstract
An approximate numerical analysis to evaluate the mean waiting time and the blocking probability of the packet switch under first‐in/first‐out (FIFO) policy with speedup factor is performed. the improved input buffer control policy with speedup factor C is proposed to achieve small mean waiting time by computer simulation and compare the performance with conventional FIFO policy and longest queue policy. Under the proposed model, there are N/2 pairs of input buffers; if one input buffer is empty, the second packet in the queue of the other buffer is transferred to the other empty buffer. It is shown that speedup factor and proposed input buffer control policy can reduce the waiting time compared with conventional FIFO policy and longest queue policy.
Original language | English |
---|---|
Pages (from-to) | 1-10 |
Number of pages | 10 |
Journal | Electronics and Communications in Japan (Part I: Communications) |
Volume | 78 |
Issue number | 11 |
DOIs | |
Publication status | Published - 1995 Nov |
Keywords
- Packet switch
- input buffer control
- maximum throughput
- mean waiting time
- speedup factor
ASJC Scopus subject areas
- Computer Networks and Communications
- Electrical and Electronic Engineering