Non-uniform EWMA-PCA based cache size allocation scheme in Named Data Networks

As a data-centric cache-enabled architecture, Named Data Networking (NDN) is considered to be an appropriate alternative to the current host-centric IP-based Internet infrastructure. Leveraging in- network caching, name-based routing, and receiver-driven sessions, NDN can greatly enhance the way Internet resources are being used. A critical issue in NDN is the procedure of cache allocation and management. Our main contribution in this research is the analysis of memory requirements to allocate suitable Content-Store size to NDN routers, with respect to combined impacts of long-term centrality-based metric and Exponential Weighted Moving Average (EWMA) of short-term parameters such as users behaviours and outgoing traffic. To determine correlations in such large data sets, data mining methods can prove valuable to researchers. In this paper, we apply a data-fusion approach, namely Principal Component Analysis (PCA), to discover relations from short- and long-term parameters of the router. The output of PCA, exploited to mine out raw data sets, is used to allocate a proper cache size to the router. Evaluation results show an increase in the hit ratio of Content-Stores in sources, and NDN routers. Moreover, for the proposed cache size allocation scheme, the number of unsatisfied and pending Interests in NDN routers is smaller than the Degree-Centrality cache size scheme.     

针对层次化名字路由的聚合机制

为了从根本上解决现有互联网存在的可扩展性、移动性和安全性等方面的问题,全新的未来互联网体系结构得到了广泛研究.其中,命名数据网络（named data networking,简称NDN）利用网内缓存和多路转发实现了基于层次化名字的高效数据传输,从根本上解决了现有互联网所面临的问题.内容的层次化名字具有数量庞大、结构复杂等特点,现有的基于IP的路由转发机制无法直接应用于NDN网络,需要有针对性地研究高效的层次化名字路由机制,保证海量网络内容的正常路由转发.路由聚合是缩减网络路由规模的主要措施.不同于现有的面向本地NDN路由表查表过程的优化,路由聚合需要全网协同处理,在不同网络节点上不断对聚合路由进行聚合.这对聚合路由标识和聚合路由可用性评估提出了诸多要求.为此,研究并提出了针对层次化名字路由的聚合机制,包括两个方面的工作：（1）构建了一种全新的计数布隆过滤器——堆叠布隆过滤器,该过滤器支持多过滤器合并,用于压缩表示被聚合路由名字;（2）给出了一种动态路由聚合机制,在保证NDN网络路由转发准确性的同时,缩小全网路由规模,最大程度地优化了路由转发效率.在真实网络拓扑上构建了仿真平台,经过实验验证,该路由聚合机制以可控的少量冗余转发为代价,有效地压缩了全网路由规模,提升了全网路由转发效率,保证了海量在线内容的高效路由转发,为NDN网络投入实际部署提供了前提.     

Measurement and performance of a cognitive packet network

As the size of the Internet grows by orders of magnitude both in terms of users, number of IP addresses, and number of routers, and as the links we use (be they wired, optical or wireless) continuously evolve and provide varying reliability and quality of service, the IP based network architecture that we know so well will have to evolve and change. Both scalability and QoS have become key issues. We are currently conducting a research project that revisits the IP routing architecture issues and proposes new designs for routers. As part of this effort, this paper discusses a packet network architecture called a cognitive packet network (CPN), in which intelligent capabilities for routing and flow control are moved towards the packets, rather than being concentrated in the nodes. In this paper we outline the design of the CPN architecture, and discuss the quality-of-service based routing algorithm that we have designed and implemented. We then present our test-bed and report on extensive measurement experiments that we have conducted.     

Edge-limited scalable QoS flow set-up

Although the Differentiated Services architecture supports scalable packet forwarding based on aggregate flows, the detailed procedure of Quality of Service (QoS) flow set-up within this architecture has not been well established. In this paper we explore the possibility of a scalable QoS flow set-up using a sink-tree paradigm. The paradigm initially constructs a sink tree at each egress edge router using network topology and bandwidth information provided by a QoS extended version of Open Shortest Path First (OSPF), which is a widely used link-state routing protocol. Our sink-tree paradigm dynamically reallocates network bandwidths online according to traffic demands. As a consequence, our paradigm easily supports QoS routing, resource allocation, and admission control at ingress edge routers without consulting core routers in a way that the QoS flow set-up time and overhead are minimized. Simulation results are very encouraging in that the proposed methodology requires significantly less communication overhead in setting up QoS flows compared to the traditional per-flow signaling-based methodology while still maintaining high resource utilization.     

