Research of novel complex optical network routing architecture

This article puts forward a novel routing architecture for complex optical network,which core component is path calculation element(PCE).As is well known,the PCE-based distributed path computation structure is making the routing control and computation loosely coupled from traditional control plane.In the study,the resource allocation and routing algorithm are the critical part of PCE hierarchy.To compare the performance of new architecture and the traditional one,the user uses the flooding suppression,routing delay,resource utilization and traffic blocking probability as performance simulation parameters and taking the verification simulation on objective modular network testbed(OMNeT)platform against to source-node routing architecture.The numerical analysis,computer simulation and experiment work indicate that the operation of PCE-based routing architecture can reduce the flooding information of path calculation request as well as the routing hops significantly and improve the quality of service(QoS)by decreasing the blocking probability when failure happened.     

Link Stability-Based Clustering and Routing in Ad-Hoc Wireless Networks Using Fuzzy Set Theory

An ad-hoc wireless network has multihop architecture and is more mobile than single-hop network architecture in the real world. But the ad-hoc wireless network has some challenge with respect to mobility, real-time communication, routing path, maintenance, spatial reuse, bandwidth management, and packets broadcast overhead. This paper investigates two important issues to ensure more stable path routing and less re-clustering to improve the system performance. Novel Linked Stability-Based Clustering (LSC) and Linked Stability-Based Routing (LSR) algorithms, using fuzzy set theory, are proposed. The LSC algorithm guarantees the stability of the cluster to reduce the probability of re-clustering because the cluster-head is not easily replaced. The LSC algorithm proposed in this paper reduces the easy re-clustering problem of the HCC algorithm by considering not only connectivity but also the link's signal strength between the mobile nodes obtained from a fuzzy set in cluster-head determination. The membership function of the LSC algorithm, based on the link's signal strength, predicts a more stable link routing path using fuzzy set theory. Simulation results show that the proposed algorithm ensures the stability of the cluster and avoids unnecessary re-clustering; for example, the LSC algorithm occurs less frequently than LID and HC algorithms. Similarly, the LSR routing algorithm that uses fuzzy sets and membership functions is based on the mean signal strength and the relative movement between nodes, to obtain the lifetime of each connection and the path lifetime, from fuzzy inferences and fuzzy rules for reference. The LSR algorithm provides more reliable path lifetime and more stable transmission than the table-driven or on-demand approaches. Simulation results reveal that the path lifetime of the LSR algorithm is longer than that of DSR, with a lower probability of path drop and avoiding rerouting. The LSR algorithm has a higher mean number of hoppings, because it always finds the most suitable path and is more stable than DSR, without searching again for a new path when the paths drop.     

Optimal K-survivable backward-recursive path computation (BRPC) in multi-domain PCE-based networks

The path computation element (PCE) enables optimal path computation in single-domain (G)MPLS networks. To overcome the lack of traffic engineering (TE) information in multi-domain networks and to preserve both computation optimality and domain confidentiality, the backward-recursive PCE-based computation (BRPC) procedure has been standardized. BRPC procedure is based on PCE protocol (PCEP) and enables synchronized computation of TE label-switched paths with the requested level of reliability and quality of service requirements (i.e., guaranteed bandwidth). In this paper, the problem of computing $K$ K -survivable optimal multi-domain paths by resorting to BRPC procedure is analyzed. Extensions to PCEP protocol are discussed to achieve path optimality when domain information is kept confidential. The optimality is theoretically proved, and the computational complexity is shown to be more efficient than existing approaches. The discussed extensions are experimentally validated in an MPLS network test bed based on commercial equipments and are shown to have performance comparable to standard PCEP approach.     

A novel segment-shared protection algorithm based on dynamic domain-sequencing scheme for multi-domain optical mesh networks

Survivability has been widely recognized as an important design issue for optical networks. In practice, as the network scale keeps expanding, this design problem becomes more critical. Due to scalability and domain privacy, designing the protection scheme in multi-domain networks is more difficult than that in single domain networks. The path computation element (PCE) is known as an efficient architecture to compute optimal traffic engineering (TE) paths in multi-domain multilayer networks. Based on the PCE architecture, we first propose a new dynamic domain-sequencing scheme that considers the load balance of inter-domain links and then propose an improved segment-shared protection approach called DDSP. It can provide 100% protection ability for multiple failures that each single domain has only one failed link. Finally, the protection based on the optimal dynamic domain-sequencing scheme, called OPT, is designed, to evaluate performance of our algorithm and to provide the good bounding for the dynamic domain-sequencing scheme with limited intra TE information. Simulation evaluation shows that the proposed scheme is effective in multi-domain path protection with more efficient resource utilization, lower blocking probabilities and less inter-domain cost. Furthermore, the performance of it is near to OPT.     

