香港浸会大学:《Data Communications and Networking》课程教学资源(PPT讲稿)Chapter 9 High Speed LANs and Wireless LANs

Data communications and Networking Chapter 9 High Speed LANs and Wireless LANs References Book Chapters 16 and 17 Data and Computer Communications, 8th edition ByW∥ lam Stallings
Data Communications and Networking Chapter 9 High Speed LANs and Wireless LANs References: Book Chapters 16 and 17 Data and Computer Communications, 8th edition By William Stallings

Outline Fundamentals of ethernet -aloHA, slotted aloHA, csma -CSMA/CD Ethernet Examples 10-Mbps Ethernet -Fast ethernet -Gigabit Ethernet 10-Gbps Ethernet 802. 11 Wireless Lans
2 Outline • Fundamentals of Ethernet —ALOHA, slotted ALOHA, CSMA —CSMA/CD • Ethernet Examples —10-Mbps Ethernet —Fast Ethernet —Gigabit Ethernet —10-Gbps Ethernet • 802.11 Wireless LANs

Ethernet Most widely used high-speed LANs Ethernet(10Mbps, 100Mbps, 1Gbps 10Gbps) Fibre channel High-speed wireless LANs Ethernet protocol is developed by iEee 802.3 standards committee, consisting of Medium Access Control ( Mac) layer(CSMA/CD protocol) the key part of this chapter Physical Layer Earlier mac schemes ALOHA Slotted aloha CSMA
3 Ethernet • Most widely used high-speed LANs — Ethernet (10Mbps, 100Mbps, 1Gbps, 10Gbps) — Fibre channel — High-speed wireless LANs • Ethernet protocol is developed by IEEE 802.3 standards committee, consisting of — Medium Access Control (MAC) Layer (CSMA/CD protocol) • the key part of this chapter — Physical Layer • Earlier MAC schemes: — ALOHA — Slotted ALOHA — CSMA

ALOHA ALOHA protocol is developed for packet radio networks, but applicable to any shared transmission medium a number of stations share the transmission medium two or more simultaneous transmissions will cause a collision Sender When station has frame it sends Station listens for an amount of time If its hears an aCK, fine. If not, it retransmits the frame after a random time If no ACK after several transmissions, it gives up Frame check sequence can be used for error detection Receiver If frame is ok and address matches receiver, sends acK Otherwise, ignores this frame and does nothing Frame may be damaged by noise or by another station transmitting at the same time(collision). Overlap of frames also causes collision ALOHA is simple, but very inefficient Assuming random traffic, the maximum channel utilization is only about 18%
4 ALOHA • ALOHA protocol is developed for packet radio networks, but applicable to any shared transmission medium. — A number of stations share the transmission medium. Two or more simultaneous transmissions will cause a collision. • Sender — When station has frame, it sends — Station listens for an amount of time — If its hears an ACK, fine. If not, it retransmits the frame after a random time — If no ACK after several transmissions, it gives up — Frame check sequence can be used for error detection • Receiver — If frame is OK and address matches receiver, sends ACK — Otherwise, ignores this frame and does nothing • Frame may be damaged by noise or by another station transmitting at the same time (collision). Overlap of frames also causes collision. • ALOHA is simple, but very inefficient — Assuming random traffic, the maximum channel utilization is only about 18%

