Optimal network topologies for local search with congestion

The problem of searchability in decentralized complex networks is of great importance in computer science, economy, and sociology. We present a formalism that is able to cope simultaneously with the problem of search and the congestion effects that arise when parallel searches are performed, and we obtain expressions for the average search cost both in the presence and the absence of congestion. This formalism is used to obtain optimal network structures for a system using a local search algorithm. It is found that only two classes of networks can be optimal: starlike configurations, when the number of parallel searches is small, and homogeneous-isotropic configurations, when it is large.

Considering tourist perceptions and network configuration in destination management

The competitiveness of tourism destinations is a relevant issue for tourism studies, moreso, is a key element on the daily basis of tourism destinations. In this sense, the management of tourism destinations is essential to maintain competitive advantages. In this article tourism destination is considered as a relational network, where interaction and cooperation is needed among tourist agents, to achieve major levels of competitive advantage and a more effective destination management system. In addition, the perceptions of tourists are obtained from two main sources. The first one is the social construction of a tourism destination previous to the visit and the second one is obtained from the interaction between tourists and tourism destination agents during the visit. In this sense, the management of tourism destination to emit a homogenous and collective image is a factor that can reduce the gap if dissatisfaction from the previous and real tourist perception. The discussion is centered on the relationship within a destination, between the supply network and the targeted demand, considering these two approaches jointly, to benefit destination management. The main result is a conceptual model that shows how tourism agents and tourists in the tourism destination interact to improve the destination competitiveness

Posicionamiento en redes WiMAX: implementación de una solución real

Aquest projecte estudia la implantació d’un sistema de posicionament a l’interior d’un edifici que compti amb una xarxa WiMAX. Per començar, s’analitzaran les característiques principals d’aquesta tecnología, la configuració de la xarxa amb la que treballarem i s’explicaran els mètodes de posicionament existents avui en dia. Més endavant s’estudiaran els aspectes més importants de la nostra aplicació: l’escenari, l’estimació de la distancia i l’estimació de la posició. Finalment, després d’analitzar els resultats de diverses mesures, es dissenyaran tres mètodes pel càlcul de la posició i s’aplicarà el nostre procediment en més de 15 escenaris de posicionament diferents, amb l’objectiu de comparar els resultats i definir quin dels mètodes aconsegueix un posicionament més precís.

Automatic self-configuration of the logical network using distributed software agents

We present a system for dynamic network resource configuration in environments with bandwidth reservation. The proposed system is completely distributed and automates the mechanisms for adapting the logical network to the offered load. The system is able to manage dynamically a logical network such as a virtual path network in ATM or a label switched path network in MPLS or GMPLS. The system design and implementation is based on a multi-agent system (MAS) which make the decisions of when and how to change a logical path. Despite the lack of a centralised global network view, results show that MAS manages the network resources effectively, reducing the connection blocking probability and, therefore, achieving better utilisation of network resources. We also include details of its architecture and implementation

Complete Analysis of Configuration Rules to Guarantee Reliable Network Security Policies

Peer-reviewed

Internet and the Catalan Universities Network. Research report (synthesis document)

El desenvolupament de les tecnologies de la informació i la comunicació (TIC) durant els darrers quaranta anys del segle XX i la seva incorporació en els diferents àmbits de l'activitat humana ens porten a plantejar-nos, al començament del segle XXI, quines són les transformacions profundes que acompanyen aquests fets i quines són les conseqüències que, com a mínim a curt termini, comporten. El focus d'aquest projecte és l'anàlisi dels processos de transformació de la vida acadèmica universitària en l'àmbit català, la seva vinculació amb la realitat actual i les repercussions que els processos esmentats tenen en la societat en general. De manera més específica, l'objectiu és, en primer lloc, explorar amb una perspectiva global la incorporació d'Internet a les universitats catalanes i, en segon lloc, analitzar els processos de canvi que aquest fet comporta en els processos de formació i recerca de la Universitat Rovira i Virgili (URV). Aquest informe presenta els resultats de tres estudis concrets, cadascun dels quals té uns objectius, una metodologia i una discussió particulars: Configuració de la xarxa d'universitats catalanes: connexió física i projectes compartits, Presència de les universitats catalanes a Internet, i Estudi de cas: la URV.

