14245590
RED with optimized dynamic threshold deployment on shared buffer
Prior survey of RED algorithm deployment on multiqueue system with shared buffer was unfair and sensitive to congestion level by statically setting the parameters. In this paper, our goal is to deploy the Random Early Detection (RED) algorithm in routers on shared buffer and solve these problems. A novel buffer management scheme that dynamically adjusts the parameters of RED named RED-ODT is proposed. Simulations under uniform traffic load and nonuniform traffic load are given, the results of which ascertain and demonstrate the superiority of the proposed scheme in terms of low packet drop ratio, satisfying buffer utilization and fairness. Simulation also shows that RED-ODT is insensitive to congestion level.
863906
Per-Flow Queueing by Dynamic Queue Sharing
Per-flow queuing is believed to be able to guarantee advanced Quality of Service (QoS) for each flow. With the dramatic increase of link speed and number of traffic flows, per-flow queuing faces a great challenge since millions of queues need to be maintained for implementation in a traditional sense. In this paper, by setting only a small number of physical queues, we propose a Dynamic Queue Sharing (DQS) mechanism to achieve an equal performance to the pure per-flow queuing with a lower cost. The proposed mechanism is based on an interesting fact that the number of simultaneous active flows in the router buffer is far less than that of in-progress flows. In DQS, a physical queue is dynamically created on-demand when a new flow comes and then dynamically released when the flow temporarily pauses. Hashing and binary sorting tree (or linked list) are combined to manage the mapping between flows and queues, so as to isolate flows in different queues. Theoretical analysis and traces experiments are conducted to evaluate DQS. The results demonstrate that when the parameters are well set, the operation delay is less than two time cycles in average with an extra memory of 16k bits.
15265299
An ultra high throughput and power efficient TCAM-based IP lookup engine
Ternary content-addressable memory (TCAM) is widely used in high-speed route lookup engines. However, restricted by the memory access speed, the route lookup engines for next-generation terabit routers demand exploiting parallelism among multiple TCAMs. Traditional parallel methods always incur excessive redundancy and high power consumption. We propose in this paper an original TCAM-based IP lookup scheme that achieves an ultra high lookup throughput and a high utilization of the memory while being power efficient. In our multichip scheme, we devise a load-balanced TCAM table construction algorithm together with an adaptive load balancing mechanism. The power efficiency is well controlled by decreasing the number of TCAM entries triggered in each lookup operation. Using 133 MHz TCAM chips and given 25% more TCAM entries than the original route table, the proposed scheme achieves a lookup throughput of up to 533 Mpps and is simple for ASIC implementation
14906808
Dynamic data broadcasting with traffic awareness
Data dissemination has significantly served as a scalable data delivery mechanism in wireless networks. However, even though the broadcast traffic has the nature of dynamic changes, most previous research efforts were elaborated upon the premise of static workloads and access patterns without having proper traffic awareness. In this paper, we address the existence of client impatience and accordingly devise an online traffic awareness mechanism based on a novel selective deferment and reflection (SDR) technique to estimate the dynamic workloads and access patterns in a granularity of a broadcast cycle. In comparison with prior probing and feedback approaches, our design is of practical usefulness in that it has low complexity and is light-weight without performance degradation. With various dynamic traffic scenarios, the experimental results show that with an increasing/decreasing workload, the real access frequency distribution is bounded by two specific estimated distributions. This fact in turn suggests us to employ a trigonometric tuning method to further enhance the estimation. In addition, we examine that the mean difference between the estimated access frequency distribution and the real one is very small, consequently indicating the feasibility and reliability of our proposed data broadcast mechanism with traffic awareness.
44360962
Parallel Solution of the Poisson-Boltzmann Equation for Proteins
A fortran code PBSOLVE is created for numerical solution of a linear Poissson-Boltzman equation. Finite difference discretization and successive overrelaxation (SOR) iterations on the sequence of grids are used to obtain the approximate electrostatic potential on the grid. Error control is provided by comparison of solution on nested grids. A parallel versioon of the PBSOLVE which exploits the message passing interface (MPI) has also been constructed. The performances of the program and the efficiency of parallelization have been tested on the small peptide Met-Enkephalin.
123451361
Probabilistic expression analysis on manifolds
In this paper, we propose a probabilistic video-based facial expression recognition method on manifolds. The concept of the manifold of facial expression is based on the observation that the images of all possible facial deformations of an individual make a smooth manifold embedded in a high dimensional image space. An enhanced Lipschitz embedding is developed to embed the aligned face appearance in a low dimensional space while keeping the main structure of the manifold. In the embedded space, a complete expression sequence becomes a path on the expression manifold, emanating from a center that corresponds to the neutral expression. Each path consists of several clusters. A probabilistic model of transition between the clusters and paths is learned through training videos in the embedded space. The likelihood of one kind of facial expression is modeled as a mixture density with the clusters as mixture centers. The transition between different expressions is represented as the evolution of the posterior probability of the six basic paths. The experimental results demonstrate that the probabilistic approach can recognize expression transitions effectively. We also synthesize image sequences of changing expressions through the manifold model.
8145594
Effects of global interconnect optimizations on performance estimation of deep submicron design
In this paper, we quantify the impact of global interconnect optimization techniques that address such design objectives as delay, peak noise, delay uncertainty due to noise, power, and cost. In doing so, we develop a new system-performance simulation model as a set of studies within the MARCO GSRC Technology Extrapolation (GTX) system. We model a typical point-to-point global interconnect and focus on accurate assessment of both circuit and design technology with respect to such issues as inductance, signal line shielding, dynamic delay, buffer placement uncertainty and repeater staggering. We demonstrate, for example, that optimal wire sizing models need to consider inductive effects-and that use of more accurate (-1,3) worst-case capacitive coupling noise switch factors substantially increases peak noise estimates compared to traditional (0,2) bounds. We also find that optimal repeater sizes are significantly smaller than conventional models would suggest, especially when considering energy-delay issues.
14717474
A Novel Approach to Contention Control in IEEE 802.11e-Operated WLANs
In this paper, we devise, in compliance with the IEEE 802.11e protocol, a novel MAC-centric approach, called MAC contention control (MCC), to maximizing the bandwidth utilization and achieving proportional bandwidth allocation. We first show that approaches based on estimating the number of competing nodes and then setting the contention window size may not converge (and in some cases diverge) because of network dynamics. Then, by studying the optimality condition derived in our prior work, we identify two parameters (referred to as control references) that remain approximately constant when the network operates at the optimal operational point, regardless of the number of competing nodes in each AC. We instrument MCC to measure these control references, compare measurement results to their optimal control reference levels, and adjust the packet dequeuing rate from the interface queues in an additive-increase-multiplicative-decrease (AIMD) fashion and with respect to prespecified bandwidth allocation ratio associated with its AC. In some sense, MCC controls the rate of passing packets from the interface queues to to the MAC access function, and thus practically controls the effective number of competing nodes. We have conducted an extensive simulation study, and demonstrated the superiority of MCC to 802.11e in terms of both the achievable network throughput and the capability of achieving proportional bandwidth allocation. This, coupled with the fact that MCC does not require change in firmware and can be practically deployed, makes MCC a viable approach to contention control in IEEE 802.11e-operated WLANs.