skip to main content
Skip header Section
Routing in the InternetJanuary 1995
Publisher:
  • Prentice-Hall, Inc.
  • Division of Simon and Schuster One Lake Street Upper Saddle River, NJ
  • United States
ISBN:978-0-13-132192-2
Published:05 January 1995
Pages:
319
Skip Bibliometrics Section
Reflects downloads up to 05 Jan 2025Bibliometrics
Abstract

No abstract available.

Cited By

  1. ACM
    Nicol D (2008). Efficient simulation of Internet worms, ACM Transactions on Modeling and Computer Simulation, 18:2, (1-32), Online publication date: 1-Apr-2008.
  2. ACM
    Feldmann A (2007). Internet clean-slate design, ACM SIGCOMM Computer Communication Review, 37:3, (59-64), Online publication date: 20-Jul-2007.
  3. Ash G (2006). Traffic Engineering and QoS Optimization of Integrated Voice & Data Networks, 10.5555/1210097, Online publication date: 17-Oct-2006.
  4. ACM
    Paxson V (2006). End-to-end routing behavior in the internet, ACM SIGCOMM Computer Communication Review, 36:5, (41-56), Online publication date: 10-Oct-2006.
  5. Setämaa-Kärkkäinen A, Miettinen K and Vuori J (2006). Best compromise solution for a new multiobjective scheduling problem, Computers and Operations Research, 33:8, (2353-2368), Online publication date: 1-Aug-2006.
  6. Tiwari A and Sahoo A A Local Coefficient Based Load Sensitive Routing Protocol for Providing QoS Proceedings of the 12th International Conference on Parallel and Distributed Systems - Volume 1, (447-456)
  7. Arora A and Zhang H (2006). LSRP, IEEE/ACM Transactions on Networking (TON), 14:3, (520-531), Online publication date: 1-Jun-2006.
  8. Xu Z Source routing in the internet with reinforcement learning and genetic algorithms Proceedings of the 5th WSEAS International Conference on Software Engineering, Parallel and Distributed Systems, (202-207)
  9. Deb S and Woodward M (2005). A new distributed QoS routing algorithm based on Fano's method, Computer Networks: The International Journal of Computer and Telecommunications Networking, 48:2, (155-174), Online publication date: 1-Jun-2005.
  10. Chen Y, Datta A and Tixeuil S (2018). Stabilizing inter-domain routing in the Internet, Journal of High Speed Networks, 14:1, (21-37), Online publication date: 1-Jan-2005.
  11. Chakraborty D, Chakraborty G and Shiratori N (2018). A dynamic multicast routing satisfying multiple QoS constraints, International Journal of Network Management, 13:5, (321-335), Online publication date: 1-Sep-2003.
  12. ACM
    Griffin T, Jaggard A and Ramachandran V Design principles of policy languages for path vector protocols Proceedings of the 2003 conference on Applications, technologies, architectures, and protocols for computer communications, (61-72)
  13. Bang Y, Lee W, Choo H and Rao N Architecture for internal communication in multi-gigabit IP routers Proceedings of the 2003 international conference on Computational science: PartIII, (495-503)
  14. Jia W, Xu G, Zhao W and Au P (2019). Efficient Internet Multicast Routing Using Anycast Path Selection, Journal of Network and Systems Management, 10:4, (417-438), Online publication date: 21-Nov-2002.
  15. ACM
    Mittal V and Vigna G Sensor-based intrusion detection for intra-domain distance-vector routing Proceedings of the 9th ACM conference on Computer and communications security, (127-137)
  16. ACM
    Maennel O and Feldmann A (2002). Realistic BGP traffic for test labs, ACM SIGCOMM Computer Communication Review, 32:4, (31-44), Online publication date: 1-Oct-2002.
  17. Fisher H (2002). Multicast Issues for Collaborative Virtual Environments, IEEE Computer Graphics and Applications, 22:5, (68-75), Online publication date: 1-Sep-2002.
  18. Felstaine E, Cohen R and Hadar O (2002). Crankback Prediction in Hierarchical ATM Networks, Journal of Network and Systems Management, 10:3, (327-355), Online publication date: 22-Aug-2002.
  19. ACM
    Maennel O and Feldmann A Realistic BGP traffic for test labs Proceedings of the 2002 conference on Applications, technologies, architectures, and protocols for computer communications, (31-44)
  20. Sobrinho J (2002). Algebra and algorithms for QoS path computation and hop-by-hop routing in the internet, IEEE/ACM Transactions on Networking (TON), 10:4, (541-550), Online publication date: 1-Aug-2002.
  21. ACM
    Narain S, Vaidyanathan R, Moyer S, Stephens W, Parmeswaran K and Shareef A Middleware For Building Adaptive Systems Via Configuration Proceedings of the 2001 ACM SIGPLAN workshop on Optimization of middleware and distributed systems, (188-195)
  22. ACM
    Narain S, Vaidyanathan R, Moyer S, Stephens W, Parmeswaran K and Shareef A Middleware For Building Adaptive Systems Via Configuration Proceedings of the ACM SIGPLAN workshop on Languages, compilers and tools for embedded systems, (188-195)
  23. ACM
    Narain S, Vaidyanathan R, Moyer S, Stephens W, Parmeswaran K and Shareef A (2001). Middleware For Building Adaptive Systems Via Configuration, ACM SIGPLAN Notices, 36:8, (188-195), Online publication date: 1-Aug-2001.
  24. (2001). Use of TCP decoupling in improving TCP performance over wireless networks, Wireless Networks, 7:3, (221-236), Online publication date: 1-May-2001.
  25. ACM
    Chang H, Wu S and Jou Y (2001). Real-time protocol analysis for detecting link-state routing protocol attacks, ACM Transactions on Information and System Security (TISSEC), 4:1, (1-36), Online publication date: 1-Feb-2001.
  26. Stone R Centertrack Proceedings of the 9th conference on USENIX Security Symposium - Volume 9, (15-15)
  27. ACM
    Camp T, Lusth J and Matocha J Reduced cell switching in a mobile computing environment Proceedings of the 6th annual international conference on Mobile computing and networking, (143-154)
  28. ACM
    Bejerano Y, Cidon I and Naor J Dynamic session management for static and mobile users Proceedings of the 4th international workshop on Discrete algorithms and methods for mobile computing and communications, (65-74)
  29. Larkins D Internet Routing and DNS Voodoo in the Enterprise Proceedings of the 13th USENIX conference on System administration, (239-250)
  30. ACM
    Griffin T and Wilfong G (2019). An analysis of BGP convergence properties, ACM SIGCOMM Computer Communication Review, 29:4, (277-288), Online publication date: 1-Oct-1999.
  31. Jia W, Zhao W, Xuan D and Xu G (1999). An Efficient Fault-Tolerant Multicast Routing Protocol with Core-Based Tree Techniques, IEEE Transactions on Parallel and Distributed Systems, 10:10, (984-1000), Online publication date: 1-Oct-1999.
  32. Metz C (2018). At the Core of IP Networks, IEEE Internet Computing, 3:5, (72-77), Online publication date: 1-Sep-1999.
  33. ACM
    Griffin T and Wilfong G An analysis of BGP convergence properties Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication, (277-288)
  34. ACM
    Heinzelman W, Kulik J and Balakrishnan H Adaptive protocols for information dissemination in wireless sensor networks Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking, (174-185)
  35. Dommel H and Garcia-Luna-Aceves J (1999). Group Coordination Support for Synchronous Internet Collaboration, IEEE Internet Computing, 3:2, (74-80), Online publication date: 1-Mar-1999.
  36. ACM
    Bak S and Cobb J Randomized distance-vector routing protocol Proceedings of the 1999 ACM symposium on Applied computing, (78-84)
  37. Pultar G Automatically Selecting a Close Mirror Based on Network Topology Proceedings of the 12th USENIX conference on System administration, (159-166)
  38. ACM
    Bejerano Y and Cidon I An efficient mobility management strategy for personal communication systems Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking, (215-222)
  39. ACM
    Malan G and Jahanian F (2019). An extensible probe architecture for network protocol performance measurement, ACM SIGCOMM Computer Communication Review, 28:4, (215-227), Online publication date: 1-Oct-1998.
  40. ACM
    Kumar S, Radoslavov P, Thaler D, Alaettinoğlu C, Estrin D and Handley M (2019). The MASC/BGMP architecture for inter-domain multicast routing, ACM SIGCOMM Computer Communication Review, 28:4, (93-104), Online publication date: 1-Oct-1998.
  41. ACM
    Malan G and Jahanian F An extensible probe architecture for network protocol performance measurement Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication, (215-227)
  42. ACM
    Kumar S, Radoslavov P, Thaler D, Alaettinoğlu C, Estrin D and Handley M The MASC/BGMP architecture for inter-domain multicast routing Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication, (93-104)
  43. ACM
    Jue J and Ghosal D (1998). Design and analysis of a replicated server architecture for supporting IP-Host mobility, ACM SIGMOBILE Mobile Computing and Communications Review, 2:3, (16-23), Online publication date: 1-Jul-1998.
  44. ACM
    Matocha J Distributed termination detection in a mobile wireless network Proceedings of the 36th annual ACM Southeast Conference, (207-213)
  45. Struyve K and Velde B A Novel Interworking Configuration to Protect Gateways in Between Survivable Sub-Networks Proceedings of the 2nd IEEE Symposium on Computers and Communications (ISCC '97)
  46. ACM
    Campbell A and Coulson G A QoS adaptive transport system Proceedings of the fourth ACM international conference on Multimedia, (117-127)
  47. ACM
    Paxson V (2019). End-to-end routing behavior in the Internet, ACM SIGCOMM Computer Communication Review, 26:4, (25-38), Online publication date: 1-Oct-1996.
  48. ACM
    Paxson V End-to-end routing behavior in the Internet Conference proceedings on Applications, technologies, architectures, and protocols for computer communications, (25-38)
Contributors
  • Telcordia Technologies, Inc.

Index Terms

  1. Routing in the Internet

      Reviews

      Arthur E. Salwin

      The Internet is a dynamic place. Links continually go up and down, and new nodes are added daily. The routers, which forward the packets from one host to the next, must track these changes and update their internal tables to reflect the current network configuration. To exchange the necessary information, router-to-router protocols are used. These routing protocols are the subject of this book. The book begins by discussing IP—the Internet Protocol—upon which all the other protocols are built (“IP Over Everything”). Next, the book describes two families of interior gateway protocols. In the distance vector family, information on the number of hops to other routers (that is, “distance vectors”) is exchanged among the routers; in the link state family, each router maintains a map of the entire network. RIP, a distance vector protocol, was originally used on the Internet. It has the advantage of relative simplicity, but problems inherent in it have caused it to be supplanted by OSPF, a link state protocol. As the Internet grew, it became apparent that maintaining a single monolithic network was not feasible, so it was divided into a set of autonomous systems (ASs). The interior gateway protocols maintain the routing tables within an AS, but a new class of protocol, the exterior gateway protocol (EGP), was needed for the ASs to exchange routing information. EGP's limitations have led to the Border Gateway Protocol, which must be used in conjunction with the Transport Control Protocol (TCP) of TCP/IP fame. The last section of the book discusses several functions that are not currently well supported by the Internet. These are fueling the development of new protocols. The first such function is multicast, which has obvious applications for disseminating information to multiple users. But multicast also has applicability behind the scenes in keeping the routing tables up to date. Another needed function is the support of mobile users—whether they are traveling in a moving vehicle or merely accessing the Internet from a stationary laptop computer at a new location. To accommodate them, Internet addresses must be divorced from the topology of the network; several proposed schemes for doing this are discussed. Finally, the book addresses a potentially serious problem—running out of Internet addresses—a situation whose prospect would have seemed ludicrous and probably unimaginable to the Internet's original developers. The Internet's rapid growth means that 32 bits soon will not be enough to specify a unique address. The book is optimistic that some interim steps will suffice until longer- term, more permanent solutions are implemented. Huitema presents a technically difficult subject in a clear fashion. Concepts are clarified by repeated use of a simple six-node network. Step-by-step updates of the routing tables for this example network are shown as various algorithms are applied to it. The chance of typographical errors in presenting such material is high, yet the book is remarkably free of them. This book is a serious text and is not written in the chatty, informal style that is common to many Internet books. That is not say it is a dry reference about bits, bytes, and headers, however. Mild humor is employed throughout, and Huitema makes the information relevant by presenting routing algorithms in the context of their historical setting and their performance implications. The book even discusses some concepts that did not stand the test of time, and tells why they did not. Among these are centralized routing and having the routing tables respond to dynamic loads. If you already know how to access the Internet and now want to learn more about how the bits get from here to there, you can learn a lot by reading this book. I know I did.

      Access critical reviews of Computing literature here

      Become a reviewer for Computing Reviews.

      Recommendations