Ad Hoc网络正成为无线网络研究的一个热点,其中路由算法是影响移动自组织网络性能的关键问题。目前关于路由协议的绝大多数研究都是对算法的仿真,缺乏基于系统观点考虑现今Ad Hoc网络的协议设计问题。提出一种适合任何操作系统的体系结...Ad Hoc网络正成为无线网络研究的一个热点,其中路由算法是影响移动自组织网络性能的关键问题。目前关于路由协议的绝大多数研究都是对算法的仿真,缺乏基于系统观点考虑现今Ad Hoc网络的协议设计问题。提出一种适合任何操作系统的体系结构和通用API来增强当前的路由体系结构,以此为基础给出了一种不修改操作系统内核实现基于全互连立方体(FCCN)虚拟拓扑的Ad hoc 路由算法的具体方案。展开更多
The scalability of routing architectures for large networks is one of the biggest challenges that the Internet faces today.Greedy routing,in which each node is assigned a locator used as a distance metric,recently rec...The scalability of routing architectures for large networks is one of the biggest challenges that the Internet faces today.Greedy routing,in which each node is assigned a locator used as a distance metric,recently received increased attention from researchers and is considered as a potential solution for scalable routing.In this paper,LMD—a local minimum driven method is proposed to compute the topology-based locator.To eliminate the negative effect of the " quasi" greedy property—transfer routes longer than the shortest routes,a two-stage routing strategy is introduced,which combines the greedy routing with source routing.The greedy routing path discovered and compressed in the first stage is then used by the following source-routing stage.Through extensive evaluations,based on synthetic topologies as well as on a snapshot of the real Internet AS(autonomous system)topology,it is shown that LMD guarantees 100%delivery rate on large networks with low stretch.展开更多
文摘Ad Hoc网络正成为无线网络研究的一个热点,其中路由算法是影响移动自组织网络性能的关键问题。目前关于路由协议的绝大多数研究都是对算法的仿真,缺乏基于系统观点考虑现今Ad Hoc网络的协议设计问题。提出一种适合任何操作系统的体系结构和通用API来增强当前的路由体系结构,以此为基础给出了一种不修改操作系统内核实现基于全互连立方体(FCCN)虚拟拓扑的Ad hoc 路由算法的具体方案。
基金Supported by the National High Technology Research and Development Program of China(No.2013AA013501)the National Program on Key Basic Research Project(No.2012CB315801)+1 种基金the National Natural Science Foundation of China(No.61133015)the Science and Technology on Information Transmission and Dissemination in Communication Networks Laboratory,CETC54
文摘The scalability of routing architectures for large networks is one of the biggest challenges that the Internet faces today.Greedy routing,in which each node is assigned a locator used as a distance metric,recently received increased attention from researchers and is considered as a potential solution for scalable routing.In this paper,LMD—a local minimum driven method is proposed to compute the topology-based locator.To eliminate the negative effect of the " quasi" greedy property—transfer routes longer than the shortest routes,a two-stage routing strategy is introduced,which combines the greedy routing with source routing.The greedy routing path discovered and compressed in the first stage is then used by the following source-routing stage.Through extensive evaluations,based on synthetic topologies as well as on a snapshot of the real Internet AS(autonomous system)topology,it is shown that LMD guarantees 100%delivery rate on large networks with low stretch.
