Discrete Capacity Assignment in IP networks using Particle Swarm Optimization

This paper presents a design methodology for IP networks under end-to-end Quality-of-Service (QoS) constraints. Particularly, we consider a more realistic problem formulation in which the link capacities of a general-topology packet network are discrete variables. This Discrete Capacity Assignment (DCA) problem can be classified as a constrained combinatorial optimization problem. A refined TCP/IP traffic modeling technique is also considered in order to estimate performance metrics for networks loaded by realistic traffic patterns. We propose a discrete variable Particle Swarm Optimization (PSO) procedure to find solutions for the problem. A simple approach called Bottleneck Link Heuristic (BLH) is also proposed to obtain admissible solutions in a fast way. The PSO performance, compared to that one of an exhaustive search (ES) procedure, suggests that the PSO algorithm provides a quite efficient approach to obtain (near) optimal solutions with small computational effort.     

Analysis of a two-stage network server

This paper presents modeling and analysis of a finite-queuing system of a server with two stages of service. In real life, such systems may represent typical network servers or client machines where network packets arrive and get queued to be served sequentially in two stages in a mutually exclusion fashion. That is, packets will be served by a first stage followed by a second stage, with only one stage being active at a time. In this paper, we present two equivalent analytical models to study and analyze the behavior of such systems. We derive equations for key features and performance measures of engineering and design significance. These features and measures include throughput, packet loss, packet delay, and server CPU utilization.     

A FrameWork for the Error Analysis of Discontinuous Finite Element Methods for Elliptic Optimal Control Problems and Applications to C 0 IP Methods

In this article, an abstract framework for the error analysis of discontinuous Galerkin methods for control constrained optimal control problems is developed. The analysis establishes the best approximation result from a priori analysis point of view and delivers a reliable and efficient a posteriori error estimator. The results are applicable to a variety of problems just under the minimal regularity possessed by the well-posedness of the problem. Subsequently, the applications of C ⁰ interior penalty methods for a boundary control problem as well as a distributed control problem governed by the biharmonic equation subject to simply supported boundary conditions are discussed through the abstract analysis. Numerical experiments illustrate the theoretical findings.     

How the Asymmetric Nature of IP Traffic Influences the Cost of the Underlying Optical Layer

In this article the influence of the asymmetric nature of (IP) traffic on the cost of the underlying optical transport network is investigated over a time frame of six years using a realistic traffic forecast for a European fiber-optic network. The currently deployed transport networks contain bidirectional optical line systems and are thus inherently symmetric, although the traffic that has to be conveyed over those networks is asymmetric. This article shows that a cost reduction of up to 38% can be obtained if the bidirectional line systems are replaced by unidirectional ones.     

Fast Restoration Based on Alternative Wavelength Paths in a Wide Area Optical IP Network

Abstract

In this article we describe an experimental investigation of IP network restoration based on wavelength recovery. We propose a procedure for metro and wide area gigabit Ethernet networks that allows us to route the wavelength in case of link failure to another existing link by exploiting wavelength division multiplexing in the fiber. Such a procedure is obtained by means of an optical switch that is managed by a loss-of-light signal that is generated by a router in case of link failure. Such a method has been tested in an IP network consisting of three core routers with optical gigabit Ethernet interfaces connected by means of 50-km-long single-mode fibers between Rome and Pomezia. Compared with other conventional restoration techniques, such as OSPF and MPLS, our method -in very fast (20 ms) and is compatible with real-time TV services and low-cost chips.     

AES加密引擎并行化设计与实现

在自主设计AES-256加密算法IP核的基础上,提出了AES加密引擎和多密码引擎SoC的硬件结构,对它们内部的并行化设计进行了研究和分析.通过对加密引擎的逻辑综合和多密码引擎并行模块的定量分析发现,在160MHz的核心频率下,4个AES-256密码引擎并行模块受总线影响下的系统吞吐率为3.06Gb/s.与同类设计相比,本文的并行化设计占有更小的面积资源,具有更大的系统吞吐率,达到了多引擎并行化设计的目标.     

IP over WDM网络中可恢复的路由选择策略与算法

研究了IP over WDM网络中各层备用资源的分配问题,提出了一种新的IP over WDM网络中可恢复的路由选择策略以及应用于其中的备用路由选择算法.该策略通过层间备用资源共享,能够完全利用网络中为恢复光层故障所预留的资源来进行IP层故障恢复,从而大大提高了网络的资源利用率.对所提出的策略进行了性能分析,并给出了相应的性能指标.     

基于概率的保持前缀地址随机化算法的安全评估

地址随机化算法通常用于在发布流量数据之前进行去隐私处理.保持前缀地址随机化算法就是其中一个常用算法.对于保持前缀地址随机化算法而言,由于引入了更多的限制,因此也面临更多的安全风险.分析了相关性攻击对保持前缀地址随机化算法的安全影响,并利用概率分析和仿真评估了不同攻击方法对其安全性能的影响.     

Large Deviations for Small Buffers: An Insensitivity Result

This article focuses on a queue fed by a large number of semi-Markov modulated fluid sources, e.g., on/off sources with on and off-times that have general distributions. The asymptotic regime is considered in which the number of sources grows large, and the buffer and link rate are scaled accordingly. We aim at characterizing the exponential decay rate of the buffer overflow probability for the regime of small buffers. An insensitivity result is proven: the decay rate depends on the distributions of the on and off-times only through their means. The efficiency gain to be achieved by using small buffers is significant, as the decay rate grows fast: proportionally to the square root of the buffer size.     

Theoretical study of optical and electronic properties of the bis‐dipolar diphenylamino‐endcapped oligoarylfluorenes as promising light emitting materials

We present a detailed study of the structural, electronic, and optical properties of the bis‐dipolar emissive oligoarylfluorenes, OF(2)Ar‐NPhs. The aim of our quantum‐chemical calculations is to investigate the role of the transition and the influence of the optical properties of the various central aryl cores in the oligoarylfluorenes. Geometry optimizations were performed for the ground‐state and for the first electronically excited‐state. The absorption and emission spectra were calculated using time‐dependent density functional theory (TD‐DFT). The results show that the HOMO, LUMO, energy gap, ionization potentials (IP), electron affinities (EA) and reorganization energy (λ) of the oligoarylfluorenes are significantly affected by the electronic withdrawing property and the conjugated length of the central aryl core. Consistently, the stronger the electron withdrawing strength, the lower the LUMO energy is. This thus improves the electron‐accepting and transporting properties by the low LUMO energy levels. The absorption and emission spectra of this series of bis‐dipolar molecules exhibit red shifts to some extent by the electronic nature of the electron affinitive central core in the oligoarylfluorenes. All the calculated results show that the oligoarylfluorenes are promising as useful light emitting materials for OLEDs. Copyright © 2007 John Wiley & Sons, Ltd.