DOC PREVIEW
MIT 6 033 - Introduction to Computer Networks

This preview shows page 1-2-3-4-5 out of 16 pages.

Save
View full document
View full document
Premium Document
Do you want full access? Go Premium and unlock all 16 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 16 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 16 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 16 pages.
Access to all documents
Download any document
Ad free experience
View full document
Premium Document
Do you want full access? Go Premium and unlock all 16 pages.
Access to all documents
Download any document
Ad free experience
Premium Document
Do you want full access? Go Premium and unlock all 16 pages.
Access to all documents
Download any document
Ad free experience

Unformatted text preview:

An Introduction to Computer NetworksChapter OutlineThis LectureSlide 8Two ways to shareInternet Traffic Is BurstyPacket switching also show reorderingSlide 18The mail systemCharacteristics of the mail systemSlide 21The InternetCharacteristics of the InternetBest EffortDifferences Between Circuit & Packet SwitchingSlide 261An Introduction to Computer NetworksSome slides are from lectures by Nick Mckeown, Ion Stoica, Frans Kaashoek, Hari Balakrishnan, and Sam Madden Prof. Dina KatabiChapter 72Chapter OutlineIntroduction (slides and 7.A)Layered Architecture (slides and 7.B & 7.D)Routing (slides and 7.D)Reliable Transmission & Flow Control (slides and read 7.E)Congestion Control (slides and read 7.F)3This LectureWhat is a network?Sharing the infrastructureCircuit switching Packet switchingBest Effort ServiceAnalogy: the mail systemInternet’s Best Effort Service8This LectureWhat is a network?Sharing the infrastructureCircuit switching Packet switchingBest Effort ServiceAnalogy: the mail systemInternet’s Best Effort Service9Two ways to shareCircuit switching (isochronous)Packet switching (asynchronous)13Internet Traffic Is BurstyDaily traffic at an MIT-CSAIL routerMax In:12.2Mb/s Avg. In: 2.5Mb/sMax Out: 12.8Mb/s Avg. Out: 3.4 Mb/s17Packet switching also show reorderingHost AHost BHost EHost DHost CNode 1Node 2Node 3Node 4Node 5Node 6Node 7Packets in a flow may not follow the same path (depends on routing as we will see later)  packets may be reordered18This LectureWhat is a network?Sharing the InfrastructureCircuit switching Packet switchingBest Effort ServiceAnalogy: the mail systemInternet’s Best Effort Service19The mail systemDina NickMITStanfordAdmin Admin20Characteristics of the mail systemEach envelope is individually routedNo time guarantee for deliveryNo guarantee of delivery in sequenceNo guarantee of delivery at all!Things get lostHow can we acknowledge delivery?RetransmissionHow to determine when to retransmit? Timeout?If message is re-sent too soon  duplicates21The mail systemDina NickMITStanfordAdmin Admin22 The InternetDina NickNms.csail.mit.eduLeland.Stanford.eduO.S. O.S.HeaderData HeaderDataPacketPacket23Characteristics of the InternetEach packet is individually routedNo time guarantee for deliveryNo guarantee of delivery in sequenceNo guarantee of delivery at all!Things get lostAcknowledgementsRetransmissionHow to determine when to retransmit? Timeout?If packet is re-transmitted too soon  duplicate24Best EffortNo Guarantees:Variable Delay (jitter)Variable ratePacket lossDuplicatesReordering(notes also state maximum packet length)25Differences Between Circuit & Packet SwitchingCircuit-switching Packet-SwitchingGuaranteed capacity No guarantees (best effort)Capacity is wasted if data is burstyMore efficientBefore sending data establishes a pathSend data immediatelyAll data in a single flow follow one pathDifferent packets might follow different pathsNo reordering; constant delay; no pkt dropsPackets may be reordered, delayed, or dropped26This LectureWe learned how to share the network infrastructure between many connections/flowsWe also learned about the implications of the sharing scheme (circuit or packet switching) on the service that the traffic


View Full Document

MIT 6 033 - Introduction to Computer Networks

Documents in this Course
TRIPLET

TRIPLET

12 pages

End Layer

End Layer

11 pages

Quiz 1

Quiz 1

4 pages

Threads

Threads

18 pages

Quiz I

Quiz I

15 pages

Atomicity

Atomicity

10 pages

QUIZ I

QUIZ I

7 pages

Load more
Download Introduction to Computer Networks
Our administrator received your request to download this document. We will send you the file to your email shortly.
Loading Unlocking...
Login

Join to view Introduction to Computer Networks and access 3M+ class-specific study document.

or
We will never post anything without your permission.
Don't have an account?
Sign Up

Join to view Introduction to Computer Networks 2 2 and access 3M+ class-specific study document.

or

By creating an account you agree to our Privacy Policy and Terms Of Use

Already a member?