Throughput analysis of input queueing packet switch under improved FIFO policy

Tatsuya Taniai; Iwao Sasase

doi:10.1109/ICCS.1992.255053

Throughput analysis of input queueing packet switch under improved FIFO policy

Tatsuya Taniai, Iwao Sasase

Department of Information and Computer Science

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

1 Citation (Scopus)

Abstract

The improved FIFO policy for an input queue-ing packet switch is proposed to attain higher maximum throughput, smaller the probability of blocking, and smaller waiting time. Under the proposed policy, one of the blocked packets is returned to the head of the input buffer and other packets are sent back to the end of the respective input buffers in order to reduce block-repeating probability. First, we analyze maximum throughput, probability of blocking, probability of the packets being sent to the end of the buffer, and average waiting time, respectively. Next, we show that the maximum throughput and the average waiting time of the input queue-ing packet switch under the proposed policy can be improved.

Original language	English
Title of host publication	Proceedings - Singapore ICCS/ISITA 1992
Subtitle of host publication	''Communications on the Move''
Publisher	Institute of Electrical and Electronics Engineers Inc.
Pages	1282-1285
Number of pages	4
ISBN (Electronic)	0780308034, 9780780308039
DOIs	https://doi.org/10.1109/ICCS.1992.255053
Publication status	Published - 1992
Event	1992 Singapore: Communications on the Move, ICCS/ISITA 1992 - Singapore, Singapore Duration: 1992 Nov 16 → 1992 Nov 20

Publication series

Name	Proceedings - Singapore ICCS/ISITA 1992: ''Communications on the Move''

Conference

Conference	1992 Singapore: Communications on the Move, ICCS/ISITA 1992
Country/Territory	Singapore
City	Singapore
Period	92/11/16 → 92/11/20

ASJC Scopus subject areas

Computer Networks and Communications
Signal Processing

Access to Document

10.1109/ICCS.1992.255053

Cite this

Taniai, T., & Sasase, I. (1992). Throughput analysis of input queueing packet switch under improved FIFO policy. In Proceedings - Singapore ICCS/ISITA 1992: ''Communications on the Move'' (pp. 1282-1285). [255053] (Proceedings - Singapore ICCS/ISITA 1992: ''Communications on the Move''). Institute of Electrical and Electronics Engineers Inc.. https://doi.org/10.1109/ICCS.1992.255053

Throughput analysis of input queueing packet switch under improved FIFO policy. / Taniai, Tatsuya; Sasase, Iwao.

Proceedings - Singapore ICCS/ISITA 1992: ''Communications on the Move''. Institute of Electrical and Electronics Engineers Inc., 1992. p. 1282-1285 255053 (Proceedings - Singapore ICCS/ISITA 1992: ''Communications on the Move'').

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

Taniai, T & Sasase, I 1992, Throughput analysis of input queueing packet switch under improved FIFO policy. in Proceedings - Singapore ICCS/ISITA 1992: ''Communications on the Move''., 255053, Proceedings - Singapore ICCS/ISITA 1992: ''Communications on the Move'', Institute of Electrical and Electronics Engineers Inc., pp. 1282-1285, 1992 Singapore: Communications on the Move, ICCS/ISITA 1992, Singapore, Singapore, 92/11/16. https://doi.org/10.1109/ICCS.1992.255053

Taniai T, Sasase I. Throughput analysis of input queueing packet switch under improved FIFO policy. In Proceedings - Singapore ICCS/ISITA 1992: ''Communications on the Move''. Institute of Electrical and Electronics Engineers Inc. 1992. p. 1282-1285. 255053. (Proceedings - Singapore ICCS/ISITA 1992: ''Communications on the Move''). https://doi.org/10.1109/ICCS.1992.255053

@inproceedings{04a33d79e45f426a9a535cef86bcfd03,

title = "Throughput analysis of input queueing packet switch under improved FIFO policy",

abstract = "The improved FIFO policy for an input queue-ing packet switch is proposed to attain higher maximum throughput, smaller the probability of blocking, and smaller waiting time. Under the proposed policy, one of the blocked packets is returned to the head of the input buffer and other packets are sent back to the end of the respective input buffers in order to reduce block-repeating probability. First, we analyze maximum throughput, probability of blocking, probability of the packets being sent to the end of the buffer, and average waiting time, respectively. Next, we show that the maximum throughput and the average waiting time of the input queue-ing packet switch under the proposed policy can be improved.",

author = "Tatsuya Taniai and Iwao Sasase",

note = "Funding Information: This work is partly supported by Ministry of Education, NTT Data Communications Systems Corporation and Mitsubishi Electric Corporation. Publisher Copyright: {\textcopyright} 1992 IEEE.; 1992 Singapore: Communications on the Move, ICCS/ISITA 1992 ; Conference date: 16-11-1992 Through 20-11-1992",

year = "1992",

doi = "10.1109/ICCS.1992.255053",

language = "English",

series = "Proceedings - Singapore ICCS/ISITA 1992: ''Communications on the Move''",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

pages = "1282--1285",

booktitle = "Proceedings - Singapore ICCS/ISITA 1992",

}

TY - GEN

T1 - Throughput analysis of input queueing packet switch under improved FIFO policy

AU - Taniai, Tatsuya

AU - Sasase, Iwao

PY - 1992

Y1 - 1992

N2 - The improved FIFO policy for an input queue-ing packet switch is proposed to attain higher maximum throughput, smaller the probability of blocking, and smaller waiting time. Under the proposed policy, one of the blocked packets is returned to the head of the input buffer and other packets are sent back to the end of the respective input buffers in order to reduce block-repeating probability. First, we analyze maximum throughput, probability of blocking, probability of the packets being sent to the end of the buffer, and average waiting time, respectively. Next, we show that the maximum throughput and the average waiting time of the input queue-ing packet switch under the proposed policy can be improved.

AB - The improved FIFO policy for an input queue-ing packet switch is proposed to attain higher maximum throughput, smaller the probability of blocking, and smaller waiting time. Under the proposed policy, one of the blocked packets is returned to the head of the input buffer and other packets are sent back to the end of the respective input buffers in order to reduce block-repeating probability. First, we analyze maximum throughput, probability of blocking, probability of the packets being sent to the end of the buffer, and average waiting time, respectively. Next, we show that the maximum throughput and the average waiting time of the input queue-ing packet switch under the proposed policy can be improved.

UR - http://www.scopus.com/inward/record.url?scp=84984329773&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84984329773&partnerID=8YFLogxK

U2 - 10.1109/ICCS.1992.255053

DO - 10.1109/ICCS.1992.255053

M3 - Conference contribution

AN - SCOPUS:84984329773

T3 - Proceedings - Singapore ICCS/ISITA 1992: ''Communications on the Move''

SP - 1282

EP - 1285

BT - Proceedings - Singapore ICCS/ISITA 1992

PB - Institute of Electrical and Electronics Engineers Inc.

T2 - 1992 Singapore: Communications on the Move, ICCS/ISITA 1992

Y2 - 16 November 1992 through 20 November 1992

ER -

Throughput analysis of input queueing packet switch under improved FIFO policy

Abstract

Publication series

Conference

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this