BGP路由服务平台(RSP)的设计

目前自治域间的路由协议-边界网关协议(BGP)存在许多问题:全互联结构无法适应大规模网络,路由反射可能带来协议振荡和路由环路。文章分析了这些问题并给出了支持域间流量工程的BGP路由服务平台的设计。     

域间路由系统脆弱性及其应对措施

域间路由系统是互联网的关键基础设施,然而它却面临着严重的安全挑战.本文分析了域间路由协议BGP(边界网关协议)存在的脆弱性,构建了域间路由系统攻击模型,阐述了域间路由系统中基于链路和基于路由器节点的攻击模式,并指出这些攻击可能造成的危害,接着讨论了目前正在应用和研究的一些安全对策,并对路由过滤机制和协议扩展两种对策进行了性能比较.     

基于BGP增强的流量调度技术

介绍了运营商流量调度领域的发展趋势,概括了运营商IP网络的主要流量调度需求,分析了现网基于BGP的流量调度技术存在的问题,提出了一种基于SDN的集中式流量调度方案.该方案对现有BGPFlowspec协议进行了增强,避免了逐个设备的路由策略配置,并可兼容传统BGP路由协议,为传统运营商提供了一种更为灵活的流量调度控制方法.     

BGP协议研究及应用

BGP协议是一种用于互联网自治域系统间的动态路由协议,其主要功能是在各自治域 系统之间交换网络可达性信息。BGP协议是一种路径向量协议,使用TCP作为传送协议,保证了数据 传输的可靠性。BGP协议支持无类型的区域间路由CIDR;支持丰富的策略配置包括路由聚合、路由过 滤;支持多播路由、VPN路由,BGP协议还支持QoS等参数扩展。主要介绍了BGP协议的原理、协议软 件的工作过程及在工程中的应用。     

基于路径标识的多路径域间路由的开发与实现

针对现有网络架构中路由扩展性方面的问题日益严重,目前提出一种基于路径标识的多路径域间路由方案,可提高域间路由可扩展性和可靠性,但该研究只停留在理论阶段。现对基于路径标识的多路径路由协议进行了开发与实现,针对域间路由协议BGP的控制层和基于Linux内核的转发层进行了具体模块的结构分析和开发,并进行了功能性测试。结果显示,开发系统可以实现路径标识路由和多路径路由的功能。     

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

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

浅析互联网域间路由安全监测技术

随着计算机与通信技术的快速发展与融合,互联网已经成为社会、商业、日常生活不可或缺的基础设施。基于BGP(边界网关协议)的域间路由系统是互联网的核心设施,是网络运营战略控制的关键,威胁着互联网的安全性、可靠性。域间路由系统有很多安全隐患,很容易受到恶意的攻击,如果不改善遇见路由系统的性能,会使互联网的应用中遇到很多问题。     

BGP4+协议研究与应用

边界网关协议(BGP)是当前互联网上应用最广泛的外部网关协议,用于在各自治域系统之间交换网络可达性信息。BGP4+在BGP版本4的基础上进行了扩展,使之携带的路由信息既能支持IPv4也能支持IPv6。介绍了BGP4+对BGP4协议的扩展、BGP4+软件的体系结构和工作过程。通过在IPv6网络环境中的应用,验证了BGP4+软件的邻居关系建立和路由重分发等功能。目前,BGP4+软件已经在基于VxWorks的路由交换机中实现。     

BGP实现网络流量负载分担

BGP是一种自治系统间的动态路由协议,广泛应用于各大电信运营商的核心IP网,它的基本功能是在自治系统间自动交换无环路的路由信息。目前,BGP不仅仅在国家网、省网中使用,许多大型城域网也使用BGP接入省网。众所周知,在自治系统网络内部,通过静态路由或者OSPF等IGP动态路由协议,只要路由器拥有等Metric的多条到达同一网段的路由,路由器就会对到达该网段的流量按照路由链路进行负载分担。在运行BGP的对等自治系统的网络中,如果边界路由器接收到多条到达同一目标网络的BGP路由,BGP最佳路径算法将会选出一条最佳路由,并仅用此路由来…     

用BGP实现因特网路由稳定的关键技术

边界网关协议(BGP)属外部网关协议，是高性能核心路由器上必须运行的一种路由协议，它主要应用于各主干网所在自治域系统之间的互联。为了使各互联网间的信息能相互通达，需要配置BGP的发布和接受路由策略。BGP的配置是目前高速计算机互联网中最复杂的部分，直接关系到全世界互联网的稳定运行，是使互联网络具有可扩展性和可持续发展性的基础。     

SDI: a multi-domain SDN mechanism for fine-grained inter-domain routing

Software-defined networking (SDN) scheme decouples network control plane and data plane, which can improve the flexibility of traffic management in networks. OpenFlow is a promising implementation instance of SDN scheme and has been applied to enterprise networks and data center networks in practice. However, it has less effort to spread SDN control scheme over the Internet to conquer the ossification of inter-domain routing. In this paper, we further innovate to the SDN inter-domain routing inspired by the OpenFlow protocol. We apply SDN flow-based routing control to inter-domain routing and propose a fine-granularity inter-domain routing mechanism, named SDI (Software Defined Inter-domain routing). It enables inter-domain routing to support the flexible routing policy by matching multiple fields of IP packet header. We also propose a method to reduce redundant flow entries for inter-domain settings. And, we implement a prototype and deploy it on a multi-domain testbed.     

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

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

Internet routing instability

