MARS：一个通用多层区域布线算法

提出一个VLSI多层区域详细布线算法,算法使用模拟进化技术进行拆线重布线,对单个线网则使用改进型多层迷宫算法进行布线。     

MARS:一个通用多层区域布线算法

提出一个 VL SI多层区域详细布线算法 ,算法使用模拟进化技术进行拆线重布线 ,对单个线网则使用改进型多层迷宫算法进行布线。     

设计规则驱动的多层布线算法

迷宫算法是集成电路两端线网优化布线问题的经典算法。多层布线受复杂版图设计规则约束．简单直接应用迷宫布线算法，或者无法获得优化的结果，或者无法满足设计规则。文章分析了迷宫算法特性与局限．提出基于群组图的多层迷宫算法，圆满地解决了上述问题。     

基于拓扑分析的多层通道布线算法

本文提出了一种基于拓扑分析的多层通道布线算法。算法把整个布线过程分成拓扑分层和物理布线两个部分。拓扑分层利用线段交叠图及模拟退火算法解决线段分层及通孔最少化问题，物理布线过程引入虚拟走线道解决交叉问题，再利用轮廓线跟踪的方法来决定最终确定各线段的布线位置。算法还解决了多层布线分层的管脚约束问题和相邻约束问题。实验结果表明，这是一种有效的方法。     

整平面整体布线算法

论了一种新的布线模式－整平面布线方法，并给出了针对该模式的基于规划的层次化的束布线算法。该算法由块内布线算法和块间布线算法两部分组成，它们的时间复杂性均为多项式时间算法。由于其整平面和层次化的固有特点，该算法特别适合于大规模的多层布线总理２。     

重叠端口通道dogleg的优化算法

针对重叠端口通道的多层布线模型，提出了一个优化通道内ｄｏｇｌｅｇ数目的算法。该算法避免了一般优化算法中难以确定合理的优化顺序的不足，用它来对重叠端口通道布线结果进行优化，能快速减少ｄｏｇｌｅｇ数目，提高电路的电学性能。最后分析了算法的时间复杂性。     

混合多层布线用AIN共烧多层基板技术研究

大功率混合多层基板（AIN混合多层布线基板）是采用在AIN共烧多层陶瓷基板上制作薄膜多层布线而形成的。其优良的散热性，高的信号传输速度，以及良好的高频特性，完全能够在微波功率器件和高速数字电路中使用。然而AIN混合多层布线基板的应用，离不开高性能的AIN共烧多层基板。本文仅对AIN共烧多层基板制作过程中需要解决的几个关键技术方面进行了研究，取得了一定的成果。     

一种基于神经网络的多层通孔最小化方法

在多层布线的线段－相交图模型基础上，利用Ｈｏｐｆｉｅｌｄ人工神经网络理论，通过反通孔数目这个优化目标与Ｈｏｐｆｉｅｌ网络能量函烽相联系的方法来解决多层布线通孔最小化问题。算法考虑了许多来自实际的约束。     

一个多层VLSI/PCB布线通孔最小化的神经网络方法

本文提出了一个基于Ｈｏｐｆｉｅｌｄ网络的ＶＬＳＩ／ＰＣＢ多层布线中的有约束通孔最小化方法。在线段交叠图模型的基础上，提出了相邻矩阵，交叠矩阵，定层矩阵等概念，利用换位矩阵，将问题映射为相应的神经网络，并构造了该问题的能量函数，从而解决了多层布线的分层及通孔最小化问题，新算法还解决了多层布线分层的管脚约束和相邻约束问题。     

一个VLSI三层布线通孔最少化的启发式算法

该文在三层布线的线段-相交图模型基础上,提出了一个启发式算法来解决VLSI三层布线通孔最少化问题,该算法通过总体优化和局部优化两个阶段对三层布线进行通孔优化。算法考虑了实际约束的处理方法,并进行大量的布线实例验证。     

一种新的基于知识的四边通道布线算法

本文提出了一种新的基于知识的双层四边通道布线算法,该算法对四边通道的布线是通过以下四步完成的。首先,对四边通道的四个角布线,其次,对关键线网优先布线,接下来,利用线网间相互制约关系进行同步增长布线;最后,对仍然没有完成连接的线网,用李氏算法布线。由于使用了启发式规则,使得该算法具有较高的布通率和布线效率。     

Routing and Wavelength Assignment in Optical Networks Using Logical Link Representation and Efficient Bitwise Computation