一种新型的基于PCE的多层多域GM-PLS／ASON光网络体系结构

With the development of large-scale, multi-region and multi-layer networks, policy-based and constraint-based path computation is more and more complicated and dynamic routing becomes one of the key issues in GMPLS/ASON networks. To combine the advantages of both GMPLS control plane and PCE, novel dual routing engine architecture of multi-layer and multi-region scalable optical networks is proposed in this paper. The collaboration of group engine and unit engine makes it effective to optimize path computation especially under the condition of complex multi-constraints. The functional architecture of dual routing engine is detailed. Different potential co, operation relationships between group engine and unit engine are investigated and simulation results for multi-region and multi-layer routing schemes are analyzed.     

Time-sensitive software-defined networking (Ts-SDN) control architecture for flexi-grid optical networks with data center application

Data center interconnected by flexi-grid optical networks is a promising scenario to meet the high burstiness and high bandwidth requirement of data center application, because flexi-grid optical networks can allocate spectral resources for applications in a dynamic, tunable and efficient control manner. Meanwhile, as centralized control architecture, the software-defined networking (SDN) enabled by OpenFlow protocol can provide maximum flexibility for the networks and make a unified control over various resources for the joint optimization of data center and network resources. Time factor is firstly introduced into SDN-based control architecture for flexi-grid optical networks supporting data center application. A traffic model considering time factor is proposed, and a requirement parameter, i.e., bandwidth-period product is adopted for the service requirement measurement. Then, time-sensitive software-defined networking (Ts-SDN)-based control architecture is designed with OpenFlow protocol extension. A novel deadline-driven PCE algorithm is proposed for the deadline-driven service under Ts-SDN-based control architecture, which can complete data center selection, path computation and bandwidth resource allocation. Finally, simulation results shows that our proposed Ts-SDN control architecture and deadline-driven PCE algorithm can improve the application and network performance to a large extent in blocking probability.     

Challenges and opportunities of delivering IP-based residential television services

This article describes the main challenges of implementing an end-to-end architecture for delivery of high-quality, IP-based residential TV services to residential customers. The IP-based approach can be implemented with an IP multicast overlay network with traditional routers or use IP-multicast-aware ATM switching systems. Both approaches use IP multicast to transport MPEG-2 broadcast video and can work on any access architecture, especially on copper-based architectures (xDSL) such as ASDL and VDSL. The main challenges met while implementing the IP-based architecture are competitive positioning relative to traditional CATV architectures, overall architecture, head-end architecture and quality issues, traffic engineering for stringent QoS requirements, IP multicast requirements, and business case considerations. The IP-based approach described leverages Internet technology advancements and capitalizes on the impacts of Internet on interactive entertainment. Video channel manipulation at the head-end is dependent on access bandwidth and affects video quality. Video traffic management to meet stringent QoS requirements is challenging at the IP layer. High-capacity, responsive IP multicasting is essential to achieving high service quality. Cost-effective IP multicasting is a critical component of the business case.     

Provisioning QoS in inter-domain traffic engineering

This work describes an architectural framework that allows inter-domain Traffic Engineering Label Switched Paths (TE-LSPs) with guaranteed quality of service (QoS) to be setup. Such TE-LSPs, called EQ-links, are setup by coordinating path computation elements (PCEs) of neighboring autonomous systems (ASs) along a pre-determined inter-AS path, computed through cooperative interaction between pairs of neighboring ASs. After defining the architectural requirements for the framework, we describe and analyze the Inter-AS Path Computation Protocol (IA-PCP), which computes an interdomain path at the AS level, i.e., selecting a sequence of ASs to the destination, based on a loose source routing approach. The results of the IA-PCP computations are then fed to the PCEs for complete path computation. The proposed architecture has been actually implemented within the testbed of the EuQoS project, which is aimed at enabling end-to-end QoS in the Internet. We report results related to the setup time of EQ-links, measured in the pan-European testbed of the EuQoS project, showing that path computation and setup takes an affordable time overhead.     

Alternate path routing for multicast

Current network-layer multicast routing protocols build multicast trees based only on hop count and policy. If a tree cannot meet application requirements, the receivers have no alternative. In this paper, we propose a general and modular architecture that integrates alternate path routing with the network's multicast services. This enables individual multicast receivers to reroute a multicast tree according to their needs, subject to policy restrictions. Our design focuses on the two primary components of this architecture - a loop-free path installation protocol and a scalable, distributed path computation algorithm. Based on a simulation study, we demonstrate that using alternate path routing enables receivers to find acceptable paths nearly as well as a link-state protocol, with much lower overhead. We also show that our approach scales to large networks and that performance improves as a multicast group grows in size.     

