We use simulation to study the dynamics of the congestion cent rol algorithm embedded in the BSD 4.3-Tahoe TCP implementation. We investigate the simple case of a few TCP connections, originating and terminating at the same pair of hosts, using a single bottleneck link. This work is an extension

to migrate them to using a set of locally scoped distributed algorithms, possibly incorporating loops that are known to be optimal for some DTN routing scenarios and decouples storage management from global DTN route selection. Simulations show up to a 500 per cent performance improvement using SR

Conventional wisdom holds that contention due to busy-wait synchronization is a major obstacle to scalability and accept-able performance in large shared-memory multiprocessors. We argue the contrary, and present fast, simple algorithms for cent ent ion-free mutual exclusion, reader-writer cent rol

Abstract — The Internet has witnessed a rapid growth in deployment of Web-based streaming applications during re-cent years. In these applications, server should be able to perform end-to-end congestion control and quality adapta-tion to match the delivered stream quality to the average available

the performance of bandwidth estimation tools∗

(MMOGs) can include millions of concurrent players spread across the world and interacting with each other within a single session. Faced with high resource demand variability and with misfit resource renting policies, the current industry practice is to over-provision for each game tens of self-owned data centres, making the market entry affordable only for big companies. Focusing on the reduction of entry and operational costs, we investigate a new dynamic resource provisioning method for MMOG operation using external data centres as low-cost resource providers. First, we identify in the various types of player interaction a source of short-term load variability, which complements the long-term load variability due to the size of the player population. Then, we introduce a combined MMOG processor, network, and memory load model that takes into account both the player interaction type and the population

, the lack of a basic un-derstanding of its essential components has been an obstacle for reliable, efcient, and reusable messaging services in sensornets. To address this problem, one task of this dis-sertation is to identify the basic components of sensornet messaging and to study the re-lated algorithmic

Abstract not found

Abstract not found

Abstract not found