Performance bonds for flow control protocols
IEEE/ACM Transactions on Networking (TON)
`` Direct Search'' Solution of Numerical and Statistical Problems
Journal of the ACM (JACM)
Instability of FIFO in session-oriented networks
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Performance Guarantees in Communication Networks
Performance Guarantees in Communication Networks
Delay bounds for a network of guaranteed rate servers with FIFO aggregation
Computer Networks: The International Journal of Computer and Telecommunications Networking
Delay Bounds in a Network with Aggregate Scheduling
QofIS '00 Proceedings of the First COST 263 International Workshop on Quality of Future Internet Services
Computer Networks: The International Journal of Computer and Telecommunications Networking - Network processors
Application of network calculus to general topologies using turn-prohibition
IEEE/ACM Transactions on Networking (TON)
Scheduling for quality of service guarantees via service curves
ICCCN '95 Proceedings of the 4th International Conference on Computer Communications and Networks
Fundamental Trade-offs in Aggregate Packet Scheduling
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
A parameter based admission control for differentiated services networks
Computer Networks: The International Journal of Computer and Telecommunications Networking - QoS in multiservice IP networks
A network service curve approach for the stochastic analysis of networks
SIGMETRICS '05 Proceedings of the 2005 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
"Pay bursts only once" does not hold for non-FIFO guaranteed rate nodes
Performance Evaluation - Performance 2005
Tight end-to-end per-flow delay bounds in FIFO multiplexing sink-tree networks
Performance Evaluation
The DISCO network calculator: a toolbox for worst case analysis
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Worst case burstiness increase due to arbitrary aggregate multiplexing
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Modeling and Worst-Case Dimensioning of Cluster-Tree Wireless Sensor Networks
RTSS '06 Proceedings of the 27th IEEE International Real-Time Systems Symposium
Network calculus: a theory of deterministic queuing systems for the internet
Network calculus: a theory of deterministic queuing systems for the internet
Sensor network calculus – a framework for worst case analysis
DCOSS'05 Proceedings of the First IEEE international conference on Distributed Computing in Sensor Systems
Application of network calculus to guaranteed service networks
IEEE Transactions on Information Theory
On deterministic traffic regulation and service guarantees: a systematic approach by filtering
IEEE Transactions on Information Theory
Traffic engineering in a multipoint-to-point network
IEEE Journal on Selected Areas in Communications
Quality of service guarantees in virtual circuit switched networks
IEEE Journal on Selected Areas in Communications
| Hi-index | 0.00 |
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.