Design of logical topologies for wavelength-routed optical networks

The problem of designing a logical topology over a wavelength-routed all-optical network (AON) physical topology is studied. The physical topology consists of the nodes and fiber links in the network. On an AON physical topology, we can set up lightpaths between pairs of nodes, where a lightpath represents a direct optical connection without any intermediate electronics. The set of lightpaths along with the nodes constitutes the logical topology. For a given network physical topology and traffic pattern, our objective is to design the logical topology and the routing algorithm so as to minimize the network congestion while constraining the average delay seen by a source-destination pair and the amount of processing required at the nodes (degree of the logical topology). Ignoring the delay constraints can result in fairly convoluted logical topologies with very long delays. On the other hand, in all our examples, imposing it results in a minimal increase in congestion. While the number of wavelengths required to imbed the resulting logical topology on the physical all optical topology is also a constraint in general, we find that in many cases of interest this number can be quite small. We formulate the combined logical topology design and routing problem described above as a mixed integer linear programming problem which we then solve for a number of cases of a six-node network. This programming problem is split into two subproblems: logical topology design, and routing. We then compare the performance of several heuristic topology design algorithms against that of randomly generated topologies, as well as lower bounds     

Efficient network QoS provisioning based on per node trafficshaping

This paper addresses the problem of providing per-connection end-to-end delay guarantees in a high-speed network. We consider a network comprised of store-and-forward packet switches, in which a packet scheduler is available at each output link. We assume that the network is connection oriented and enforces some admission control which ensures that the source traffic conforms to specified traffic characteristics. We concentrate on the class of rate-controlled service (RCS) disciplines, in which traffic from each connection is reshaped at every hop, and develop end-to-end delay bounds for the general case where different reshapers are used at each hop. In addition, we establish that these bounds can also be achieved when the shapers at each hop have the same “minimal” envelope. The main disadvantage of this class of service discipline is that the end-to-end delay guarantees are obtained as the sum of the worst-case delays at each node, but we show that this problem can be alleviated through “proper” reshaping of the traffic. We illustrate the impact of this reshaping by demonstrating its use in designing RCS disciplines that outperform service disciplines that are based on generalized processor sharing (GPS). Furthermore, we show that we can restrict the space of “good” shapers to a family which is characterized by only one parameter. We also describe extensions to the service discipline that make it work conserving and as a result reduce the average end-to-end delays     

Maximum packing channel assignment in cellular networks

We study the performance of the maximum packing channel assignment algorithm (MPA) in channelized cellular networks. MPA is a greedy algorithm, which rejects a call only when it is forced to do so, even if this involves rearrangement of channels assigned to the ongoing calls, without dropping any of them. We ignore handoffs and model the channel reuse constraints in the cellular network by a hypergraph. As the traffic and the number of channels are scaled together, we get a limiting regime where the blocking probability in the cells can be computed by solving a nonlinear optimization problem. The carried traffic in this limiting case is an upper bound on the performance of MPA for practical finite-channel systems. We show that the performance of MPA in a finite-channel cellular system can be closely approximated by considering a simple fixed-routing circuit-switched network. Thus, the finite-channel performance of MPA can be studied using methods well known in the area of circuit-switched networks. We compare the performance of MPA with other asymptotically optimal algorithms and demonstrate its optimality for low and moderate offered traffic. We envisage MPA as a practical channel assignment algorithm, for moderate size systems, and suggest approximations to reduce its complexity     

Routing and wavelength assignment in all-optical networks

Considers routing connections in a reconfigurable optical network using WDM. Each connection between a pair of nodes in the network is assigned a path through the network and a wavelength on that path, such that connections whose paths share a common link in the network are assigned different wavelengths. The authors derive an upper bound on the carried traffic of connections (or equivalently, a lower bound on the blocking probability) for any routing and wavelength assignment (RWA) algorithm in such a network. The bound scales with the number of wavelengths and is achieved asymptotically (when a large number of wavelengths is available) by a fixed RWA algorithm. The bound can be used as a metric against which the performance of different RWA algorithms can be compared for networks of moderate size. The authors illustrate this by comparing the performance of a simple shortest-path RWA (SP-RWA) algorithm via simulation relative to the bound. They also derive a similar bound for optical networks using dynamic wavelength converters, which are equivalent to circuit-switched telephone networks, and compare the two cases. Finally, they quantify the amount of wavelength reuse achievable in large networks using the SP-RWA via simulation as a function of the number of wavelengths, number of edges, and number of nodes for randomly constructed networks as well as de Bruijn networks. They also quantify the difference in wavelength reuse between two different optical node architectures     

