Data networks
Deadlock-Free Message Routing in Multiprocessor Interconnection Networks
IEEE Transactions on Computers
A Class of End-to-End Congestion Control Algorithms for the Internet
ICNP '98 Proceedings of the Sixth International Conference on Network Protocols
Evaluation of a start-stop protocol for best-effort traffic in ATM networks
Computer Communications
Congestion control in asynchronous, high-speed wormhole routing networks
IEEE Communications Magazine
A new feedback congestion control policy for long propagation delays
IEEE Journal on Selected Areas in Communications
Application of network calculus to general topologies using turn-prohibition
IEEE/ACM Transactions on Networking (TON)
Scalability of wireless networks
IEEE/ACM Transactions on Networking (TON)
Transforming general networks into feed-forward by using turn-prohibition
Computer Communications
A model of evaluation of adaptive fuzzy backpressure in policing mechanism schemes over VDSL network
ICS'06 Proceedings of the 10th WSEAS international conference on Systems
A model of fuzzy control backoff schemes in telecommunication networks
CIMMACS'05 Proceedings of the 4th WSEAS international conference on Computational intelligence, man-machine systems and cybernetics
Ethernet as a lossless deadlock free system area network
ISPA'05 Proceedings of the Third international conference on Parallel and Distributed Processing and Applications
Aspen trees: balancing data center fault tolerance, scalability and cost
Proceedings of the ninth ACM conference on Emerging networking experiments and technologies
| Hi-index | 0.00 |
No packets will be dropped inside a packet network, even when congestion builds up, if congested nodes send backpressure feedback to neighboring nodes, informing them of unavailability of buffering capacity-stopping them from forwarding more packets until enough buffer becomes available. While there are potential advantages in backpressured networks that do not allow packet dropping, such networks are susceptible to a condition known as deadlock in which throughput of the network or part of the network goes to zero (i.e., no packets are transmitted). In this paper, we describe a simple, lossless method of preventing deadlocks and livelocks in backpressured packet networks. In contrast with prior approaches, our proposed technique does not introduce any packet losses, does not corrupt packet sequence, and does not require any changes to packet headers. It represents a new networking paradigm in which internal network losses are avoided (thereby simplifying the design of other network protocols) and internal network delays are bounded.