On the scheduling of real-time multihop packet-switching networks

Abstract

The purpose of the paper is to present a method to validate tentative routes to establish calls with end-to-end timing-constraints in a multihop packet-switching network. Timing release counters are proposed as a mechanism to guarantee that intervals between consecutive releases of messages of the same call are not shorter than the call period. A comparative evaluation of the proposed timing release counters vs. the alternative method of stop-and-go queues is performed.