Efficient multicast search under delay and bandwidth constraints

The issue of a multicast search for a group of users is discussed in this study. Given the condition that the search is over only after all the users in the group are found, this problem is called the Conference Call Search (CCS) problem. The goal is to design efficient CCS strategies under delay and bandwidth constraints. While the problem of tracking a single user has been addressed by many studies, to the best of our knowledge, this study is one of the first attempts to reduce the search cost for multiple users. Moreover, as oppose to the single user tracking, for which one can always reduce the expected search delay by increasing the expected search cost, for a multicast search the dependency between the delay and the search cost is more complicated, as demonstrated in this study. We identify the key factors affecting the search efficiency, and the dependency between them and the search delay. Our analysis shows that under tight bandwidth constraints, the CCS problem is NP-hard. We therefore propose a search method that is not optimal, but has a low computational complexity. In addition, the proposed strategy yields a low search delay as well as a low search cost. The performance of the proposed search strategy is superior to the implementation of an optimal single user search on a group of users. Amotz Bar-Noy received the B.Sc. degree in 1981 in Mathematics and Computer Science and the Ph.D. degree in 1987 in Computer Science, both from the Hebrew University, Israel. From October 1987 to September 1989 he was a post-doc fellow in Stanford University, California. From October 1989 to August 1996 he was a Research Staff Member with IBM T. J. Watson Research Center, New York. From February 1995 to September 2001 he was an associate Professor with the Electrical Engineering-Systems department of Tel Aviv University, Israel. From September 1999 to December 2001 he was with AT research labs in New Jersey. Since February 2002 he is a Professor with the Computer and Information Science Department of Brooklyn College - CUNY, Brooklyn New York. Zohar Naor received the Ph.D. degree in Computer Science from Tel Aviv University, Tel Aviv, Israel, in 2000. Since 2003 he is with the University of Haifa, Israel. His areas of interests include wireless networks, resource management of computer networks, mobility, search strategies, and multiple access protocols.     

Extended global routing with RLC crosstalk constraints

In this paper, we study an extended global routing problem with RLC crosstalk constraints. Considering simultaneous shield insertion and net ordering, we propose a multiphase algorithm to synthesize a global routing solution with track assignment to satisfy the RLC crosstalk constraint at each sink. The key algorithm phase is global routing synthesis with shield reservation and minimization based on prerouting shield estimation. Experiments using large industrial benchmarks show that compared to the best alternative with postrouting shield insertion and net ordering, the proposed algorithm with shield reservation and minimization reduces the congestion by 18.4% with a smaller runtime. To the best of our knowledge, this is the first in-depth study on global routing synthesis with RLC crosstalk constraints.     

Crosstalk modeling for coupled RLC interconnects with application to shield insertion

On-chip interconnect delay and crosstalk noise have become significant bottlenecks in the performance and signal integrity of deep submicrometer VLSI circuits. A crosstalk noise model for both identical and nonidentical coupled resistance-inductance-capacitance (RLC) interconnects is developed based on a decoupling technique exhibiting an average error of 6.8% as compared to SPICE. The crosstalk noise model, together with a proposed concept of effective mutual inductance, is applied to evaluate the effectiveness of the shielding technique.     

时延约束下的等效带宽估计

本文利用流体流方法计算不实时媒体流在缓冲区中的延概率分布函数，给出了时延约束下实时媒体流的等效带宽的表达式。讨论了相关参数对等效带宽的影响。进行了仿真分析和验证。该表达式计算简单，便于实时带宽估计和控制。     

Surface-wave delay lines with near-octave bandwidth

Efficient operation of lithium-niobate delay lines over bandwidths approaching one octave is reported. The transducers are of a 3-electrode (N = 1) interdigital design. Broad bandwidth to the series-resonant transducer is obtained by the use of a lumped-element impedance invertor coupling network. A 9.1 ?s delay line is described, which gives 55% 3 dB bandwidth centred at 235 MHz with 25 dB minimum loss and over 50 dB minimum triple-transit suppression.     

考虑工艺波动的RLC互连延时统计模型

基于概率解释算法的原理,提出了一种考虑工艺波动的RLC互连延时统计模型,该模型使用了对数正态分布函数。在给定互连参数波动范围条件下,利用该算法计算延时仅需要采用前两个瞬态。和HSPICE相比,Monte Carlo分析中的均值和平均偏差误差分别低于0.7％和0.51％。模型计算简单且精度高,可以满足互连线仿真要求。     

Crosstalk bandwidth and stability analysis in graphene nanoribbon interconnects

