A mostly-digital analog scan-out chain for low bandwidth voltage measurement for analog IP test

A method of precise measurement of on-chip analog voltages in a mostly-digital manner, with minimal overhead, is presented. A pair of clock signals is routed to the node of an analog voltage. This analog voltage controls the delay between this pair of clock signals, which is then measured in an all-digital manner using the technique of sub-sampling. This sub-sampling technique, having measurement time and accuracy trade-off, is well suited for low bandwidth signals. This concept is validated by designing delay cells, using current starved inverters in UMC 130nm CMOS process. Sub-mV accuracy is demonstrated for a measurement time of few seconds.

Packet flow analysis in IP networks using data-flow analysis

Static analysis (aka offline analysis) of a model of an IP network is useful for understanding, debugging, and verifying packet flow properties of the network. Data-flow analysis is a method that has typically been applied to static analysis of programs. We propose a new, data-flow based approach for static analysis of packet flows in networks. We also investigate an application of our analysis to the problem of inferring a high-level policy from the network, which has been addressed in the past only for a single router.

Greening the IP Over Optical Backbone Network

In this paper we examine the energy consumption of IP Over Optical WDM Networks. As the number of Internet users increases the Internet expands in reach and capacity. This results in increased energy consumption of the network. Minimizing the power consumption, termed as ``Greening the Internet'', is desirable to help service providers (SP) operate their networks and provide services more efficiently in terms of power consumption. Minimizing the operational power typically depends on the strategy (e. g., lightpath bypass, lightpath non-bypass and traffic grooming) and operations (e. g., electronic domain versus optical domain). We consider a typical optical backbone network model, and develop a model which minimizes the power consumption. Performance calculation shows that our method consumes less power compared to traffic grooming approach.

Characterization of friction at three contact pairs by photoelastic Isotropic point (IP)

Friction coefficient between a circular-disk periphery and V-block surface was determined by introducing the concept of isotropic point (IP) in isochromatic field of the disk under three-point symmetric loading. IP position on the symmetry axis depends on active coefficient of friction during experiment. We extend this work to asymmetric loading of circular disk in which case two frictional contact pairs out of three loading contacts, independently control the unconstrained IP location. Photoelastic experiment is conducted on particular case of asymmetric three-point loading of circular disk. Basics of digital image processing are used to extract few essential parameters from experimental image, particularly IP location. Analytical solution by Flamant for half plane with a concentrated load, is utilized to derive stress components for required loading configurations of the disk. IP is observed, in analytical simulations of three-point asymmetric normal loading, to move from vertical axis to the boundary along an ellipse-like curve. When friction is included in the analysis, IP approaches the center with increase in loading friction and it goes away with increase in support friction. With all these insights, using experimental IP information, friction angles at three contact pairs of circular disk under asymmetric loading, are determined.

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-0 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.

Critical Reappraisal Of Plasticity Index Of Soils

A fundamental approach, based on Gouy-Chapman theory of double layer, has been provided to micromechanistically interpret the plasticity index of soils and their relationship with liquid limit. The relationships between plasticity index and liquid limit, developed earlier, through statistical approaches and critical state concepts, have been reexamined. The statistical analysis of extensive published data has resulted in the relationship, IP = 0.74 (wL - 8). On comparison with other relationships in vogue the proposed equation has been found to give better agreement. From the reappraisal of critical state approaches consistent with the micromechanistic interpretation, the possible range of parameters have been computed and compared with those obtained by statistical means to enhance the credibility of the proposed relationship.

A Petri net model for evaluating packet buffering strategies in a network processor

Previous studies have shown that buffering packets in DRAM is a performance bottleneck. In order to understand the impediments in accessing the DRAM, we developed a detailed Petri net model of IP forwarding application on IXP2400 that models the different levels of the memory hierarchy. The cell based interface used to receive and transmit packets in a network processor leads to some small size DRAM accesses. Such narrow accesses to the DRAM expose the bank access latency, reducing the bandwidth that can be realized. With real traces up to 30% of the accesses are smaller than the cell size, resulting in 7.7% reduction in DRAM bandwidth. To overcome this problem, we propose buffering these small chunks of data in the on chip scratchpad memory. This scheme also exploits greater degree of parallelism between different levels of the memory hierarchy. Using real traces from the internet, we show that the transmit rate can be improved by an average of 21% over the base scheme without the use of additional hardware. Further, the impact of different traffic patterns on the network processor resources is studied. Under real traffic conditions, we show that the data bus which connects the off-chip packet buffer to the micro-engines, is the obstacle in achieving higher throughput.

