Computing tight performance bounds in feed-forward networks under general assumptions about arrival and server models has turned out to be a challenging problem. Recently it was even shown to be NP-hard [1].We now address this problem in a heuristic fashion, building on a procedure for computing provably tight bounds under simple traffic and server models. We use a decomposition of a complex problem with more general traffic and server models into a set of simpler problems with simple traffic and server models. This set of problems can become prohibitively large, and we therefore resort to heuristic methods such as Monte Carlo. This shows interesting tradeoffs between performance bound quality and computational effort. © Springer-Verlag Berlin Heidelberg 2010.
CITATION STYLE
Kiefer, A., Gollan, N., & Schmitt, J. B. (2010). Searching for tight performance bounds in feed-forward networks. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5987 LNCS, pp. 227–241). https://doi.org/10.1007/978-3-642-12104-3_18
Mendeley helps you to discover research relevant for your work.