Evaluation of Fat Uptake of Polysaccharide Coatings on Deep-Fat Fried Potato Chips by Confocal Laser Scanning Microscopy

In the present investigation, potato slices of 3 cm diameter and 1.5 mm thickness with edible coating (1% Okra and 1% Okra + Carrageen polysaccharide coating solutions) and without any coating treatment (control samples) were fried in sunflower oil at temperatures from 170–180°C for 5 min. Confocal laser scanning microscopy of fried chips was recorded using fluorescence mode of the microscope. We observed gas cells and fat globules in the confocal laser scanning microscopy micrographs of fried chips. The results indicated that both 1% Okra and 1% Okra + Carrageen polysaccharide were effective in reducing the moisture loss and decreasing oil uptake (p ≤ 0.05), but we found the highest effect in those samples treated with 1% Okra + Carrageen polysaccharide coating. These results substantiate the application of edible coating with 1% Okra and 1% Okra + Carrageen polysaccharide to the potato chips resulting in better moisture retention capacity, eventually leading to chips with lower fat content.     

Nanocrystalline γ-Alumina Synthesized by Sonohydrolysis of Alkoxide Precursor in the Presence of Organic Acids: Structure and Morphological Properties

γ-Al₂O₃ nanoparticles with an average size of 5 nm were synthesized by the hydrolysis of aluminum triisopropoxide under the influence of power ultrasound (100 W/cm²) and in the presence of formic or oxalic acids as peptizers, followed by calcination. The structural and morphological properties of the as-prepared precursor hydroxides and calcined nanocrystalline powders were characterized by XRD, SEM, TEM, TGA, IR, and BET. The ultrasound-driven cavitation process has been shown to affect the agglomeration of the precursor nanoparticles by condensation of interparticle hydroxyls. The oxalate anions were strongly adsorbed on the surface of the precursor nanoparticles and thus retarded the ultrasound-driven condensation of interparticle hydroxyls. Formic acid showed a lesser degree of adsorption on the surface of the precursor particles. The ultrasound-driven agglomeration of the primary particles as well as the role of organic modifiers on the microstructural properties of the precursor and the target alumina phases have been discussed.     

Polyphenolic and phytochemical content of Cucumis sativus seeds and study on mechanism of preservation of nutritional and quality outcomes in enriched mayonnaise

Oxidative rancidity in food emulsions leads to a reduction in shelf life. Synthetic antioxidants are widely used in food industry to prevent the development of rancidity. The present study was focussed on investigating the antioxidant potential of Cucumis sativus seeds (CSS) and correlates these findings with mayonnaise enrichment and extends its shelf life. CSS exhibited the highest abundance in phenolic compounds (93.5 ± 0.1 mgGAE g^?1), flavonoids (57.4 ± 0.1 mgQE g^?1), β‐carotene (19.46 ± 0.4 mg carotenoids per 100 g) and high free radical scavenging activity. CSS (200 ppm) and butylated hydroxyanisole (200 ppm) were incorporated in mayonnaise and the oxidative stability was evaluated by peroxide, p‐anisidine and TBARS values during storage at different temperatures. Organoleptic evaluations indicated that CSS enriched sample was recorded the highest overall acceptability. The results from our study will provide scientific basis for CSS as natural preservative against lipid oxidation or food enrichment while developing functional foods.     

Blocking in all-optical networks

We present an analytical technique of very low complexity, using the inclusion-exclusion principle of combinatorics, for the performance evaluation of all-optical, wavelength-division multiplexed networks with no wavelength conversion. The technique is a generalized reduced-load approximation scheme which is applicable to arbitrary topologies and traffic patterns. One of the main issues in computing blocking probabilities in all-optical networks is the significant link load correlation introduced by the wavelength continuity constraint. One of the models we propose takes this into account and gives good results even under conditions with high link load correlation. Through numerous experiments we show that our models can be used to obtain fast and accurate estimates of blocking probabilities in all-optical networks and scale well with the path length and capacity of the network. We also extend one of our models to take into account alternate routing, in the form of Fixed Alternate Routing and Least Loaded Routing.