A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is
Packet-based networks have opened the possibility of carrying a great variety of applications with different traffic profiles. Traffic profiles such as bursty traffic is essential for the analysis and evaluation of network performance. This paper is a simulation study devoted to comparing the performance of a range of packet-level multiplexing algorithms with bursty traffic. Four multiplexing algorithms are studied: round robin, random selection, weighted random selection and longest queue.doi:10.25103/jestr.031.09 fatcat:2k2npc4qprbrjk7fxsqz4mzdsu