Raphael-深亚微米集成互连参数仿真优化系统

针对超深亚微米层次下的金属互连设计,使用Raphael(集成布线互连)仿真系统完成了互连寄生效应参数的提取。介绍了Raphael仿真系统的主要功能及基本应用,并分析了常规集成布线互连参数模型。采用二层跨越式互连结构,对寄生电阻、电容参数进行了仿真,并得到电流密度的分布结果。这些参数的提取及验证对电路的布局设计是十分重要的。     

无线移动自组网络的动态源路由策略

文章介绍无线移动自组网中动态源路由策略的路由发现和路由维护,并提出改进思路和今后研究的方向。     

具有星际链路的LEO&MEO双层卫星网络路由策略研究

本文提出了一个具有星际链路的LEO&MEO(低轨和中轨 )双层卫星通信系统 ,详细介绍了系统结构、协议体系并重点研究了双层卫星系统的路由问题 .为了适应宽带多媒体通信的需要 ,系统采用了ATM快速分组交换技术 .提出了基于Dijkstra算法的双层卫星网络时延最短路由策略和时延抖动最小路由策略 ,并通过计算机仿真研究了它们的性能 ,得到了具有一定参考价值的结果 .     

Dynamic group multicast routing with bandwidth reservations

Multicasting refers to the transmission of data from a source node to multiple destination nodes in a network. Group multicasting is a generalization of multicasting whereby every member of a group is allowed to multicast messages to other members that belong to the same group. The routing problem in this case involves the construction of a set of low cost multicast trees with bandwidth requirements, one for each member of the group for multicasting messages to other members of the group. In this paper, we examine this routing problem with an additional requirement that member nodes are allowed to join and leave the multicasting group anytime during a session. We call this problem, the dynamic group multicast routing problem (DGMRP). In this paper, we proposed three heuristic algorithms to generate a set of low cost multicast trees with dynamic group membership. Results from our empirical study shows that the one of the proposed algorithms, called Maximum bandwidth bottleneck path selection algorithm (MBBPS), achieves better utilization of bandwidth resources as compared with the other two algorithms which are based on a greedy approach. In addition MBBPS performs better in terms of cost when the bandwidth is not sufficient in the network. Copyright © 2002 John Wiley & Sons, Ltd.     

Multiattribute‐based routing for lifetime maximization in opportunistic mobile social networks

With the advancement in wireless technology and portable devices, smart phones have become one of the belongings of human being. People share their data online, but it has limitations due to transmission range and mobility. Yet opportunistic mobile social network enables users to share data online even if there is no connected path between source and destination. The widespread use of mobile phones equipped with WiFi, Bluetooth, and several other components and contact opportunities among humans bridge the gap between internet available and nonavailable area. In this paper, we have proposed a new routing approach which utilizes both spatial and temporal attributes of user such as probability to meet a particular location and remaining intercontact time between two nodes to select better relay nodes. Generally, users visit different locations such as sports stadium and mall, with varying probability. Users with similar interest form group, and each user has different intercontact time with other users according to their point of interest and visiting pattern. By utilizing multiattributes, different forwarding strategies have been devised for both inter and intragroup routing. The proposed work “point of interest (PoI)‐based routing” is implemented in Opportunistic Network Environment simulator, and the performance is analysed in terms of delivery rate, latency, overhead, goodput, and energy consumed. The simulation results show that PoI diminishes 23% of overhead and yields 24% improvement in goodput over the state‐of‐the‐art protocol. Thus, the simulation results reveal that our proposed work provides the balance between routing performance and resource consumption.     

Integrated Routing Algorithms for Provisioning “Sub-Wavelength” Connections in IP-Over-WDM Networks

This work focuses on developing and implementing comprehensive unified constraint-based routing algorithms within the generalized multi-protocol label switching framework (GMPLS) to provision sub-wavelength circuits (low-rate traffic streams). Constraint-based routing is further augmented in this work by dynamically routing both an active and another alternate link/node-disjoint backup path at the same time in order to provision a given connection request. This new integrated approach combines both IP routing and optical resource allocation to setup end-to-end connections.     

多总线结构MHAL路由方法

在分析传统调制解调级硬件抽象层(Modem Hardware Abstract Layer,MHAL)路由方法局限性的基础上,提出了一种多总线结构MHAL路由方法,并详细介绍了该方法的设计实现及验证。基于多总线结构MHAL路由方法在不违反软件通信结构规范的前提下,解决了传统方法不能解决的处理器间多总线路由、处理器多端口路由以及数据包路由转发问题。该技术已在某大型软件无线电系统中得到应用。     

基于选播机制的无线Mesh网络网关选取路由算法

提出了一种基于选播的无线Mesh网络网关选取模型和相应的网关选取路由算法。该模型将所有网关节点抽象成一个选播组,将所有的网关节点组成一个网关树,实现对网关组成员的管理与维护。网关选取路由算法以时延为度量,通过有效的选播机制自适应地查找"最优"网关节点为客户节点服务,以提供响应最快的高质量的因特网接入服务。实验结果表明,该算法能在合理的时间内有效地解决多网关选取问题。     

Improved video streaming using MSVC and nonoverlapping zone routing multipath propagation over MANETs

Providing real‐time video streaming in mobile ad hoc networks is difficult because of the time‐dependent channel status and stringent service requirements. The currently existing route request‐reply–based multihop overlay networks cause considerable control overheads in video transmission resulting in loss of data and communication breakdown. Such networks are more suitable to nonstreaming video applications rather than to time‐sensitive video streaming applications. Therefore, a powerful mechanism needs to be adopted to handle the channel failures amicably and reduce latency effectively in time critical video streaming applications over mobile ad hoc networks. In order to be resilient to the channel failures and reduce latency in such applications, 2 strategies, namely, multistate video coding and 2‐tier–based nonoverlapping zone routing multipath propagation through directional antennas have respectively been incorporated. The performance of the proposed nonoverlapping zone routing multipath propagation system is compared with those of the existing multicast zone routing and zone‐based hierarchical link state routing protocols with parameters average end‐to‐end delay, routing overhead and packet delivery ratio using NS 2.34. The simulation results show that latency and resilience get considerably improved. Finally, the video quality of the proposed work has been verified by subjective and objective video testing methods.     

Study on a Distributed Wavelength Routing Algorithm in WDM Optical Transport Networks

A new design scheme for a distributed algorithm for routing and wavelength assignment (RWA) is developed in this paper, and the communication rules between the nodes to exchange signaling packets are discussed. The Adaptive-Alternate-Routing-Least-Load (AARLL) algorithm is implemented in the distributed scheme for the first time. Under dynamic traffic circumstances, the influence of the race condition, which does not exist in centralized scheme, on the network performance is analyzed and the analyzed results show that the race condition has a major impact on network performance only under light traffic load, while under medium and heavy traffic load the impact is very small. To analyze the performance loss caused by adopting the distributed algorithm for RWA, the capacity loss factor (CLF) is introduced and the calculated results show that CLF does not exceed 6% under medium traffic load.