Statistische Leistungsschranken für Computernetzwerke und Kommunikationssysteme

具有高可扩展性的概念的实现对互联网的成功至关重要。因此，骨干路由器转发聚合流量，避免任何逐流处理。流之间的公平性是通过端到端拥塞控制来实现的，但这种方法并不普遍适用。因此，今天的Internet只实现了一种称为Best-Effort的基本服务，它不提供任何形式的性能保证。最近的差异化服务体系结构通过添加一些额外的服务类（理想情况下带有已定义的服务保证）来扩展单一服务Internet，同时保持流量聚合的概念。然而，在聚合调度网络中，性能保证的推导是复杂的，仍有待研究。这个问题是由难以量化的交通聚合和多路复用效应引起的。本项目旨在发展一个用于聚合调度网络性能评估的框架。应用领域是多方面的，范围从尺寸到入场控制。计划工作的一个重要部分是应用有效带宽理论的概念开发一个简明的概率网络演算。目标是通过允许某些违规概率来扩展今天的最坏情况分析。

The realization of concepts with high scalability has been crucial to the success of the Internet. Consequently, backbone routers forward aggregated traffic, avoiding any per-flow treatment. Fairness among flows is approached by end-to-end congestion control, which, however, is not generally applicable. Hence, today's Internet implements only one basic service, called Best-Effort, that does not provide performance guarantees of any kind. The recent Differentiated Services architecture extends the single service Internet by adding few additional service classes, ideally with defined service guarantees, while maintaining the concept of traffic aggregation. However, in Aggregate scheduling networks the derivation of performance guarantees is complicated and still subject to research. The problem is caused by traffic aggregation and multiplexing effects that are hard to quantify. This project aims at evolving a framework for performance evaluation of Aggregate scheduling networks. The areas of application are manifold and range from dimensioning to admission control. A significant part of the intended work is the development of a concise probabilistic Network Calculus applying concepts from the theory of effective bandwidths. The goal is to extend today's worst-case analysis by allowing for certain violation probabilities.