skip to main content
article

Prevention of deadlocks and livelocks in lossless backpressured packet networks

Published:01 December 2003Publication History
Skip Abstract Section

Abstract

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.

References

  1. {1} W. Noureddine and F. Tobagi, "Selective back-pressure in switched ethernet LAN's," in Proc. IEEE GLOBECOM, Dec. 1999, pp. 1256-1263.Google ScholarGoogle Scholar
  2. {2} P. M. Merlin and P. J. Schweitzer, "Deadlock avoidance in store-and-forward networks-I: Store-and-forward deadlock," IEEE Trans. Commun., vol. COM-28, pp. 345-354, Mar. 1980.Google ScholarGoogle Scholar
  3. {3} K. D. Gunther, "Prevention of deadlocks in packet-switched data transport systems," IEEE Trans. Commun., vol. COM-29, pp. 512-524, Apr. 1981.Google ScholarGoogle Scholar
  4. {4} I. S. Gopal, "Prevention of store-and-forward deadlock in computer networks," IEEE Trans. Commun., vol. COM-33, pp. 1258-1264, Dec. 1985.Google ScholarGoogle Scholar
  5. {5} I. Cidon, J. M. Jaffe, and M. Sidi, "Distributed store-and-forward deadlock detection and resolution algorithms," IEEE Trans. Commun., vol. COM-35, pp. 1139-1145, Nov. 1987.Google ScholarGoogle Scholar
  6. {6} M. D. Schroeder et al., "Autonet: A high-speed, self-configuring local area network using point-to-point links," IEEE J. Select. Areas Commun., vol. 9, pp. 1318-1335, Oct. 1991.Google ScholarGoogle Scholar
  7. {7} W. J. Dally and C. L. Seitz, "Deadlock-free message routing in multiprocessor interconnection networks," IEEE Trans. Comput., vol. C-36, pp. 547-553, May 1987. Google ScholarGoogle Scholar
  8. {8} E. Leonardi et al., "Congestion control in asynchronous, high-speed wormhole routing networks," IEEE Commun. Mag., pp. 58-69, Nov. 1996. Google ScholarGoogle Scholar
  9. {9} D. Bertsekas and R. Gallager, Data Networks. Englewood Cliffs, NJ: Prentice-Hall, 1992. Google ScholarGoogle Scholar
  10. {10} M. Karol, S. J. Golestani, and D. Lee, "Prevention of deadlocks and live-locks in lossless, backpressured packet networks," in Proc. INFOCOM, Mar. 2000, pp. 1333-1342.Google ScholarGoogle Scholar
  11. {11} I. Iliadis, "A new feedback congestion control policy for long propagation delays," IEEE J. Select. Areas Commun., vol. 13, pp. 1284-1295, Sept. 1995. Google ScholarGoogle Scholar
  12. {12} I. Iliadis and R. Marie, "Evaluation of a start-stop protocol for best-effort traffic in ATM networks," Comput. Commun. Rev., vol. 21, pp. 1544-1588, 1998. Google ScholarGoogle Scholar
  13. {13} R. G. Gallager and S. J. Golestani, "Flow control and routing algorithms for data networks," in Proc. 5th Int. Conf. Computer Communications, 1980, pp. 779-784.Google ScholarGoogle Scholar
  14. {14} S. J. Golestani and S. Bhattacharyya, "A class of end-to-end congestion control algorithms for the Internet," in Proc. 6th Int. Conf. Network Protocols , Oct. 1998, pp. 137-150. Google ScholarGoogle Scholar

Index Terms

  1. Prevention of deadlocks and livelocks in lossless backpressured packet networks

        Recommendations

        Comments

        Login options

        Check if you have access through your login credentials or your institution to get full access on this article.

        Sign in

        Full Access

        PDF Format

        View or Download as a PDF file.

        PDF

        eReader

        View online with eReader.

        eReader