A real time message stream is said to have an (m, k) firm guarantee requirement if at least m out of any k consecutive messages from the stream must meet their deadlines to ensure adequate quality of service. M. Hamdaoui and P. Ramanathan (1995) recently proposed a scheduling policy called Distance based Priority Assignment (DBP) to better service multiple real time streams, each with its own (m, k) firm guarantee requirement. The key assumption in the DBP technique is that all messages reach their destination in one hop. This assumption, however, is not valid in most networks because there is often no direct connection between the source and the destination nodes of a real time stream. The DBP scheme is extended to deal with streams in which the messages traverse more than one hop in reaching their destination. Through empirical evaluation, it is also shown that this extended DBP scheme, called DBP-M, performs better than existing policies in reducing the probability of not meeting the (m, k) firm guarantee requirement.
展开▼
机译：如果来自该流的任何k个连续消息中至少m个必须满足其期限以确保足够的服务质量，则实时消息流被称为具有（m，k）个牢固的保证要求。 M. Hamdaoui和P. Ramanathan（1995）最近提出了一种调度策略，称为基于距离的优先级分配（DBP），以更好地服务于多个实时流，每个实时流都有其自己的（m，k）保证要求。 DBP技术中的关键假设是所有消息都在一跳中到达目的地。但是，此假设在大多数网络中无效，因为实时流的源节点和目标节点之间通常没有直接连接。 DBP方案已扩展为处理流，在流中，消息在到达目的地时要经过一个以上的跃点。通过经验评估，还表明，这种扩展的DBP方案DBP-M在降低不满足（m，k）坚定担保要求的可能性方面比现有策略表现更好。
展开▼
