Generalized guaranteed rate scheduling algorithms: a framework
IEEE/ACM Transactions on Networking (TON)
Aggregation and conformance in differentiated service networks: a case study
ACM SIGCOMM Computer Communication Review
Worst case burstiness increase due to FIFO multiplexing
Performance Evaluation
Delay bounds for a network of guaranteed rate servers with FIFO aggregation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Analysis on Generalized Stochastically Bounded Bursty Traffic for Communication Networks
LCN '02 Proceedings of the 27th Annual IEEE Conference on Local Computer Networks
Relationship between guaranteed rate server and latency rate server
Computer Networks: The International Journal of Computer and Telecommunications Networking
Network calculus: a theory of deterministic queuing systems for the internet
Network calculus: a theory of deterministic queuing systems for the internet
INFOCOM'96 Proceedings of the Fifteenth annual joint conference of the IEEE computer and communications societies conference on The conference on computer communications - Volume 1
Stochastically bounded burstiness for communication networks
IEEE Transactions on Information Theory
A basic stochastic network calculus
Proceedings of the 2006 conference on Applications, technologies, architectures, and protocols for computer communications
Fundamental calculus on generalized stochastically bounded bursty traffic for communication networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Quality of Service constrained routing optimization using Evolutionary Computation
Applied Soft Computing
| Hi-index | 0.00 |
To achieve some level of Quality of Service (QoS) assurance, a network usually has Service Level Agreements (SLAs) with its users and neighboring domains, which describe the QoS level that the service provider is committed to provide, and the specification of traffic that users or neighboring domains are allowed to send. An interesting and important question arises as to whether a flow is still conformant to its original traffic specification after crossing the network since it may interact with other flows within the network. In this paper, we study analytically the extent to which a flow and an aggregate of flows become non-conformant through an analysis of the stochastic burstiness increase of flows after crossing a per-flow scheduling network and an aggregate scheduling network. The stochastic behavior of a server in aggregate scheduling networks is also studied to determine the conformance deterioration of individual flows, which provides the theoretical conformance deterioration bound and provides useful results for conformance analysis in an aggregate scheduling network with general topology. Our theoretical results are verified by extensive simulations.