ALOHA Node 1 Packet Waiting a random time Node 2 Packet Retransmission Retransmission [2:3 Ime Collision Node 3 Packet 5
5 ALOHA

Slotted AloHA To improve efficiency a modification of ALOHA known as slotted ALOHA, was developed Time is organized into uniform slots whose size equals the frame transmission time -Need a central clock ( or other sync mechanism) Transmission begins only at a slot boundary -Consequence: frames either miss or overlap totally Maximum channel utilization can be improved to about 37%
6 Slotted ALOHA • To improve efficiency, a modification of ALOHA, known as slotted ALOHA, was developed. • Time is organized into uniform slots whose size equals the frame transmission time —Need a central clock (or other sync mechanism) • Transmission begins only at a slot boundary —Consequence: frames either miss or overlap totally • Maximum channel utilization can be improved to about 37%

Slotted AloHA Node 1 packet Nodes 2& 3 packets Retransmission Retransmission 283 3 Time Slot Collision
7 Slotted ALOHA

CSMA Why aloha and slotted aloha are so inefficient? Stations don't check the channel status. They just send out frames without considering whether the channel is free or not, which creates too many collisions In fact it is not difficult for a station to sense the channel status(free or not) CSMA: Carrier Sense Multiple access Stations listen to the channel(carrier sense) Stations knowwhether the channel is free or not Stations transmit only if the channel is free -Collisions become rare Only if two or more stations attempt to transmit at about the same time, collisions could happen 8
8 CSMA • Why ALOHA and slotted ALOHA are so inefficient? — Stations don’t check the channel status. They just send out frames without considering whether the channel is free or not, which creates too many collisions. • In fact, it is not difficult for a station to “sense” the channel status (free or not). • CSMA: Carrier Sense Multiple Access — Stations listen to the channel (carrier sense) — Stations “know” whether the channel is free or not — Stations transmit only if the channel is free — Collisions become rare • Only if two or more stations attempt to transmit at about the same time, collisions could happen

CSMA (Cont) In traditional LANs, propagation time is much less than frame transmission time Remark: this may not be true for 1 Gbps and 10gbps ethernet All stations know that a transmission has started almost immediately by carrier sense Details of cSma Stations first listen for clear medium (carrier sense) -If medium is idle, transmit the frame -If two or more stations start at about the same instant there will be a collision To account for this a station waits for an acK If no ack after a reasonable time then retransmit What should a station do if the medium is found busy? Three different approaches: nonpersistent CSMA, 1-persistent CSMA, and p-persistent CSMA 9
9 CSMA (Cont.) • In traditional LANs, propagation time is much less than frame transmission time — Remark: this may not be true for 1Gbps and 10Gbps Ethernet • All stations know that a transmission has started almost immediately by “carrier sense” • Details of CSMA — Stations first listen for clear medium (carrier sense) — If medium is idle, transmit the frame — If two or more stations start at about the same instant, there will be a collision. • To account for this, a station waits for an ACK • If no ACK after a reasonable time, then retransmit • What should a station do if the medium is found busy? — Three different approaches: nonpersistent CSMA, 1-persistent CSMA, and p-persistent CSMA

Nonpersistent CSMA a station wishing to transmit listens to the medium and obeys the following rules 1. If medium is idle, transmit; otherwise, go to step 2 2. If medium is busy, wait an amount of time drawn from a probability distribution and repeat step 1 The use of random delays reduces probability of collisions Consider two stations become ready to transmit at about the same time while another transmission is in progress If both stations delay the same amount of time before retrying both will attempt to transmit at same time>collision Drawback: Capacity is wasted because medium will generally remain idle following the end of a transmission even if there are one or more stations waiting to transmit. 10
10 Nonpersistent CSMA • A station wishing to transmit listens to the medium and obeys the following rules: 1. If medium is idle, transmit; otherwise, go to step 2 2. If medium is busy, wait an amount of time drawn from a probability distribution and repeat step 1 • The use of random delays reduces probability of collisions — Consider two stations become ready to transmit at about the same time while another transmission is in progress — If both stations delay the same amount of time before retrying, both will attempt to transmit at same time → collision • Drawback: — Capacity is wasted because medium will generally remain idle following the end of a transmission, even if there are one or more stations waiting to transmit
按次数下载不扣除下载券;
注册用户24小时内重复下载只扣除一次;
顺序:VIP每日次数-->可用次数-->下载券;
- 《软件工程》课程教学资源(PPT讲稿)软件测试——系统测试.pptx
- 厦门大学:《大数据技术原理与应用》课程教学资源(PPT课件讲稿,2017)第4章 分布式数据库HBase.ppt
- 上海交通大学:自然语言处理(PPT课件讲稿)Natural Language Processing.ppt
- 演化计算(PPT讲稿)Evolutionary Computation(EC).ppt
- 《计算机组成原理》课程电子教案(PPT课件讲稿)第4章 指令系统.ppt
- 电子工业出版社:《计算机网络》课程教学资源(第五版,PPT课件讲稿)第五章 运输层.ppt
- C++ Basics(PPT讲稿).ppt
- 河南中医药大学(河南中医学院):《计算机文化》课程教学资源(PPT课件讲稿)第五章 运输层.pptx
- 南京航空航天大学:《数据结构》课程教学资源(PPT课件讲稿)第七章 图(微软精品课程建设).ppt
- 香港浸会大学:Programming Interest Group(PPT讲稿)Combinatorics & Number Theory.ppt
- 河南中医药大学(河南中医学院):《计算机网络》课程教学资源(PPT课件讲稿)第二章 物理层.ppt
- 《网络搜索和挖掘关键技术 Web Search and Mining》课程教学资源(PPT讲稿)Lecture 03 The term vocabulary and postings lists.ppt
- A Unified Approach to Route Planning for Shared Mobility.pptx
- 同济大学:《软件测试》课程教学资源(PPT课件讲稿)第6章 功能测试(朱少民).ppt
- 香港理工大学:Introduction to Matlab(PPT讲稿)Image Processing with MATLAB.pptx
- 同济大学:《机器学习》课程教学资源(PPT讲稿)决策树 Decision Tree.pptx
- 河南中医药大学:《网络技术实训》课程教学资源(PPT课件讲稿)网络建设中的关键技术(主讲:路景鑫).pptx
- 微信公众平台开发与应用(PPT讲座,谭海兵).pptx
- 《计算机常用工具软件》教学资源(PPT讲稿)第8章 音频工具.ppt
- 应用层网络(PPT课件讲稿)Application-layer Overlay Networks.ppt
- Software Reliability & Testing(PPT讲稿)Overview of Software Reliability Engineering.ppt
- 《Java程序开发》课程教学资源(PPT课件讲稿)第11章 Struts2框架技术.ppt
- 北京航空航天大学:《数据挖掘——概念和技术(Data Mining - Concepts and Techniques)》课程教学资源(PPT课件讲稿)Chapter 02 Getting to Know Your Data.ppt
- 《计算机网络》课程教学资源(PPT课件讲稿)第三章 数据链路层.ppt
- 《信息系统与数据库技术》课程教学资源(PPT课件讲稿)第4章 T-SQL与可编程对象.ppt
- 香港理工大学:数据仓库和数据挖掘(PPT讲稿)Data Warehousing & Data Mining.ppt
- 山西农业大学:大数据技术原理与应用(PPT讲稿)Development and application of bigdata technology.ppt
- Peer-to-Peer Networks:Distributed Algorithms for P2P Distributed Hash Tables.ppt
- 中国科学技术大学:《计算机体系结构》课程教学资源(PPT课件讲稿)Chapter 01 量化设计与分析基础(主讲:周学海).ppt
- 《计算机视觉》课程教学资源(PPT课件讲稿)边缘和线特征提取.ppt
- 厦门大学:《数据库系统原理》课程教学资源(PPT课件讲稿,2016版)第五章 数据库完整性.ppt
- 四川大学:《Linux操作系统》课程教学资源(PPT课件讲稿)第2章 Linux操作系统管理基础.ppt
- 《数据结构》课程教学资源(PPT课件讲稿)第六章 树与二叉树(6.1-6.3).ppt
- 《Java语言程序设计》课程教学资源(PPT课件讲稿)第三章 Java面向对象程序设计.ppt
- 香港科技大学:Advanced Topics in Next Generation Wireless Networks.ppt
- 《图像处理与计算机视觉 Image Processing and Computer Vision》课程教学资源(PPT课件讲稿)Chapter 04 Feature extraction and tracking.pptx
- 面向服务的业务流程管理(PPT讲稿)Introduction to Business Process Management(BPM).pptx
- 《Computer Networking:A Top Down Approach》英文教材教学资源(PPT课件讲稿,6th edition)Chapter 6 无线和移动网络 Wireless and Mobile Networks.ppt
- “互联网+”与“+互联网”(PPT讲稿).pptx
- 《C语言程序设计》课程电子教案(PPT课件讲稿)第六章 函数.ppt