SlideShare a Scribd company logo
Internet Architecture &
Design Philosophy
CS4482 High Performance Networking
Dilum Bandara
Dilum.Bandara@uom.lk
Some slides extracted from Dr. Dan Massey’s CS557 class at Colorado
State University
Outline
1. J.H. Saltzer, D.P. Reed, and D.D. Clark, “End to End
Arguments in System Design,” ACM Transactions on
Computer Systems, vol. 2, no. 4, Nov. 1984, pp. 277-
288
2. D.D. Clark, “Design Philosophy of the DARPA Internet
Protocols,” ACM, 1988
2
Architecture
 Dictionary definitions
 A style & method of design & construction
 Orderly arrangement of parts
 Manner of construction of something & disposition of
its parts
 Design, the way components fits together
 Definitions vary & no one agrees
 Goal
 Why the Internet was designed this way?
3
4
OSI
Stack
Source: http://walkwidnetwork.blogspot.com/2013/04/physical-layer-osi-model.html
Layered Design
5
Source: http://blog.anuesystems.com/category/span-and-taps/
Hourglass Architecture
 Why internet layer?
 Make a big network
 Global addressing
 Virtualized network to isolate
protocols from network details
 Why only IP?
 Maximum interoperability
 Minimize no of service interfaces
 Why IP is so narrow?
 Assumes least common network
functionality  many networks 6
Steve Deering’s
hourglass showing
“waist” of the Internet
Source: http://isoc.org/wp/ietfjournal/?p=454
Hourglass Architecture Insufficient
7
Putting on weight
Need for more
functionality
Midlife Crisis
Address space not
sufficient
Architecture often seen today
8
Source: http://isoc.org/wp/ietfjournal/?p=454
End-to-End Argument [1]
 Examines which layer should implement a service
 Argue many services should be implemented at
higher layers
 e.g., on end hosts
 Contributions
 Fits with the model of minimal network (IP) layer
 Provides guidance on what (not) to add to data link
layers
 End-to-end principle is fundamental to Internet success
9
Which Layer?
 Services
 Reliable delivery
 Duplicate message suppression
 FIFO ordering
 Delivery guarantees
 Encryption
 Transaction Management
 Recovery from crashes
 Options
 Lower layers help application by providing those services
 Lower layers are of little help as application has the final
say 10
File Transfer – Example
 Errors can occur at many levels
 Transfer from sender disk to memory
 Transfer from sender OS to sender line card
 Transfer across network
 Transfer from receiver line card to receiver OS
 Transfer from receiver memory to disk
 What would be the effect of a perfectly reliable
network?
 Does not recover from other errors
 Provides a false sense of security
 Impact other applications that don’t need those services
11
Tradeoffs
 As far as application has to perform its own
checking, extra effort at network level is of little
help
 End systems have information on semantics &
requirements
 Application state
 Network has information on data transmission
parameters (packet size, error rate)
 Assuming packets follow the predicted path
12
Other Examples
 Delivery guarantees
 Did the end act upon the received message?
 Encryption
 Clear data before entering the secure network
 Duplicate message suppression
 Applications may retry, e.g., remote login
 FIFO ordering
 In distributed systems with multiple destinations
 Recovery from crashes
 What if the network failed & all state is lost?
13
Rules of Thumb
 Consider marginal gain in lower layer
 If you can achieve large impact with limited effort, go
for it
 Consider impact on other services
 Implement at lower layer, only if minimal impact on
applications that don’t use that service
 General Result
 Implement services at the end, not inside the network
14
Why TCP/IP? [2]
 Objective
 Why TCP/IP was designed this way?
 DARAP Internet Architecture
 1 fundamental goal
 Several 2nd level goals
 Ordering of 2nd level goals
15
Fundamental Goal
 Allow connection of many existing networks
 Effective technique for multiplexed utilization of existing
