3,873 research outputs found

    Planning as Optimization: Dynamically Discovering Optimal Configurations for Runtime Situations

    Full text link
    The large number of possible configurations of modern software-based systems, combined with the large number of possible environmental situations of such systems, prohibits enumerating all adaptation options at design time and necessitates planning at run time to dynamically identify an appropriate configuration for a situation. While numerous planning techniques exist, they typically assume a detailed state-based model of the system and that the situations that warrant adaptations are known. Both of these assumptions can be violated in complex, real-world systems. As a result, adaptation planning must rely on simple models that capture what can be changed (input parameters) and observed in the system and environment (output and context parameters). We therefore propose planning as optimization: the use of optimization strategies to discover optimal system configurations at runtime for each distinct situation that is also dynamically identified at runtime. We apply our approach to CrowdNav, an open-source traffic routing system with the characteristics of a real-world system. We identify situations via clustering and conduct an empirical study that compares Bayesian optimization and two types of evolutionary optimization (NSGA-II and novelty search) in CrowdNav

    Intelligent protocol adaptation for enhanced medical e-collaboration

    Get PDF
    Copyright @ 2003 AAAIDistributed multimedia e-health applications have a set specific requirements which must be taken into account effective use is to be made of the limited resources provided by public telecommunication networks. Moreover, there an architectural gap between the provision of network-level Quality of Service (QoS) and user requirements of e-health applications. In this paper, we address the problem bridging this gap from a multi-attribute decision-making perspective in the context of a remote collaborative environment for back pain treatment. We propose intelligent mechanism that integrates user- related requirements with the more technical characterisation Quality of Service. We show how our framework is capable of suggesting appropriately tailored transmission protocols, by incorporating user requirements in the remote delivery e-health solutions

    On the Geographic Location of Internet Resources

    Full text link
    One relatively unexplored question about the Internet's physical structure concerns the geographical location of its components: routers, links and autonomous systems (ASes). We study this question using two large inventories of Internet routers and links, collected by different methods and about two years apart. We first map each router to its geographical location using two different state-of-the-art tools. We then study the relationship between router location and population density; between geographic distance and link density; and between the size and geographic extent of ASes. Our findings are consistent across the two datasets and both mapping methods. First, as expected, router density per person varies widely over different economic regions; however, in economically homogeneous regions, router density shows a strong superlinear relationship to population density. Second, the probability that two routers are directly connected is strongly dependent on distance; our data is consistent with a model in which a majority (up to 75-95%) of link formation is based on geographical distance (as in the Waxman topology generation method). Finally, we find that ASes show high variability in geographic size, which is correlated with other measures of AS size (degree and number of interfaces). Among small to medium ASes, ASes show wide variability in their geographic dispersal; however, all ASes exceeding a certain threshold in size are maximally dispersed geographically. These findings have many implications for the next generation of topology generators, which we envisage as producing router-level graphs annotated with attributes such as link latencies, AS identifiers and geographical locations.National Science Foundation (CCR-9706685, ANI-9986397, ANI-0095988, CAREER ANI-0093296); DARPA; CAID

    The Network Effects of Prefetching

    Full text link
    Prefetching has been shown to be an effective technique for reducing user perceived latency in distributed systems. In this paper we show that even when prefetching adds no extra traffic to the network, it can have serious negative performance effects. Straightforward approaches to prefetching increase the burstiness of individual sources, leading to increased average queue sizes in network switches. However, we also show that applications can avoid the undesirable queueing effects of prefetching. In fact, we show that applications employing prefetching can significantly improve network performance, to a level much better than that obtained without any prefetching at all. This is because prefetching offers increased opportunities for traffic shaping that are not available in the absence of prefetching. Using a simple transport rate control mechanism, a prefetching application can modify its behavior from a distinctly ON/OFF entity to one whose data transfer rate changes less abruptly, while still delivering all data in advance of the user's actual requests

    Simulated Versus Observed Cluster Eccentricity Evolution

    Full text link
    The rate of galaxy cluster eccentricity evolution is useful in understanding large scale structure. Rapid evolution for z<z < 0.13 has been found in two different observed cluster samples. We present an analysis of projections of 41 clusters produced in hydrodynamic simulations augmented with radiative cooling and 43 clusters from adiabatic simulations. This new, larger set of simulated clusters strengthens the claims of previous eccentricity studies. We find very slow evolution in simulated clusters, significantly different from the reported rates of observational eccentricity evolution. We estimate the rate of change of eccentricity with redshift and compare the rates between simulated and observed clusters. We also use a variable aperture radius to compute the eccentricity, r200_{200}. This method is much more robust than the fixed aperture radius used in previous studies. Apparently radiative cooling does not change cluster morphology on scales large enough to alter eccentricity. The discrepancy between simulated and observed cluster eccentricity remains. Observational bias or incomplete physics in simulations must be present to produce halos that evolve so differently.Comment: ApJ, in press, minor revision
    • …
    corecore