Multicasting in deflection-routed all-optical packet-switched networks

Two multicast protocols are proposed for deflection-routed all-optical packet-switched networks. One scheme sends a deflected multicast packet back to the root node while the other sends it back to the deflection point Both schemes can be implemented using demonstrated optical signal processing technology. The performance of the two proposed multicast schemes are compared using Manhattan Street Networks. We found that the back-to-the-root-node scheme performed better than the back-to-the-deflection-node scheme. A hybrid approach can further improve the system performance.published_or_final_versio

Lossless Photonic Switched Networks For Metro-access

We evaluate through computer simulation the performance of Photonic switching OPS/OBS networks of various sizes and configurations, based on a lossless (amplified) photonic switching node experimentally demonstrated previously. The great advantage of photonic switching is transparency to signal rate and format. Thus we propose a basic flexible network, with low-energy consumption and high-efficiency. In simulations traffic load is varied and network parameters such as, average number of hops (ANH), network latency (delay) and packet loss fraction are evaluated. Consistent results for the various configurations are presented, analyzed and discussed; and Interesting conclusions emerge.9773Conference on Optical Metro Networks and Short-Haul Systems VIIIFEB 16-18, 2016San Francisco, C

Static and dynamic properties of small-world connection topologies based on transit-stub networks

Many real complex networks are believed to belong to a class called small-world (SW) networks. SW networks are graphs with high local clustering and small distances between nodes. A standard approach to constructing SW networks consists of varying the probability of rewiring each edge on a regular graph. As the initial substrate for the regular graph some specific topologies are usually selected such as ring-lattices or grids. However, these regular graphs are not suitable for modeling certain hierarchical topologies. A new regular substrate is proposed in this paper. The proposed substrate resembles topologies with certain hierarchical propertiesmore accurately. Then, different dynamics inspired by networking protocols are used to characterize dynamical properties of a network. Measuring transmission times and error rates lead us to consider networks with SW features as the most reliable and fastest, regardless of the routing policies.We thank the MCyT (BFI 2000-015). (RH) was also funded by DE-FG03-96ER14092 and (CA) was supported by ARO-MURI grant DAA655-98-1-0249 during a four month stay at UCSD. We also thank Lev Trimsing for useful discussion

Light-driven transport of plasmonic nanoparticles on demand

Laser traps provide contactless manipulation of plasmonic nanoparticles (NPs) boosting the development of numerous applications in science and technology. The known trapping configurations allow immobilizing and moving single NPs or assembling them, but they are not suitable for massive optical transport of NPs along arbitrary trajectories. Here, we address this challenging problem and demonstrate that it can be handled by exploiting phase gradients forces to both confine and propel the NPs. The developed optical manipulation tool allows for programmable transport routing of NPs to around, surround or impact on objects in the host environment. An additional advantage is that the proposed confinement mechanism works for off-resonant but also resonant NPs paving the way for transport with simultaneous heating, which is of interest for targeted drug delivery and nanolithography. These findings are highly relevant to many technological applications including micro/nano-fabrication, micro-robotics and biomedicine

Quo Vadis - a framework for intelligent routing in large communication networks

Modern communication networks contain hundreds if not thousands of interconnected nodes. Traffic management mechanisms must be able to support a cost-effective, responsive, flexible, robust, customer-oriented high speed communication environment while minimizing the overhead associated with management functions. Conventional traffic management mechanisms for routing and congestion control algorithms entail tremendous resource overhead in storage and update of network state information;Quo Vadis is an evolving framework for intelligent traffic management in very large communication networks. It is designed to exploit topological properties of large networks as well as their spatio-temporal dynamics to optimize multiple performance criteria through cooperation among nodes in the network. It employs a distributed representation of network state information using local load measurements supplemented by a less precise global summary. Routing decisions in Quo Vadis are based on parameterized heuristics designed to optimize various performance metrics in an anticipatory or pro-active as well as compensatory or reactive mode and to minimize the overhead associated with traffic management;The complexity of modern networks in terms of the number of entities, their interaction, and the resulting dynamics make an analytical study often impossible. Hence, we have designed and implemented an object oriented simulation toolbox to facilitate the experimental studies of Quo Vadis. Our efforts to design such a simulation environment were driven by the need to evaluate heuristic routing strategies and knowledge representation as employed by Quo Vadis. The results of simulation experiments within a grid network clearly demonstrate the ability of Quo Vadis to avoid congestion and minimize message delay under a variety of network load conditions;In order to provide a theoretical framework for the design and analytical study of decision mechanisms as employed by Quo Vadis, we draw upon concepts from the field of utility theory. Based on the concept of reward and cost incurred by messages in the network, utility functions which bias routing decisions so as to yield routes that circumvent congested areas have been designed. The existence of utility functions which yield minimum cost routes in uniform cost networks with a single congested node has been proven rigorously