interconnected networks
 Some important assumptions
 Connect ARPANET with ARPA packet radio
 Networks represent administrative boundaries
 Rely on packet switching & store and forward
 Net result
 Packet switched network consisting of distinct networks
with store & forward gateways between them
16
2nd Level Goals
1. Function despite loss of networks/gateways
2. Support multiple types of services
3. Accommodate a variety of networks
4. Distributed management of resources
5. Cost effective
6. Low level of effort to add a host
7. Provide accounting of resources used
 What else could a network designer ask for?
17
Fundamental Trade-Offs
 All goals can’t be satisfied equally
 Which goals win & which lose in the trade-off?
 Order of goals is essential
 Very strong focus on first 3
 Survive network & gateway failures
 Provide different types of services
 Accommodate a variety of networks
 See a connection to hourglass model?
 A different order would produce a different design
 e.g., accounting barely works at all in the Internet
18
Survivability
 Links & Gateways will fail & stop working
 Design didn’t anticipate misbehaviour
 Source has no physical path to destination
 2 entities can continue to communicate
 Despite faults at any intermediate point
 Mask any transient failures, e.g., route changes
 Break only if total network partition
 See a connection to end-to-end principle?
19
Achieving Survivability
 Implications for storing network state
 Failure of intermediate nodes  loss of state
 Must replicate state stored at intermediate nodes
 Replication is difficult
 Clever Solution
 State only stored at edges
 Stateless packet switches (middle of network)
 State at the edge
 e.g., TCP state: seqnum, acknum, window, etc.
 Fate-sharing
 Acceptable to lose the state if the host itself has failed
20
Types of Services
 Virtual circuit service (TCP)
 Bi-directional reliable delivery
 Differing goals even within this service
 High bandwidth, delay not so important, e.g., file transfer
 Low latency, bandwidth less important, e.g., Telnet
 Other services
 Low complexity, no reliability, e.g., debugging
 Predictable rate with minimal jitter, e.g., voice
 Reliability is counterproductive
21
Types of Services (Cont.)
 Split TCP/IP as 2 separate layers
 TCP (transport) & IP (network)
 Datagram as basic building block
 No assumption desired service is present in
underlying network
 Build services such as TCP or UDP at the end hosts
22
Variety of Networks
 Assumptions regarding underlying network
 Transport a packet with reasonable packet size
 Reasonable (but not perfect) reliability
 Reliability proved a problem for sending voice
 Assumptions that weren’t used
 Reliable or sequenced delivery
 Network broadcast or multicast
 Priorities or services
 Failures, speeds, or delays
 Minimal set of functionalities
 Build other services at host, e.g., TCP for reliability 23
Other Goals
 Distributed management
 Success in allowing multiple domains (2 tier routing)
 Failure in routing policies
 Cost Effective
 Longer headers reduce efficiency
 Retransmission at the ends reduces efficiency
 Adding Hosts
 Host software is complex
 Relies on correct implementations at the host
 Misbehaviour is a real problem today
 Accounting
 Challenges of datagram model
 May prefer flows for accounting 24
Implementations
 Proven to meet goal of network variety
 Some high speed, some not
 Some highly redundant, some single point of failure
 This failure is due to the implementation, not the design
 Leaves much of the work for implementation
 What bandwidth? What redundancy?
 Performance Goals
 Little good guidance
 Limited effective simulation
 Specifying Performance
 Must specify it, or you won’t get it
 Leave it to network administrators to specify performance goals
25
Summary
 Identified & Prioritized Goals
 Top 3 goals very successful
 Bottom goals less successful
 Building block – datagram
 Very effective for top goals
 Suggests “flows” may be better (for different priorities
of goals)
 Suggests Period Messages – Soft-state
26

More Related Content

