Home > Store

Patterns in Network Architecture: A Return to Fundamentals

Register your product to gain access to bonus material or receive a coupon.

Patterns in Network Architecture: A Return to Fundamentals

  • By
  • Published Dec 27, 2007 by Pearson.

Book

  • Sorry, this book is no longer in print.
Not for Sale

Description

  • Copyright 2008
  • Edition: 1st
  • Book
  • ISBN-10: 0-13-225242-2
  • ISBN-13: 978-0-13-225242-3

Groundbreaking Patterns for Building Simpler, More Powerful Networks

In Patterns in Network Architecture, pioneer John Day takes a unique approach to solving the problem of network architecture. Piercing the fog of history, he bridges the gap between our experience from the original ARPANET and today’s Internet to a new perspective on networking. Along the way, he shows how socioeconomic forces derailed progress and led to the current crisis.

Beginning with the seven fundamental, and still unanswered, questions identified during the ARPANET’s development, Patterns in Network Architecture returns to bedrock and traces our experience both good and bad. Along the way, he uncovers overlooked patterns in protocols that simplify design and implementation and resolves the classic conflict between connection and connectionless while retaining the best of both. He finds deep new insights into the core challenges of naming and addressing, along with results from upper-layer architecture. All of this in Day’s deft hands comes together in a tour de force of elegance and simplicity with the annoying turn of events that the answer has been staring us in the face: Operating systems tell us even more about networking than we thought. The result is, in essence, the first “unified theory of networking,” and leads to a simpler, more powerful–and above all–more scalable network infrastructure.  The book then lays the groundwork for how to exploit the result in the design, development, and management as we move beyond the limitations of the Internet.

Using this new model, Day shows how many complex mechanisms in the Internet today (multihoming, mobility, and multicast) are, with this collapse in complexity, now simply a consequence of the structure. The problems of router table growth of such concern today disappear. The inescapable conclusion is that the Internet is an unfinished demo, more in the tradition of DOS than Unix, that has been living on Moore’s Law and 30 years of band-aids. It is long past time to get networking back on track.

•           Patterns in network protocols that synthesize “contradictory” approaches and simplify design and implementation

•           “Deriving” that networking is interprocess communication (IPC) yielding

•           A distributed IPC model that repeats with different scope and range of operation

•           Making network addresses topological makes routing purely a local matter

•           That in fact, private addresses are the norm–not the exception–with the consequence that the global public addresses required today are unnecessary

•           That mobility is dynamic multihoming and unicast is a subset of multicast, but multicast devolves into unicast and facilitates mobility

•           That the Internet today is more like DOS, but what we need should be more like Unix

•           For networking researchers, architects, designers, engineers

Provocative, elegant, and profound, Patterns in Network Architecture transforms the way you envision, architect, and implement networks.

Preface: The Seven Unanswered Questions xiii

Chapter 1: Foundations for Network Architecture 1

Chapter 2: Protocol Elements 23

Chapter 3: Patterns in Protocols 57

Chapter 4: Stalking the Upper-Layer Architecture 97

Chapter 5: Naming and Addressing 141

Chapter 6: Divining Layers 185

Chapter 7: The Network IPC Model 235

Chapter 8: Making Addresses Topological 283

Chapter 9: Multihoming, Multicast, and Mobility 317

Chapter 10: Backing Out of a Blind Alley 351

Appendix A: Outline for Gedanken Experiment on Separating Mechanism and Policy 385

Bibliography 389

Index 399

Extras

Interview(s)

Listen to a Podcast CS Techcast 27: Taking You to Network School with John Day

Sample Content

Online Sample Chapter

Patterns in Network Architecture: Naming and Addressing

Downloadable Sample Chapter

Download the chapter

Table of Contents

Preface: The Seven Unanswered Questions xiii

Chapter 1: Foundations for Network Architecture 1

Chapter 2: Protocol Elements 23

Chapter 3: Patterns in Protocols 57

Chapter 4: Stalking the Upper-Layer Architecture 97

Chapter 5: Naming and Addressing 141

Chapter 6: Divining Layers 185

Chapter 7: The Network IPC Model 235

Chapter 8: Making Addresses Topological 283

Chapter 9: Multihoming, Multicast, and Mobility 317

Chapter 10: Backing Out of a Blind Alley 351

Appendix A: Outline for Gedanken Experiment on Separating Mechanism and Policy 385

Bibliography 389

Index 399

Preface

Download the preface

Index

Download the index

Updates

Errata

