MAINTENANCE AND POWER SAVINGS IN LARGE MULTIPLANE DATA CENTER FABRICS

Within a Data Center (DC) environment network upgrades are often challenging and may consume significant amounts of time and network administrator resources. Additionally, DC networks tend to consume large amounts of energy and dissipate considerable amounts of heat that can be challenging to evacuate in densely populated fabrics. To address these challenges techniques are presented herein that support, possibly among other things, the construction of a network model; the use of Machine Learning (ML) to predict low and high load periods and, in low periods, determining the ratio of resources that may be taken offline; updating the equal-cost multi-path (ECMP) rules in the leaves to avoid selected planes so as to take the full plane spine and super-spine nodes offline; and upgrading one of the super-spine nodes and then one of the spine nodes to ensure that there is always a rollback path in case of a problem. If the upgrading is successful, the techniques may include proceeding to upgrade all of the super-spine nodes and all of the spine nodes

MULTICAST OPERATIONS, ADMINISTRATION, AND MANAGEMENT (OAM) TECHNIQUES UTILIZING PROTOCOL INDEPENDENT MULTICAST (PIM) FLOODING MECHANISMS

Multicast networks are often complex and to provide a visualization of traffic flows within a multicast network often involves the full knowledge of a distribution tree for the network. Further, isolating problems within a multicast network can involve tracing of multiple nodes across the distribution tree. Techniques presented provide efficient multicast tree discovery through Protocol Independent Multicast (PIM) flooding mechanisms, which can be further used to facilitate network visualizations and fault isolation within a network

Distributed Quantum Computation with Minimum Circuit Execution Time over Quantum Networks

Present quantum computers are constrained by limited qubit capacity and restricted physical connectivity, leading to challenges in large-scale quantum computations. Distributing quantum computations across a network of quantum computers is a promising way to circumvent these challenges and facilitate large quantum computations. However, distributed quantum computations require entanglements (to execute remote gates) which can incur significant generation latency and, thus, lead to decoherence of qubits. In this work, we consider the problem of distributing quantum circuits across a quantum network to minimize the execution time. The problem entails mapping the circuit qubits to network memories, including within each computer since limited connectivity within computers can affect the circuit execution time. We provide two-step solutions for the above problem: In the first step, we allocate qubits to memories to minimize the estimated execution time; for this step, we design an efficient algorithm based on an approximation algorithm for the max-quadratic-assignment problem. In the second step, we determine an efficient execution scheme, including generating required entanglements with minimum latency under the network resource and decoherence constraints; for this step, we develop two algorithms with appropriate performance guarantees under certain settings or assumptions. We consider multiple protocols for executing remote gates, viz., telegates and cat-entanglements. With extensive simulations over NetSquid, a quantum network simulator, we demonstrate the effectiveness of our developed techniques and show that they outperform a scheme based on prior work by up to 95%

Neottiospora curcumæ sp. Nov.

This article does not have an abstract

Tuning Catalytic Activity and Selectivity in Photocatalysis on Dielectric Cuprous Oxide Particles

Dye degradation has been for more than forty years in the scientific community. All these studies have primarily focused on breaking various dyes using catalysts driven by either light or heat. Most studies started to focus on metal-oxides after the discovery of water-splitting by TiO2. Among the many catalysts used plasmonic metal nanostructures have been explored significantly in recent times due to their special property called localized surface plasmon resonances (LSPR). However, facing multiple problems of heat losses and instability, people started to focus on dielectric medium-to-high refractive indexed materials for photonic applications. Most of these dielectric materials have been studied from a physics point of view and less from chemistry. In this work, we have focused on how these materials can be used for tuning selectivity through wavelength-dependent studies by performing methylene blue (MB) dye degradation.Comment: Main draft & SI - 15 page

The life-history of Puccinia blepharidis P. Henn.

The life-history of P. blepharidis was worked out. Pycnia, æcia and telia are produced. Uredia have been omitted in the life-cycle. The æciospores function as the repeating spores. Pycnia develop when infection is through basidiospores. It is felt that P. makenensis and P. boerhaaviœfoliœ recorded on the same host should be merged with P. blepharidis

HITLESS GRACEFUL INSERTION AND REMOVAL OF A ROUTER/SWITCH IN HIGHLY RELIABLE MULTICAST NETWORKS

Currently, the support for graceful insertion and removal (GIR) within a Protocol-Independent Multicast (PIM) environment is limited. As a result, there is no mechanism today that allows for a soft migration of flows when, for example, planning for a maintenance window. Techniques are presented herein that support a hitless upgrade capability that avoids impacting any flow during the upgrade and reload of a spine switch. This is the most difficult task today for customer networks, where multicast flows run all of the time and no disruption is acceptable. Aspects of the presented techniques include a new PIM hello message type-length-value (TLV) option. Such an option may be referred to herein as a progressive graceful insertion and removal (PGIR) capability option

Additions to fungi of Madras-XVI

This article does not have an abstract