PPTX
Network defenses
PPTX
Mac addresses(media access control)
PPTX
Networking Fundamentals
PPT
PPT
Distributed Systems
PPT
Data communication and computer networks | Network Topologies
PDF
MAC Address – All you Need to Know About it
PPTX
Basic concepts in computer security
Network defenses
Mac addresses(media access control)
Networking Fundamentals
Distributed Systems
Data communication and computer networks | Network Topologies
MAC Address – All you Need to Know About it
Basic concepts in computer security

What's hot (20)

PPTX
TCP/IP Introduction
PPTX
Internet Protocol
PPTX
An introduction to networking
PPTX
Introduction to Network and System Administration
PPTX
TCP and UDP
PPT
Firewall
PPT
Circuit and packet_switching
PPTX
Cellular wireless network security
PPTX
Internetworking
PPTX
PPT on Basic of Gateway
PPTX
PDF
IEEE standards 802.3.&802.11
PPTX
Address resolution protocol (ARP)
PPTX
OSI Model - Open Systems Interconnection
PPS
Ip address
PPTX
Transmission Control Protocol (TCP)
PPT
IEEE Standards
TCP/IP Introduction
Internet Protocol
An introduction to networking
Introduction to Network and System Administration
TCP and UDP
Firewall
Circuit and packet_switching
Cellular wireless network security
Internetworking
PPT on Basic of Gateway
IEEE standards 802.3.&802.11
Address resolution protocol (ARP)
OSI Model - Open Systems Interconnection
Ip address
Transmission Control Protocol (TCP)
IEEE Standards
Ad

Similar to Internet Architecture and Design Philosophy (20)

PPTX
Designing network topology.pptx
PPT
Ccna report
PPT
nv.ppt
PPTX
PPT
Lecture 01
PPTX
1.3 Workbook Answers.pptx.....................
PPTX
computor system technology and application.pptx
DOCX
computer network NCC l4dc assingment
PPTX
A Deep Dive in the World of IT Networking (Part 2)
PPT
Datacom_Section_2_-_Protocols.ppt
PPT
Tcp ip
PDF
CS9222 ADVANCED OPERATING SYSTEMS
PPTX
Csc341 – Lecture 1 network management
PPT
Slides for Week 1 - Lec 2
PDF
Client Server Model and Distributed Computing
PPTX
Ccna interview questions
PDF
Network characteristics of the cloud
PDF
Essay On Ethernet
PDF
Comptia Network Study Notes Dion Training 11 James Dion
DOCX
Pg. 03Question Three Assignment 3Deadline Thurs.docx
Designing network topology.pptx
Ccna report
nv.ppt
Lecture 01
1.3 Workbook Answers.pptx.....................
computor system technology and application.pptx
computer network NCC l4dc assingment
A Deep Dive in the World of IT Networking (Part 2)
Datacom_Section_2_-_Protocols.ppt
Tcp ip
CS9222 ADVANCED OPERATING SYSTEMS
Csc341 – Lecture 1 network management
Slides for Week 1 - Lec 2
Client Server Model and Distributed Computing
Ccna interview questions
Network characteristics of the cloud
Essay On Ethernet
Comptia Network Study Notes Dion Training 11 James Dion
Pg. 03Question Three Assignment 3Deadline Thurs.docx
Ad

More from Dilum Bandara (20)

