资源公钥基础设施RPKI:现状与问题

BGP(border gateway protocol,边界网关协议)在设计之初并没有充分考虑安全问题,随着互联网规模的日益壮大,其安全风险也暴露得愈加明显。学术界和工业界提出了诸多方案解决域间路由面临的安全问题,目前真正得以部署的是IETF(the Internet Engineering Task Force,互联网工程任务组)推动的资源公钥基础设施(resource public key infrastructure,RPKI)。综述了RPKI的技术现状和研究进展,重点分析了RPKI存在的问题、现有的解决方案以及不足之处,介绍了RPKI功能扩展的相关研究,最后指出了未来有潜力的研究方向。     

无线传感器网络的发展与路由需求

无线传感器网络是满足恶劣条件和特殊需求的重要网络技术，随着网络的发展，他已经成为学术界和工业界的热门研究领域。本文探讨了无线传感器网络的多应用化和异构性的发展方向，并在此基础上分析了现有路由技术的不足，提出了发展异构无线传感器网络对路由技术的需求。     

互联网路由可扩展问题探讨

随着Internet网络的迅猛发展,传统互联网架构面临着严峻挑战,尤其是路由可扩展问题。本文阐述了互联网路由可扩展问题的背景,分析了导致路由系统可扩展性问题的内在原因和外部原因,在此基础上讨论了设计新型网络架构时所需要满足的要求,并对目前主要的技术策略及思路,以及几个重要解决方案进行了分析与对比。     

无线Ad Hoc网络中的QoS路由协议

无线Ad Hoc网络的应用环境以及与Internet的互连都要求其必须提供一定的服务质量(QoS)保证,QoS路由技术是在无线Ad Hoc网络中实现QoS的重要方法。本文对近年来国内外在无线Ad Hoc网络中的QoS路由技术方面取得的研究成果进行了全面的概括总结和分类,对资源预留路由、多径路由和跨层优化路由3类QoS路由协议进行比较分析,并且提出了QoS路由技术亟待解决的问题和今后的发展方向。     

可扩展路由机制的研究

由于边缘网络多宿主和流量工程等需求的增长,近来LAB(Internet Architecture Board)指出当前Internet路由系统面临严峻的可扩展问题.可扩展问题反映了当前Internet路由架构存在根本的缺陷,即主机身份标识和路由位置标识使用同一个标识空间.本文阐述了当前的路由现状和造成路由膨胀的主要因素,然后重点分析了当前的各种解决方案.在对各种方案进行分类之后,本文总结了Map/Encaps方案存在的优势以及指出了它所面临的挑战,这为新的路由架构的研究提供了参考.     

大型IP互联网设计及路由协议

在IP互联网络的设计中路由协议的选择十分重要,文章就选择和使用路由协议时必须考虑的关键问题——网络拓扑、编址与路由汇集、路由选择、收敛、网络扩展性及安全性等问题进行讨论;并重点介绍较常用的EIGRP和OSPF路由协议的特点。     

互联网BGP路由可视及安全检测技术架构与实践

边界网关协议（border gateway protocol,BGP）是支撑互联网50年来快速发展的核心协议,因早期设计考虑不足一直存在路由劫持、路由泄露等路由安全威胁漏洞。随着互联网应用日益深入,BGP 路由安全问题逐渐引起业界重视,边界网络安全防护意义重大。提出了一种BGP路由安全检测架构,通过推理构建全球BGP路由知识库实现互联网全局路由可视性,并基于此实现路由劫持、路由泄露等路由安全事件的准实时检测。通过在杭州交换中心部署实践,证明本系统可构造较完整的互联网全局路由知识库、实现较准确和实时的BGP路由安全事件检测。     

互联网BGP路由收敛问题研究现状的分析

文章重点分析了互联网边界网关协议(BGP)路由收敛问题,叙述了当前国际上对这个问题的几种解决方案,并指出了这几种解决方案所存在的问题.作者提出了自己的观点:BGP路由收敛问题与各路由器有不同的路由策略;各路由器BGP的数据更新时延不同;各链路连接失败和恢复的次序不同;路由更新消息的粒度与多方因素有关,应该找出一种综合的解决方法.     

一体化IP路由器测试解决方案