Based on transmission line modeling (TLM), and using the Nichols chart, we present a bandwidth and stability analysis, together with step time responses, for coupled multilayer graphene nanoribbon (MLGNR) interconnects that is inquired for the first time. In this analysis, the dependence of the degree of crosstalk relative stability for coupled MLGNR interconnects comprising of both capacitive and mutual-inductive couplings between adjacent MLGNR has been acquired. The obtained results show that with increasing the length or decreasing the width of the MLGNRs, the stability in near-end output increases. While, any increase in the length or width of MLGNRs, decrease the stability of far-end output. Also, by increasing capacitive coupling or decreasing inductive coupling, the near-end output becomes more stable, and the far-end output becomes less stable. Moreover, any increase in the length or capacitive coupling, decreases the bandwidth, whereas any increase in the width or inductive coupling, increases the bandwidth. Finally, transient simulations with Advanced Design System (ADS) show that the model has an excellent accuracy.     

基于延时及带宽约束的组播路由算法

本文分析了网络中基于延时和带宽受限的组播路由优化问题,提出了一种新的启发式算法,并进行了实验和分析。文中构造的路由方案成功地解决了当网络中存在多组组播通信时的QoS路由选择问题。此方案不仅保证了组播业务所需的带宽、端到端延时、减小了丢包率,而且有效地控制了算法的复杂性并可适用于大规模的网络中。     

Analysis and optimization of shielded RLC global interconnects for gigascale integration

Compact physical models are presented for on-chip double-sided shielded transmission lines, which are mainly used for long global interconnects where inductance effects should not be ignored. The models are then used to optimize the width and spacing of long global interconnects with repeater insertion. The impacts of increasing line width and spacing on various performance parameters such as delay, data-flux density, power dissipation and total repeater area are analysed. The product of data-flux density and reciprocal delay per unit length are defined as a figure of merit (FOM). By maximizing the FOM, the optimal width and spacing of shielded RLC global interconnects are obtained for various international technology roadmap for semiconductors (ITRS) technology nodes.     

Optimum bandwidth partitioning with analog-to-digital converter constraints

In certain communication channels, such as short copper twisted pairs, it is theoretically possible to perform transmission with very high spectral efficiency using a very wide bandwidth. However, current analog-to-digital converter (ADC) technology limits the allowable sampling rate and resolution, thus severely constraining the transmission speeds. This paper proposes the partitioning of the available bandwidth into multiple bands, each employing an independent ADC. The benefit of such a scheme is the reduction of the sampling rates of the ADCs. An increase in the dynamic range is allowed, thus offering the potential to realize very high spectral efficiencies. An analysis of transmission under ADC constraints is performed, where an expression for the achievable data rate is derived, based on an empirical rule for the tradeoff between the ADC sampling rate and resolution. A bandwidth-partitioning problem is formulated, where the objective is the maximization of the data rate, and the optimization parameters are the frequency-band assignments. Then, a practical example of transmission over category (CAT)-5 cable is considered. The possible impairment factors are outlined, and the essential system elements are described. Using the previously given algorithm, the optimum solution and the corresponding performance are given for two distinct scenarios. These scenarios serve to illustrate the bandwidth-partitioning procedure, and provide useful intuition regarding the application of the proposed method. In particular, it is deduced that it is best to have narrower bands in frequencies where the signal-to-noise ratio (SNR) is relatively high, and wider bands in frequencies where the SNR is relatively low.     

Lowpass delay filters with flat magnitude and group delay constraints

This paper describes the design of finite impulse response (FIR) delay filters that minimize a squared error and have prescribed number of zeros at /spl omega/=/spl pi/ and prescribed magnitude and group delay flatness at /spl omega/=0. An important special case is the design of least squared error lowpass filters with prescribed flatness constraints and zeros at /spl omega/=/spl pi/. Even though the flatness constraints are in general nonlinear functions of the filter coefficients, we show the remarkable fact that for a subclass of the filters a simple orthogonal projection of least squared error filters onto a special linear subspace determined via Baher (1982) filters gives the solution. The paper also introduces the notion of delay filters that are high-order approximations to the ideal delay and establishes their equivalence to Baher filters. This connection gives novel elementary derivations of Baher filters and their properties. Matlab programs are provided at the end of the paper for the design of filters described in this paper.     

Multiwindow time-varying spectrum with instantaneous bandwidth andfrequency constraints

We build on Cohen's work (Cohen and Lee 1988, 1989; Cohen 1990, 1995) on instantaneous bandwidth and frequency by extending it to a multiwindow framework for polynomial phase signals. Unlike the case with a single spectrogram, which Cohen considered, our multiwindow framework allows one to obtain a time-varying spectral estimate that simultaneously satisfies instantaneous bandwidth and frequency constraints. We then develop a method utilizing this new multiwindow time-varying spectral technique for estimating the instantaneous frequency of a signal. The method is computationally simple, asymptotically unbiased for noise-free signals, and provides a signal-to-noise ratio (SNR) improvement of more than 3 dB over other estimators, including the cross-polynomial Wigner distribution method, for quadratic and cubic FM signals     

Research on slow light transmission with wide bandwidth and large normalized delay bandwidth product