基于可变大小偏移量表的高速IP路由查找算法

由于因特网速度的不断提高、网络流量的不断增加和路由表规模的不断扩大,IP路由查找已经成为制约核心路由器性能的主要瓶颈。目前已有几种解决高速IP路由查找问题的算法,但均不能完全满足核心路由器的要求。本文提出了一种基于可变大小偏移量表的IP路由查找方法,它具有查找速率高、更新时间快、存储代价低、易于实现等特点,能
能满足10Gbps核心路由器环境的要求。     

基于RAM和TCAM存储结构的高速路由查找算法

由于因特网速度的不断提高,网络流量的不断增加和路由表规模的不断扩大,IP路由查找已经成为制约核心路由器性能的主要瓶颈。文章分析了两种常用的基于硬件存储器的路由查找算法,并结合它们各自优点,提出了一种基于RAM和TCAM存储结构的路由查找算法,该算法克服了上述两种算法的不足,具有查找速率高、更新时间快、存储代价低、易于实现等特点,是一种理想的适合于高速核心路由器环境的查找机制。     

Deadlock free routing algorithms for irregular mesh topology NoC systems with rectangular regions

The simplicity of regular mesh topology Network on Chip (NoC) architecture leads to reductions in design time and manufacturing cost. A weakness of the regular shaped architecture is its inability to efficiently support cores of different sizes. A proposed way in literature to deal with this is to utilize the region concept, which helps to accommodate cores larger than the tile size in mesh topology NoC architectures. Region concept offers many new opportunities for NoC design, as well as provides new design issues and challenges. One of the most important among these is the design of an efficient deadlock free routing algorithm. Available adaptive routing algorithms developed for regular mesh topology cannot ensure freedom from deadlocks. In this paper, we list and discuss many new design issues which need to be handled for designing NoC systems incorporating cores larger than the tile size. We also present and compare two deadlock free routing algorithms for mesh topology NoC with regions. The idea of the first algorithm is borrowed from the area of fault tolerant networks, where a network topology is rendered irregular due to faults in routers or links, and is adapted for the new context. We compare this with an algorithm designed using a methodology for design of application specific routing algorithms for communication networks. The application specific routing algorithm tries to maximize adaptivity by using static and dynamic communication requirements of the application. Our study shows that the application specific routing algorithm not only provides much higher adaptivity, but also superior performance as compared to the other algorithm in all traffic cases. But this higher performance for the second algorithm comes at a higher area cost for implementing network routers.     

Agent system for inter-AS routing error diagnosis

The basic unit of Internet routing is called an autonomous system, or AS, defined as a set of routers under a single technical administration. The Internet currently comprises more than 12,000 AS's. Some are university or corporate networks; others are ISP networks. Inside an AS, a single authority controls the deployment of policies and protocols by which routers compute intra-AS paths, including paths to gateway or border routers. For inter-AS routing, the situation is more complicated. Most AS's manage the exchange of routing information through the Internet Engineering Task Force's border gateway protocol. BGP lets an AS advertise "reachability" information throughout the Internet by sending update information when network topology or routing policies change. BGP is a hop-by-hop protocol, which sends the information only to a gateway router's immediate neighbors. At NTT Network Innovation Laboratories, we have developed and are currently testing a multiagent-based system called Encore to automatically diagnose inter-AS routing problems. We briefly describe the problem addressed by the system, its design and current implementation, and recent test results     

Reconfigurable Service Composition and Categorization for Power-Aware Mobile Computing

The requirement of agile adaptation to varying resource constraints in mobile systems motivates the use of a service-oriented architecture (SOA), which can support the composition of two or more services to form a complex service. In this paper, we propose SOA-based middleware to support QoS control of mobile applications and to configure an energy-efficient service composition graph. We categorize services into two layers:functionality-centric services, which are connected to create a complex service to meet the user's intentions, and resource-centric services, which undertake distributed functionality-centric services in a way that increases the success rate of service composition while reducing contention at specific service nodes. We also present a service routing algorithm to balance the resource consumption of service providers on a service-overlay network. Through simulation of power-aware service composition using a realistic model based on ns-2 and traced data, we demonstrate that our approach can help both the mobile devices and the servers in a service-overlay network to reduce energy consumption without an increase in response time.     

A MPLS/LDP Distributed Architecture for Next Generation Routers

