期刊名称：International Journal of Computer Science and Network Security
印刷版ISSN：1738-7906
出版年度：2008
卷号：8
期号：1
页码：222-227
出版社：International Journal of Computer Science and Network Security
摘要：First-in-First-out (FIFO) is the most widely used scheduling protocol in packet switching network. In fact, it is one of the simplest queuing policies used to provide best effort services in packet-switched network. However, the performance of FIFO is really crucial when it related to stability i.e. question of whether there is a bound on the total size of packets in the network at all times. In this study, our primary objective is to find the optimum packet size of voice packet when using FIFO adversarial network and FIFO M/M/1 network. Our new approach is based on adversarial generation of packets so that positive results are more robust in that they do not depend on particular probabilistic assumptions about the input sequences. In this paper, we proposed the FIFO scheduling technique that uses adversarial queuing model to find the best packet size of voice packet in FIFO network. Although the simulation results show that the average packet loss is increase when the arrival packet is increased, the average packet delay is improved as compared to FIFO M/M/1 technique, studied by [2]. The proposed algorithm can be applied in packet-switched network, with adaptive routing, in order to transfer voice packet over the Internet.
Loading...
