[考研资料]热门网络chap4.ppt

Computer Networks（Fourth Edition） Chapter 4 The Medium Access Control Sublayer Chapter 4 The Medium Access Control Sublayer 4.1 The Channel Allocation Problem 4.2 Multiple Access Protocols 4.3 Ethernet 4.4 Wireless LANs 4.5 Broadband Wireless 4.6 Bluetooth 4.7 Data Link Layer Switching 4.1 The Channel Allocation Problem 4.1.1 Static Channel Allocation 1.FDM(Frequency Division Multiplexing) the bandwidth is divided into N portions Each user is statically allocated every Nth bandwith 2.TDM(Time Division Multiplexing) Each user is statically allocated every Nth time slot 4.1 The Channel Allocation Problem 4.1.2 Dynamic Channel Allocation 4.1 The Channel Allocation Problem 4.1.2 Dynamic Channel Allocation Five key assumptions 1.Station Model the model consists of N independent stations stations are blocked and do nothing util the frame has been transmitted 2.Single Channel Assumption all stations transmit on a single channel 3.Collision Assumption if two frames overlap,it is called collision 4.1 The Channel Allocation Problem 4.1.2 Dynamic Channel Allocation 4a.Continuous Time transmission can begin at any instant 4b.Slotted Time transmission can begin at the start of a slot 5a.Carrier Sense stations can tell if the channel is in use 5b.No Carrier Sense stations cannot sense the channel before use it 4.2 Multiple Access Protocols 4.2 Multiple Access Protocols 4.2.1ALOHA 1970s, to solve the channel allocation problem. 1.Pure ALOHA Permit users to transmit whenever they have data to be sent; if collision happened, the sender waits a random amount of time and then sent it again. 4.2 Multiple Access Protocols 1.Pure ALOHA uniform frame size, namely the same length. 4.2 Multiple Access Protocols 2.Slotted ALOHA divide time into discrete intervals,users transmit at the start of each interval the approach required the users to agree on slot boundaries. 4.2 Multiple Access Protocols comparision 4.2 Multiple Access Protocols Carrier Sense Multiple Acce