![Page 1: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/1.jpg)
Where Are We?
Basics:Network ClassificationNetwork ArchitectureReliable Data TransferDelay ModelsImplementation:Protocol Design
CSC458/2209 - Computer Networks
![Page 2: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/2.jpg)
Layered Architecture
CSC458/2209 - Computer Networks
![Page 3: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/3.jpg)
Layered Architecture
CSC458/2209 - Computer Networks
![Page 4: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/4.jpg)
Data Link Layer
FunctionalityReliable Delivery of FramesFlow ControlError DetectionError Correction
CSC458/2209 - Computer Networks
![Page 5: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/5.jpg)
Multiaccess Media
CSC458/2209 - Computer Networks
![Page 6: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/6.jpg)
Multiaccess Media
CSC458/2209 - Computer Networks
![Page 7: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/7.jpg)
Multiaccess Media
Rules
“Don’t interrupt when someone else is speaking”“Raise your hand if you have a question”“Give everyone a chance to speak”
CSC458/2209 - Computer Networks
![Page 8: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/8.jpg)
Multiaccess Media
Rules
“Don’t interrupt when someone else is speaking”“Raise your hand if you have a question”“Give everyone a chance to speak”
CSC458/2209 - Computer Networks
![Page 9: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/9.jpg)
Multiaccess Media
Rules
“Don’t interrupt when someone else is speaking”“Raise your hand if you have a question”“Give everyone a chance to speak”
CSC458/2209 - Computer Networks
![Page 10: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/10.jpg)
Multiaccess Media
Rules
“Don’t interrupt when someone else is speaking”“Raise your hand if you have a question”“Give everyone a chance to speak”
CSC458/2209 - Computer Networks
![Page 11: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/11.jpg)
Multiaccess Protocols
Channel Partitioning (Cellular Wireless Networks)Random Access (Ethernet, WiFi)Taking Turns (Token Ring)
CSC458/2209 - Computer Networks
![Page 12: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/12.jpg)
Multiaccess Protocols
Channel Partitioning (Cellular Wireless Networks)Random Access (Ethernet, WiFi)Taking Turns (Token Ring)
CSC458/2209 - Computer Networks
![Page 13: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/13.jpg)
Multiaccess Protocols
Channel Partitioning (Cellular Wireless Networks)Random Access (Ethernet, WiFi)Taking Turns (Token Ring)
CSC458/2209 - Computer Networks
![Page 14: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/14.jpg)
Multiaccess Protocols
Channel Partitioning (Cellular Wireless Networks)Random Access (Ethernet, WiFi)Taking Turns (Token Ring)
CSC458/2209 - Computer Networks
![Page 15: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/15.jpg)
Protocols for Multiaccess Networks
Hosts broadcast packetsWhen a collision occurs, all transmitted packets are lostLost packets have to be retransmitted
CSC458/2209 - Computer Networks
![Page 16: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/16.jpg)
Protocols for Multiaccess Networks
Hosts broadcast packetsWhen a collision occurs, all transmitted packets are lostLost packets have to be retransmitted
CSC458/2209 - Computer Networks
![Page 17: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/17.jpg)
Protocols for Multiaccess Networks
Hosts broadcast packetsWhen a collision occurs, all transmitted packets are lostLost packets have to be retransmitted
CSC458/2209 - Computer Networks
![Page 18: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/18.jpg)
Protocols for Multiaccess Networks
Hosts broadcast packetsWhen a collision occurs, all transmitted packets are lostLost packets have to be retransmitted
CSC458/2209 - Computer Networks
![Page 19: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/19.jpg)
Protocols for Multiaccess Networks
Hosts broadcast packetsWhen a collision occurs, all transmitted packets are lostLost packets have to be retransmitted
=> Need Multiaccess Protocol
CSC458/2209 - Computer Networks
![Page 20: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/20.jpg)
Protocols for Multiaccess Networks
Goal:Understand Multiaccess ProtocolsUnderstand Ethernet and IEEE 802.11 Protocol
Issues:How to deal with collisions? (− > Protocol design)Maximal traffic load? (− > Protocol performance)
CSC458/2209 - Computer Networks
![Page 21: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/21.jpg)
Protocols for Multiaccess Networks
Goal:Understand Multiaccess ProtocolsUnderstand Ethernet and IEEE 802.11 Protocol
Issues:How to deal with collisions? (− > Protocol design)Maximal traffic load? (− > Protocol performance)
CSC458/2209 - Computer Networks
![Page 22: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/22.jpg)
Protocols for Multiaccess Networks
Goal:Understand Multiaccess ProtocolsUnderstand Ethernet and IEEE 802.11 Protocol
Issues:How to deal with collisions? (− > Protocol design)Maximal traffic load? (− > Protocol performance)
CSC458/2209 - Computer Networks
![Page 23: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/23.jpg)
Protocols for Multiaccess Networks
Goal:Understand Multiaccess ProtocolsUnderstand Ethernet and IEEE 802.11 Protocol
Issues:How to deal with collisions? (− > Protocol design)Maximal traffic load? (− > Protocol performance)
CSC458/2209 - Computer Networks
![Page 24: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/24.jpg)
Protocols for Multiaccess Networks
Goal:Understand Multiaccess ProtocolsUnderstand Ethernet and IEEE 802.11 Protocol
Issues:How to deal with collisions? (− > Protocol design)Maximal traffic load? (− > Protocol performance)
CSC458/2209 - Computer Networks
![Page 25: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/25.jpg)
Model - Slotted Aloha
Time is divided into slots:
unit time = LC seconds
Packet arrival rate (over all hosts) of λ packets/time unitCollision or Perfect ReceptionImmediate Feedback: 0,1,e(Re-)transmission Probability: qr
Infinite number of hosts (i.e. each node has at most onepacket to transmit)
CSC458/2209 - Computer Networks
![Page 26: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/26.jpg)
Model - Slotted Aloha
Time is divided into slots:
unit time = LC seconds
Packet arrival rate (over all hosts) of λ packets/time unitCollision or Perfect ReceptionImmediate Feedback: 0,1,e(Re-)transmission Probability: qr
Infinite number of hosts (i.e. each node has at most onepacket to transmit)
CSC458/2209 - Computer Networks
![Page 27: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/27.jpg)
Model - Slotted Aloha
Time is divided into slots:
unit time = LC seconds
Packet arrival rate (over all hosts) of λ packets/time unitCollision or Perfect ReceptionImmediate Feedback: 0,1,e(Re-)transmission Probability: qr
Infinite number of hosts (i.e. each node has at most onepacket to transmit)
CSC458/2209 - Computer Networks
![Page 28: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/28.jpg)
Model - Slotted Aloha
Time is divided into slots:
unit time = LC seconds
Packet arrival rate (over all hosts) of λ packets/time unitCollision or Perfect ReceptionImmediate Feedback: 0,1,e(Re-)transmission Probability: qr
Infinite number of hosts (i.e. each node has at most onepacket to transmit)
CSC458/2209 - Computer Networks
![Page 29: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/29.jpg)
Model - Slotted Aloha
Time is divided into slots:
unit time = LC seconds
Packet arrival rate (over all hosts) of λ packets/time unitCollision or Perfect ReceptionImmediate Feedback: 0,1,e(Re-)transmission Probability: qr
Infinite number of hosts (i.e. each node has at most onepacket to transmit)
CSC458/2209 - Computer Networks
![Page 30: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/30.jpg)
Model - Slotted Aloha
Questions
Throughput?
How to choose qr ?Would qr = 1 work?Probability for (re-)transmission after k − 1 slots:Average time until (re-)transmission:
CSC458/2209 - Computer Networks
![Page 31: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/31.jpg)
Model - Slotted Aloha
Questions
Throughput?
How to choose qr ?Would qr = 1 work?Probability for (re-)transmission after k − 1 slots:Average time until (re-)transmission:
CSC458/2209 - Computer Networks
![Page 32: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/32.jpg)
Model - Slotted Aloha
Questions
Throughput?
How to choose qr ?Would qr = 1 work?Probability for (re-)transmission after k − 1 slots:Average time until (re-)transmission:
CSC458/2209 - Computer Networks
![Page 33: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/33.jpg)
Model - Slotted Aloha
Questions
Throughput?
How to choose qr ?Would qr = 1 work?Probability for (re-)transmission after k − 1 slots:Average time until (re-)transmission:
CSC458/2209 - Computer Networks
![Page 34: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/34.jpg)
Model - Slotted Aloha
Questions
Throughput?
How to choose qr ?Would qr = 1 work?Probability for (re-)transmission after k − 1 slots:Average time until (re-)transmission:
CSC458/2209 - Computer Networks
![Page 35: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/35.jpg)
Model - Slotted Aloha
Questions
Throughput?
How to choose qr ?Would qr = 1 work?Probability for (re-)transmission after k − 1 slots:Average time until (re-)transmission:
CSC458/2209 - Computer Networks
![Page 36: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/36.jpg)
Model - Slotted Aloha
Notationλ: aggregated arrival raten: number of backlogged packetsG(n) = nqr : average number of transmissions per time slot
Want to computePsucc : probability of successful transmission in a time slot(as a function of G(n))Throughput = Psucc
1
CSC458/2209 - Computer Networks
![Page 37: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/37.jpg)
Model - Slotted Aloha
Notationλ: aggregated arrival raten: number of backlogged packetsG(n) = nqr : average number of transmissions per time slot
Want to computePsucc : probability of successful transmission in a time slot(as a function of G(n))Throughput = Psucc
1
CSC458/2209 - Computer Networks
![Page 38: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/38.jpg)
Model - Slotted Aloha
Notationλ: aggregated arrival raten: number of backlogged packetsG(n) = nqr : average number of transmissions per time slot
Want to computePsucc : probability of successful transmission in a time slot(as a function of G(n))Throughput = Psucc
1
CSC458/2209 - Computer Networks
![Page 39: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/39.jpg)
Model - Slotted Aloha
Notationλ: aggregated arrival raten: number of backlogged packetsG(n) = nqr : average number of transmissions per time slot
Want to computePsucc : probability of successful transmission in a time slot(as a function of G(n))Throughput = Psucc
1
CSC458/2209 - Computer Networks
![Page 40: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/40.jpg)
Model - Slotted Aloha
Notationλ: aggregated arrival raten: number of backlogged packetsG(n) = nqr : average number of transmissions per time slot
Want to computePsucc : probability of successful transmission in a time slot(as a function of G(n))Throughput = Psucc
1
CSC458/2209 - Computer Networks
![Page 41: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/41.jpg)
Model - Slotted Aloha
Notationλ: aggregated arrival raten: number of backlogged packetsG(n) = nqr : average number of transmissions per time slot
Want to computePsucc : probability of successful transmission in a time slot(as a function of G(n))Throughput = Psucc
1
CSC458/2209 - Computer Networks
![Page 42: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/42.jpg)
Model - Slotted Aloha
Psucc = nqr
(1 − qr
)n−1=
nqr
1 − qr
(1 − qr
)n
CSC458/2209 - Computer Networks
![Page 43: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/43.jpg)
Model - Slotted Aloha
Psucc = nqr
(1 − qr
)n−1=
nqr
1 − qr
(1 − qr
)n
For qr small, we have(1 − qr
)n≈ e−nqr and
nqr
1 − qr≈ nqr ,
CSC458/2209 - Computer Networks
![Page 44: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/44.jpg)
Model - Slotted Aloha
Psucc = nqr
(1 − qr
)n−1=
nqr
1 − qr
(1 − qr
)n
For qr small, we have(1 − qr
)n≈ e−nqr and
nqr
1 − qr≈ nqr ,
and we obtain
Psucc ≈ nqr e−nqr = G(n)e−G(n)
where G(n) = nqr
CSC458/2209 - Computer Networks
![Page 45: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/45.jpg)
Model - Slotted Aloha
Throughput:
G(n)e−G(n)
where G(n) = nqr
CSC458/2209 - Computer Networks
![Page 46: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/46.jpg)
Model - Slotted Aloha
Throughput:
G(n)e−G(n)
where G(n) = nqr
Note: Arrivals according to a Poisson distribution with rate G:
pk =Gk
k !e−G
CSC458/2209 - Computer Networks
![Page 47: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/47.jpg)
Model - Slotted Aloha
If G(n)e−G(n) > λ:If G(n)e−G(n) < λ:Optimal G(n) = nqr = 1, or
qr =1n
CSC458/2209 - Computer Networks
![Page 48: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/48.jpg)
Model - Slotted Aloha
If G(n)e−G(n) > λ:If G(n)e−G(n) < λ:Optimal G(n) = nqr = 1, or
qr =1n
CSC458/2209 - Computer Networks
![Page 49: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/49.jpg)
Model - Slotted Aloha
If G(n)e−G(n) > λ:If G(n)e−G(n) < λ:Optimal G(n) = nqr = 1, or
qr =1n
CSC458/2209 - Computer Networks
![Page 50: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/50.jpg)
Model - Slotted Aloha
If G(n)e−G(n) > λ:If G(n)e−G(n) < λ:Optimal G(n) = nqr = 1, or
qr =1n
CSC458/2209 - Computer Networks
![Page 51: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/51.jpg)
Model - Slotted Aloha
What did we learn?
λmax = e−1 ≈ 0.368qr should dynamically change
Binary Exponential Backoffqr = 2−k
CSC458/2209 - Computer Networks
![Page 52: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/52.jpg)
Model - Slotted Aloha
What did we learn?
λmax = e−1 ≈ 0.368qr should dynamically change
Binary Exponential Backoffqr = 2−k
CSC458/2209 - Computer Networks
![Page 53: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/53.jpg)
Model - Slotted Aloha
What did we learn?
λmax = e−1 ≈ 0.368qr should dynamically change
Binary Exponential Backoffqr = 2−k
CSC458/2209 - Computer Networks
![Page 54: Basics: Network Classificationmarbach/COURSES/CSC358_S14/l11.pdfBasics: Network Classification Network Architecture Reliable Data Transfer Delay Models Implementation: Protocol Design](https://reader035.vdocuments.net/reader035/viewer/2022062607/6041d0709b7d565bd23b1611/html5/thumbnails/54.jpg)
Model - Slotted Aloha
What did we learn?
λmax = e−1 ≈ 0.368qr should dynamically change
Binary Exponential Backoffqr = 2−k
CSC458/2209 - Computer Networks