Skip to main content
SpringerLink
Log in

Networking Algorithms

  • Chapter
  • First Online:
Networking and Computation

  • 807 Accesses

Abstract

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 49.99
Price excludes VAT (USA)
  • Available as EPUB and PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 64.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info
Hardcover Book
USD 89.99
Price excludes VAT (USA)
  • Durable hardcover edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

References

  1. 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. 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. 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.

    Article  MathSciNet  Google Scholar 

  4. 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. 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. 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. D. Bertsekas and R. Gallager, Data Networks, 2nd ed., Prentice-Hall, 1991.

    Google Scholar 

  8. 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. S. Deb, M. Effros, T. Ho, et al., “Network Coding for Wireless Applications: A Brief Tutorial”, see Google Scholar.

    Google Scholar 

  10. 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. 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. J.M. Griffiths, “Binary Code Suitable for Line Transmission,” Electronics Letters, vol. 5, 1969, pp. 79–81.

    Article  Google Scholar 

  13. 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. G.J. Holzmann, “The Model Checker Spin,” IEEE Transactions on Software Engineering, vol. 23, no. 5, May 1997, pp. 279–295.

    Google Scholar 

  15. G.J. Holzmann, The SPIN Model Checker: Primer and Reference Manual, Addison-Wesley, Boston, 2004.

    Google Scholar 

  16. T.S. Humble, “Quantum Security for the Physical Layer”, IEEE Communications Magazine, vol. 51, Aug. 2013, pp. 56–62.

    Google Scholar 

  17. 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. 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. 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.

    Article  Google Scholar 

  20. 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. 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. C.S.R. Murthy and B.S. Manoj, Ad Hoc Wireless Networks: Architectures and Protocols, Prentice-Hall, 2004.

    Google Scholar 

  23. N. Papanikolaou, “An Introduction to Quantum Cryptography,” Crossroads, ACM, vol. 11, no. 3, March 2005.

    Google Scholar 

  24. C.E. Perkins, Ad Hoc Networking, Addison-Wesley, 2000.

    Google Scholar 

  25. 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. 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. (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. T.G. Robertazzi, Networks and Grids: Technology and Theory, Springer, NY, 2007.

    MATH  Google Scholar 

  29. T.G. Robertazzi, Introduction to Computer Networking, Springer, 2017.

    Google Scholar 

  30. T.N. Saadawi, M.H. Ammar and A. El Hakeem, Fundamentals of Telecommunication Networks, Wiley, NY, NY, 1994.

    Google Scholar 

  31. V. Scarani and C. Kurtsiefer, “The Black Paper of Quantum Cryptography: Real Implementation Problems,” Theoretical Computer Science, vol. 560, 2014, pp. 27–32.

    Article  MathSciNet  Google Scholar 

  32. M. Schwartz, Telecommunication Networks: Protocols, Modeling and Analysis, Addison-Wesley, Reading, Mass., 1987.

    Google Scholar 

  33. 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. A.S. Tanenbaum, Computer Networks, 3rd edition, Prentice-Hall, 1996.

    Google Scholar 

  35. A.S. Tanenbaum, Computer Networks, 4th edition, Prentice-Hall, 2002.

    Google Scholar 

  36. C.-K. Toh, Ad Hoc Mobile Wireless Networks: Protocols and Systems, Prentice-Hall, 2002.

    Google Scholar 

  37. 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. 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. 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. 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. 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 

Download references

Author information

Authors and Affiliations

  1. Stony Brook University, Stony Brook, New York, USA

    Thomas G. Robertazzi & Li Shi

Authors
  1. Thomas G. Robertazzi
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Li Shi
    View author publications

    You can also search for this author in PubMed Google Scholar

Rights and permissions

Reprints and permissions

Copyright information

© 2020 Springer Nature Switzerland AG

About this chapter

Check for updates. Verify currency and authenticity via CrossMark

Cite this chapter

Robertazzi, T.G., Shi, L. (2020). Networking Algorithms. In: Networking and Computation. Springer, Cham. https://doi.org/10.1007/978-3-030-36704-6_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-030-36704-6_4

  • Published:

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-030-36703-9

  • Online ISBN: 978-3-030-36704-6

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics

Search

Navigation