Optical performance of a composite parabolic trough

The effects of receiver misplacement and the trough pointing towards the sun on the concentration characteristics of a composite parabolic trough are discussed. Results from some numerical calculations are presented graphically and discussed.     

Protecting multicast sessions in WDM optical mesh networks

Recent advances in wavelength-division-multiplexing (WDM) technology are expected to facilitate bandwidth-intensive multicast applications. However, a single fiber (bundle) cut on such a network can disrupt the transmission of information to several destination nodes on a "light tree"-based multicast session. Thus, it is imperative to protect multicast sessions e.g., by reserving resources along backup trees. We show that, if a backup tree is directed-link-disjoint to its primary counterpart, then data loss can be prevented in the event of any single link failure. We provide mathematical formulations for efficient routing and wavelength assignment (RWA) of several multicast sessions (including their backup trees for dedicated protection) at a globally optimum cost. We present these formulations for networks equipped with two kinds of multicast-capable switch architectures: one using the opaque (O-E-O) approach and the other using transparent (all-optical) approach. We expand our formulations to accommodate sparse splitting constraints in a network, in which an optical splitter has limited splitting fanout and each node has a limited number of such splitters. We develop a profit-maximizing model that would enable a network operator to be judicious in selecting sessions and simultaneously routing the chosen ones optimally. We illustrate the solutions obtained from solving these optimization problem formulations for a representative-size network.     

DOA: DSR over AODV Routing for Mobile Ad Hoc Networks

We present a lightweight hierarchical routing model, Way Point Routing (WPR), in which a number of intermediate nodes on a route are selected as waypoints and the route is divided into segments by the waypoints. Waypoints, including the source and the destination, run a high-level intersegment routing protocol, while the nodes on each segment run a low-level intrasegment routing protocol. One distinct advantage of our model is that when a node on the route moves out or fails, instead of discarding the whole original route and discovering a new route from the source to the destination, only the two waypoint nodes of the broken segment have to find a new segment. In addition, our model is lightweight because it maintains a hierarchy only for nodes on active routes. On the other hand, existing hierarchical routing protocols such as CGSR and ZRP maintain hierarchies for the entire network. We present an instantiation of WPR, where we use DSR as the intersegment routing protocol and AODV as the intrasegment routing protocol. This instantiation is termed DSR over AODV (DOA) routing protocol. Thus, DSR and AODV—two well-known on-demand routing protocols for MANETs—are combined into one hierarchical routing protocol and become two special cases of our protocol. Furthermore, we present two novel techniques for DOA: one is an efficient loop detection method and the other is a multitarget route discovery. Simulation results show that DOA scales well for large networks with more than 1,000 nodes, incurring about 60 percent-80 percent less overhead than AODV, while other metrics are better than or comparable to AODV and DSR.     

Real‐time causal message ordering in multimedia systems

Messages that are sent to and received by multiple sites need to have a consistent order imposed by all sites. Causal ordering allows the cause and effect relations of messages to be maintained. This paper presents an algorithm that ensures that multimedia data with real‐time deadlines are delivered to the application layer in causal order. The algorithm is designed to ensure that any message that arrives at a destination site before its deadline will be delivered to the application before the message expires. In addition, by focusing on a form of causal ordering violations caused by “the triangle inequality”, this algorithm has a low overhead with respect to the amount of information that must be appended to each message. This revised version was published online in June 2006 with corrections to the Cover Date.     

Route optimization in mobile ATM networks

This paper presents an algorithm for optimizing the route of a connection that becomes suboptimal due to operations such as handoffs and location-based reroutes, and applies this algorithm to the handoff management problem in mobile ATM (Asynchronous Transfer Mode) networks based on the PNNI (Private Network-to-Network Interface) standard. The route optimization algorithm uses hierarchical route information of the connection and summarized topology and loading information of the network to determine a “crossover node” such that adjusting the connection from that crossover node results in an optimally routed connection. Handoff management schemes that perform local rerouting of connections have been proposed in order to support fast handoffs. These methods result in suboptimally routed connections. In this paper, we demonstrate how this route optimization algorithm can be used to optimize the route of a connection after such a handoff is executed, as the second phase of a two-phase handoff scheme. This route optimization procedure can also be executed as part of the handoff procedure resulting in a one-phase handoff scheme. Applying this route optimization algorithm, we propose two one-phase schemes, the one-phase optimal scheme and the one-phase minimal scheme. A comparative performance analysis of one- and two-phase handoff schemes is presented. Measures of comparison are handoff latency and the amount of network resources used by a connection. Handoff latency in the one-phase optimal scheme is greater than that in the two-phase schemes, and handoff latency in the one-phase minimal scheme is smaller than that in the two-phase schemes. The one-phase methods show a significant increase in efficiency of the connection compared to the two-phase methods. This revised version was published online in June 2006 with corrections to the Cover Date.     

An experimentally validated thermo-mechanical model for the prediction of thermal contact conductance

A predictive model for estimating thermal contact conductance between two nominally flat metallic rough surfaces has been developed and experimentally validated. The predictive model consists of two complementary parts, the first of which is a surface deformation analysis to calculate the actual area of contact for each contact spot, while the second accounts for the effects of constriction resistance and gas gap conductance between the contacting surfaces. A surface characterization technique is developed which generates an equivalent 3-D surface profile from multiple 2-D profiles and determines the unique wavelengths of importance for the surface deformation and constriction resistance models. For given surface profiles and material properties of two contacting surfaces, and a specified contact pressure, the surface characterization technique filters out non-essential wavelengths on the surface, after which the surface deformation analysis calculates the deformation and contact area of each contacting asperity by considering three different modes of deformation, namely, elastic, elastic–plastic, and plastic. The constriction resistance model is then used to calculate the constriction resistance for each contacting asperity based on the area of contact and radius of curvature of the asperity. The constriction resistance values for all the contacting asperities are then used to calculate the total thermal contact conductance. An experimental facility has also been constructed to measure thermal contact conductance of interfaces to verify the results of the predictive model. Good agreement has been found between the model predictions and experimental measurements, validating the modeling approach.     

SIVA: A System for Coverage-Directed State Space Search

We introduce SImulation Verification with Augmentation (SIVA), a tool for coverage-directed state space search on digital hardware designs. SIVA tightly integrates simulation with symbolic techniques for efficient state space search. Specifically, the core algorithm uses a combination of ATPG and BDDs to generate directed input vectors, i.e., inputs which cover behavior not excited by simulation. We also present approaches to automatically generate lighthouses that guide the search towards hard-to-reach coverage goals. Experiments demonstrate that our approach is capable of achieving significantly greater coverage than either simulation or symbolic techniques in isolation.     

Cost analysis of a multi-component parallel redundant complex system with overloading effect and waiting under critical human error

The cost analysis of a multi-component parallel redundant complex system is considered, incorporating the concept of overloading effect and waiting time for repair under critical human error. Failure and waiting times follow an exponential time distribution, whereas repair time follows a general distribution. Using the supplementary variable technique, Laplace transforms of the probabilities of the complex system being in various states have been computed. Some graphs have been plotted to highlight the main results.     

Effect of puffing on oil characteristics ofAmaranth (Rajgeera) seeds

Puffing or popping is a common method of processingAmaranthus cruentus (Syn.Amaranthus paniculatus L. or Rajgeera) grain. Investigations into the effect of this processing treatment have shown the percent unsaturation in the oil to decrease from 75.5% to 62.3%. The maximum effect is on linoleic acid, the quantity of which decreased sharply from 46.8% to 27.0%. Squalene also increased by 15.5%, due to puffing of amaranth seeds.