One of the main concerns of network operators is that current routers are not scalable in order to meet future traffic requirements on the core Internet taking into account new applications. The next generation routers with petabit switching capacity are being built to serve higher demands. Their processing capability is enhanced by additional memory and computing resources on control and line cards with a very large number of high speed interfaces. However, the current routing software architecture is not able to fully exploit such an advanced hardware platform. This paper proposes a first distributed software architecture of MPLS/LDP targeting the next generation routers. We investigate the ability of offloading components of the current centralized architecture of MPLS/LDP on to line cards in order to share the load between the control and line cards. This allows the signaling to be achieved entirely at the line card level, hence, improving the robustness, scalability and resiliency of the system. Performance evaluation, considering the CPU utilization and the number of exchanged messages, is also presented.     

一种ICN中的启发式路由机制

互联网逐渐成为社会基础设施,现有TCP/IP体系结构面临诸多挑战,以信息中心网络(Information-Centric Networking,ICN)为代表的未来互联网成为研究热点。在基于名字路由的基础上,提出了一种面向ICN的启发式路由机制,即通过为满足回溯条件的兴趣包寻找其他可用接口再次进行转发来降低网络阻塞率,通过修改数据包沿途经过的路由器邻居节点的转发信息库(Forwarding Information Base,FIB)来实现对缓存的高效利用,以及通过引入"流行度"概念来提高内容存储库(Content Store,CS)的命中率。基于INTERNET2拓扑进行了仿真实现,结果表明该机制是可行和有效的。     

Transport-aware IP routers: a built-in protection mechanism to counter DDoS attacks

The lack-of service differentiation and resource isolation by current IP routers exposes their vulnerability to Distributed Denial of Service (DDoS) attacks (Garber, 2000), causing a serious threat to the availability of Internet services. Based on the concept of layer-4 service differentiation and resource isolation, where the transport-layer information is inferred from the IP headers and used for packet classification and resource management, we present a transport-aware IP (tIP) router architecture that provides fine-grained service differentiation and resource isolation among different classes of traffic aggregates. The tIP router architecture consists of a fine-grained Quality-of-Service (QoS) classifier and an adaptive weight-based resource manager. A two-stage packet-classification mechanism is devised to decouple the fine-grained QoS lookup from the usual routing lookup at core routers. The fine-grained service differentiation and resource isolation provided inside the tIP router is a powerful built-in protection mechanism to counter DDoS attacks, reducing the vulnerability of Internet to DDoS attacks. Moreover, the tIP architecture is stateless and compatible with the Differentiated Service (DiffServ) infrastructure. Thanks to its scalable QoS support for TCP control segments, the tIP router supports bidirectional differentiated services for TCP sessions.     

Shared memory multiprocessor architectures for software IP routers

We propose new shared memory multiprocessor architectures and evaluate their performance for future Internet protocol (IP) routers based on symmetric multiprocessor (SMP) and cache coherent nonuniform memory access (CC-NUMA) paradigms. We also propose a benchmark application suite, RouterBench, which consists of four categories of applications representing key functions on the time-critical path of packet processing in routers. An execution driven simulation environment is created to evaluate SMP and CC-NUMA router architectures using this RouterBench. The execution driven simulation can produce accurate cycle-level execution time prediction and reveal the impact of various architectural parameters on the performance of routers. We port the FUNET trace and its routing table for use in our experiments. We find that the CC-NUMA architecture provides an excellent scalability for design of high-performance IP routers. Results also show that the CC-NUMA architecture can sustain good lookup performance, even at a high frequency of route updates.     

Multiprocessing in multiprotocol routers

High-speed networks place strict requirements on the architecture of communication subsystems. One of the most significant problems in conventional subsystems is provision of high-speed protocol processing. The protocol processing problem is especially significant in the environment of multiprotocol routers where several routing protocols are supported. A multiprocessor architecture for high-speed processing in multiprotocol environments is presented and analyzed. It is shown that exploitation of vertical and horizontal parallelism in protocol stacks combined with parallelism in memory accesses and packet memory management significantly increases system performance. The presented architecture, used in realistic environments, meets the throughput requirements of high-speed network links offering throughput up to 100 Mbps.     

园区WiFi网下软定义移动通信的设计与实现

当前WiFi园区网络存在移动通信范围有限、主机地址配置受限等问题.软定义移动组网的已有研究大多集中于实现无线接入点的可编程性,其在实际部署中需要使用专用的接入点设施.以单跳有设施网络为研究目标,提出了一种园区WiFi网下软定义移动通信方案,为移动主机访问本地资源提供免配置接入和移动通信支持.其中,网络设施选择OpenFlow网络,普通接入点直接连接OpenFlow交换机.控制器负责分发包含接入位置的流表项,为移动主机提供基于名称的路由转发,并主动调整通信流的返回路径.目前已经完成系统原型开发,进行了移动通信实验,测量和分析了不同配置下的网络可用带宽和切换时延.实验结果表明,该组网模式可以实现主机的移动通信,主机网络配置和OpenFlow交换机性能对切换时延影响较小.     

