Mueller / Cao / Wang Scalable Information Systems

4th International ICST Conference, INFOSCALE 2009, Hong Kong, June 10-11, 2009, Revised Selected Papers
1. Auflage 2009
ISBN: 978-3-642-10485-5
Verlag: Springer
Format: PDF
Kopierschutz: 1 - PDF Watermark

E-Book, Englisch, Band 18, 332 Seiten

Reihe: Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering

This book constitutes the proceedings of the 4th International ICST Conference, INFOSCALE 2009, held in Hong Kong in June 2009. Scalability has become a mainstream research area in computer science and information systems in view of the incessant growth of data and knowledge. More than 60 manuscripts were submitted, and the program committee selected 22 papers for presentation on the conference and reproduction in this book. The papers focus on a wide range of scalability issues and new approaches to tackle problems arising from the ever growing size and complexity of information.

Autoren/Hrsg.

Mueller, Peter

Cao, Jian-Nong

Wang, Cho-Li

Inhaltsverzeichnis

1;Preface;5
2;Organization;6
3;Table of Contents;9
4;A Fully Data-Driven Reconfigurable Architecture with Very Coarse-Grained Execution Units;11
4.1;Introduction;11
4.2;Design Consideration;12
4.3;Architecture;14
4.3.1;Array Structure;14
4.3.2;Processing Elements;15
4.3.3;Switch;17
4.4;Reconfiguration;18
4.5;Design Flow;20
4.6;Performance Analysis;20
4.7;Conclusion;21
4.8;References;22
5;Identify Intimate Social Relationship in Blogsphere;24
5.1;Introduction;24
5.2;Related Work;25
5.3;Model Blog Social Network;26
5.3.1;Definition of Circle of Intimate Relationship;27
5.3.2;Identify Intimate Friends Circle Set;28
5.4;Experiment;29
5.5;Conclusions;34
5.6;References;34
6;Local vs. Global Scalability in Ad Hoc and Sensor Networks;36
6.1;Introduction;36
6.2;AMotivating Sample Problem;37
6.3;On a Bottleneck of Scalability;38
6.4;Random Graph Models;41
6.5;Example Models;44
6.6;Threshold Function for Partial Connectivity;46
6.7;Results;47
6.8;Solving the Sample Problem;52
6.9;Conclusion;54
6.10;References;54
7;Measuring IP Address Fragmentation from BGP Routing Dynamics;56
7.1;Introduction;56
7.2;Related Works;57
7.3;Prefix-Distance, Network-Distance and Geographic-Distance;58
7.4;Measuring $D_{p}$ and $D_{g}$;60
7.4.1;Collect Prefix Groups;60
7.4.2;Calculate $D^{g}_{p}$ and $D_{g}$;62
7.5;Measurement Results;62
7.5.1;Clustering Result;62
7.5.2;Prefix-Distance and Geo-Distance in BGP Routing Tables;64
7.6;Conclusion and Future Work;66
7.7;References;66
8;On Improving Network Locality in BitTorrent-Like Systems;68
8.1;Introduction;68
8.2;Related Work;70
8.2.1;BitTorrent Overview;70
8.2.2;Existing Studies on Cross-ISP Traffic;72
8.3;Preliminaries;73
8.4;Peer Collaboration Strategy;74
8.4.1;Biased Neighbor Selection;74
8.4.2;Unique Piece Selection;75
8.4.3;Dynamic Priority Allocation;77
8.5;Experimental Evaluation;78
8.5.1;Methodology;78
8.5.2;Performance Analysis;79
8.6;Conclusions and Future Work;83
8.7;References;84
9;Parallel File Transfer for Grid Economic;86
9.1;Introduction;86
9.2;Related Work;88
9.2.1;Co-Allocation Architecture;88
9.2.2;The Recursive-Adjustment;89
9.2.3;Dynamic Co-Allocation Scheme with Duplicate Assignments;89
9.2.4;Co-Allocation with Server Selection;90
9.3;Research Architecture;90
9.4;Efficient and Economic Parallel File Transfer (EEPT);91
9.4.1;Server Selection and File Decomposition;91
9.4.2;Dynamic File Transfer;93
9.5;Experiments and Performance Analysis;94
9.6;Conclusions and Future Work;98
9.7;References;98
10;Performance Evaluation of Identity and Access Management Systems in Federated Environments;100
10.1;Introduction;100
10.2;Related Work;102
10.3;Methodology;103
10.4;System Model for Identity and Access Management;104
10.4.1;Components;104
10.4.2;Process Model;105
10.5;Evaluation Criteria and Metrics for IAM Systems;106
10.5.1;Performance and Scalability;106
10.5.2;Robustness, Reliability and Autonomy;106
10.5.3;Proliferation and Quality of Security-Relevant Data;107
10.5.4;Integration Costs;107
10.5.5;Costs of Operation;108
10.6;Evaluating Identity and Access Management Systems;108
10.6.1;Scenarios;111
10.6.2;Comparison of the Scenarios;113
10.7;Conclusions and Future Work;116
10.8;References;116
11;Power Consumption Optimization of MPI Programs on Multi-core Clusters;118
11.1;Introduction;118
11.2;Related Works;121
11.3;Challenges of Power Saving in Multi-core CPU Cluster Platform;121
11.3.1;CPU Power Control Structure;122
11.3.2;Network Bandwidth and Cache Structure;122
11.3.3;MPI Environment Support;123
11.4;The Proposed Approach;123
11.4.1;Drop Down Data Transmission Speed;123
11.4.2;Data Broadcasting According to Core Loading;123
11.4.3;Slow Down Lower Loading CPU / Core;124
11.5;Performance Evaluation;125
11.6;Conclusion and Future Works;129
11.7;References;129
12;Scalable Workload Adaptation for Mixed Workload;131
12.1;Introduction;131
12.2;AWMF and Its Prototype Implementantion;132
12.2.1;AWMF;132
12.2.2;Query Scheduler;133
12.3;Overhead of Query Scheduler;134
12.4;The Scalable Approach;137
12.4.1;Choosing Performance Metrics;137
12.4.2;Performance Modeling;137
12.4.3;Utility Functions;138
12.5;Experiments;140
12.5.1;Workload;140
12.5.2;Experimental Results;141
12.5.3;Analysis of the Experimental Results;143
12.6;Conclusions and Future Work;143
12.7;References;144
13;Tuning Performance of P2P Mesh Streaming System Using a Network Evolution Approach;145
13.1;Introduction;145
13.2;Related Works;146
13.3;System Model and Assumption;147
13.4;System Evolution;149
13.4.1;Peer Arrival;149
13.4.2;Parent Adjustment;152
13.4.3;Peer Failure;153
13.5;Simulation;155
13.5.1;Methodology and Metrics;155
13.5.2;System Resilience;156
13.5.3;Startup Latency;158
13.6;Conclusion;160
13.7;References;160
14;HVS-Based Imperceptibility Evaluation for Steganography;162
14.1;Introduction;162
14.2;HVS-Based Imperceptibility Evaluation;163
14.3;HPSNR Based on HVS for Gray Image;163
14.4;CHPSNR Based on HVS for Color Image;165
14.5;Experiment Results;166
14.5.1;Effect of Color on Stego Image’s Quality;166
14.5.2;Effect of Capacity on Stego Image’ s Quality;168
14.5.3;Localized Distortion;169
14.6;Conclusions;170
14.7;References;170
15;Hasten Dynamic Frame Slotted ALOHA Algorithm for Fast Identification in RFID System;172
15.1;Introduction;172
15.2;Aloha Based Tag Anti-collision Protocols;173
15.2.1;Slotted ALOHA (SA) Algorithm;174
15.2.2;Frame Slotted ALOHA (FSA) Algorithm;174
15.2.3;Dynamic Frame Slotted ALOHA (DFSA) Algorithm;174
15.3;Hasten Dynamic Frame Slotted Aloha (HDFSA);177
15.3.1;HDFSA Protocol;177
15.3.2;HDFSA Algorithm;180
15.3.3;Computational Complexity;180
15.4;Results and Analysis;181
15.5;Conclusion;183
15.6;References;183
16;A Lightweight Mechanism to Mitigate Application Layer DDoS Attacks;185
16.1;Introduction;185
16.2;Background and Related Work;187
16.3;Legitimate User and Attacker Model;188
16.3.1;Legitimate User Model;188
16.3.2;Attacker Model;189
16.4;Mitigation by Trust Management;190
16.4.1;License Management;191
16.4.2;Adaptive Trust Computing;192
16.4.3;Trust-Based Scheduler;194
16.4.4;Possible Attacks;195
16.5;Simulation;195
16.5.1;Simulation Setup;196
16.5.2;Results and Analysis;196
16.6;Collaborative Trust Management;199
16.7;Conclusion;199
16.8;References;200
17;A Multidimensional Mapping Mechanism Based Secure Routing Method for DHT;202
17.1;Introduction;202
17.2;Related Work;203
17.2.1;Improving the Routing Algorithm;203
17.2.2;Trust Model;204
17.2.3;Employing Certificate Authority;204
17.3;Multidimensional Mapping Mechanism Based Secure DHT Routing Method;205
17.3.1;Analysis of Typical Routing Attacks;205
17.3.2;Overview of Multidimensional Mapping Mechanism;206
17.3.3;Multidimensional Space Division;207
17.3.4;Quick Location and Initial Security Check;208
17.3.5;Space Conversion Mechanism;209
17.3.6;Routing in Final Dimension Space;210
17.4;Performance Evaluation;211
17.5;Conclusion;213
17.6;References;214
18;A Practical OpenMP Implementation of Bit-Reversal for Fast Fourier Transform;216
18.1;Introduction;216
18.2;Related Work;217
18.3;OpenMP Implemention;218
18.3.1;Brief Overview of Sequential Bit-Reversal;218
18.3.2;Our OpenMP Version of Bit-Reversal;220
18.4;Experiments;222
18.5;Possible Improvement;224
18.6;Conclusions and Future Work;225
18.7;References;225
19;A Scalable, Vulnerability Modeling and Correlating Method for Network Security;227
19.1;Introduction;227
19.2;Security Design Goals;228
19.3;Analysis Model;229
19.4;Vulnerability Correlation;230
19.4.1;Fact Modeling;230
19.4.2;Transition Rule;230
19.4.3;Vulnerability Correlation Algorithm;232
19.4.4;A Case Study;233
19.5;Related Work;235
19.6;Conclusion;236
19.7;References;236
20;A Self-adaptive Fault-Tolerant Mechanism in Wireless Sensor Networks;238
20.1;Introduction;238
20.2;Related Works;239
20.3;Self-adaptive Fault-Tolerant and Optimal Throughput Topology;240
20.3.1;Preliminaries;240
20.3.2;Modified Self-adaptive Fault-Tolerant Method;241
20.3.3;The Relational Function between Transport Attempt Probability and Confidence Rate;242
20.3.4;The Algorithm on Constructing the Fault-Tolerant Optimal Throughput Subgraph;243
20.4;Simulation Results;245
20.4.1;The Effectiveness of FTMAWSS;246
20.4.2;The Effectiveness of Different Topologies;248
20.5;Conclusion;249
20.6;References;250
21;CAWA: Continuous Approximate Where-About Queries;251
21.1;Introduction;251
21.2;Related Work;252
21.2.1;Spatio-Temporal Queries;253
21.2.2;Probabilistic Approaches;253
21.3;CAWA Query Processing;254
21.4;Distributed Design;257
21.5;Performance Study;258
21.5.1;Simulation Environment;260
21.6;Conclusions;266
21.7;References;266
22;Chemical Compounds with Path Frequency Using Multi-Core Technology;268
22.1;Introduction;268
22.2;Related Work;269
22.3;Multi-Core Chemical Compound Inference from Path Frequency (MC-CIPF);271
22.4;Experimental Results;273
22.5;Conclusions;280
22.6;References;280
23;Distance Dimension Reduction on QR Factorization for Efficient Clustering Semantic XML Document Using the QR Fuzzy C-Mean (QR-FCM);282
23.1;Introduction;282
23.2;Preparation for Semantic-Based XML Documents;283
23.3;Path Element Vector Space Model (PEVSM);285
23.3.1;Distance Dimension Reduction (DDR) via the QR Factorization;286
23.3.2;Our Proposed QR-FCM Algorithm;288
23.4;Experiment Result;290
23.4.1;Within-Group-Variance and Between-Group-Variance Using Membership µ;290
23.4.2;Working on Real Data Sets;293
23.5;Conclusion and Future Work;296
23.6;References;296
24;Efficient Top-k Query Algorithms Using K-Skyband Partition;298
24.1;Introduction;298
24.2;Problem Definitions and NRA Algorithm;299
24.3;Dominate-NRA Algorithms;301
24.3.1;Top-$k$ Queries and $K$-Skyband Queries;301
24.3.2;Dominate-NRA Algorithm(DNRA);302
24.3.3;Optimization;305
24.3.4;Pre-computation;307
24.4;Experiments;308
24.4.1;Description of Datasets;309
24.4.2;Experimental Results;310
24.4.3;Summary;313
24.5;Related Works;313
24.6;Conclusions and Future Works;314
24.7;References;314
25;Using Multi-threading and Server Update Pushing to Improve the Performance of VNC for a Wall-Sized Tiled Display Wall;316
25.1;Introduction;316
25.2;Related Work;318
25.3;Applying VNC to a Display Wall;318
25.4;Methodology;320
25.5;Problems When Using VNC for a Display Wall;322
25.5.1;Performance Results for TightVNC;322
25.5.2;Discussion and Conclusion;323
25.6;ImprovingTightVNC;324
25.6.1;From Single-Threading to Multi-threading;324
25.6.2;From Viewer Pull to Server Push;324
25.6.3;Consistency between Tiles;326
25.7;Comparing TightVNC vs. TiledVNC;327
25.7.1;Performance Results;327
25.7.2;Discussion;329
25.8;Conclusion;329
25.9;References;330
26;Author Index;332