Shortest node-disjoint paths on random graphs

A localized method to distribute paths on random graphs is devised, aimed at finding the shortest paths between given source/destination pairs while avoiding path overlaps at nodes. We propose a method based on message-passing techniques to process global information and distribute paths optimally. Statistical properties such as scaling with system size and number of paths, average path-length and the transition to the frustrated regime are analyzed. The performance of the suggested algorithm is evaluated through a comparison against a greedy algorithm. © 2014 IOP Publishing Ltd and SISSA Medialab srl.

A Linear Time Algorithm for Computing Longest Paths in Cactus Graphs

ACM Computing Classification System (1998): G.2.2.

Dynamic Determination of Personalized Educational Paths

Report published in the Proceedings of the National Conference on "Education and Research in the Information Society", Plovdiv, May, 2014

Efficient algorithm for routing optimization via statistical mechanics

Many practical routing algorithms are heuristic, adhoc and centralized, rendering generic and optimal path configurations difficult to obtain. Here we study a scenario whereby selected nodes in a given network communicate with fixed routers and employ statistical physics methods to obtain optimal routing solutions subject to a generic cost. A distributive message-passing algorithm capable of optimizing the path configuration in real instances is devised, based on the analytical derivation, and is greatly simplified by expanding the cost function around the optimized flow. Good algorithmic convergence is observed in most of the parameter regimes. By applying the algorithm, we study and compare the pros and cons of balanced traffic configurations to that of consolidated traffic, which provides important implications to practical communication and transportation networks. Interesting macroscopic phenomena are observed from the optimized states as an interplay between the communication density and the cost functions used. © 2013 IEEE.

Automatized Generation of Personalized Learning Paths through Aspects in Multidimensional Spaces

Report published in the Proceedings of the National Conference on "Education and Research in the Information Society", Plovdiv, May, 2016

Impact of the carrier relaxation paths on two-state operation in quantum dot lasers

We study InGaAs QD laser operating simultaneously at ground (GS) and excited (ES) states under 30ns pulsed-pumping and distinguish three regimes of operation depending on the pump current and the carrier relaxation pathways. An increased current leads to an increase in ES intensity and to a decrease in GS intensity (or saturation) for low pump range, as typical for the cascade-like pathway. Both the GS and ES intensities are steadily increased for high current ranges, which prove the dominance of the direct capture pathway. The relaxation oscillations are not pronounced for these ranges. For the mediate currents, the interplay between the both pathways leads to the damped large amplitude relaxation oscillations with significant deviation of the relaxation oscillation frequency from the initial value during the pulse.

How education should link with career paths

How good is your pharmacy practice? And what does “good” look like? Take a look back at the education and training you have received in your career to date. Has it stood you in good stead? Certainly there is a need to establish a model of professional education and development that produces good pharmacists — you should be able to demonstrate your competence regardless of your sector of work. It may help if we move away from the view that excellence in pharmacy practice is primarily defined by where you practise and the kind of job that you do. The Modernising Pharmacy Careers programme’s aspirations to integrate the undergraduate degree with the preregistration training year are bold and to be applauded — provided the outcome delivers changes that are more than superficial. The new model needs to deliver greater integration of education with practice, while retaining an adequate science base. Theory should be put into the context of practice-based, cross-sector learning needs and opportunities. For example, is the classroom really the best environment in which to learn dispensing? Pharmacokinetic theory could be put into context through creatively designed work placements. And it might make more sense to learn patient counselling in a community pharmacy, and so on. Is it resources we lack to make this happen? Or do we lack the collective will to be imaginative, to be radical and to conceive new approaches to professional education? Implicit in this new approach to education is the expectation that pharmacists should teach and mentor and, conversely, that those who teach should also engage in relevant practice. University education must produce graduates whose knowledge and competence are useful to employers. Moreover, graduates must be adequately prepared to enter any area of the profession endowed with professional self-confidence (something, arguably, that needs further development within the pharmacy psyche). Of course, becoming qualified is just the beginning. Post-qualification, pharmacists need structured career paths that foster this professional confidence, support learning and ensure recognition. To this end, the Royal Pharmaceutical Society-led professional curriculum group is working to define knowledge, skills and experience for all areas of advanced practice. More than ever, the profession needs to adopt a culture of learning, teaching and practice research that is unified. The question is: how do we move away from merely collecting qualifications (trophies) to developing meaningful careers? Pharmacists in all areas and at all levels of the profession need to consider their own willingness to make this shift. The RPS and MPC are leading the way, but are we following?

Identifying the configurational paths to innovation in SMEs:a fuzzy-set qualitative comparative analysis