This paper examines the network interdomain routing information exchanged between backbone service providers at the major US public Internet exchange points. Internet routing instability, or the rapid fluctuation of network reachability information, is an important problem currently facing the Internet engineering community. High levels of network instability can lead to packet loss, increased network latency and time to convergence. At the extreme, high levels of routing instability have led to the loss of internal connectivity in wide-area, national networks. We describe several unexpected trends in routing instability, and examine a number of anomalies and pathologies observed in the exchange of inter-domain routing information. The analysis in this paper is based on data collected from border gateway protocol (BGP) routing messages generated by border routers at five of the Internet core's public exchange points during a nine month period. We show that the volume of these routing updates is several orders of magnitude more than expected and that the majority of this routing information is redundant, or pathological. Furthermore, our analysis reveals several unexpected trends and ill-behaved systematic properties in Internet routing. We finally posit a number of explanations for these anomalies and evaluate their potential impact on the Internet infrastructure     

Research on scheduling method based on traffic matrix for IoT security

With the increasing number of sensors in the Internet of Things (IoT), network nodes are prone to load imbalance, which seriously affects the reliability and scalability of the IoT. In this paper, a method of load balancing is proposed to reduce the pressure of switches in IoT and improve the efficiency of switch. The method is based on software defined network (SDN) technology using dynamic traffic scheduling of server cluster (DTSSC) model. It obtains the traffic and load matrices for each server and achieves load balancing on each of them. This method has high efficiency and low overhead and is easy to deploy. The validity of this method is verified through experiments; ie, the load ratio of each server is balanced.     

Impact of Hot-Potato Routing Changes in IP Networks

Despite the architectural separation between intradomain and interdomain routing in the Internet, intradomain protocols do influence the path-selection process in the Border Gateway Protocol (BGP). When choosing between multiple equally-good BGP routes, a router selects the one with the closest egress point, based on the intradomain path cost. Under such hot-potato routing, an intradomain event can trigger BGP routing changes. To characterize the influence of hot-potato routing, we propose a technique for associating BGP routing changes with events visible in the intradomain protocol, and apply our algorithm to a tier-1 ISP backbone network. We show that (i) BGP updates can lag 60 seconds or more behind the intradomain event; (ii) the number of BGP path changes triggered by hot-potato routing has a nearly uniform distribution across destination prefixes; and (iii) the fraction of BGP messages triggered by intradomain changes varies significantly across time and router locations. We show that hot-potato routing changes lead to longer delays in forwarding-plane convergence, shifts in the flow of traffic to neighboring domains, extra externally-visible BGP update messages, and inaccuracies in Internet performance measurements.      

Domain load balancing routing for multi-gateway wireless mesh networks

As Wireless Mesh Networks (WMNs) are typically used for Internet access, most traffic is routed through the gateways which connect WMN to the wired network. As a result, the gateways tend to get congested and balancing of the traffic load of gateways is critical. In this paper, we consider applications that require continuous provision of a certain bandwidth to a server located at the wired network. If a path that satisfies the bandwidth request cannot be found, the request will be rejected, so that load imbalance will result underutilization of the network capacity. We present a novel load balancing routing algorithm for maximizing the network utilization (i.e., accommodating service requests as many as possible) for multi-gateway WMNs. In the proposed scheme, a WMN is divided into domains. Each domain is served by one gateway, so that all traffic of a domain is served by the corresponding gateway. Our scheme determines routing to balance the traffic load among domains, and then performs load balancing routing within each domain. Simulation results show that in square grid topologies, our intra-domain routing achieves near optimal performance with about 70% less overhead than the existing schemes. Our inter-domain load balancing scheme outperforms the existing heuristics by up to 25% while achieving about 80% performance of the optimal solution.     

基于软件定义网络的服务器集群负载均衡技术研究

在当前的网络体系结构下,采用硬件系统实现服务器集群负载均衡存在着获取负载节点状态困难、流量导向方式复杂等制约因素,不利于提升服务器集群的伸缩性和服务性能。针对此问题,该文提出一种基于软件定义网络(SDN)的负载均衡机制(SDNLB)。该机制借助SDN具有的集中式控制和流量灵活调度优势,利用SNMP协议和OpenFlow协议对服务器的运行状态和全局网络负载信息进行实时监测,并通过权值计算的方式选择出权重最高的服务器作为流处理的目标服务器,在此基础上,采用最优转发路径算法进行流量调度,从而达到提高服务器集群的利用率与处理性能的目的。搭建了实验平台对SDNLB的性能进行仿真测试,实验结果表明:在相同的网络负载条件下,SDNLB与其他负载均衡算法相比,能够有效地降低服务器集群的负载,并能够显著提高网络吞吐量和带宽利用率,缩短流的完成时间和平均时延。     

Data center traffic scheduling strategy based on Fibonacci tree optimization algorithm

To improve traffic scheduling capabilities in network provider data centers,both network structure and network traffic flow were considered at the same time.The analysis prediction and online scheduling mechanism was proposed in data center based on software defined networking (SDN).Aiming at the multi-dimensional,multi-constrained and multi-modal problems of traffic flow scheduling in data centers,the traffic flow scheduling strategy based on Fibonacci tree optimization (FTO) algorithm was proposed.FTO algorithm was embedded into two stages of analysis prediction and online scheduling,took it advantage of global local alternating and multi-model optimization characteristics,the optimal solution and suboptimal solutions of traffic scheduling had been got at one time.The emulator result shows that,the FTO traffic scheduling strategy can schedule traffic in data centers reasonably,which improves the load balancing capability of network providers' data centers effectively.