Titlebook: Network and Parallel Computing; 8th IFIP Internation Erik Altman,Weisong Shi Conference proceedings 2011 IFIP International Federation for

Extemporize

Elastic Phoenix: Malleable MapReduce for Shared-Memory Systemshoenix workload as it runs can reduce response time by 29% compared to a statically resourced workload. We detail the changes to the Phoenix application programming interface (API) made to support the new capability, and discuss the implementation changes to the Phoenix code base. We show that any a

BIAS

Improved Compact Routing Schemes for Power-Law Networksd compact routing schemes, namely HDLR and HDLR.. Theoretical analysis on random power law graphs shows our schemes can achieve a better space-stretch trade-off than prior compact routing schemes. Simulations conducted on random power law graphs and real-world AS-level Internet graph validate the ef

FOR

Oratory

Towards a Universal Sketch for Origin-Destination Network Measurementspose solution that can not only answer a wide range of queries, but also be able to answer types of queries that were not known .. In particular, we introduce the use of the Conditional Random Sampling (CRS) sketch data structure for succinctly capturing network traffic data between a set of nodes i

周興旺

A Power Adjusting Algorithm on Mobility Control in Mobile Ad Hoc Networksility of MANET by adjusting the transmission power and in the meantime save energy by restarting route discovery periodically to balance the energy consumption on route discovery and packets delivering. It is suggested that PAA can be implemented in the dynamic source routing protocol (DSR). Simulat

PALSY