Using fuzzy-set qualitative comparative analysis (fsQCA), this study investigates the conditions leading to a higher level of innovation. More specifically, the study explores the impact of inter-organisational knowledge transfer networks and organisations' internal capabilities on different types of innovation in Small to Medium size Enterprises (SMEs) in the high-tech sector. A survey instrument was used to collect data from a sample of UK SMEs. The findings show that although individual factors are important, there is no need for a company to perform well in all the areas. The fsQCA, which enables the examination of the impacts of different combinations of factors, reveals that there are a number of paths to achieve better incremental and radical innovation performance. Companies need to choose the one that is closest to their abilities and fits best with their resources.

Secure routing and trust computation in multihop infrastructureless networks

Today's wireless networks rely mostly on infrastructural support for their operation. With the concept of ubiquitous computing growing more popular, research on infrastructureless networks have been rapidly growing. However, such types of networks face serious security challenges when deployed. This dissertation focuses on designing a secure routing solution and trust modeling for these infrastructureless networks. ^ The dissertation presents a trusted routing protocol that is capable of finding a secure end-to-end route in the presence of malicious nodes acting either independently or in collusion, The solution protects the network from active internal attacks, known to be the most severe types of attacks in an ad hoc application. Route discovery is based on trust levels of the nodes, which need to be dynamically computed to reflect the malicious behavior in the network. As such, we have developed a trust computational model in conjunction with the secure routing protocol that analyzes the different malicious behavior and quantifies them in the model itself. Our work is the first step towards protecting an ad hoc network from colluding internal attack. To demonstrate the feasibility of the approach, extensive simulation has been carried out to evaluate the protocol efficiency and scalability with both network size and mobility. ^ This research has laid the foundation for developing a variety of techniques that will permit people to justifiably trust the use of ad hoc networks to perform critical functions, as well as to process sensitive information without depending on any infrastructural support and hence will enhance the use of ad hoc applications in both military and civilian domains. ^

Venezuela and Chile: Two Opposite Paths of Democratic Consolidation and Economic Development.

In the past 20 years, Chile and Venezuela have followed divergent paths of democratic and economic development. When the Cold War ended, Venezuela was one of the few Latin American countries where democracy had survived the authoritarian wave of the 1960 and 1970s. Heralded in the late 1980s as the most stable democracy and one of the most developed and globalized economies in the region, Venezuela has since experienced deterioration of democratic institutions, political polarization, economic stagnation, and instability. In contrast, Chile has experienced a democratic renaissance since 1990. Rapid economic growth, an increasingly efficient public sector, significant reductions in poverty, and improvements in social programs have all made Chile a regional leader in democratic consolidation and sustainable development. Chile emerges as a success story and Venezuela as a country lagging behind in terms of making progress in economic development and poverty reduction. While Chile has developed a democratic system based on institutions, Venezuela has seen its democracy evolve towards increasing concentration of power on the hands of President Hugo Chávez.

Host and network optimizations for performance enhancement and energy efficiency in data center networks

Modern data centers host hundreds of thousands of servers to achieve economies of scale. Such a huge number of servers create challenges for the data center network (DCN) to provide proportionally large bandwidth. In addition, the deployment of virtual machines (VMs) in data centers raises the requirements for efficient resource allocation and find-grained resource sharing. Further, the large number of servers and switches in the data center consume significant amounts of energy. Even though servers become more energy efficient with various energy saving techniques, DCN still accounts for 20% to 50% of the energy consumed by the entire data center. The objective of this dissertation is to enhance DCN performance as well as its energy efficiency by conducting optimizations on both host and network sides. First, as the DCN demands huge bisection bandwidth to interconnect all the servers, we propose a parallel packet switch (PPS) architecture that directly processes variable length packets without segmentation-and-reassembly (SAR). The proposed PPS achieves large bandwidth by combining switching capacities of multiple fabrics, and it further improves the switch throughput by avoiding padding bits in SAR. Second, since certain resource demands of the VM are bursty and demonstrate stochastic nature, to satisfy both deterministic and stochastic demands in VM placement, we propose the Max-Min Multidimensional Stochastic Bin Packing (M3SBP) algorithm. M3SBP calculates an equivalent deterministic value for the stochastic demands, and maximizes the minimum resource utilization ratio of each server. Third, to provide necessary traffic isolation for VMs that share the same physical network adapter, we propose the Flow-level Bandwidth Provisioning (FBP) algorithm. By reducing the flow scheduling problem to multiple stages of packet queuing problems, FBP guarantees the provisioned bandwidth and delay performance for each flow. Finally, while DCNs are typically provisioned with full bisection bandwidth, DCN traffic demonstrates fluctuating patterns, we propose a joint host-network optimization scheme to enhance the energy efficiency of DCNs during off-peak traffic hours. The proposed scheme utilizes a unified representation method that converts the VM placement problem to a routing problem and employs depth-first and best-fit search to find efficient paths for flows.

Context-Based Customization of Routing Functions for Web GIS Applications