On optimal computation of MPLS label binding for multipoint-to-point connections

Most network operators have considered reducing Label Switched Routers (LSR) label spaces (i.e. the number of labels that can be used) as a means of simplifying management of underlaying Virtual Private Networks (VPNs) and, hence, reducing operational expenditure (OPEX). This letter discusses the problem of reducing the label spaces in Multiprotocol Label Switched (MPLS) networks using label merging - better known as MultiPoint-to-Point (MP2P) connections. Because of its origins in IP, MP2P connections have been considered to have tree- shapes with Label Switched Paths (LSP) as branches. Due to this fact, previous works by many authors affirm that the problem of minimizing the label space using MP2P in MPLS - the Merging Problem - cannot be solved optimally with a polynomial algorithm (NP-complete), since it involves a hard- decision problem. However, in this letter, the Merging Problem is analyzed, from the perspective of MPLS, and it is deduced that tree-shapes in MP2P connections are irrelevant. By overriding this tree-shape consideration, it is possible to perform label merging in polynomial time. Based on how MPLS signaling works, this letter proposes an algorithm to compute the minimum number of labels using label merging: the Full Label Merging algorithm. As conclusion, we reclassify the Merging Problem as Polynomial-solvable, instead of NP-complete. In addition, simulation experiments confirm that without the tree-branch selection problem, more labels can be reduced

Dynamic bandwidth management as part of an integrated network management system based on distributed agents

We present a system for dynamic network resource configuration in environments with bandwidth reservation and path restoration mechanisms. Our focus is on the dynamic bandwidth management results, although the main goal of the system is the integration of the different mechanisms that manage the reserved paths (bandwidth, restoration, and spare capacity planning). The objective is to avoid conflicts between these mechanisms. The system is able to dynamically manage a logical network such as a virtual path network in ATM or a label switch path network in MPLS. This system has been designed to be modular in the sense that in can be activated or deactivated, and it can be applied only in a sub-network. The system design and implementation is based on a multi-agent system (MAS). We also included details of its architecture and implementation

The achievable region approach to the optimal control of stochastic systems

The achievable region approach seeks solutions to stochastic optimisation problems by: (i) characterising the space of all possible performances(the achievable region) of the system of interest, and (ii) optimisingthe overall system-wide performance objective over this space. This isradically different from conventional formulations based on dynamicprogramming. The approach is explained with reference to a simpletwo-class queueing system. Powerful new methodologies due to the authorsand co-workers are deployed to analyse a general multiclass queueingsystem with parallel servers and then to develop an approach to optimalload distribution across a network of interconnected stations. Finally,the approach is used for the first time to analyse a class of intensitycontrol problems.

Network revenue management with product-specific no-shows

Revenue management practices often include overbooking capacity to account for customerswho make reservations but do not show up. In this paper, we consider the network revenuemanagement problem with no-shows and overbooking, where the show-up probabilities are specificto each product. No-show rates differ significantly by product (for instance, each itinerary andfare combination for an airline) as sale restrictions and the demand characteristics vary byproduct. However, models that consider no-show rates by each individual product are difficultto handle as the state-space in dynamic programming formulations (or the variable space inapproximations) increases significantly. In this paper, we propose a randomized linear program tojointly make the capacity control and overbooking decisions with product-specific no-shows. Weestablish that our formulation gives an upper bound on the optimal expected total profit andour upper bound is tighter than a deterministic linear programming upper bound that appearsin the existing literature. Furthermore, we show that our upper bound is asymptotically tightin a regime where the leg capacities and the expected demand is scaled linearly with the samerate. We also describe how the randomized linear program can be used to obtain a bid price controlpolicy. Computational experiments indicate that our approach is quite fast, able to scale to industrialproblems and can provide significant improvements over standard benchmarks.

Optimal information transmission in organizations: Search and congestion

