Queueing networks and Markov chains: modeling and performance evaluation with computer science applications
G-WiN —the Gbit/s infrastructure for the German scientific community
Computer Networks: The International Journal of Computer and Telecommunications Networking - Pioneering tomorrow's Internet Selected papers from the TERENA Networking Conference 2000 22–25 May 2000, Lisbon, Portugal
Performance Guarantees in Communication Networks
Performance Guarantees in Communication Networks
Performance of Computer Communication Systems: A Model-Based Approach
Performance of Computer Communication Systems: A Model-Based Approach
Interconnection Networks: An Engineering Approach
Interconnection Networks: An Engineering Approach
The output of a switch, or, effective bandwidths for networks
Queueing Systems: Theory and Applications
Analysis on Generalized Stochastically Bounded Bursty Traffic for Communication Networks
LCN '02 Proceedings of the 27th Annual IEEE Conference on Local Computer Networks
Application of network calculus to general topologies using turn-prohibition
IEEE/ACM Transactions on Networking (TON)
On realistic network topologies for simulation
MoMeTools '03 Proceedings of the ACM SIGCOMM workshop on Models, methods and tools for reproducible network research
Network calculus: a theory of deterministic queuing systems for the internet
Network calculus: a theory of deterministic queuing systems for the internet
Stochastically bounded burstiness for communication networks
IEEE Transactions on Information Theory
Statistical service assurances for traffic scheduling algorithms
IEEE Journal on Selected Areas in Communications
A methodology for computing end-to-end delay bounds in FIFO-multiplexing tandems
Performance Evaluation
| Hi-index | 0.00 |
Various elegant and powerful theories for network performance evaluation have to assume independence to be efficient. While traffic sources are often supposed to be independent, the implications of this assumption regarding flows in arbitrary networks are largely unknown. Recently, turn-prohibition was proposed to solve a related problem concerning feed-forward networks. In this paper we extend the concept of turn-prohibition to address the issue of independence of flows in general topologies. To this end we evolve an algorithm which derives a set of critical turns that provide full connectivity while conserving the independence of flows up to multiplexing points. In an iterative procedure further turns are added to improve connectivity. The developed algorithm is proven and exemplified.