Study of the data acquisition network for the triggerless data acquisition of the LHCb experiment and new particle track reconstruction strategies for the LHCb upgrade

The LHCb experiment will receive a major upgrade by the end of February 2021. This upgrade will allow the recording of proton-proton collision data at $\sqrt{s} = 14\ \text{TeV}$ with an instantaneous luminosity of $2 \cdot 10^{33}\ \text{cm}^{-2}\text{s}^{-1}$, making possible measurements of unprecedented precision in the $b$ and $c$-quark flavour sectors. For taking advantage of the increased luminosity provided, the data acquisition system will receive a substantial upgrade. The upgraded system will be capable of processing the full collision rate of $30\ \text{MHz}$, without any low-level hardware preselection. This new design constraint poses a non-trivial technological challenge, both from a networking and computing point of view. A possible design of a $32\ \text{Tb/s}$ data acquisition network is presented, and low-level network simulations are used to validate the design. Those simulations use an accurate behavioural model developed and optimised for this specific purpose. It is mandatory to optimise the reconstruction algorithms using a computing and physics approach, to perform the online reconstruction of the full $30\ \text{MHz}$ $pp$ collisions rate. A new parametrisation of the charged particles' bending generated by the dipole of the LHCb experiment is presented. The accuracy of the model is tested against Monte Carlo data. This strategy can reduce by a factor four the size of the search windows needed in the SciFi sub-detector. The LookingForward algorithm in the Allen framework uses this model

Design and analysis of a 3-dimensional cluster multicomputer architecture using optical interconnection for petaFLOP computing

In this dissertation, the design and analyses of an extremely scalable distributed multicomputer architecture, using optical interconnects, that has the potential to deliver in the order of petaFLOP performance is presented in detail. The design takes advantage of optical technologies, harnessing the features inherent in optics, to produce a 3D stack that implements efficiently a large, fully connected system of nodes forming a true 3D architecture. To adopt optics in large-scale multiprocessor cluster systems, efficient routing and scheduling techniques are needed. To this end, novel self-routing strategies for all-optical packet switched networks and on-line scheduling methods that can result in collision free communication and achieve real time operation in high-speed multiprocessor systems are proposed. The system is designed to allow failed/faulty nodes to stay in place without appreciable performance degradation. The approach is to develop a dynamic communication environment that will be able to effectively adapt and evolve with a high density of missing units or nodes. A joint CPU/bandwidth controller that maximizes the resource allocation in this dynamic computing environment is introduced with an objective to optimize the distributed cluster architecture, preventing performance/system degradation in the presence of failed/faulty nodes. A thorough analysis, feasibility study and description of the characteristics of a 3-Dimensional multicomputer system capable of achieving 100 teraFLOP performance is discussed in detail. Included in this dissertation is throughput analysis of the routing schemes, using methods from discrete-time queuing systems and computer simulation results for the different proposed algorithms. A prototype of the 3D architecture proposed is built and a test bed developed to obtain experimental results to further prove the feasibility of the design, validate initial assumptions, algorithms, simulations and the optimized distributed resource allocation scheme. Finally, as a prelude to further research, an efficient data routing strategy for highly scalable distributed mobile multiprocessor networks is introduced

Cost studies of Multipurpose Large Launch Vehicles. Volume 2 - Half size vehicle /MLLV/ conceptual design Final report

Conceptual design of half-size multipurpose large launch vehicle with liquid propellant main and injection stages and solid propellant strap-on stag