版权说明:本文档由用户提供并上传,收益归属内容提供方,若内容存在侵权,请进行举报或认领
文档简介
1、Ch5: Routing in Data Networks10/1/20221Shortest Path Routing ReviewThe Bellman-Ford & Dijkstras algorithm10/1/20222The Floyd-Warshall algorithmFind the shortest paths between all pairs of nodes togetherProcedureStart with single arc distancesCalculate shortest path only node 1 used as intermediate n
2、odeOnly node 1 and node 2Example10/1/20223SummaryThe Bellman-Ford algorithm iterates on the number of arcs in a pathThe Dijkstra algorithm iterates on the length of the pathThe Floyd-Warshall algorithm iterates on the set of nodes that are allowed as intermediate nodes on the paths.10/1/20224View ro
3、uting as a “global” optimization problem Assumptions: The cost of using a link is a function of the flow on that link The total network cost is the sum of the link costs The required traffic rate between each source-destination pair is known in advance Traffic between source-destination pair can be
4、split along multiple paths with infinite precision Find the paths (and associated traffic flows) along which to route all of the traffic such that the total cost is minimized Optimal Routing10/1/2022Formulation of optimal routingLet Dij (Fij) be the cost function for using link (i,j) with flow Fij F
5、ij is the total traffic flow along link (i,j) Let D(F) be the total cost for the network with flow vector F The total cost:For S-D pair w with total rate rw Pw is the set of paths between S and D Xp is the rate sent along path p Pw 10/1/20226Formulation continuedOptimal routing problem can now be wr
6、itten as: 10/1/20227Optimal model limitationThe choice of the cost functionhypothesis: without paying attention to other aspects of the traffic statistics undesirable behavior associated with high variance and with correlations of packet inter arrival times and transmission times. 10/1/20228Topologi
7、cal design problemOverviewAssumptionsA collection of terminals with geographical locationsInput traffic flow from each terminal to othersDesignThe topology of a communication subnet to service the traffic demands of the terminalsThe local access network of terminalsObjectiveDelay constraintsGuarante
8、e the reliability Minimize cost10/1/20229Design and optimizationThe problem is divided into two parts Subnet design problemLAN design problem10/1/202210Subnet Design ProblemGiven location of subnet nodes and traffic flow for these nodesSelect the capacity and flow of each linkMeet the delay and reli
9、ability constraintsMinimizing costsA difficult combinatorial problem!Simple versionchoose the link capacities so as to minimize a linear cost. Capacity assignment problem10/1/202211Capacity assignment problemMinimize the linear costAccording M/M/1 model, the delay constraint r is the total arrival r
10、ate into the network The optimal value 10/1/202212Substitute the capability in cost function, the optimal cost is expressed as Consider optimizing the network cost with respect to both Cij and Fij Local minimaDifficult to minimizeHeuristic methods10/1/202213Capacity assignment problemHeuristic metho
11、ds for capacity assignmentSuppose there is a current best topology and a trial topologyBest means it satisfies the delay and reliability constraints and meanwhile has the lowest cost that has been foundDecide whether uses trial topo to replace current best topo10/1/202214Generate new trial TopoPossi
12、bilitiesLower the capacity (or delete) of underutilized linkIncrease the capacity of overutilized linkBranch exchange heuristicA combination of these possibilitiesone link is deleted and another link is addedsaturated cut method10/1/202215Network reliability issuesReliability requirementThe network
13、is k-connected.K-connectedK-connected between two nodesTwo nodes are connected by deleting (k-1) nodesA graph is k-connected if every pair of nodes are k-connected. 10/1/202216Network reliability issuesCheck k-connectivityCheck each pair of nodes is too slowMore efficient method is expectedKleitman
14、method1) Choose an arbitrary node and check it k-connectivity to others2) Delete the checked node and its arcs, and check another nodes (k-1)-connectivity3) Continue untilthe last second node is checked to be 1-connected, orStop at some (k-i)-connectivity of some node10/1/202217Local Access Network
15、DesignConcentrator location problemConnect the n sources to m concentratorsThe cost functionConsider the variables xij where Total cost10/1/202218AssumptionsOne source is connected to one concentrator a maximum number of sources that can be handled by concentrator j.The problem can be converted to a linear transportation problem. 10/1/202219Optimization
温馨提示
- 1. 本站所有资源如无特殊说明,都需要本地电脑安装OFFICE2007和PDF阅读器。图纸软件为CAD,CAXA,PROE,UG,SolidWorks等.压缩文件请下载最新的WinRAR软件解压。
- 2. 本站的文档不包含任何第三方提供的附件图纸等,如果需要附件,请联系上传者。文件的所有权益归上传用户所有。
- 3. 本站RAR压缩包中若带图纸,网页内容里面会有图纸预览,若没有图纸预览就没有图纸。
- 4. 未经权益所有人同意不得将文件中的内容挪作商业或盈利用途。
- 5. 人人文库网仅提供信息存储空间,仅对用户上传内容的表现方式做保护处理,对用户上传分享的文档内容本身不做任何修改或编辑,并不能对任何下载内容负责。
- 6. 下载文件中如有侵权或不适当内容,请与我们联系,我们立即纠正。
- 7. 本站不保证下载资源的准确性、安全性和完整性, 同时也不承担用户因使用这些下载资源对自己和他人造成任何形式的伤害或损失。
最新文档
- 2024大连市商品混凝土购买合同范本
- 2024年摩托车零部件及配件合作协议书
- 2024年航空用玻璃系列项目合作计划书
- 2024复印机租赁合同范本
- 2024年CO自动监测仪项目发展计划
- 雨季及大风天气施工方案
- 2024年垃圾焚烧发电设备项目发展计划
- 2024年人造纤维(纤维素纤维)项目建议书
- 山东省菏泽市成武县实验小学2024年六上数学期末质量检测模拟试题含解析
- 塑料 甲基丙烯酸甲酯-丙烯腈-丁二烯-苯乙烯(MABS) 模塑和挤出材料 第1部分:命名系统和分类基础 征求意见稿
- 社情民意信息提案范文10篇17
- 土壤分析技术规范(第二版)
- 监狱企业生产管理系统建设思考(全文)
- 电子商务专业及专业群建设实施计划方案
- 安全用电知识培训PPT通用通用课件
- Q∕GDW 12178-2021 三相智能物联电能表技术规范
- 生物显微技术染色和组织化学课件
- 小学五年级上册劳动教案课程最新
- 小猪唏哩呼噜阅读指导(课堂PPT)
- 手拉葫芦安全作业培训课件
- 3l_看听学11-12
评论
0/150
提交评论