Chapter 12 - William Stallings, Data and Computer.pptVIP

Chapter 12 - William Stallings, Data and Computer.ppt

  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 12 - William Stallings, Data and Computer.ppt

Data and Computer Communications Eighth Edition by William Stallings Lecture slides by Lawrie Brown Routing in Switched Networks I tell you, went on Syme with passion, that every time a train comes in I feel that it has broken past batteries of besiegers, and that man has won a battle against chaos. You say contemptuously that when one has left Sloane Square one must come to Victoria. I say that one might do a thousand things instead, and that whenever I really come there I have the sense of hairbreadth escape. And when I hear the guard shout out the word Victoria, it is not an unmeaning word. It is to me the cry of a herald announcing conquest. It is to me indeed Victoria; it is the victory of Adam. —The Man Who Was Thursday, G.K. Chesterton Routing in Packet Switched Network key design issue for (packet) switched networks select route across network between end nodes characteristics required: correctness simplicity robustness stability fairness optimality efficiency Performance Criteria used for selection of route simplest is “minimum hop” can be generalized as “least cost” Example Packet Switched Network Decision Time and Place time packet or virtual circuit basis fixed or dynamically changing place distributed - made by each node centralized source Network Information Source and Update Timing routing decisions usually based on knowledge of network (not always) distributed routing using local knowledge, info from adjacent nodes, info from all nodes on a potential route central routing collect info from all nodes issue of update timing when is network info held by nodes updated fixed - never updated adaptive - regular updates Routing Strategies - Fixed Routing use a single permanent route for each source to destination pair determined using a least cost algorithm route is fixed at least until a change in network topology hence cannot respond to traffic changes advantage is simplicity disadvantage is lack of flexibility Fixed Routing Tables Routing Strategie

文档评论(0)

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

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

1亿VIP精品文档

相关文档