## Abstract

This paper describes four scheduling algorithms and two packet-dropping algorithms for transmitting soft-real-time variable-bit-rate traffic in a packet-switched network. Simulation results show that the first-come-first-serve algorithm, which is equivalent to the earliest-deadline-first algorithm when all packets have equal relative deadlines, outperforms the timed-token algorithm as well as two other real-time scheduling algorithms. We also simulated the last-in-first-discard (LIFD) algorithm as well as a more complex (1, k) packet-dropping algorithm which, for each stream, tries to drop no more than 1 packet in any sequence of k packets. We found that although the (1, k) dropping algorithm does significantly reduce the failure rate, the same reduction in this failure rate can be achieved by slightly lowering the network utilization and using the simpler LIFD algorithm.

Original language | English (US) |
---|---|

Pages (from-to) | 143-152 |

Number of pages | 10 |

Journal | Conference on Local Computer Networks |

State | Published - 1996 |

Event | Proceedings of the 1996 21st Conference on Local Computer Networks - Minneapolis, MN, USA Duration: Oct 13 1996 → Oct 16 1996 |

## ASJC Scopus subject areas

- Software
- Electrical and Electronic Engineering