An optimal weighted-average congestion based pricing scheme for enhanced QoS

Pricing is an effective tool to control congestion and achieve quality of service (QoS) provisioning for multiple differentiated levels of service. In this paper, we consider the problem of pricing for congestion control in the case of a network of nodes under a single service class and multiple queues, and present a multi-layered pricing scheme. We propose an algorithm for finding the optimal state dependent price levels for individual queues, at each node. The pricing policy used depends on a weighted average queue length at each node. This helps in reducing frequent price variations and is in the spirit of the random early detection (RED) mechanism used in TCP/IP networks. We observe in our numerical results a considerable improvement in performance using our scheme over that of a recently proposed related scheme in terms of both throughput and delay performance. In particular, our approach exhibits a throughput improvement in the range of 34 to 69 percent in all cases studied (over all routes) over the above scheme.

Hormones andCuscuta development: interaction of cytokinin and indole-3-acetic acid in the growth and curvature of subapical stem segments

Cuscuta stem (vines) exhibits two modes of growth—longitudinal elongation forming free-hanging vines, or coiling growth to twine around the host. The elongation zone of free-hanging vine extended up to 160 mm from the stem apex and in vivo growth rate (during 8 h of growth) was maximal in the 20-to-40-mm region. While gibberellic acid (GA3) or fusicoccin (FC) could maintain (GA3) or enhance (FC) the growth rate of apical (10 or 25 mm) segments, indole-3-acetic acid (IAA) (10 mgrM) induced growth only in subapical (5–160 mm) segments. In vitro growth rate induced by IAA (10 mgrM) was similar to the in vivo growth rate up to 40 mm. Thereafter, up to 100 mm, IAA induced growth rate exceeded in vivo growth. p ]Subapical segments (sim13 mm) from 5- to 40-mm regions responded to a cytokinin (BA, Z, or iP) or to low IAA (0.1 mgrM) with curved growth, whereas the segments grew straight in the presence of high IAA (10 mgrM). Curvature (measured as the angle subtended at the center of the circle of which the segment formed an arc) induced by BA and low (0.1 mgrM) IAA was greater than either added separately. Besides, segments induced to curve in BA + low-IAA solution could be made to straighten out by transferring to a solution containing high IAA (10 mgrM) with or without BA. Thus in vivo patterns of straight and coiling growth could be mimicked reversibly in vitro by adjusting the relative concentrations of cytokinin and auxin; low auxin and cytokinin induced coiling growth, whereas high auxin and cytokinin induced straight growth. p ]Beyond 40 mm, BA had no growth-promoting or curvative-inducing effect.Cuscuta vine segments thus showed sequential sensitivity to applied hormones, the apical region (0–25 mm) to GA3, the subapical (5–40 mm) region to BA and IAA and the region beyond (40–160 mm) to IAA alone.

Hormones andCuscuta development: In vitro induction of haustoria by cytokinin and its inhibition by other hormones

Cytokinins induced haustoria formation in excised 10-mm segments ofCuscuta vine, the subapical 25-to-50-mm region being most responsive, producing a mean of 4–6 haustoria per segment. The order of effectiveness of cytokinins continuously applied (72 h) was 6-benzylaminopurine (BA) ges isopentenyladenine (iP) Gt zeatin (Z). Ribosides of BA and Z were as effective as the bases, whereas riboside of iP ([9R]iP) was half as effective as iP. Haustoria induction was influenced by weather and seasonal conditions at the time of vine collection; materials obtained on warm, sunny days responded better than those obtained on rainy, cloudy, or cool days. Haustoria were induced equally well all around the segment, and no thigmostimulus was needed for induction. p ]A 10-min pulse of 100 mgrM BA induced half as many haustoria as a 60-min pulse or continuous application of BA. White light inhibited haustoria induction elicited by a short (30-min) pulse of BA, whereas a longer (120-min) BA application overcame this light inhibition. Auxins (IAA or NAA, 1–10 mgrM), gibberellin (GA3, 1–10 mgrM), ethylene (as ethrel, 10–100 mgrM), and abscisic acid (ABA, 100 mgrM) were individually inhibitory (60–80%) with respect to haustoria induction when given continuously with 50 mgrM BA. A 60-min pulse of auxins (10 mgrM), GA3 (100 mgrM), or ethrel (10 mgrM), given at various time intervals during or after a 60-min pulse of 100 mgrM BA, showed that inhibition was maximal (70–95%) between 4 and 16 h of BA application and negligible (GA3) or much reduced (auxin, ethrel) at 20 h, indicating a ldquocommitmentrdquo to haustoria formation by this time.