QoS routing across multiple autonomous systems using the path computation element architecture

We examine various algorithms for calculating quality of service (QoS)-enabled paths spanning multiple autonomous systems (ASs) using the path computation element (PCE) architecture. The problem is divided into two parts. We first calculate an AS path, then the node-by-node path. Using extensive simulation, we compared various AS-path calculation algorithms based on border gateway protocol (BGP) and various AS-aggregation procedures, such as mesh, star and nodal aggregation. For node-to-node path calculation, we employed the per-domain backward algorithm and the per-domain backward tree algorithm (also known as backward recursive PCE-based computation). Results point to the fact that complex AS-path calculation algorithms do not perform significantly better than BGP. However, if the service quality provided by ASs varies greatly, either in time or space, then we expect a QoS-aware AS-path computation algorithm, e.g., static nodal aggregation, to outperform BGP. Although the per-domain backward tree algorithm generally performs better than the per-domain backward algorithm, using a persistent variant of the latter makes it outperform the per-domain backward tree algorithm. The cost is a negligible increase in computational complexity and a slightly increased connection setup delay.     

一种基于微基准程序和理想上限的 处理器性能分析方法

随着现代高性能通用处理器结构的不断发展,处理器的性能分析已经变得越来越困难.基于大工作负载和单纯依靠模拟器的性能分析方法复杂度高,且难以直观地反映微体系结构特征.本文针对超标量处理器的特点,提出一种新的处理器性能分析方法,具体包括:设计一个微基准程序集Godson-Microbench,并提出相应的理想性能上限计算公式.这种方法扩充了过去基于约束的性能分析方法,可以更加完整地评估流水线性能并有效地发现性能瓶颈.本文使用这种方法分析比较了龙芯2号处理器和Alpha21264处理器,并依此改进了龙芯2号的结构,使得微基准程序的平均性能提高了13.8%,SPEC程序集的IPC提高了28.8%.本文提出的性能分析方法在龙芯2号的结构优化工作中发挥了重要作用.     

Tunable Mismatch Shaping for Quadrature Bandpass Delta-Sigma Data Converters

This paper presents an architecture for quadrature bandpass mismatch shaping that allows the center frequency of the mismatch suppression band to be tunable over the entire Nyquist range. The approach is based on the previously reported complex-valued tree-based mismatch shaper, and extends this to allow tunable operation. The proposed design has been implemented using VHDL and synthesized to logic gates. The hardware complexity and mismatch shaping performance of the proposed architecture are compared to that of a reference architecture, which uses separate tunable mismatch shapers for each complex component path. Simulation results show consistent mismatch shaping performance across the entire tuning range.     

High-Throughput Layered LDPC Decoding Architecture

This paper presents a high-throughput decoder architecture for generic quasi-cyclic low-density parity-check (QC-LDPC) codes. Various optimizations are employed to increase the clock speed. A row permutation scheme is proposed to significantly simplify the implementation of the shuffle network in LDPC decoder. An approximate layered decoding approach is explored to reduce the critical path of the layered LDPC decoder. The computation core is further optimized to reduce the computation delay. It is estimated that 4.7 Gb/s decoding throughput can be achieved at 15 iterations using the current technology.      

A vertical Path Computation Element (PCE) based path provisioning scheme in multilayer optical networks

The explosive growth of Internet traffic has led to a dramatic increase in demand for data transmission capacity, which requires high transmission rates beyond the conventional transmission capability. This demand has spurred tremendous research activities in new high-speed transmission and switching technologies. As optical transmission technology keeps maturing, next generation optical networks are expected to be controlled by Generalized Multiprotocol Label Switching (GMPLS) protocol suite and operating at multiple switching layers. In order to ensure the most efficient utilization of multilayer network resources, and to maximize revenue from existing capacity, effective global provisioning solution that providing the network with the possibility of reacting in advance to traffic changes should be provided. This paper proposes a new path provisioning scheme in multilayer optical networks based on the vertical Path Computation Element (PCE) architecture to efficiently exploit multiple PCE cooperation. This paper also investigated the problem of how network nodes overcome limited visibility of network resources. Unlike most of the previous studies, the topology of the upper switching layer is not always equal to the physical topology of lower switching layer.     

Architectural Optimizations for Low-Power $K$ -Best MIMO Decoders

