Skip to main content
Journal ArticleOPEN ACCESS

Extended DBP for (m,k)-firm based QoS

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2004) 3222 357-365
DOI: 10.1007/978-3-540-30141-7_50
5Citations
Citations of this article
3Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper, an extended DBP (E_DBP) scheme is studied for (m,k)-firm constraint. The basic idea of the proposed algorithm takes into account the distance to exit a failure state, which is a symmetrical notion of distance to fall into a failure state in DBP. Quality of Service (QoS) in terms of dynamic failure and delay is evaluated. Simulation results reveal the effectiveness of E_DBP to provide better QoS. © IFIP International Federation for Information Processing 2004.

Cite

CITATION STYLE

APA

Chen, J., Wang, Z., Song, Y., & Sun, Y. (2004). Extended DBP for (m,k)-firm based QoS. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), 3222, 357–365. https://doi.org/10.1007/978-3-540-30141-7_50

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free