BLOCKING PROBABILITY WITH TIME-DRIVEN PRIORITY SCHEDULING
Mario Baldi, Y. Ofek · 2000
This paper evaluates call blocking probability over packet-switched networks with Time-driven priority (TDP) (Li et al. 1998; Li, Ofek and Yung 1996). The presented work is novel since call blocking is typically studied in the context of circuit-switched networks. TDP together with resource reservation enables real-time delivery of packets with no loss due to congestion and constant jitter of one time frame (TF)typically between 12.5 s and 125 s. Resource reservation for a call (or multiple calls) over a TDP network requires finding a schedule. A call may not be accepted for two reasons (i) there is no capacitythe call is rejectedor (ii) there is capacity but no schedulethe call is blocked. This work studies the call blocking probability as a function of the link utilization, since call blocking can possibly lead to low link utilization. In other words, it may not be possible to fully utilize the network because of unschedulability (i.e., the inability to find a schedule). The results...