Queuing strategies for qos management of traffic between lans interconnected by low-speed wan links

We provide a comparative performance evaluation of packet queuing and link admission strategies for low-speed wide area network Links (e.g. 9600 bps, 64 kbps) that interconnect relatively highspeed, connectionless local area networks (e.g. 10 Mbps). In particular, we are concerned with the problem of providing differential quality of service to interLAN remote terminal and file transfer sessions, and throughput fairness between interLAN file transfer sessions. We use analytical and simulation models to study a variety of strategies. Our work also serves to address the performance comparison of connectionless vs. connection-oriented interconnection of CLNS LANS. When provision of priority at the physical transmission level is not feasible, we show, for low-speed WAN links (e.g. 9600 bps), the superiority of connection-oriented interconnection of connectionless LANs, with segregation of traffic streams with different QoS requirements into different window flow controlled connections. Such an implementation can easily be obtained by transporting IP packets over an X.25 WAN. For 64 kbps WAN links, there is a drop in file transfer throughputs, owing to connection overheads, but the other advantages are retained, The same solution also helps to provide throughput fairness between interLAN file transfer sessions. We also provide a corroboration of some of our modelling results with results from an experimental test-bed.

Optimizing Multimedia Experience in a Thin Client Environment for a Resource Constrained Processor

In this paper, we study how TCP and UDP flows interact with each other when the end system is a CPU resource constrained thin client. The problem addressed is twofold, 1) the throughput of TCP flows degrades severely in the presence of heavily loaded UDP flows 2) fairness and minimum QoS requirements of UDP are not maintained. First, we identify the factors affecting the TCP throughput by providing an in-depth analysis of end to end delay and packet loss variations. The results obtained from the first part leads us to our second contribution. We propose and study the use of an algorithm that ensures fairness across flows. The algorithm improves the performance of TCP flows in the presence of multiple UDP flows admitted under an admission algorithm and maintains the minimum QoS requirements of the UDP flows. The advantage of the algorithm is that it requires no changes to TCP/IP stack and control is achieved through receiver window control.

An optimal weighted-average congestion based pricing scheme for enhanced QoS, , LNCS 4882, 2007

Pricing is an effective tool to control congestion and achieve quality of service (QoS) provisioning for multiple differentiated levels of service. In this paper, we consider the problem of pricing for congestion control in the case of a network of nodes under a single service class and multiple queues, and present a multi-layered pricing scheme. We propose an algorithm for finding the optimal state dependent price levels for individual queues, at each node. The pricing policy used depends on a weighted average queue length at each node. This helps in reducing frequent price variations and is in the spirit of the random early detection (RED) mechanism used in TCP/IP networks. We observe in our numerical results a considerable improvement in performance using our scheme over that of a recently proposed related scheme in terms of both throughput and delay performance. In particular, our approach exhibits a throughput improvement in the range of 34 to 69 percent in all cases studied (over all routes) over the above scheme.

Fault-tolerant Video on Demand in RSerPool Architecture

With the advent of Internet, video over IP is gaining popularity. In such an environment, scalability and fault tolerance will be the key issues. Existing video on demand (VoD) service systems are usually neither scalable nor tolerant to server faults and hence fail to comply to multi-user, failure-prone networks such as the Internet. Current research areas concerning VoD often focus on increasing the throughput and reliability of single server, but rarely addresses the smooth provision of service during server as well as network failures. Reliable Server Pooling (RSerPool), being capable of providing high availability by using multiple redundant servers as single source point, can be a solution to overcome the above failures. During a possible server failure, the continuity of service is retained by another server. In order to achieve transparent failover, efficient state sharing is an important requirement. In this paper, we present an elegant, simple, efficient and scalable approach which has been developed to facilitate the transfer of state by the client itself, using extended cookie mechanism, which ensures that there is no noticeable change in disruption or the video quality.

H-DBUG: A High-level Debugging Framework for Protocol Verification using Assertions

The success of an ABV IP depends highly on the associated debugging environment. An efficient debugging environment helps the user to find out the exact location of the failure. Moreover, it provides information to the user in a refined detail of abstraction and permit adequate interaction. It has also been realized that adequate visualization support helps in tracking the behavioral aspects of the Design Under Test (DUT). Currently, the debugging tools provide information in the signal level and do not provide any information about the high-level behavior of the DUT. We present a debugging framework that takes the design specification, assertions and the user intent in a simple format and provides detailed information by processing the design trace on-line, or off-line. We also present a visualization framework to ease the debugging procedure. We have experimented with industrial standard on-chip bus protocols that ensure that this utility can be incorporated successfully in the present functional verification flow.