On the Placement of Internet TAPs in Wireless 无线网络中的无线上网的位置.pptVIP

下载本文档

1
0
约6.87千字
约 29页
2017-03-08 发布于上海
举报
版权申诉

On the Placement of Internet TAPs in Wireless 无线网络中的无线上网的位置.ppt

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

On the Placement of Internet TAPs in Wireless 无线网络中的无线上网的位置

Placement of Integration Pointsin Multi-hop Community Networks Ranveer Chandra (Cornell University) Lili Qiu, Kamal Jain and Mohammad Mahdian (Microsoft Research) Motivation Community networks (Houses cooperate in multi-hop network for Internet access) Related Work Placement of server replicas, proxies Web servers, internet measurement, file servers Facility location problem Handles locality without link capacity constraints Does not consider impact of wireless interference Clustering Approach (Bejerano ’02) Only works for a TDMA MAC Our Contributions We propose placement algorithms that: Are close to optimal Work with a general MAC Take wireless interference into account Are optimized for changing workload Provide fault tolerance to ITAP and link failures Outline Motivation and Related Work Problem Formulation Three link models with increasing realism Placement Algorithms Advanced Features Mapping to a Graph Nodes: houses and possible ITAP locations Edges determined by either: A connectivity graph given by Internet provider Supplied signal and propagation characteristics Simplified wireless connectivity model ? edge (i, j) if and only if distance (i, j) ? CR, where CR is the communication range Reducing Search Space Problem Formulation Given: A community with N houses House demand: dh ?h Link capacity : Cape ?e House capacity: Caph ?h ITAP capacity : Capi ?i Simple Interference Models Ideal link model: Throughput unaffected by path length (# hops) Possible by using smart antennas, multiple radios Simple Interference Models Ideal link model: Throughput unaffected by path length (# hops) Possible by using smart antennas, multiple radios Simple Interference Models Ideal link model: Throughput unaffected by path length (# hops) Possible by using smart antennas, multiple radios Outline Motivation and Related Work Problem Formulation Placement Algorithms Placement algorithms: Ideal Link Model Placement algorithms: General Link Model Advanced Features