Print Number Error Location Error Correction Date Added
2 p xx Splitting out IP (nothing new for addressing). Splitting IP from TCP seemed a necessity. The transport protocol and IP do very different functions (as will become clear in Chapter 6, “Diving Layers”). The only unfortunate aspect in the creation of IP was that nothing was done about the multihoming problem. IP continued to name the interface. But this was understandable. IP was split out in 1975, soon after the problem was recognized. Although we understood what the multihoming problem was and theoretically what its solution was, there was still much about addressing that was unclear. More theoretical and practical work was necessary. However, it did put us in the uncomfortable position of an Internet address naming a subnetwork point of attachment.
Splitting out IP (nothing new for addressing). Splitting IP from TCP seemed a necessity. The transport protocol and IP do very different functions (as will become clear in Chapter 6, “Divining Layers”). The only unfortunate aspect in the creation of IP was that nothing was done about the multihoming problem. IP continued to name the interface. But this was understandable. IP was split out in 1975, soon after the problem was recognized. Although we understood what the multihoming problem was and theoretically what its solution was, there was still much about addressing that was unclear. More theoretical and practical work was necessary. However, it did put us in the uncomfortable position of an Internet address naming a subnetwork point of attachment.
5/8/2008
2 p xxvi That brings us to roughly the early 1990s, to the time frame when I started this exercise, just as the IPng was heating up.26 The seven unanswered questions we started with were still unanswered and in the back of my mind (as they always had been). It was not my intention to try to solve them. It is a daunting list. But with each that pattern emerged, was measured against whether they contributed to solving them. I was looking for a clear understanding of where we were. However, three issues had to be looked at. Two of the issues experience had shown could wreck an architecture if not confronted and solved. We have already touched on them: finding a meaningful synthesis of connection and connectionless, and working out naming and addressing (and in particular what location dependent means). The religious war over connections and connectionless had been at the root of too many disasters. A true synthesis was desperately needed. And, of course, just looking at the seven unanswered questions, you can see that a number of issues all revolve around a clear understanding of naming and addressing. The third arose from my experience with hundreds of protocol designs more than 20 years, seeing the same things over and over. I wanted to separate mechanism and policy as we had in operating systems—just to see what would happen.27
That brings us to roughly the early 1990s, to the time frame when I started this exercise, just as the IPng was heating up.26 The seven unanswered questions we started with were still unanswered and in the back of my mind (as they always had been). It was not my intention to try to solve them. It is a daunting list. But as each pattern emerged, it was measured against whether they contributed to solving them. I was looking for a clear understanding of where we were. However, three issues had to be looked at. Two of the issues experience had shown could wreck an architecture if not confronted and solved. We have already touched on them: finding a meaningful synthesis of connection and connectionless, and working out naming and addressing (and in particular what location dependent means). The religious war over connections and connectionless had been at the root of too many disasters. A true synthesis was desperately needed. And, of course, just looking at the seven unanswered questions, you can see that a number of issues all revolve around a clear understanding of naming and addressing. The third arose from my experience with hundreds of protocol designs over more than 30 years, seeing the same things over and over. I wanted to separate mechanism and policy as we had in operating systems—just to see what would happen.27
5/8/2008
2 p xxviii As noted earlier, several concepts that are key to understanding this model are not generally known. We will rely heavily on what Seymour Papert29 calls the only concepts that make computer science worth learning: problem decomposition, abstraction, and recursion. Abstraction has fallen into to disuse for the past couple of decades, but we will put it to good use here. Furthermore, the architecture we are led to requires a considerable cognitive shift. Therefore, this book is organized to take the reader from what we know to a new way of looking at things. To bridge the gap, so to speak. Even so, this will not be easy for the reader; there is some hard thinking ahead.
We first start with a return to fundamentals, to remind us of the minimum assumptions required for communication and for the tools for working with abstractions. In Chapters 2 and 3, we look at the familiar world of protocols and separating mechanism and policy. Here, new patterns emerge that indicate there are probably only three kinds of protocols, and then later we find that one of them is more a “common header” than a protocol. We are also able to make considerable progress in resolving the conflict between connections and connectionless.30
In Chapter 4, we review our experience with “upper layers” and learn some things that we did right and some things to avoid. As strange as it might sound, we find some key concepts here that will be useful in constructing our fundamental model, while at the same time concluding that there is no “upper-layer architecture.” Then in Chapter 5, “Naming and Addressing,”we take a hard look at that ever-difficult and subtle topic, “naming and addressing.” We give special emphasis to Saltzer’s 1982 paper expanding on it slightly, noting how the current infatuation with the “loc/id split” problem is a dead end. By the time we reach Chapter 6, we have a pretty reasonable picture of the problem and the elements we will need and can consider the problem of assembling them into a system. Here we embark on a simple exercise that any of us could have done at any time over the past 30 years only to find it yields the structure we have been looking for. (A revolting department!) This chapter is key to everything.
As noted earlier, several concepts that are key to understanding this model are not generally known. We will rely heavily on what Seymour Papert29 calls the only concepts that make computer science worth learning: problem decomposition, abstraction, and recursion. Abstraction has fallen into disuse for the past couple of decades, but we will put it to good use here. Furthermore, the architecture we are led to requires a considerable cognitive shift. Therefore, this book is organized to take the reader from what we know to a new way of looking at things. To bridge the gap, so to speak. Even so, this will not be easy for the reader; there is some hard thinking ahead.
We first start with a return to fundamentals, to remind us of the minimum assumptions required for communication and for the tools for working with abstractions. In Chapters 2 and 3, we look at the familiar world of protocols and separating mechanism and policy. Here, new patterns emerge that indicate there are probably only three...

Submit Errata

More Information

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.

Overview


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information


To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.

Surveys

Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.

Newsletters

If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information


Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.

Security


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.

Children


This site is not directed to children under the age of 13.

Marketing


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information


If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.

Choice/Opt-out


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information


Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents


California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure


Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.

Links


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact


Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice


We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020