### Inhalt

### zur Navigation

## Es gibt keine deutsche Übersetzung dieser Webseite.

# Analytical Performance Evaluation

The success of computer and communication systems strongly depends on their performance, typically reflected in the perception of speed. Optimizing system performance, subject to a set of resource and cost constraints, is thus a critical design goal for system engineers. An elegant technique to help in this matter is performance evaluation which can be performed either by measurements, simulation, or using theoretical methods. In particular, analytical performance evaluation has the fundamental merit of rapidly leading to rigorous and unequivocal insight into the behavior of systems which can be accordingly tuned and optimized.

Our own research is concerned with extending the theory of the stochastic network calculus, which is a probabilistic extension of the deterministic network calculus conceived by R. Cruz in the early 1990's. Over the past two decades the calculus has established itself as a versatile alternative methodology to the classical queueing theory for the performance analysis of computer and communication networks. Its prospect is that it can deal with problems that are fundamentally hard for queueing theory, based on the fact that it works with bounds rather than striving for exact solutions. We are in particular concerned with various fundamental research problems related to modelling and analyzing networks with flow transformations, or improving the bounds accuracy using refined inequalities. On the long term, we believe that our research can significantly contribute to establishing the stochastic network calculus as an indispensable mathematical tool for the performance analysis of resource sharing based systems.

## Selected Publications

Zitatschlüssel | CSW-OENWFTICF-11 |
---|---|

Autor | Ciucu, Florin and Schmitt, Jens and Wang, Hao |

Buchtitel | Proceedings of the 30th IEEE International Conference on Computer Communications (INFOCOM '11) |

Seiten | 1979–1987 |

Jahr | 2011 |

ISBN | 978-1-4244-9919-9 |

ISSN | 0743-166X |

DOI | http://dx.doi.org/10.1109/INFCOM.2011.5935003 |

Ort | Shanghai, China |

Adresse | New York, NY, USA |

Monat | April |

Verlag | IEEE |

Zusammenfassung | Convolution-form networks have the property that the end-to-end service of network flows can be expressed in terms of a (min,+)-convolution of the per-node services. This property is instrumental for deriving end-to-end queueing results which fundamentally improve upon alternative results derived by a node-by-node analysis. This paper extends the class of convolution-form networks with stochastic settings to scenarios with flow transformations, e.g., by loss, dynamic routing or retransmissions. In these networks, it is shown that by using the tools developed in this paper end-to-end delays grow as O(n) in the number of nodes n; in contrast, by using the alternative node-by-node analysis, end-to-end delays grow as O(n^2). |