Networking Algorithms

  • Thomas G. Robertazzi
  • Li Shi


In this chapter fundamental algorithms used in networking are described. This discussion starts with a consideration of routing, a network layer function. Two shortest paths routing algorithms and a bottleneck bandwidth routing algorithm are presented. This is followed by an exposition of some different types of routing strategies. Protocol verification and model checking are examined. Error codes, both error detecting and error correcting, are studied. The latter part of the chapter has sections on line codes, network coding, and quantum cryptography.


Shortest path routing Bottleneck routing Protocol verification Error detection codes Error Correction codes Line codes Network coding Quantum cryptography 


  1. 7.
    R. Ahlswede, N. Cai, S.-Y. R. Li and R.W. Yeung, “Network Information Flow”, IEEE Transactions on Information Theory, vol. 46, no. 4, July 2000, pp. 1204–1216.Google Scholar
  2. 8.
    H. Ahmadi and W.E. Denzel, “A Survey of Modern High-Performance Switching Techniques,” IEEE Journal on Selected Areas in Communications, vol. 7, no. 7, Sept. 1989, pp. 1091–1103.Google Scholar
  3. 9.
    R. Alléaume, C. Brassard, et al., “Using Quantum Key Distribution for Cryptographic Purposes: A Survey,” Theoretical Computer Science, vol. 560, 2014, pp. 62–81.MathSciNetCrossRefGoogle Scholar
  4. 13.
    G. Apostolopoulos, R. Guérin, S. Kamat and S.K. Tripathi, “Quality of Service Based Routing: A Performance Perspective,” Proceedings of SIGCOMM’98, 1998, pp. 17–28.Google Scholar
  5. 21.
    S.T. Başaran, G.K. Kurt, M. Uysal and İ. Altunbaş, “A Tutorial on Network Coded Cooperation”, IEEE Communication Surveys and Tutorials, vol. 18, no. 4, Fourth Quarter 2016, pp. 2970–2990.Google Scholar
  6. 29.
    C.H. Bennett and G. Brassard, “Quantum Cryptography: Public Key Distribution and Coin Tossing,” Proc. of IEEE International Conference on Computer Systems and Signal Processing, vol. 175, pg. 8, 1984.Google Scholar
  7. 36.
    D. Bertsekas and R. Gallager, Data Networks, 2nd ed., Prentice-Hall, 1991.Google Scholar
  8. 64.
    S. Chen and K. Nahrstedt, “An Overview of Quality of Service Routing for Next-Generation High-Speed Networks: Problems and Solutions,” IEEE Network, Nov./Dec. 1998, pp. 64–79.Google Scholar
  9. 71.
    S. Deb, M. Effros, T. Ho, et al., “Network Coding for Wireless Applications: A Brief Tutorial”, see Google Scholar.Google Scholar
  10. 91.
    P.A. Franaszek and A. X. Widmer, “Byte Oriented DC Balanced (0.4) 8B/10B Partitioned Block Transmission Code,” US Patent 4486739, December 4, 1984.Google Scholar
  11. 92.
    M.A. Franklin, “A VLSI Performance Comparison on Banyan and Crossbar Communication Networks,” IEEE Transactions on Computers, vol. C-30, no. 4, April 1981, 283–290.Google Scholar
  12. 106.
    J.M. Griffiths, “Binary Code Suitable for Line Transmission,” Electronics Letters, vol. 5, 1969, pp. 79–81.CrossRefGoogle Scholar
  13. 108.
    R.A. Guérin, A. Orda and D. Williams, “QoS Routing Mechanisms and OSPF Extensions, Proceedings of IEEE Globecomm’97, 1997, pp. 1903–1908.Google Scholar
  14. 116.
    G.J. Holzmann, “The Model Checker Spin,” IEEE Transactions on Software Engineering, vol. 23, no. 5, May 1997, pp. 279–295.Google Scholar
  15. 117.
    G.J. Holzmann, The SPIN Model Checker: Primer and Reference Manual, Addison-Wesley, Boston, 2004.Google Scholar
  16. 120.
    T.S. Humble, “Quantum Security for the Physical Layer”, IEEE Communications Magazine, vol. 51, Aug. 2013, pp. 56–62.Google Scholar
  17. 132.
    B. Karp and H.T. Kung, “GPSR: Greedy Perimeter Stateless Routing for Wireless Networks,” Proceedings of the 6th Annual ACM/IEEE International Conference on Mobile Computing and Networking (MobiCom), 2000.Google Scholar
  18. 153.
    S.-Y. R. Li, R.W, Yeung and N. Cai, “Linear Network Coding”, IEEE Transactions on Information Theory, vol. 49, no.2, Feb. 2003, pp. 371–381.Google Scholar
  19. 158.
    D. Lun, M. Médard, R. Koetter and M. Effros, “On Coding for Reliable Communication over Packet Networks,” Physical Communications, vol. 1, no. 1, 2008, pp 3–20.CrossRefGoogle Scholar
  20. 159.
    L.O. Mailloux, M.R. Grimaila et al., “Performance Evaluations of Quantum Key Distribution System Architectures,” IEEE Security and Privacy, vol. 13, Jan/Feb 2015, pp. 30–40.Google Scholar
  21. 167.
    M. Mauve, H. Hastenstein and A. Widmer, “A Survey on Position-Based Routing in Mobile Ad Hoc Networks,” IEEE Network, vol. 15, no. 3, Nov./Dec. 2001, pp. 30–39.Google Scholar
  22. 172.
    C.S.R. Murthy and B.S. Manoj, Ad Hoc Wireless Networks: Architectures and Protocols, Prentice-Hall, 2004.Google Scholar
  23. 175.
    N. Papanikolaou, “An Introduction to Quantum Cryptography,” Crossroads, ACM, vol. 11, no. 3, March 2005.Google Scholar
  24. 179.
    C.E. Perkins, Ad Hoc Networking, Addison-Wesley, 2000.Google Scholar
  25. 180.
    W.W. Peterson and D.T. Brown, “Cyclic Codes for Error Detection,” Proceedings of the IRE (Institute of Radio Engineers), 1961, pp. 228–235.Google Scholar
  26. 186.
    J. Quereshi, C.H. Foh and J. Cai, “Optimal Solution for the Index Coding Problem using Network Coding over GF(2)”, IEEE SECON 2012, pp. 134–142.Google Scholar
  27. 192.
    (b) T.G. Robertazzi, “Processor Equivalence for a Linear Daisy Chain of Load Sharing Processors,” IEEE Transactions on Aerospace and Electronic Systems, vol. 29, no. 4, Oct. 1993, pp. 1216–1221.Google Scholar
  28. 196.
    T.G. Robertazzi, Networks and Grids: Technology and Theory, Springer, NY, 2007.zbMATHGoogle Scholar
  29. 198.
    T.G. Robertazzi, Introduction to Computer Networking, Springer, 2017.Google Scholar
  30. 204.
    T.N. Saadawi, M.H. Ammar and A. El Hakeem, Fundamentals of Telecommunication Networks, Wiley, NY, NY, 1994.Google Scholar
  31. 206.
    V. Scarani and C. Kurtsiefer, “The Black Paper of Quantum Cryptography: Real Implementation Problems,” Theoretical Computer Science, vol. 560, 2014, pp. 27–32.MathSciNetCrossRefGoogle Scholar
  32. 208.
    M. Schwartz, Telecommunication Networks: Protocols, Modeling and Analysis, Addison-Wesley, Reading, Mass., 1987.Google Scholar
  33. 225.
    T.H. Szymanski, “A VLSI Comparison between Crossbar and Switch Recursive Banyan Interconnection Networks,” Proc. of the International Conference on Parallel Processing, Aug. 1986, pp. 192–199.Google Scholar
  34. 226.
    A.S. Tanenbaum, Computer Networks, 3rd edition, Prentice-Hall, 1996.Google Scholar
  35. 227.
    A.S. Tanenbaum, Computer Networks, 4th edition, Prentice-Hall, 2002.Google Scholar
  36. 228.
    C.-K. Toh, Ad Hoc Mobile Wireless Networks: Protocols and Systems, Prentice-Hall, 2002.Google Scholar
  37. 232.
    R.C. Walker, B. Amrutur and R.W. Dugan, “Decoding Method and Decoder for 64b/66b Coded Packetized Serial Data,” US Patent 6650638 B1, November 18, 2003.Google Scholar
  38. 233.
    R.C. Walker, B. Amrutur and R.W. Dugan, “Coding Method and Coder for Coding Packetized Serial Data with Low Overhead,” US Patent 6718491 B1, April 6, 2004.Google Scholar
  39. 236.
    Z. Wang and J. Crowcroft, “Quality-of-Service Routing for Supporting Multimedia Applications,” IEEE Journal of Selected Areas in Communications, vol. 14, no. 7, Sept. 1996, pp. 1228–1234.Google Scholar
  40. 239.
    A.X. Widmer and P.A. Franaszek, “A DC-Balanced, Partitioned Block, 8b/10b Transmission Code,” IBM Journal of Research and Development, vol. 27, no. 5, Sept. 1985, pp. 440–451.Google Scholar
  41. 254.
    M.C. Yuang, “Survey of Protocol Verification Techniques Based on Finite State Machine Models,” Proceedings of Computer Networking Symposium, Washington D.C., 1988, pp. 164–172.Google Scholar

Copyright information

© Springer Nature Switzerland AG 2020

Authors and Affiliations

  • Thomas G. Robertazzi
    • 1
  • Li Shi
    • 1
  1. 1.Stony Brook UniversityStony BrookUSA

Personalised recommendations