Data networks
Introduction to algorithms
Performance and stability of communication networks via robust exponential bounds
IEEE/ACM Transactions on Networking (TON)
On the self-similar nature of Ethernet traffic (extended version)
IEEE/ACM Transactions on Networking (TON)
The turn model for adaptive routing
Journal of the ACM (JACM)
IEEE/ACM Transactions on Networking (TON)
Wide area traffic: the failure of Poisson modeling
IEEE/ACM Transactions on Networking (TON)
Interconnections (2nd ed.): bridges, routers, switches, and internetworking protocols
Interconnections (2nd ed.): bridges, routers, switches, and internetworking protocols
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
Modeling and analysis of power-tail distributions via classical teletraffic methods
Queueing Systems: Theory and Applications
Fault-tolerant wormhole message routing in computer/communication networks
Fault-tolerant wormhole message routing in computer/communication networks
Prevention of deadlocks and livelocks in lossless backpressured packet networks
IEEE/ACM Transactions on Networking (TON)
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 tutorial on some new methods for performance evaluation of queueing networks
IEEE Journal on Selected Areas in Communications
Admission control for statistical QoS: theory and practice
IEEE Network: The Magazine of Global Internetworking
Application specific NoC design
Proceedings of the conference on Design, automation and test in Europe: Proceedings
The DISCO network calculator: a toolbox for worst case analysis
valuetools '06 Proceedings of the 1st international conference on Performance evaluation methodolgies and tools
Designing application-specific networks on chips with floorplan information
Proceedings of the 2006 IEEE/ACM international conference on Computer-aided design
Stability of FIFO networks under adversarial models: State of the art
Computer Networks: The International Journal of Computer and Telecommunications Networking
NoCOUT: NoC topology generation with mixed packet-switched and point-to-point networks
Proceedings of the 2008 Asia and South Pacific Design Automation Conference
Transforming general networks into feed-forward by using turn-prohibition
Computer Communications
Towards an FBM model based network calculus framework with service differentiation
Mobile Networks and Applications
A methodology for computing end-to-end delay bounds in FIFO-multiplexing tandems
Performance Evaluation
FBM model based network-wide performance analysis with service differentiation
The Fourth International Conference on Heterogeneous Networking for Quality, Reliability, Security and Robustness & Workshops
Computer Networks: The International Journal of Computer and Telecommunications Networking
Proceedings of the 47th Design Automation Conference
A method to remove deadlocks in networks-on-chips with wormhole flow control
Proceedings of the Conference on Design, Automation and Test in Europe
Synthesis of low-overhead configurable source routing tables for network interfaces
Proceedings of the Conference on Design, Automation and Test in Europe
Application-specific 3D Network-on-Chip design using simulated allocation
Proceedings of the 2010 Asia and South Pacific Design Automation Conference
The ReNoC Reconfigurable Network-on-Chip: Architecture, Configuration Algorithms, and Evaluation
ACM Transactions on Embedded Computing Systems (TECS)
Preserving the independence of flows in general topologies using turn-prohibition
IWQoS'05 Proceedings of the 13th international conference on Quality of Service
Formally enhanced runtime verification to ensure NoC functional correctness
Proceedings of the 44th Annual IEEE/ACM International Symposium on Microarchitecture
Optimized 3D Network-on-Chip Design Using Simulated Allocation
ACM Transactions on Design Automation of Electronic Systems (TODAES)
Searching for tight performance bounds in feed-forward networks
MMB&DFT'10 Proceedings of the 15th international GI/ITG conference on Measurement, Modelling, and Evaluation of Computing Systems and Dependability and Fault Tolerance
A complete self-testing and self-configuring NoC infrastructure for cost-effective MPSoCs
ACM Transactions on Embedded Computing Systems (TECS) - Special Section on Wireless Health Systems, On-Chip and Off-Chip Network Architectures
CusNoC: fast full-chip custom NoC generation
IEEE Transactions on Very Large Scale Integration (VLSI) Systems
ForEVeR: A complementary formal and runtime verification approach to correct NoC functionality
ACM Transactions on Embedded Computing Systems (TECS) - Special Issue on Design Challenges for Many-Core Processors, Special Section on ESTIMedia'13 and Regular Papers
Hi-index | 0.00 |
Network calculus is known to apply in general only to feedforward routing networks, i.e., networks where routes do not create cycles of interdependent packet flows. In this paper, we address the problem of using network calculus in networks of arbitrary topology. For this purpose, we introduce a novel graph-theoretic algorithm, called turn-prohibition (TP), that breaks all the cycles in a network and, thus, prevents any interdependence between flows. We prove that the TP-algorithm prohibits the use of at most 1/3 of the total number turns in a network, for any network topology. Using analysis and simulation, we show that the TP-algorithm significantly outperforms other approaches for breaking cycles, such as the spanning tree and up/down routing algorithms, in terms of network utilization and delay bounds. Our simulation results also show that the network utilization achieved with the TP-algorithm is within a factor of two of the maximum theoretical network utilization, for networks of up to 50 nodes of degree four. Thus, in many practical cases, the restriction of network calculus to feedforward routing networks may not represent a too significant limitation.