Advertisement

Problems Arising from Deflection Routing: Live-lock, Lockout, Congestion and Message Reassembly

  • N. F. Maxemchuk
Part of the NATO ASI Series book series (volume 72)

Abstract

Deflection routing is a technique that has been proposed for slotted, metropolitan area networks. When there are no buffers available at an intermediate node in the network, packets of data are forced to take longer paths through the network. Because this technique only uses local information at a node, it is possible to apply it to high rate networks in which the propagation delay on a link is much greater than the time it takes to transmit a packet.

Several problems encountered with this technique are described in this paper, including live-lock, source lockout, congestion spreading, and reassembly buffer overflow. Live-lock and congestion spreading are unique to deflection routing, source lockout occurs in many slotted networks, and reassembly buffer overflow is common in datagram networks. It is shown that random deflection rules eliminate live-locks, and that the other problems can be managed by end-to-end mechanisms when they persist.

Keywords

Network Throughput Output Link Outgoing Link Access Rate Link Utilization 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. [1]
    Z. L. Budrikis, J. L. Hullett, R. M. Newman, D. Economou, F. M. Fozdar, R. D. Jeffery, “QPSX: A Queue Packet and Synchronous Circuit Exchange,” Proc. 8th Internatl. Conf. on Comp. Comm., Munich, F.R.G., Sept 15-19, 1986, published by North-Holland, pp. 288–293.Google Scholar
  2. [2]
    R. M. Newman, Z. L. Budrikis, J. L. Hullett, “The QPSX Man,” IEEE Comm., Vol. 26, No. 4, April 1988, pp. 20–28.CrossRefGoogle Scholar
  3. [3]
    H. Ohnishi, N. Morita, S. Suzuki, “ATM Ring Protocol and Performance,” Boston ICC’89, June 11–14, 1989, Conference Record Vol. 1 of 3Google Scholar
  4. [4]
    N. F. Maxemchuk, “Regular and Mesh Topologies in Local and Metropolitan Area Networks,” AT&T Technical Journal, Sept. 85, vol. 64, no. 7, pp. 1659–1686.Google Scholar
  5. [5]
    P. Baran, “On Distributed Communications Networks,” IEEE Trans, on Comm. Sys., vol cs-12, no.l, pp. 1–9, Mar 1964.Google Scholar
  6. [6]
    G. L. Fultz, L. Kleinrock, “Adaptive Routing Techniques for Store-and-Forward Computer- Communications Networks,” Proc. ICC’71, pp. 39. 1–8.Google Scholar
  7. [7]
    N. F. Maxemchuk, “Distributed Clocks in Slotted Networks,” Proceedings of Infocom’88, Mar. 29-31, 1988, New Orleans, pp 119–125.Google Scholar
  8. [8]
    N. F. Maxemchuk, “The Manhattan Street Network,” Proc. of Globcom’85, pp. 255–261, Dec. 2-5, 1986, New Orleans, LA.Google Scholar
  9. [9]
    N. F. Maxemchuk, “Linear, Unidirectional Networks and Random Access Strategies in Fiberoptic Local Distribution Systems,” Proc. Globcom’86, Houston, Tx, Dec. 1-4, 1986, pp 29–33.Google Scholar
  10. [10]
    D. H. Lawrie, D. A. Padua, “Analysis of Message Switching with Shuffle/Exchange in Multiprocessors,” Proc. Wkshp Intercnn Ntwks, 1980, pp. 116–123.Google Scholar
  11. [11]
    P-Y. Chen, P-C Yew, D. Lawrie, “Performance of Packet Switching in Buffered Single-Stage Shuffle-Exchange Networks,” Proc. 3rd Intl. Conf. DisL Computing, 1982, pp. 622–627.Google Scholar
  12. [12]
    N. F. Maxemchuk, “Routing in the Manhattan Street Network,” IEEE Trans, on Commun., May 1987, vol. COM-35, no. 5, pp. 503–512.Google Scholar
  13. [13]
    A. G. Greenberg, J. Goodman, “Sharp Approximate Analysis of Adaptive Routing in Mesh Networks,” Proc. of International Sem. on Teletraffic Analysis and Comp. Perf. Eval., The Netherland, June 1986, pp. 255–270.Google Scholar
  14. [14]
    N. F. Maxemchuk, “Comparison of Deflection and Store-and-Forward Techniques in the Manhattan Street and Shuffle-Exchange Networks,” IEEE INFOCOM ’89, Ottawa, Ont. Canada, April 25-27, 1989, pp. 800–809.Google Scholar
  15. [15]
    I. S. Gopal, “Prevention of Store-and-Forward Deadlock in Computer Networks,” IEEE Trans, on Commun., vol. COM-33, no. 12, Dec. 1985, pp. 1258–64.Google Scholar
  16. [16]
    I. Cidon, J. Jaffe, M. Sidi, “Distributed Store-and-Forward Deadlock Detection and Resolution Algorithms,” IEEE Trans, on Commun., vol. com-35, no. 11, Nov. 1987, pp. 1139–1145.Google Scholar
  17. [17]
    R. T. Prosser, “Routing Procedures in Communications Networks- Part I: Random Procedures,” IRE Trans, on Commun. Syst., Dec. 1962, pp 322–329.Google Scholar
  18. [18]
    L. Kleinrock, Communication Nets; Stochastic Message Flow and Delay, McGraw-Hill, New York, 1964.Google Scholar
  19. [19]
    B. K. Penney, A. A. Baghdadi, “Survey of computer communications loop networks: Part 1,” Computer Communications, vol. 2, no. 4, August 1979, pp 165–180.CrossRefGoogle Scholar
  20. [20]
    B. K. Penney, A. A. Baghdadi, “Survey of computer communications loop networks: Part 2,” Computer Communications, vol. 2, no. 5, October 1979, pp 224–241.CrossRefGoogle Scholar
  21. [21]
    J. W. Wong, “Throughput of DQDB Networks under Heavy Load,” EFOC/LAN-89, Amsterdam, The Netherlands, June 14–16, 1989.Google Scholar
  22. [22]
    E. L. Hahne, A. K. Choudhury, N. F. Maxemchuk, “Improving the Fairness of Distributed- Queue, Dual-Bus Networks,” INFOCOM’90, San Francisco, June 5-7, 1990, pp. 175–184.Google Scholar
  23. [23]
    Raj Jain, K. K. Ramakrishnan, Dah-Ming Chiu, “Congestion Avoidance in Computer Networks With a Connectionless Network Layer,” Digital Equipment Corp., July 8, 1988, pp. 1–17Google Scholar
  24. [24]
    W. Bux, D. Grillo, “Row Control in Local-Area Networks of Interconnected Token Rings,” IEEE Trans, on Comm., Vol. COM-33, No. 10, October 1985, pp. 1058–1066.Google Scholar
  25. [25]
    M. Gerla, L. Kleinrock, “Flow Control: A Comparative Survey,” IEEE Trans, on Comm., vol. COM-28, no. 4, Apr. 1980, pp. 553–574.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1991

Authors and Affiliations

  • N. F. Maxemchuk
    • 1
  1. 1.AT&T Bell LaboratoriesMurray HillUSA

Personalised recommendations