PPTX
Designing for Multiple Blockchains in Industry Ecosystems
PPTX
Introduction to Machine Learning
PPTX
Time Series Analysis and Forecasting in Practice
PPTX
Introduction to Dimension Reduction with PCA
PPTX
Introduction to Descriptive & Predictive Analytics
PPTX
Introduction to Concurrent Data Structures
PPTX
Hard to Paralelize Problems: Matrix-Vector and Matrix-Matrix
PPTX
Introduction to Map-Reduce Programming with Hadoop
PPTX
Embarrassingly/Delightfully Parallel Problems
PPTX
Introduction to Warehouse-Scale Computers
PPTX
Introduction to Thread Level Parallelism
PPTX
CPU Memory Hierarchy and Caching Techniques
PPTX
Data-Level Parallelism in Microprocessors
PDF
Instruction Level Parallelism – Hardware Techniques
PPTX
Instruction Level Parallelism – Compiler Techniques
PPTX
CPU Pipelining and Hazards - An Introduction
PPTX
Advanced Computer Architecture – An Introduction
PPTX
High Performance Networking with Advanced TCP
PPTX
Introduction to Content Delivery Networks
PPTX
Peer-to-Peer Networking Systems and Streaming
Designing for Multiple Blockchains in Industry Ecosystems
Introduction to Machine Learning
Time Series Analysis and Forecasting in Practice
Introduction to Dimension Reduction with PCA
Introduction to Descriptive & Predictive Analytics
Introduction to Concurrent Data Structures
Hard to Paralelize Problems: Matrix-Vector and Matrix-Matrix
Introduction to Map-Reduce Programming with Hadoop
Embarrassingly/Delightfully Parallel Problems
Introduction to Warehouse-Scale Computers
Introduction to Thread Level Parallelism
CPU Memory Hierarchy and Caching Techniques
Data-Level Parallelism in Microprocessors
Instruction Level Parallelism – Hardware Techniques
Instruction Level Parallelism – Compiler Techniques
CPU Pipelining and Hazards - An Introduction
Advanced Computer Architecture – An Introduction
High Performance Networking with Advanced TCP
Introduction to Content Delivery Networks
Peer-to-Peer Networking Systems and Streaming

Recently uploaded (20)

PPTX
M Tech Sem 1 Civil Engineering Environmental Sciences.pptx
PPTX
IOT PPTs Week 10 Lecture Material.pptx of NPTEL Smart Cities contd
PPTX
web development for engineering and engineering
PDF
Evaluating the Democratization of the Turkish Armed Forces from a Normative P...
PDF
The CXO Playbook 2025 – Future-Ready Strategies for C-Suite Leaders Cerebrai...
PPTX
MCN 401 KTU-2019-PPE KITS-MODULE 2.pptx
PPTX
CYBER-CRIMES AND SECURITY A guide to understanding
PPTX
UNIT-1 - COAL BASED THERMAL POWER PLANTS
PPTX
Internet of Things (IOT) - A guide to understanding
PPTX
MET 305 2019 SCHEME MODULE 2 COMPLETE.pptx
PPTX
Construction Project Organization Group 2.pptx
PPT
CRASH COURSE IN ALTERNATIVE PLUMBING CLASS
PDF
July 2025 - Top 10 Read Articles in International Journal of Software Enginee...
PDF
Embodied AI: Ushering in the Next Era of Intelligent Systems
PDF
SM_6th-Sem__Cse_Internet-of-Things.pdf IOT
PPTX
Welding lecture in detail for understanding
PPTX
CARTOGRAPHY AND GEOINFORMATION VISUALIZATION chapter1 NPTE (2).pptx
PDF
keyrequirementskkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk
PDF
Enhancing Cyber Defense Against Zero-Day Attacks using Ensemble Neural Networks
PPTX
Sustainable Sites - Green Building Construction
M Tech Sem 1 Civil Engineering Environmental Sciences.pptx
IOT PPTs Week 10 Lecture Material.pptx of NPTEL Smart Cities contd
web development for engineering and engineering
Evaluating the Democratization of the Turkish Armed Forces from a Normative P...
The CXO Playbook 2025 – Future-Ready Strategies for C-Suite Leaders Cerebrai...
MCN 401 KTU-2019-PPE KITS-MODULE 2.pptx
CYBER-CRIMES AND SECURITY A guide to understanding
UNIT-1 - COAL BASED THERMAL POWER PLANTS
Internet of Things (IOT) - A guide to understanding
MET 305 2019 SCHEME MODULE 2 COMPLETE.pptx
Construction Project Organization Group 2.pptx
CRASH COURSE IN ALTERNATIVE PLUMBING CLASS
July 2025 - Top 10 Read Articles in International Journal of Software Enginee...
Embodied AI: Ushering in the Next Era of Intelligent Systems
SM_6th-Sem__Cse_Internet-of-Things.pdf IOT
Welding lecture in detail for understanding
CARTOGRAPHY AND GEOINFORMATION VISUALIZATION chapter1 NPTE (2).pptx
keyrequirementskkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkkk
Enhancing Cyber Defense Against Zero-Day Attacks using Ensemble Neural Networks
Sustainable Sites - Green Building Construction