In order to obtain excellent slow-light performance, we propose a photonic crystal waveguide (PCW) that introduces extrinsic defect rods in the center row of a complete square lattice rotated 45° counterclockwise and the second row adjacent to it. The continuous cavities are used as a storage of electromagnetic energy and a speed reducer of light speed, used for slow optical transmission in PCWs. Then, the plane wave expansion method (PWE) is used to study the slow light transmission characteristics of the proposed structure, and the influence of the structure parameters on the slow light performance is analyzed. Finally, the bandwidth is obtained at 23.37 nm when the normalized delay bandwidth product (NDBP) reaches 0.40. In addition, considering the effect of material properties on slow light performance, NDBP is further optimized to 0.44, and the bandwidth reaches 27.63 nm. A simple but universal structure is designed to provide an important theoretical basis for further improving the storage capacity with high bandwidth and high NDBP slow light.     

QoS multicast routing with delay constraints

Proliferation of group-based real-time applications, such as online games and video conferencing has motivated research into QoS multicast routing. These types of applications require consideration of both source-to-destination delay (i.e., packet delay from the source to all destinations) and inter-destination delay variation (i.e., the difference in packet delay from the source to different destinations) constraints. In this paper, we formulate a new combined problem for delay partitioning and multicast routing with source-to-destination delay and inter-destination delay variation constraints in a QoS framework, where a delay dependent cost function is associated with each network link. After identifying the problem asnp-complete, we introduce a Genetic Algorithm (ga) based algorithm that computes a source-based multicast tree which satisfies both constraints with near-optimal cost. We compare differentga schemes using different selection operators and find that the combination of Steady Statega and Remainder Stochastic Sampling selection operator works best for our problem. Simulation results also show that ourga heuristic consistently perfornis better than several other simple heuristics.     

一种时延和时延抖动受约束的启发式多播路由算法

多播路由算法在组播应用中是至关重要的,对视频会议等交互式实时组播业务来说,不仅要考虑时延约束,而且要考虑时延抖动约束。本文提出了一种基于最短时延路径的时延和时延抖动约束的启发式算法,仿真结果表明该算法复杂度较低,而且性能也较好,在算法复杂度和性能之间达到了很好的折中。     

An improved RC model for VLSI interconnects with applications to buffer insertion

A general platform to generate the RC, RLC and RLCG models of interconnects using global approximation method, two-port networks, and asymptotic waveform evaluation (AWE) is presented. Using the delay of transmission-line-modeled interconnects from HSPICE as a bench mark, we show that among all 18 models studied, the π-configuration of AWE-RLC model yields the best accuracy. To reduce complexity subsequently computational cost without sacrificing accuracy, the AWE-RLC model is mapped to a complex RC model using moment matching. The complex RC model is further mapped to an improved RC model utilizing the principle of charge reservation. The improved RC model is employed to estimate the delay of long interconnects with buffer insertion. As compared with the conventional RC model, the improved RC model reduces the delay of interconnects with buffer insertion, the number of buffers, and the size of the buffer by 20.5, 24, and 32 %, respectively.     

Adaptive filtering with bandwidth constraints in the feedback path

This paper introduces a new, adaptive-filter-based controller that shows advantageous properties from the viewpoint of its communication requirement. The algorithm is called signed-error filtered-x LMS (SE-FxLMS). Its novelty is characterized by the fact that it makes possible data compression in the feedback path of adaptive-filter-based control loops in a very simple way. This feature is especially useful in such closed-loop systems where the feedback signals are transmitted over a low-bandwidth communication channel. This is a typical case in so-called networked control systems (NCS), where the communication is carried out over a shared communication channel, e.g., using a wireless sensor network. The paper introduces an analysis of the algorithm as well.     

有时延及时延差别约束的最小代价组播路由问题

本文把有时延、时延差别约束的组播路由问题提到优化的层次上,提出了有时延、时延差别约束的最小代价组播路由优化问题,并证明此问题是NP－complete问题。继而提出了一种基于动态罚函数法的启发式遗传算法以及解该问题,并分析了算法的复杂度。仿真表明,本文算法是有效的、稳定的。在满足两种约束的情况下,能够使网络代价优化。     

Communication over fading channels with delay constraints

We consider a user communicating over a fading channel with perfect channel state information. Data are assumed to arrive from some higher layer application and are stored in a buffer until transmitted. We study adapting the user's transmission rate and power based on the channel state information as well as the buffer occupancy; the objectives are to regulate both the long-term average transmission power and the average buffer delay incurred by the traffic. Two models for this situation are discussed; one corresponding to fixed-length/variable-rate codewords and one corresponding to variable-length codewords. The tradeoff between the average delay and the average transmission power required for reliable communication is analyzed. A dynamic programming formulation is given to find all Pareto optimal power/delay operating points. We then quantify the behavior of this tradeoff in the regime of asymptotically large delay. In this regime, we characterize simple buffer control policies which exhibit optimal characteristics. Connections to the delay-limited capacity and the expected capacity of fading channels are also discussed