Transforming general networks into feed-forward by using turn-prohibition

This publication has 9 references indexed in Scilit:

• Prevention of deadlocks and livelocks in lossless backpressured packet networks
  IEEE/ACM Transactions on Networking, 2003
• Application of network calculus to general topologies using turn-prohibition
  IEEE/ACM Transactions on Networking, 2003
• Universal-stability results and performance bounds for greedy contention-resolution protocols
  Journal of the ACM, 2001
• A quantitative comparison of graph-based models for Internet topology
  IEEE/ACM Transactions on Networking, 1997
• Modeling Internet topology
  IEEE Communications Magazine, 1997
• A necessary and sufficient condition for deadlock-free routing in cut-through and store-and-forward networks
  IEEE Transactions on Parallel and Distributed Systems, 1996
• A calculus for network delay. I. Network elements in isolation
  IEEE Transactions on Information Theory, 1991
• Problems in large LANs
  IEEE Network, 1988
• Nondeterministic Algorithms
  Journal of the ACM, 1967