Chapter 4 Data Link Layer.pptVIP

  1. 1、原创力文档(book118)网站文档一经付费(服务费),不意味着购买了该文档的版权,仅供个人/单位学习、研究之用,不得用于商业用途,未经授权,严禁复制、发行、汇编、翻译或者网络传播等,侵权必究。。
  2. 2、本站所有内容均由合作方或网友上传,本站不对文档的完整性、权威性及其观点立场正确性做任何保证或承诺!文档内容仅供研究参考,付费前请自行鉴别。如您付费,意味着您自己接受本站规则且自行承担风险,本站不退款、不进行额外附加服务;查看《如何避免下载的几个坑》。如果您已付费下载过本站文档,您可以点击 这里二次下载
  3. 3、如文档侵犯商业秘密、侵犯著作权、侵犯人身权等,请点击“版权申诉”(推荐),也可以打举报电话:400-050-0827(电话支持时间:9:00-18:30)。
  4. 4、该文档为VIP文档,如果想要下载,成为VIP会员后,下载免费。
  5. 5、成为VIP后,下载本文档将扣除1次下载权益。下载后,不支持退款、换文档。如有疑问请联系我们
  6. 6、成为VIP后,您将拥有八大权益,权益包括:VIP文档下载权益、阅读免打扰、文档格式转换、高级专利检索、专属身份标志、高级客服、多端互通、版权登记。
  7. 7、VIP文档为合作方或网友上传,每下载1次, 网站将根据用户上传文档的质量评分、类型等,对文档贡献者给予高额补贴、流量扶持。如果你也想贡献VIP文档。上传文档
查看更多
Chapter 4 Data Link Layer

Chapter 4 Data Link Layer;Services;Data Link Protocols;Framing (Chapter 5.4 in Leon-Garcia);Framing;Data to be sent;Bit Stuffing;0110111111111100;Example: Framing in Ethernet;Error Control Coding (Chapter 3.9 in Leon-Garcia);Error Control;Single Parity Check;Example;Probability of Error;Two-Dimensional Parity Check;1 0 0 1 0 0 0 0 0 1 0 1 1 0 0 1 0 0 1 0 0 0 1 0 1 0 0 1 1 1 ;Hamming Codes;m = 3 Hamming Code;Hamming (7,4) code;Parity Check Equations;0 0 1 0 0 0 0;Minimum distance;General Hamming Codes;Hamming Codes: Error-correction;Hamming Codes: Performance ;Other Error Control Codes;Internet Checksum;Polynomial Codes;Automatic Repeat Request (ARQ) (Chapter 5 in Leon-Garcia);;Service Models;Connection setup Message transfer Connection release Example: TCP, PPP;No setup Each message sent independently Must provide all address information per message Simple quick Example: UDP, IP;Purpose: To pass to the receiver every frame correctly, only once, in order. Bad things can happen: Error, arbitrary delay, out-of-order arrival, or loss. Aim at very high reliability. Assume if frames arrive, they arrive in-order for now. We save the out-of-order problem for later. Basic elements: Error-detecting code ACKs (positive acknowledgments) NAKs (negative acknowledgments) Timeout mechanism;Packet;In cases (a) (b) the transmitting station A acts the same way But in case (b) the receiving station B accepts frame 1 twice Question: How is the receiver to know the second frame is also frame 1? Need a sequence number: Slast=SN of most recent transmitted frame.;Sequence Numbers;Transmitter A;Transmitter A;S/W Efficiency;frame tf time;Efficiency on Error-free channel;Delay-Bandwidth Product;Average Transmission Number;Efficiency in Channel with Errors;Go-Back-N;Frame transmission are pipelined to keep the channel busy Frame with errors and subsequent out-of-sequence frames are ignored; A;Go-Back-N with Timeout;Receiver;Example: M = 22 = 4, Go-Back –

文档评论(0)

牛X文档 + 关注
实名认证
文档贡献者

该用户很懒,什么也没介绍

1亿VIP精品文档

相关文档