This poster presentation features three route planning applications developed by the Florida International University GIS Center and the Geomatics program at the University of Florida, and outlines their context based differences. The first route planner has been developed for cyclists in three Florida counties, i.e. Miami Dade County, Broward County, and Palm Beach County. The second route planner computes safe pedestrian routes to schools and has been developed for Miami Dade County. The third route planner combines pre-compiled cultural/eco routes and point-to-point route planning for the City of Coral Gables. This poster highlights the differences in design (user interface) and implementation (routing options) between the three route planners as a result of a different application context and target audience.

Cooperative routing for collision minimization in wireless sensor networks

Cooperative communication has gained much interest due to its ability to exploit the broadcasting nature of the wireless medium to mitigate multipath fading. There has been considerable amount of research on how cooperative transmission can improve the performance of the network by focusing on the physical layer issues. During the past few years, the researchers have started to take into consideration cooperative transmission in routing and there has been a growing interest in designing and evaluating cooperative routing protocols. Most of the existing cooperative routing algorithms are designed to reduce the energy consumption; however, packet collision minimization using cooperative routing has not been addressed yet. This dissertation presents an optimization framework to minimize collision probability using cooperative routing in wireless sensor networks. More specifically, we develop a mathematical model and formulate the problem as a large-scale Mixed Integer Non-Linear Programming problem. We also propose a solution based on the branch and bound algorithm augmented with reducing the search space (branch and bound space reduction). The proposed strategy builds up the optimal routes from each source to the sink node by providing the best set of hops in each route, the best set of relays, and the optimal power allocation for the cooperative transmission links. To reduce the computational complexity, we propose two near optimal cooperative routing algorithms. In the first near optimal algorithm, we solve the problem by decoupling the optimal power allocation scheme from optimal route selection. Therefore, the problem is formulated by an Integer Non-Linear Programming, which is solved using a branch and bound space reduced method. In the second near optimal algorithm, the cooperative routing problem is solved by decoupling the transmission power and the relay node se- lection from the route selection. After solving the routing problems, the power allocation is applied in the selected route. Simulation results show the algorithms can significantly reduce the collision probability compared with existing cooperative routing schemes.

Sperimentazione di protocolli di routing su topologie di rete ibride

In questa tesi si è voluto interfacciare dispositivi di nuova generazione (Raspberry Pi), presenti in una topologia di rete già implementata, con dispositivi di vecchia generazione, come Router Cisco e Switch HP. Questi ultimi sono dispositivi fisici, mentre i Raspberry, tramite tool mininet e altre impostazioni, possono generare dispositivi virtuali. Si è quindi applicato un interfacciamento tra le due tipologie di apparati, creando una rete nuova, e adatta come caso a ricoprire le reti attuali, siccome questo è un esempio di come con poche modifiche si può intervenire su qualsiasi rete già operativa. Si sono quindi osservati i criteri generali su cui operano sia i router, che gli switch, e si sono osservati come questi interagiscono con un flusso di dati attraverso vari protocolli, alcuni rifacenti al modello ISO/OSI, altri all'OSPF.

Opportunistic Contact Graph Routing

L'ambiente di questa tesi è quello del Delay and Disruption Tolerant Networks (DTN), un'architettura di rete di telecomunicazioni avente come obiettivo le comunicazioni tra nodi di reti dette “challenged”, le quali devono affrontare problemi come tempi di propagazione elevati, alto tasso di errore e periodi di perdita delle connessioni. Il Bunde layer, un nuovo livello inserito tra trasporto e applicazione nell’architettura ISO/OSI, ed il protocollo ad esso associato, il Bundle Protocol (BP), sono stati progettati per rendere possibili le comunicazioni in queste reti. A volte fra la ricezione e l’invio può trascorrere un lungo periodo di tempo, a causa della indisponibilità del collegamento successivo; in questo periodo il bundle resta memorizzato in un database locale. Esistono varie implementazioni dell'architettura DTN come DTN2, implementazione di riferimento, e ION (Interplanetary Overlay Network), sviluppata da NASA JPL, per utilizzo in applicazioni spaziali; in esse i contatti tra i nodi sono deterministici, a differenza delle reti terrestri nelle quali i contatti sono generalmente opportunistici (non noti a priori). Per questo motivo all’interno di ION è presente un algoritmo di routing, detto CGR (Contact Graph Routing), progettato per operare in ambienti con connettività deterministica. È in fase di ricerca un algoritmo che opera in ambienti non deterministici, OCGR (Opportunistic Contact Graph Routing), che estende CGR. L’obiettivo di questa tesi è quello di fornire una descrizione dettagliata del funzionamento di OCGR, partendo necessariamente da CGR sul quale è basato, eseguire dei test preliminari, richiesti da NASA JPL, ed analizzarne i risultati per verificare la possibilità di utilizzo e miglioramento dell’algoritmo. Sarà inoltre descritto l’ambiente DTN e i principali algoritmi di routing per ambienti opportunistici. Nella parte conclusiva sarà presentato il simulatore DTN “The ONE” e l’integrazione di CGR e OCGR al suo interno.