We propose a stylized model of a problem-solving organization whoseinternal communication structure is given by a fixed network. Problemsarrive randomly anywhere in this network and must find their way to theirrespective specialized solvers by relying on local information alone.The organization handles multiple problems simultaneously. For this reason,the process may be subject to congestion. We provide a characterization ofthe threshold of collapse of the network and of the stock of foatingproblems (or average delay) that prevails below that threshold. We buildupon this characterization to address a design problem: the determinationof what kind of network architecture optimizes performance for any givenproblem arrival rate. We conclude that, for low arrival rates, the optimalnetwork is very polarized (i.e. star-like or centralized ), whereas it islargely homogenous (or decentralized ) for high arrival rates. We also showthat, if an auxiliary assumption holds, the transition between these twoopposite structures is sharp and they are the only ones to ever qualify asoptimal.

On bounds for network revenue management

The Network Revenue Management problem can be formulated as a stochastic dynamic programming problem (DP or the\optimal" solution V *) whose exact solution is computationally intractable. Consequently, a number of heuristics have been proposed in the literature, the most popular of which are the deterministic linear programming (DLP) model, and a simulation based method, the randomized linear programming (RLP) model. Both methods give upper bounds on the optimal solution value (DLP and PHLP respectively). These bounds are used to provide control values that can be used in practice to make accept/deny decisions for booking requests. Recently Adelman [1] and Topaloglu [18] have proposed alternate upper bounds, the affine relaxation (AR) bound and the Lagrangian relaxation (LR) bound respectively, and showed that their bounds are tighter than the DLP bound. Tight bounds are of great interest as it appears from empirical studies and practical experience that models that give tighter bounds also lead to better controls (better in the sense that they lead to more revenue). In this paper we give tightened versions of three bounds, calling themsAR (strong Affine Relaxation), sLR (strong Lagrangian Relaxation) and sPHLP (strong Perfect Hindsight LP), and show relations between them. Speciffically, we show that the sPHLP bound is tighter than sLR bound and sAR bound is tighter than the LR bound. The techniques for deriving the sLR and sPHLP bounds can potentially be applied to other instances of weakly-coupled dynamic programming.

APOE status modulates the changes in network connectivity induced by brain stimulation in non-demented elders.

Behavioral consequences of a brain insult represent an interaction between the injury and the capacity of the rest of the brain to adapt to it. We provide experimental support for the notion that genetic factors play a critical role in such adaptation. We induced a controlled brain disruption using repetitive transcranial magnetic stimulation (rTMS) and show that APOE status determines its impact on distributed brain networks as assessed by functional MRI (fMRI).Twenty non-demented elders exhibiting mild memory dysfunction underwent two fMRI studies during face-name encoding tasks (before and after rTMS). Baseline task performance was associated with activation of a network of brain regions in prefrontal, parietal, medial temporal and visual associative areas. APOE ε4 bearers exhibited this pattern in two separate independent components, whereas ε4-non carriers presented a single partially overlapping network. Following rTMS all subjects showed slight ameliorations in memory performance, regardless of APOE status. However, after rTMS APOE ε4-carriers showed significant changes in brain network activation, expressing strikingly similar spatial configuration as the one observed in the non-carrier group prior to stimulation. Similarly, activity in areas of the default-mode network (DMN) was found in a single component among the ε4-non bearers, whereas among carriers it appeared disaggregated in three distinct spatiotemporal components that changed to an integrated single component after rTMS. Our findings demonstrate that genetic background play a fundamental role in the brain responses to focal insults, conditioning expression of distinct brain networks to sustain similar cognitive performance.

Aggregating and Deploying Network Access Control Policies

Peer-reviewed

Optimal Traffic Grooming in WDM using Lighttours

Recent developments in optical communications have allowed simpler optical devices to improve network resource utilization. As such, we propose adding a lambda-monitoring device to a wavelength-routing switch (WRS) allowing better performance when traffic is routed and groomed. This device may allow a WRS to aggregate traffic over optical routes without incurring in optical-electrical-optical conversion for the existing traffic. In other words, optical routes can be taken partially to route demands creating a sort of "lighttours". In this paper, we compare the number of OEO conversions needed to route a complete given traffic matrix using either lighttours or lightpaths