Worst-case analysis of router networks with rival queueing models
Gulpinar, Nalan, Harrison, Pete and Rustem, Berç (2006) Worst-case analysis of router networks with rival queueing models. In: 21st International Symposium on Computer and Information Sciences (ISCIS 2006), Istanbul, TURKEY, NOV 01-03, 2006. Published in: Computer and Information Sciences - ISCIS 2006, Proceedings, 4263 pp. 897-907.Full text not available from this repository.
A robust, worst-case design framework is developed for a tandem router network based on rival queueing models. Worst-case design is concerned with determining the best design or strategy in the most hostile operating environment, i.e. simultaneously with worst-case model parameters. In the router network, end-to-end performance is computed as the mean transmission delay subject to an upper limit on the rate of losses and finite capacity queueing and recovery buffers. The worst-case optimal ratio of arrival-buffer size to recovery-buffer size is determined, which is a critical quantity that affects both loss rate and transmission time. The impact of the retransmission probability is also investigated.
|Item Type:||Conference Item (UNSPECIFIED)|
|Subjects:||Q Science > QA Mathematics > QA76 Electronic computers. Computer science. Computer software|
|Series Name:||LECTURE NOTES IN COMPUTER SCIENCE|
|Journal or Publication Title:||Computer and Information Sciences - ISCIS 2006, Proceedings|
|Editor:||Levi, A and Savas, E and Yenigun, H and Balcisory, S and Saygin, Y|
|Number of Pages:||11|
|Page Range:||pp. 897-907|
|Title of Event:||21st International Symposium on Computer and Information Sciences (ISCIS 2006)|
|Location of Event:||Istanbul, TURKEY|
|Date(s) of Event:||NOV 01-03, 2006|
Actions (login required)