Internet Architecture and Design Philosophy

  • 1. Internet Architecture & Design Philosophy CS4482 High Performance Networking Dilum Bandara Dilum.Bandara@uom.lk Some slides extracted from Dr. Dan Massey’s CS557 class at Colorado State University
  • 2. Outline 1. J.H. Saltzer, D.P. Reed, and D.D. Clark, “End to End Arguments in System Design,” ACM Transactions on Computer Systems, vol. 2, no. 4, Nov. 1984, pp. 277- 288 2. D.D. Clark, “Design Philosophy of the DARPA Internet Protocols,” ACM, 1988 2
  • 3. Architecture  Dictionary definitions  A style & method of design & construction  Orderly arrangement of parts  Manner of construction of something & disposition of its parts  Design, the way components fits together  Definitions vary & no one agrees  Goal  Why the Internet was designed this way? 3
  • 6. Hourglass Architecture  Why internet layer?  Make a big network  Global addressing  Virtualized network to isolate protocols from network details  Why only IP?  Maximum interoperability  Minimize no of service interfaces  Why IP is so narrow?  Assumes least common network functionality  many networks 6 Steve Deering’s hourglass showing “waist” of the Internet Source: http://isoc.org/wp/ietfjournal/?p=454
  • 7. Hourglass Architecture Insufficient 7 Putting on weight Need for more functionality Midlife Crisis Address space not sufficient
  • 8. Architecture often seen today 8 Source: http://isoc.org/wp/ietfjournal/?p=454
  • 9. End-to-End Argument [1]  Examines which layer should implement a service  Argue many services should be implemented at higher layers  e.g., on end hosts  Contributions  Fits with the model of minimal network (IP) layer  Provides guidance on what (not) to add to data link layers  End-to-end principle is fundamental to Internet success 9
  • 10. Which Layer?  Services  Reliable delivery  Duplicate message suppression  FIFO ordering  Delivery guarantees  Encryption  Transaction Management  Recovery from crashes  Options  Lower layers help application by providing those services  Lower layers are of little help as application has the final say 10
  • 11. File Transfer – Example  Errors can occur at many levels  Transfer from sender disk to memory  Transfer from sender OS to sender line card  Transfer across network  Transfer from receiver line card to receiver OS  Transfer from receiver memory to disk  What would be the effect of a perfectly reliable network?  Does not recover from other errors  Provides a false sense of security  Impact other applications that don’t need those services 11
  • 12. Tradeoffs  As far as application has to perform its own checking, extra effort at network level is of little help  End systems have information on semantics & requirements  Application state  Network has information on data transmission parameters (packet size, error rate)  Assuming packets follow the predicted path 12
  • 13. Other Examples  Delivery guarantees  Did the end act upon the received message?  Encryption  Clear data before entering the secure network  Duplicate message suppression  Applications may retry, e.g., remote login  FIFO ordering  In distributed systems with multiple destinations  Recovery from crashes  What if the network failed & all state is lost? 13
  • 14. Rules of Thumb  Consider marginal gain in lower layer  If you can achieve large impact with limited effort, go for it  Consider impact on other services  Implement at lower layer, only if minimal impact on applications that don’t use that service  General Result  Implement services at the end, not inside the network 14
  • 15. Why TCP/IP? [2]  Objective  Why TCP/IP was designed this way?  DARAP Internet Architecture  1 fundamental goal  Several 2nd level goals  Ordering of 2nd level goals 15
  • 16. Fundamental Goal  Allow connection of many existing networks  Effective technique for multiplexed utilization of existing interconnected networks  Some important assumptions  Connect ARPANET with ARPA packet radio  Networks represent administrative boundaries  Rely on packet switching & store and forward  Net result  Packet switched network consisting of distinct networks with store & forward gateways between them 16
  • 17. 2nd Level Goals 1. Function despite loss of networks/gateways 2. Support multiple types of services 3. Accommodate a variety of networks 4. Distributed management of resources 5. Cost effective 6. Low level of effort to add a host 7. Provide accounting of resources used  What else could a network designer ask for? 17
  • 18. Fundamental Trade-Offs  All goals can’t be satisfied equally  Which goals win & which lose in the trade-off?  Order of goals is essential  Very strong focus on first 3  Survive network & gateway failures  Provide different types of services  Accommodate a variety of networks  See a connection to hourglass model?  A different order would produce a different design  e.g., accounting barely works at all in the Internet 18
  • 19. Survivability  Links & Gateways will fail & stop working  Design didn’t anticipate misbehaviour  Source has no physical path to destination  2 entities can continue to communicate  Despite faults at any intermediate point  Mask any transient failures, e.g., route changes  Break only if total network partition  See a connection to end-to-end principle? 19
  • 20. Achieving Survivability  Implications for storing network state  Failure of intermediate nodes  loss of state  Must replicate state stored at intermediate nodes  Replication is difficult  Clever Solution  State only stored at edges  Stateless packet switches (middle of network)  State at the edge  e.g., TCP state: seqnum, acknum, window, etc.  Fate-sharing  Acceptable to lose the state if the host itself has failed 20
  • 21. Types of Services  Virtual circuit service (TCP)  Bi-directional reliable delivery  Differing goals even within this service  High bandwidth, delay not so important, e.g., file transfer  Low latency, bandwidth less important, e.g., Telnet  Other services  Low complexity, no reliability, e.g., debugging  Predictable rate with minimal jitter, e.g., voice  Reliability is counterproductive 21
  • 22. Types of Services (Cont.)  Split TCP/IP as 2 separate layers  TCP (transport) & IP (network)  Datagram as basic building block  No assumption desired service is present in underlying network  Build services such as TCP or UDP at the end hosts 22
  • 23. Variety of Networks  Assumptions regarding underlying network  Transport a packet with reasonable packet size  Reasonable (but not perfect) reliability  Reliability proved a problem for sending voice  Assumptions that weren’t used  Reliable or sequenced delivery  Network broadcast or multicast  Priorities or services  Failures, speeds, or delays  Minimal set of functionalities  Build other services at host, e.g., TCP for reliability 23
  • 24. Other Goals  Distributed management  Success in allowing multiple domains (2 tier routing)  Failure in routing policies  Cost Effective  Longer headers reduce efficiency  Retransmission at the ends reduces efficiency  Adding Hosts  Host software is complex  Relies on correct implementations at the host  Misbehaviour is a real problem today  Accounting  Challenges of datagram model  May prefer flows for accounting 24
  • 25. Implementations  Proven to meet goal of network variety  Some high speed, some not  Some highly redundant, some single point of failure  This failure is due to the implementation, not the design  Leaves much of the work for implementation  What bandwidth? What redundancy?  Performance Goals  Little good guidance  Limited effective simulation  Specifying Performance  Must specify it, or you won’t get it  Leave it to network administrators to specify performance goals 25
  • 26. Summary  Identified & Prioritized Goals  Top 3 goals very successful  Bottom goals less successful  Building block – datagram  Very effective for top goals  Suggests “flows” may be better (for different priorities of goals)  Suggests Period Messages – Soft-state 26

Editor's Notes

  • #16: DARPA – Defence Advanced Research Project Agency