Maximum-likelihood (ML) detection for higher order multiple-input–multiple-output (MIMO) systems faces a major challenge in computational complexity. This limits the practicality of these systems from an implementation point of view, particularly for mobile battery-operated devices. In this paper, we propose a modified approach for MIMO detection, which takes advantage of the quadratic-amplitude modulation (QAM) constellation structure to accelerate the detection procedure. This approach achieves low-power operation by extending the minimum number of paths and reducing the number of required computations for each path extension, which results in an order-of-magnitude reduction in computations in comparison with existing algorithms. This paper also describes the very-large-scale integration (VLSI) design of the low-power path metric computation unit. The approach is applied to a 4 $times$ 4, 64-QAM MIMO detector system. Results show negligible performance degradation compared with conventional algorithms while reducing the complexity by more than 50%.      

基于PCE的ASON路由技术研究

由因特网工程任务组(IETF)路径计算单元(PCE)工作组定义的基于PCE的多协议标签交换/通用多协议标签交换(MPLS/GMPLS)网络结构能有效解决多层网络中端到端的路径计算问题.文章从自动交换光网络(ASON)路由技术的发展趋势出发,根据有关PCE的RFC文档对PCE的体系结构、发现机制和策略进行了较为系统的说明,重点对PCE在ASON路由中的应用及PCE路径保护和恢复机制进行了阐述,表明PCE技术将成为ASON路由技术的首要选择.     

A software methodology for detecting hardware faults in VLIW data paths

The proposed methodology aims to achieve processor data paths for VLIW architectures able to autonomously detect transient and permanent hardware faults while executing their applications. The approach, carried out on the compiled application software, provides the introduction of additional instructions for controlling the correctness of the computation with respect to failures in one of the data path functional units. The advantage of a software approach to hardware fault detection is interesting because it allows one to apply it only to the critical applications executed on the VLIW architecture, thus not causing a delay in the execution of noncritical tasks. Furthermore, by exploiting the intrinsic redundancy of this class of architectures no hardware modification is required on the data path so that no processor customization is necessary.     

A Parallel-Based Lifting Algorithm and VLSI architecture for DWT

A novel Parallel-Based Lifting Algorithm （PBLA） for Discrete Wavelet Transform （DWT）, exploiting the parallelism of arithmetic operations in all lifting steps, is proposed in this paper. It leads to reduce the critical path latency of computation, and to reduce the complexity of hardware implementation as well. The detailed derivation on the proposed algorithm, as well as the resulting Very Large Scale Integration （VLSI） architecture, is introduced, taking the 9/7 DWT as an example but without loss of generality. In comparison with the Conventional Lifting Algorithm Based Implementation （CLABI）, the critical path latency of the proposed architecture is reduced by more than half from （4Tm ＋ 8Ta）to Tm ＋ 4Ta, and is competitive to that of Convolution-Based Implementation （CBI）, but the new implementation will save significantly in hardware. The experimental results demonstrate that the proposed architecture has good performance in both increasing working frequency and reducing area.     

分布式服务质量路由预计算算法

服务质量路由作为下一代IP互联网提供服务质量(QoS)控制的一种重要方案,如何提高其可扩展性和路由性能是有待解决的难题.本文提出了基于聚类的分布式预计算算法,以具有多种QoS参数的路由表预计算为目标,引入了支持QoS参数的扩展距离向量,通过网络中各个节点的分布式协同计算,大大降低了单个路由器的计算复杂度.文章分析了优势路径及其选取策略,给出了路由计算中优势路径聚集的聚类方法,实现了QoS路由表的高效聚集压缩.实验结果进一步验证了该算法具有计算量小和QoS路由性能高的优点,在QoS度量维数和网络规模方面均具有良好的可扩展性,并对域间算法研究提供了重要依据.     

Parallel Computation of Adaptive Filtering Algorithms on Multi-Core Systems

The performance of recent CPUs has been rapidly increasing with the help of parallel architectural supports, such as SIMD (Single Instruction Multiple Data) extensions and multi-core architecture. However, efficient use of such parallel supports for adaptive filtering is difficult due to feedback loops that induce the data dependency problem. In this paper, efficient parallel computation of adaptive filters is studied for multi-core architecture with SIMD arithmetic support. Control- and data-level parallel computation methods are considered, where the former finds parallelism in the evaluation of one output sample, while the latter processes multiple output samples at a time to increase the degree of parallelism. The control-level parallel approach frequently utilizes the pipelining technique to uncover the parallelism, whereas the data-level approach employs a parallel computation method for linear recurrence equations to resolve the dependency. Not only adaptive transversal LMS (Least Mean Square) but also gradient adaptive lattice (GAL) and QR-decomposition based least-square lattice (QRD-LSL) filters are implemented on a PC that employs both SIMD and multi-core architecture.