In this paper, we propose and evaluate a new approach for implementing efficient routing and wavelength assignment (RWA) in wavelength division multiplexing (WDM) optical networks. In our method, the state of a fiber is given by the set of free wavelengths in this fiber and is efficiently represented as a compact bitmap. The state of a multiple-fiber link is also represented by a compact bitmap computed as the logical union of the individual bitmaps of the fibers in this link. Likewise, the state of a lightpath is represented by a similar bitmap computed as the logical intersection of the individual bitmaps of the links in this path. The count of the number of 1-valued bits in the bitmap of the route from source to destination is used as the primary reward function in route selection. A modified Dijkstra algorithm is developed for dynamic routing based on the bitmap representation. The algorithm uses bitwise logical operations and is quite efficient. A first-fit channel assignment algorithm is developed using a simple computation on the bitmap of the selected route. The resulting bitwise routing algorithm combines the benefits of least loaded routing algorithms and shortest path routing algorithms. Our extensive simulation tests have shown that the bitwise RWA approach has small storage overhead, is computationally fast, and reduces the network-wide blocking probability. The blocking performance of our RWA method compares very favorably with three routing methods: fixed alternate routing, shortest path using flooding, and Dijkstra’s algorithm using mathematical operations. Our simulation experiments have also evaluated the performance gain obtained when the network access stations are equipped with finite buffers to temporarily hold blocked connection requests.     

一种稳健的城市场景车载Ad hoc路由策略

该文通过分析已有的适合城市场景的Ad hoc车载路由策略,发现其中的不足,提出一种新的稳健高效的路由策略,包括在交通岔口引入固定节点,采用二次选择路由方向,以及一系列有针对性的恢复机制。仿真结果表明,新的路由协议在城市场景中有较好的性能。     

考虑串扰效应的性能驱动全局布线器研究

提出了利用符号化矩计算模型进行性能驱动的多级布线方法.通过在模式布线阶段利用符号化矩计算模型,快速得到电路的高阶矩,并根据计算结果,采用合理的代价函数对时延串扰等性能指标进行预估,进而指导布线.实验结果显示,该算法在串扰优化方面得到较大的提高,布线结果兼顾了时延优化和信号波形质量优化.     

Genetic algorithm for routing switching units

A hybrid model is presented of a genetic algorithm for routing switching units using fuzzy logic in genetic operators. A fuzzy objective function is used to take into account the criteria of the problem. The algorithm has been developed with regard to various physical effects during routing, thereby reducing the design time of devices by eliminating the need for rerouting after the verification stage.     

基于网络编码的多播路由算法性能分析

多播传输是目前通信系统中的一项关键技术,可以将相同的信息同时传向多个接收节点。该文提出一种基于网络编码的新的多播路由算法,该算法利用Dijkstra约简网络搜索源节点到各接收节点的路径族。仿真结果表明,该算法在资源消耗和负载均衡方面较传统的多播路由算法有更好的表现,同时性能也更接近基于网络编码的最小费用多播算法。最后,数学分析表明该算法具有较低的计算复杂度。     

Dynamic routing of restorable bandwidth-guaranteed tunnels using aggregated network resource usage information

The paper presents new algorithms for dynamic routing of restorable bandwidth-guaranteed paths. We assume that connections are requested one-by-one and there is no prior knowledge of future arrivals. In order to guarantee restorability an alternate link (node) disjoint backup (restoration) path has to be determined, as well as an active path, when the connection is initiated. This joint on-line routing problem is particularly important in optical networks and in MPLS networks for dynamic provisioning of bandwidth-guaranteed or wavelength paths. A simple solution is to find two disjoint paths, but this results in excessive resource usage. Backup path bandwidth usage can be reduced by judicious sharing of backup paths amongst certain active paths while still maintaining restorability. The best sharing performance is achieved if the routing of every path in progress in the network is known to the routing algorithm at the time of a new path setup. We give a new integer programming formulation for this problem. Complete path routing knowledge is a reasonable assumption for a centralized routing algorithm, but is not often desirable, particularly when distributed routing is preferred. We show that a suitably developed algorithm which uses only aggregated information, and not per-path information, is able to perform almost as well as one using complete information. Disseminating this aggregate information is feasible using proposed traffic engineering extensions to routing protocols. We formulate the dynamic restorable bandwidth routing problem in this aggregate information scenario and develop efficient routing algorithms. The performance of our algorithm is close to the complete information bound.     

WSN中基于分簇路由的多维度数据压缩算法研究

 本文在不减少基站获取传感信息量的前提下,以最大程度减少传输数据量为目的,提出一种在分簇路由协议支持下的时间、空间多维度的数据压缩算法.结合基于空间维度的数据压缩方式设计了一种改进的分簇路由.通过实例验证与仿真评测,该数据压缩算法以及配合该算法设计的路由协议可以显著的减少整个无线传感器网络中数据发送量,延长网络的生存周期.     

Throughput oriented forwarders selection analysis for opportunistic routing in wireless mesh network

Opportunistic routing explicitly takes advantage of the broadcast nature of wireless communications by using a set of forwarders to opportunistically perform packet forwarding. A key issue in the design of opportunistic routing protocols is the forwarder list selection problem. This paper proposes a novel routing metric which shows the end-to-end throughput and a corresponding throughput oriented opportunistic routing forwarder-selecting algorithm throughput oriented forwarders selection (TOFS) through analyzing forwarding characteristics of forwarders. The algorithm puts forward a constraint mechanism that controls the number of forwarders by constraint of throughput for forwarders selection, achieving a better balance between number of forwarders and effective link stability by introducing the factor of transmission time. Simulation results show that the algorithm can improve the network end-to-end throughput effectively over existing methods.