Security and policy driven computing

263 Pages·2011·11.883 MB·xv, 274 p. : ill. ; 24 cm\263

by  Lei Liu

Security and
Policy Driven
Computing

Security and
Policy Driven
Computing
Lei Liu
Oracle Corporation
Menlo Park, California, USA
CRC Press
Taylor & Francis Group
6000 Broken Sound Parkway NW, Suite 300
Boca Raton, FL 33487-2742
© 2011 by Taylor and Francis Group, LLC
CRC Press is an imprint of Taylor & Francis Group, an Informa business
No claim to original U.S. Government works
Printed in the United States of America on acid-free paper
10 9 8 7 6 5 4 3 2 1
International Standard Book Number-13: 978-1-4398-2580-8 (Ebook-PDF)
This book contains information obtained from authentic and highly regarded sources. Reasonable
efforts have been made to publish reliable data and information, but the author and publisher cannot
assume responsibility for the validity of all materials or the consequences of their use. The authors and
publishers have attempted to trace the copyright holders of all material reproduced in this publication
and apologize to copyright holders if permission to publish in this form has not been obtained. If any
copyright material has not been acknowledged please write and let us know so we may rectify in any
future reprint.
Except as permitted under U.S. Copyright Law, no part of this book may be reprinted, reproduced,
transmitted, or utilized in any form by any electronic, mechanical, or other means, now known or
hereafter invented, including photocopying, microfilming, and recording, or in any information stor-
age or retrieval system, without written permission from the publishers.
For permission to photocopy or use material electronically from this work, please access www.copy-
right.com (http://www.copyright.com/) or contact the Copyright Clearance Center, Inc. (CCC), 222
Rosewood Drive, Danvers, MA 01923, 978-750-8400. CCC is a not-for-profit organization that pro-
vides licenses and registration for a variety of users. For organizations that have been granted a pho-
tocopy license by the CCC, a separate system of payment has been arranged.
Trademark Notice: Product or corporate names may be trademarks or registered trademarks, and are
used only for identification and explanation without intent to infringe.
Visit the Taylor & Francis Web site at
http://www.taylorandfrancis.com
and the CRC Press Web site at
http://www.crcpress.com
Contents
Preface xiii
1 A Parallel Search Optimization Using an Adaptive
State-Action Index Structure 1
1.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . 1
1.2 Significance of Research . . . . . . . . . . . . . . . . . . . . . 1
1.3 Problem Formulation . . . . . . . . . . . . . . . . . . . . . . 2
1.3.1 Task environment formulation. . . . . . . . . . . . . . 4
1.3.2 Goal formulation . . . . . . . . . . . . . . . . . . . . . 4
1.3.3 Problem formulation . . . . . . . . . . . . . . . . . . . 4
1.4 Review of Literature . . . . . . . . . . . . . . . . . . . . . . . 5
1.5 Contribution . . . . . . . . . . . . . . . . . . . . . . . . . . . 7
1.6 Methodology . . . . . . . . . . . . . . . . . . . . . . . . . . . 8
1.7 Evaluation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 16
1.8 Experimental Study . . . . . . . . . . . . . . . . . . . . . . . 18
1.8.1 Test selection . . . . . . . . . . . . . . . . . . . . . . . 19
1.8.2 Test description. . . . . . . . . . . . . . . . . . . . . . 19
1.8.3 Test sample analysis . . . . . . . . . . . . . . . . . . . 21
1.9 Discussion . . . . . . . . . . . . . . . . . . . . . . . . . . . . 26
1.9.1 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . 27
References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 28
2 A Method of Policy Discovery for Storage and
Data Management 31
2.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . 31
2.1.1 Background . . . . . . . . . . . . . . . . . . . . . . . . 31
2.1.2 Review of literature . . . . . . . . . . . . . . . . . . . 32
2.2 Problem Analysis . . . . . . . . . . . . . . . . . . . . . . . . 34
2.2.1 State representation . . . . . . . . . . . . . . . . . . . 35
2.2.2 Relation representation . . . . . . . . . . . . . . . . . 37
2.2.3 Policy representation . . . . . . . . . . . . . . . . . . . 37
2.2.4 Activity representation. . . . . . . . . . . . . . . . . . 37
2.2.5 Activity space . . . . . . . . . . . . . . . . . . . . . . 38
2.2.6 Upper ontology of policies . . . . . . . . . . . . . . . . 38
2.2.7 Semantics of policies . . . . . . . . . . . . . . . . . . . 41
v
vi Contents
2.3 Method of Policy Discovery . . . . . . . . . . . . . . . . . . . 42
2.3.1 Continuous policies . . . . . . . . . . . . . . . . . . . . 42
2.3.2 Discrete policies . . . . . . . . . . . . . . . . . . . . . 43
2.3.3 Simulator . . . . . . . . . . . . . . . . . . . . . . . . . 44
2.3.4 Assign values to relations . . . . . . . . . . . . . . . . 45
2.3.5 Conflict relations . . . . . . . . . . . . . . . . . . . . . 45
2.3.6 Compute uncertainty. . . . . . . . . . . . . . . . . . . 46
2.3.7 Hierarchy of policy relational model . . . . . . . . . . 47
2.3.8 Granularity of relations . . . . . . . . . . . . . . . . . 47
2.3.9 Relevance of information. . . . . . . . . . . . . . . . . 47
2.3.10 Parameter estimation . . . . . . . . . . . . . . . . . . 48
2.3.11 Biological model . . . . . . . . . . . . . . . . . . . . . 48
2.3.12 Policy decomposition . . . . . . . . . . . . . . . . . . . 49
2.4 Performance Evaluation . . . . . . . . . . . . . . . . . . . . . 49
2.5 Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50
2.5.1 Closure . . . . . . . . . . . . . . . . . . . . . . . . . . 50
References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 50
3 Knowledge-Based Policy Discovery for Storage and
Data Management 53
3.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . 53
3.1.1 Background . . . . . . . . . . . . . . . . . . . . . . . . 53
3.1.2 Review of literature . . . . . . . . . . . . . . . . . . . 55
3.2 Problem Analysis . . . . . . . . . . . . . . . . . . . . . . . . 56
3.2.1 Syntax . . . . . . . . . . . . . . . . . . . . . . . . . . . 56
3.2.2 Semantics . . . . . . . . . . . . . . . . . . . . . . . . . 57
3.3 Method of Discovery . . . . . . . . . . . . . . . . . . . . . . . 59
3.3.1 Upper ontology . . . . . . . . . . . . . . . . . . . . . . 59
3.3.2 Perception specification . . . . . . . . . . . . . . . . . 59
3.3.3 Action specification . . . . . . . . . . . . . . . . . . . 60
3.3.4 Environment specification . . . . . . . . . . . . . . . . 61
3.3.5 Knowledge base. . . . . . . . . . . . . . . . . . . . . . 63
3.3.6 Policy aspect inference algorithm . . . . . . . . . . . . 63
3.4 Performance Evaluation . . . . . . . . . . . . . . . . . . . . . 64
3.4.1 Soundness . . . . . . . . . . . . . . . . . . . . . . . . . 64
3.4.2 Completeness . . . . . . . . . . . . . . . . . . . . . . . 65
3.4.3 Time complexity . . . . . . . . . . . . . . . . . . . . . 65
3.4.4 Space complexity . . . . . . . . . . . . . . . . . . . . . 66
3.4.5 Experiment . . . . . . . . . . . . . . . . . . . . . . . . 66
3.5 Conclusions . . . . . . . . . . . . . . . . . . . . . . . . . . . . 70
3.6 Closure . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 71
References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 71
4 Stabilizing Read–Write Throughput of Transactional
Memory for Contention Management 75
4.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . 75
4.1.1 Background . . . . . . . . . . . . . . . . . . . . . . . . 75
Contents vii
4.1.2 Why STM performance is important . . . . . . . . . . 75
4.1.3 What has been done . . . . . . . . . . . . . . . . . . . 76
4.1.4 Open issues . . . . . . . . . . . . . . . . . . . . . . . . 76
4.2 Problem Statement and Goal . . . . . . . . . . . . . . . . . . 77
4.2.1 Problem formulation . . . . . . . . . . . . . . . . . . . 77
4.2.2 Statement of problem . . . . . . . . . . . . . . . . . . 82
4.3 Brief Review of the Literature . . . . . . . . . . . . . . . . . 83
4.3.1 Fourier analysis . . . . . . . . . . . . . . . . . . . . . . 83
4.3.2 Wave equation . . . . . . . . . . . . . . . . . . . . . . 84
4.3.3 Vector calculus . . . . . . . . . . . . . . . . . . . . . . 84
4.3.4 Ordinary statistics . . . . . . . . . . . . . . . . . . . . 85
4.3.5 Random matrices . . . . . . . . . . . . . . . . . . . . . 86
4.3.6 Qualitative analysis . . . . . . . . . . . . . . . . . . . 86
4.3.7 Lattice models . . . . . . . . . . . . . . . . . . . . . . 87
4.3.8 Controlling chaos . . . . . . . . . . . . . . . . . . . . . 87
4.3.9 KAM theorem . . . . . . . . . . . . . . . . . . . . . . 87
4.4 Approach . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 87
4.4.1 Physical assumption . . . . . . . . . . . . . . . . . . . 87
4.4.2 Information-theoretical description . . . . . . . . . . . 88
4.4.3 Evaluation . . . . . . . . . . . . . . . . . . . . . . . . 91
4.4.4 Dynamics . . . . . . . . . . . . . . . . . . . . . . . . . 93
4.4.5 Discrete control . . . . . . . . . . . . . . . . . . . . . . 94
4.4.6 Cost inner product . . . . . . . . . . . . . . . . . . . . 95
4.4.7 Throughput convergence . . . . . . . . . . . . . . . . . 95
4.4.8 Experiments . . . . . . . . . . . . . . . . . . . . . . . 95
4.5 Barriers and Issues . . . . . . . . . . . . . . . . . . . . . . . 99
4.5.1 Errors of simultaneous measurement . . . . . . . . . . 99
4.5.2 Conjecture of partition function. . . . . . . . . . . . . 99
4.5.3 Error detection of entangled states . . . . . . . . . . . 100
References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 100
5 Parallel Search Optimization for Storage Virtualization 103
5.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . 103
5.2 Significance of Research . . . . . . . . . . . . . . . . . . . . . 104
5.3 Problem Formulation . . . . . . . . . . . . . . . . . . . . . . 105
5.3.1 Task environment formulation. . . . . . . . . . . . . . 108
5.3.2 Goal formulation . . . . . . . . . . . . . . . . . . . . . 108
5.4 Review of Literature . . . . . . . . . . . . . . . . . . . . . . . 110
5.5 Methodology . . . . . . . . . . . . . . . . . . . . . . . . . . . 114
5.5.1 Data abstraction . . . . . . . . . . . . . . . . . . . . . 115
5.5.2 Data parallelism . . . . . . . . . . . . . . . . . . . . . 116
5.6 Evaluation . . . . . . . . . . . . . . . . . . . . . . . . . . . . 119
5.7 Experimental Study . . . . . . . . . . . . . . . . . . . . . . . 121
5.7.1 Analysis . . . . . . . . . . . . . . . . . . . . . . . . . . 121
5.7.2 Testbed setup . . . . . . . . . . . . . . . . . . . . . . . 122
5.7.3 Discussion on parallelism . . . . . . . . . . . . . . . . 123
viii Contents
5.7.4 Initial states . . . . . . . . . . . . . . . . . . . . . . . 126
5.7.5 Goal states . . . . . . . . . . . . . . . . . . . . . . . . 128
5.7.6 Data samples . . . . . . . . . . . . . . . . . . . . . . . 128
5.7.7 Performance metrics . . . . . . . . . . . . . . . . . . . 128
5.8 Discussion . . . . . . . . . . . . . . . . . . . . . . . . . . . . 129
5.8.1 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . 131
References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 132
6 Finite Automata for Evaluating Testbed
Resource Contention 135
6.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . 135
6.1.1 Background . . . . . . . . . . . . . . . . . . . . . . . . 135
6.2 Problem Analysis . . . . . . . . . . . . . . . . . . . . . . . . 136
6.2.1 Contribution . . . . . . . . . . . . . . . . . . . . . . . 139
6.3 Review of Literature . . . . . . . . . . . . . . . . . . . . . . . 140
6.4 Methodology . . . . . . . . . . . . . . . . . . . . . . . . . . . 141
6.5 Performance Evaluation . . . . . . . . . . . . . . . . . . . . . 142
6.6 Implementation . . . . . . . . . . . . . . . . . . . . . . . . . 144
6.7 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . 146
References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 146
7 Adaptive Buffer Tuning for Data Intensive
Algebraic Operations 149
7.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . 149
7.1.1 Background . . . . . . . . . . . . . . . . . . . . . . . . 149
7.2 Significance of Work . . . . . . . . . . . . . . . . . . . . . . . 150
7.3 Problem Analysis . . . . . . . . . . . . . . . . . . . . . . . . 151
7.4 Contribution . . . . . . . . . . . . . . . . . . . . . . . . . . . 153
7.5 Methodology . . . . . . . . . . . . . . . . . . . . . . . . . . . 154
7.6 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . 159
References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 159
8 A Quantum Method of Representing Recurring
Data Deduplication Policy States 161

8.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . 161
8.2 Problem Formulation . . . . . . . . . . . . . . . . . . . . . . 162
8.2.1 State representation using momentum basis . . . . . . 162
8.2.2 State representation using orthogonal basis . . . . . . 163
8.2.3 Policy vector space . . . . . . . . . . . . . . . . . . . . 164
8.2.4 Statement of problem . . . . . . . . . . . . . . . . . . 165
8.3 Review of Literature . . . . . . . . . . . . . . . . . . . . . . . 165
8.3.1 Fourier analysis . . . . . . . . . . . . . . . . . . . . . . 165
8.3.2 Vector expansion method . . . . . . . . . . . . . . . . 166
8.3.3 Ordinary statistics . . . . . . . . . . . . . . . . . . . . 166
8.3.4 Random matrices . . . . . . . . . . . . . . . . . . . . . 167
Contents ix
8.4 Methodology . . . . . . . . . . . . . . . . . . . . . . . . . . . 167
8.4.1 Measuring job states . . . . . . . . . . . . . . . . . . . 167
8.4.2 Compute schedule states . . . . . . . . . . . . . . . . . 168
8.4.3 Compute policy states . . . . . . . . . . . . . . . . . . 168
8.4.4 Information theoretical description . . . . . . . . . . . 169
8.5 Implementation . . . . . . . . . . . . . . . . . . . . . . . . . 169
8.5.1 Structure of policy state . . . . . . . . . . . . . . . . . 169
8.5.2 Policy state persistence model. . . . . . . . . . . . . . 171
8.6 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . 172
References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 173
9 QAM—Quantum Availability Mechanics without Recovery
for Storage and Data Management 175
9.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . 175
9.1.1 Nonreversible operations . . . . . . . . . . . . . . . . . 175
9.1.2 Reversible operations . . . . . . . . . . . . . . . . . . 176
9.2 Problem Formulation . . . . . . . . . . . . . . . . . . . . . . 176
9.2.1 State representation using canonical basis . . . . . . . 176
9.2.2 Separable states . . . . . . . . . . . . . . . . . . . . . 176
9.2.3 Statement of problem . . . . . . . . . . . . . . . . . . 177
9.2.4 Goal statement . . . . . . . . . . . . . . . . . . . . . . 177
9.3 Review of Possible Solutions . . . . . . . . . . . . . . . . . . 177
9.3.1 Clustering . . . . . . . . . . . . . . . . . . . . . . . . . 178
9.3.2 Move or backup . . . . . . . . . . . . . . . . . . . . . 178
9.3.3 Evolution with wave mechanics . . . . . . . . . . . . . 178
9.3.4 Transactional management . . . . . . . . . . . . . . . 178
9.3.5 Data persistence . . . . . . . . . . . . . . . . . . . . . 178
9.3.6 Cloning . . . . . . . . . . . . . . . . . . . . . . . . . . 179
9.3.7 Multicast with synchronous computation . . . . . . . 179
9.3.8 Quantum teleportation . . . . . . . . . . . . . . . . . 179
9.4 Methodology . . . . . . . . . . . . . . . . . . . . . . . . . . . 180
9.4.1 Throughput trajectory . . . . . . . . . . . . . . . . . . 180
9.4.2 State encoding . . . . . . . . . . . . . . . . . . . . . . 180
9.4.3 Linear blocking . . . . . . . . . . . . . . . . . . . . . . 181

9.4.4 Job decomposition and composition . . . . . . . . . . 182
9.4.5 Uncertainty principle of availability. . . . . . . . . . . 182
9.4.6 Quantum availability operator . . . . . . . . . . . . . 183
9.4.7 State evolution . . . . . . . . . . . . . . . . . . . . . . 183
9.4.8 Diagonalization by job observable. . . . . . . . . . . . 183
Reference . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 184
10 A Quantum Method with Unknown Future Tasks
to Resolve Storage Message Conflicts 185
10.1 Introduction . . . . . . . . . . . . . . . . . . . . . . . . . . . 185
10.2 Problem Formulation . . . . . . . . . . . . . . . . . . . . . . 185
x Contents
10.2.1 Message representation . . . . . . . . . . . . . . . . 185
10.2.2 State representation using orthogonal basis . . . . . 186
10.2.3 Message conflict relation . . . . . . . . . . . . . . . 186
10.2.4 Statement of problem . . . . . . . . . . . . . . . . . 186
10.3 Review of Possible Solutions . . . . . . . . . . . . . . . . . . 187
10.3.1 Message queue . . . . . . . . . . . . . . . . . . . . . 187
10.3.2 Transactional management . . . . . . . . . . . . . . 187
10.3.3 Protocol management . . . . . . . . . . . . . . . . . 187
10.3.4 Message persistence . . . . . . . . . . . . . . . . . . 188
10.3.5 Arbitrary delay of messages. . . . . . . . . . . . . . 188
10.3.6 Encoding order of messages . . . . . . . . . . . . . . 188
10.3.7 In memory nuffering and sorting . . . . . . . . . . . 188
10.3.8 Diagonalization . . . . . . . . . . . . . . . . . . . . 189
10.3.9 Resequencing messages by eigenbasis . . . . . . . . 189
10.4 Methodology . . . . . . . . . . . . . . . . . . . . . . . . . . . 189
10.4.1 Measuring message states . . . . . . . . . . . . . . . 189
10.4.2 Asserting message orders . . . . . . . . . . . . . . . 189
10.4.3 Diagonalization by message persistence . . . . . . . 189
10.4.4 Quantum messages and resequencing . . . . . . . . 190
10.4.5 Concurrency of message sending . . . . . . . . . . . 190
10.4.6 Information of messages . . . . . . . . . . . . . . . . 191
10.5 Conclusion . . . . . . . . . . . . . . . . . . . . . . . . . . . . 193
References . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 193
11 A Quantum Automatic Controlled Method for
Storage Test Coverage 195
11.1 Problem Statement . . . . . . . . . . . . . . . . . . . . . . . 195
11.2 Wave of Programs . . . . . . . . . . . . . . . . . . . . . . . 196
11.2.1 Alternative solutions. . . . . . . . . . . . . . . . . . 196
11.2.1.1 Code mining . . . . . . . . . . . . . . . . . 196
11.2.2 Programconfiguration. . . . . . . . . . . . . . . . . 197
11.2.3 Unit tests . . . . . . . . . . . . . . . . . . . . . . . . 197
11.2.4 Aspect based test . . . . . . . . . . . . . . . . . . . 197
11.3 Methodology . . . . . . . . . . . . . . . . . . . . . . . . . . 198

11.3.1 Test coveragepattern . . . . . . . . . . . . . . . . . 198
11.3.2 Complete test pattern . . . . . . . . . . . . . . . . . 198
11.3.3 Sequential test pattern . . . . . . . . . . . . . . . . 199
11.3.4 Phase elimination pattern . . . . . . . . . . . . . . . 199
11.3.5 Projective test pattern . . . . . . . . . . . . . . . . 200
11.3.6 Joint state pattern . . . . . . . . . . . . . . . . . . . 200
11.3.7 Measurement apparatus pattern . . . . . . . . . . . 201
11.3.8 Tensored test pattern . . . . . . . . . . . . . . . . . 201
11.3.9 Entanglement construction pattern . . . . . . . . . 201
11.3.10 Entanglement measurement pattern . . . . . . . . . 202
11.3.11 A sample of entanglement measurement . . . . . . . 202