主动层次多目通信路由模型

许多应用需要IP多目通信.在Internet大规模应用IP Multicast时,有效的路由是关键.这样的多目路由协议必须是有效的、可伸缩的和增量可配置的.但是传统的Internet路由对性能是不敏感的,不能平衡负载和处理拥塞.现有的大多数多目通信路由协议不仅负责数据转发,还负责路由树的构造,这给路由器带来了极大的复杂性,而且协议的配置是手动的、费时费钱的工作.该文提出一个主动层次式Multicast路由的体系结构,采用主动网络技术将多目通信路由协议的数据转发和控制机制分开,根据链路的状态信息用主动报文控     

Fast binary and multiway prefix searches for packet forwarding

Backbone routers with tens-of-gigabits-per-second links are indispensable communication devices to deploy on the Internet. The IP lookup operation is the most critical task that must be improved in routers. In this paper, we first present a systematic method to compare prefixes of different lengths. The list of prefixes can then be sorted and stored in a sequential array, which is contrary to the linked lists used in most of trie-based structures. Next, fast binary and multiway prefix searches assisted by auxiliary prefixes are proposed. We also developed a 32-bit representation to encode the prefixes of different lengths. For the large routing tables currently available on the Internet, the proposed multiway prefix search can achieve the worst-case number of memory accesses of three and four if the sizes of the CPU cache lines are 64 bytes and 32 bytes, respectively. The IPv4 simulation results show that the proposed prefix searches outperform the existing IP lookup schemes in terms of lookup times and memory consumption. The simulations using IPv6 routing tables also show the performance advantages of the proposed binary prefix searches. We also analyze the performance of the existing lookup schemes by concurrently considering the lookup speed, the update speed, and the memory consumption. Although the update speed of the proposed prefix search is worse than the dynamic routing table schemes with log(N) complexity for a table of N prefixes, our analysis shows that the overall performance of the proposed binary prefix search outperforms all the existing schemes.     

高性能路由器分组调度算法研究

Internet同时面临着两个问题:更快的交换路由结构和引入服务质量(QoS)保证.每个问题都可以独立解决.高性能路由器可以用输入缓冲的交叉开关(crossbar)代替共享内存来获得更快的速度;QoS能够通过分组公平排队算法PFQ(packet fair queuing)来得到.然而到目前为止,这两个问题的解决还是互斥的--所有的分组公平排队算法研究都需要路由器采用输出排队或者集中式共享内存.基于输入输出结合排队CIOQ(combined input output queuing)结构,设计和实现了一种分     

Visualizing Internet routing changes

Today's Internet provides a global data delivery service to millions of end users and routing protocols play a critical role in this service. It is important to be able to identify and diagnose any problems occurring in Internet routing. However, the Internet's sheer size makes this task difficult. One cannot easily extract out the most important or relevant routing information from the large amounts of data collected from multiple routers. To tackle this problem, we have developed Link-Rank, a tool to visualize Internet routing changes at the global scale. Link-Rank weighs links in a topological graph by the number of routes carried over each link and visually captures changes in link weights in the form of a topological graph with adjustable size. Using Link-Rank, network operators can easily observe important routing changes from massive amounts of routing data, discover otherwise unnoticed routing problems, understand the impact of topological events, and infer root causes of observed routing changes     

Persistent detection and recovery of state inconsistencies

Soft-state is a well established approach to designing robust network protocols and applications. However it is unclear how to apply soft-state approach to protocols that must maintain a large amount of state information in a scalable way. For example the Border Gateway Protocol (BGP) is used to maintain the global routing tables at core Internet routers, and the table size is typically above 180,000 entries and continues to grow over time. In this paper, we propose a novel approach, Persistent Detection and Recovery (PDR), to enable large-state protocols and applications to maintain state consistency using a soft-state approach. PDR uses state compression and receiver participation mechanisms to avoid per-state refresh overhead. We evaluate PDR’s effectiveness and scalability by applying its mechanisms to maintain the consistency of BGP routing tables between routers. Our results show that the proposed PDR mechanisms are effective and efficient in detecting and correcting route insertion, modification, and removal errors. Moreover, they eliminate the need for routers to exchange full routing tables after a session reset, thus enabling routers to recover quickly from transient session failures.