在Internet环境下 ,动态路由和转发的评估解决方案gilent的 IP路由性能成为可能的第一个测试系统。此外 ,它是工业界组合 IP流量和路由协议测试为一个单独方案的唯一测试系统。现在 ,可以进行比以往更加深入的测试。用测试系统评估多端口包转发性能。系统可提供 6 4个能产生和分析路由及数据流量的端口。图形用户界面的使用简化了多端口路由表配置和性能测量设置。测试系统自动产生包括路由表的一段 IP地址 ,进一步减少测试设置时间一体化IP路由器测试解决方案     

中国IP路由领域首篇RFC标准发布

华为近日宣布，华为和国内运营商共同署名的两篇互联网基础路由领域RFc（Request For Comments）标准，近期已被ETF（Internet Engineering Task Force）标准组织作为最高级别的推荐性标准发布，这是中国在IP路由领域发布的首篇RFC标准，标志着中国的基础路由技术在全球范围内获得了重大认可。     

SAT based solutions for detailed routing of island style FPGA architectures

Detailed routing solutions for island style FPGA architectures using Boolean satisfiability (SAT) based formulations have been proposed in this paper. Due to decreasing size of ICs and hence, the increasing complexity of the routing resource constraints, routing has been a big challenge in electronic design automation field. Our proposed techniques work on multi-pin net routing where all nets are considered for routing in their intact form whereas, most of the existing routing solutions decompose multi-pin nets into two-pin nets for detailed routing to ease the problem. However this approach, apart from increasing the number of nets in the circuits, may also introduce pin doglegging which, when not permitted by the architecture of FPGA, would require extra constraints to eliminate. Many detailed routers adopt sequential detailed routing approaches which are vulnerable to the net ordering problem which may cause a routable circuit to be erroneously classified as unroutable. Our proposed techniques avoid these pitfalls by keeping the multi-pin nets intact and solve all nets simultaneously using SAT. The SAT-based multi-pin net dogleg-free formulations presented here achieve significant improvement over existing SAT-based solutions with respect to the number of variables and clauses used, thereby achieving greater scalability and also display comparable and sometimes better routability results on benchmark circuits when compared with other detailed routing solutions. Detailed routing is also significantly affected by the architecture of the switching blocks. This paper proposes SAT-based formulation for three different switch box architectures i.e. Subset, Wilton, and Universal switches. Our experiments clearly demonstrate how routing solutions for a circuit can differ significantly for different types of switch boxes.     

移动自组织网络中可扩展的定位符/标识符分离路由协议

In the traditional Internet Protocol (IP) architecture, there is an overload of IP semantic problems. Existing solutions focused mainly on the infrastructure for the fixed network, and there is a lack of support for Mobile Ad Hoc Networks (MANETs). To improve scalability. A routing protocol for MANETs is presented based on a locator named Tree-structure Locator Distance Vector (TLDV). The hard core of this routing method is the identifier/locator split by the Distributed Hash Table (DHT ) method, which provides a scalable routing service. The node locator indicates its relative location in the network and should be updated whenever topology changes . Locator space is organized as a tree-structure, and the basic routing operation of the TLDV protocol is presented. TLDV protocol is compared to some classical routing protocols for MANETs on the NS2 platform. Results show that TLDV has better scalability.     

IER： ID-ELOC-RLOC BASED ARCHITECTURE FOR NEXT GENERATION INTERNET

The scalability and mobility issues in current Internet architecture have drawn a lot of attentions from researchers. However, there are still many problems in current solutions. In this paper, we argue that three spaces, i.e., endpoint IDentifier （ID）, Endpoint Locator （ELoc） and Routing Locator （RLoc）, are necessary to realize two separations, i.e., separating identifier from locator and separating edge networks from the transit core. Following this argument, we design ID-ELoc-RLoc based architecture, i.e., IER, a separation approach to solve both mobility and scalability issues. After separating identifier from locator, mobile endpoints can ensure continuity of communications across IP address changes since their IDs do not change during moving. After separating edge networks from the transit core, the size and dynamics of global routing table would not be affected by traffic engineering, multi-homing, etc. in edge networks. In this paper, we introduce the definitions, framework, and implementation considerations of our IER architecture in details.     

复杂网络与可扩展路由

