Performance comparison of voice packet sizes in the FIFO adversarial queuing and FIFO M/M/1 model.
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...
| Main Authors: | , , |
|---|---|
| Format: | Article |
| Language: | English English |
| Published: |
IJCSNS (International Journal of Computer Science and Network Security)
2008
|
| Online Access: | http://psasir.upm.edu.my/id/eprint/16125/ http://psasir.upm.edu.my/id/eprint/16125/1/Performance%20comparison%20of%20voice%20packet%20sizes%20in%20the%20FIFO%20adversarial%20queuing%20and%20FIFO%20M.pdf |
| _version_ | 1848842872163401728 |
|---|---|
| author | Muhammed, Abdullah Mohd Salleh, KyairulNiza Abdullah, Azizol |
| author_facet | Muhammed, Abdullah Mohd Salleh, KyairulNiza Abdullah, Azizol |
| author_sort | Muhammed, Abdullah |
| building | UPM Institutional Repository |
| collection | Online Access |
| description | 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. |
| first_indexed | 2025-11-15T08:06:02Z |
| format | Article |
| id | upm-16125 |
| institution | Universiti Putra Malaysia |
| institution_category | Local University |
| language | English English |
| last_indexed | 2025-11-15T08:06:02Z |
| publishDate | 2008 |
| publisher | IJCSNS (International Journal of Computer Science and Network Security) |
| recordtype | eprints |
| repository_type | Digital Repository |
| spelling | upm-161252015-10-26T00:21:25Z http://psasir.upm.edu.my/id/eprint/16125/ Performance comparison of voice packet sizes in the FIFO adversarial queuing and FIFO M/M/1 model. Muhammed, Abdullah Mohd Salleh, KyairulNiza Abdullah, Azizol 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. IJCSNS (International Journal of Computer Science and Network Security) 2008 Article PeerReviewed application/pdf en http://psasir.upm.edu.my/id/eprint/16125/1/Performance%20comparison%20of%20voice%20packet%20sizes%20in%20the%20FIFO%20adversarial%20queuing%20and%20FIFO%20M.pdf Muhammed, Abdullah and Mohd Salleh, KyairulNiza and Abdullah, Azizol (2008) Performance comparison of voice packet sizes in the FIFO adversarial queuing and FIFO M/M/1 model. International Journal of Computer Science and Network Security, 8 (1). pp. 222-227. ISSN 1738-7906 English |
| spellingShingle | Muhammed, Abdullah Mohd Salleh, KyairulNiza Abdullah, Azizol Performance comparison of voice packet sizes in the FIFO adversarial queuing and FIFO M/M/1 model. |
| title | Performance comparison of voice packet sizes in the FIFO adversarial queuing and FIFO M/M/1 model. |
| title_full | Performance comparison of voice packet sizes in the FIFO adversarial queuing and FIFO M/M/1 model. |
| title_fullStr | Performance comparison of voice packet sizes in the FIFO adversarial queuing and FIFO M/M/1 model. |
| title_full_unstemmed | Performance comparison of voice packet sizes in the FIFO adversarial queuing and FIFO M/M/1 model. |
| title_short | Performance comparison of voice packet sizes in the FIFO adversarial queuing and FIFO M/M/1 model. |
| title_sort | performance comparison of voice packet sizes in the fifo adversarial queuing and fifo m/m/1 model. |
| url | http://psasir.upm.edu.my/id/eprint/16125/ http://psasir.upm.edu.my/id/eprint/16125/1/Performance%20comparison%20of%20voice%20packet%20sizes%20in%20the%20FIFO%20adversarial%20queuing%20and%20FIFO%20M.pdf |