互联网规模扩大,相应路由表大小呈指数增加,形成下一代互联网可扩展路由“瓶颈”。基于复杂网络和可扩展路由的相关理论与主要策略,文章对相关研究成果。如小世界效应所表现出来的特性、小世界和无标度网络模型,网格、层次及隐藏度量等3种可扩展路由网络模型,随机游走、贪婪、最大度、优先、本地介数、距离与度及相似性与度混合等多种路由策略等进行了分析与归纳。这些研究结果和方法为因互联网规模不断扩大所带来的路由系统可扩展性问题提供解决方案     

可信路由机理及关键技术

文章认为由于网络规模的增大以及节点移动、多宿主、网络流量工程等需求的不断增强,使得路由可扩展性、安全性、可靠性等问题凸显。尽管与可信路由相对应的理论技术方案不断提出,但未能从根本上解决网络路由的可信任问题。为此文章提出可信路由体系结构模型、可信域内路由、可信域间路由等新网络环境下的可信路由参考机制,并对可信路由涉及的关键技术,如映射可扩展技术、路由信任机制、多径路由技术、服务质量保证、路由监测管理技术,进行了研究和探讨。     

Overlay networking： applications and research challenges

Overlay networking is one of the perspective solutions to today‘s Internet challenges. At basic service level, overlay networks can serve as a supplement and enhancement of existing services, such as routing and addressing. At high application level, overlay networks can be used for applications, which are difficult to deploy in existing IP architecture with some specific reasons, e.g., they need high-level information, which is hard to obtain by underlying layers. To address the heterogeneity of today‘s Internet, overlay networks provide ways to service availability and desirable performance while retaining scalability. In contrast to changing the existing network layer, overlay networks allow bootstrapping, which is most important in the development of Internet infrastructure. Various applications of overlay networking are clarified in this paper. Research challenges including routing and searching in overlay networking are also identified.     

Robust and flexible Internet connectivity for mobile ad hoc networks

An important challenge for the wider adoption of mobile ad hoc network (MANET) technologies is finding ways to efficiently interconnect them with the Internet. However, such interconnections prove difficult due to differences in mobility, addressing and routing between MANETs and existing IP networks.In this paper, we review the existing solutions to interconnect MANETs with the Internet, but find them lacking in robustness and flexibility. For instance, many solutions do not consider the presence of multiple gateways, and in such scenarios they either fail, or are less efficient due to the lack of multi-homing capabilities.A key insight of ours is that the reason for routing failure is usually an interconnection scheme’s inability to express indirection (i.e., a way to enforce routing through a certain gateway on the path toward a destination in the Internet). Another problem concerns state replication where a route update fails to replicate all the routing state needed to forward packets to an Internet gateway.We analyze the above problems and suggest a solution that provides robust and flexible Internet connectivity. With minor adaptions our solution works for any MANET routing protocol, and has support for multiple gateways and multi-homing. Simulations show that, when used in combination with AODV routing, our solution provides up to 20% delivery ratio improvement over one of the main alternatives. A prototype implementation illustrates the feasibility of our solution in the real world.     

对新型网络路由机制的思考

路由是网络的结构基石,新型网络路由机制是构建新型网络体系的必需。目前网际层的路由本质上是所谓的"单下一跳路由"机制,解决网络传输拥塞问题的一个根本措施在于改变当前网络单下一跳的选路模式,允许多条路径的并行传输。边界网关协议(BGP)是目前Internet唯一采用的域间路由协议,针对当前域间路由系统面临的规模可扩展性问题,文章提出了一个规模可扩展的新型分层域间路由架构(s-idra)。除了可扩展性以外,路由体系还面临其他挑战,比如安全性、服务质量(QoS)、组播、移动、动态网络拓扑等等。路由协议尤其是未来新型信息网络体系结构的路由协议的研究任重而道远。     

Powering Internet with power-law networking

It is generally recognized that the current routing scheme of Internet suffers from serious scalability problems. In this paper, we work with the abstract but ??Internet-like?? network model consisting of an infinite-variance power-law random graph (IVPLRG). We adopt the idea of a routing scheme proposed by Carmi, Cohen and Dolev (C-C-D). The scheme fits very naturally to the spontaneously emerging ??soft hierarchy?? architecture on an IVPLRG. The use of multiple addresses is suggested as a solution to the inflexibility of the pure C-C-D scheme. A mean-field approximation is introduced for efficient computation of relevant quantitative characteristics and applied to various problems of our scheme. We review a few recent Internet routing proposals and discuss their relation to our scheme. We find out that the topology creation of our scheme offers advantages in terms of scalability and routing policy control.