Geyong Min, Beniamino Di Martino, Laurence T. Yang, Minyi Guo, Gudula Ruenger9783540498605, 3540498605
Table of contents :
LNCS 4331 – Forntiers of High Performance Computing and Networking……Page 1
Preface……Page 5
Table of Contents……Page 26
Introduction……Page 37
Related Works……Page 38
Motivation……Page 40
DNA Flow Messages and Header Format……Page 41
DNA Description……Page 42
Modeling……Page 43
Analytical Results……Page 45
Conclusion……Page 46
Introduction……Page 47
Related Work……Page 48
Monitoring of Continuous k-NN Queries……Page 49
Preliminaries……Page 50
Static Query Monitoring over Moving Objects……Page 51
Moving Query Monitoring over Moving Objects……Page 53
Performance Evaluation……Page 54
Conclusion……Page 56
Introduction……Page 57
Task Allocation Algorithms……Page 58
Experimentation System……Page 61
Investigations……Page 62
Development of Experimentation System……Page 64
References……Page 65
Introduction……Page 67
Components……Page 68
QoS and Reliable Transmission……Page 69
Performance Evaluation……Page 70
Conclusion……Page 72
Introduction……Page 73
System Architecture Description……Page 74
Pipeline Structure……Page 75
Complexity and Speed Comparison Results……Page 79
Conclusion……Page 81
Pseudo Share Data Cache in Multiprocessor: PSDMP……Page 0
Introduction……Page 93
Model Proposed……Page 94
Read Access……Page 95
Write Access……Page 96
Conflict Handling……Page 97
Allocation and Invalidation of Data Block……Page 98
Simulation Results and Analysis……Page 99
References……Page 101
Introduction……Page 103
Preliminary……Page 104
Manik et al.’s Scheme……Page 105
Thulasi et al.’s Cryptanalysis……Page 106
Our Improved Scheme……Page 107
Validation and Security analysis……Page 108
References……Page 109
Cluster and Multi-cluster Architectures……Page 111
Characterization of Type of Application of Interest……Page 112
Contribution of This Work……Page 113
Metrics Used……Page 114
Results……Page 115
Conclusions and Work Guidelines……Page 117
References……Page 118
Introduction……Page 120
CMP: Internal Organization……Page 121
Methodology……Page 123
Simulation Results……Page 124
Conclusions……Page 128
Objectives……Page 130
Development……Page 131
The Higher Layer……Page 132
Communication Between Layers……Page 133
Results……Page 137
References……Page 138
Introduction……Page 140
Related Works……Page 141
Reconfigurable Chip-Multiprocessor Architecture……Page 142
Implementation Results……Page 143
Convolution Implementation……Page 144
Experimental Results……Page 145
Conclusions and Future Works……Page 148
References……Page 149
Introduction……Page 150
Related Work……Page 151
Virtual Link Queues……Page 152
Signaling Support for VL’s……Page 153
Scalability and Reconfiguration Issues……Page 154
Layer 2 Congestion Control……Page 155
Congestion Control Mechanisms……Page 156
Congestion Control Performance……Page 157
Conclusions……Page 159
Introduction……Page 161
Open Spaces……Page 162
The Dome……Page 163
The Dome Architecture……Page 164
Resource Allocation Mechanism……Page 165
Resource Management……Page 166
Experiment……Page 167
Experimental Results……Page 168
Conclusion and Future Work……Page 169
Introduction……Page 171
The Architecture of the Solver System……Page 172
The Grid Testbed……Page 174
Case Studies……Page 176
Conclusions and Future Work……Page 178
Introduction……Page 181
A Review of k-Coteries and Bicoteries……Page 183
The (m,h,k)-Coteries……Page 184
Examples of (m,h,k)-Coteries……Page 185
The (m,h,ki)-Coteries: A Generalized Quorum System……Page 188
Conclusions……Page 189
Introduction……Page 191
Proposed Load Sharing Algorithm……Page 192
Analysis of CLS for One Partition……Page 194
Probing-Based vs. Coordinated Schemes……Page 196
Analysis of CLS for Multiple Partitions……Page 197
Conclusion……Page 199
References……Page 200
Introduction……Page 201
Related Work……Page 202
Possible Performance Benefits……Page 203
Modelling CPU and Network Activity……Page 204
Benchmark Results……Page 205
Conclusions……Page 208
Introduction……Page 211
Interactions Between a User and the Grid……Page 213
A Two-Level Organization……Page 214
Agreement Problems……Page 215
The Domain Manager……Page 216
The Grid Manager……Page 217
Conclusion……Page 220
Introduction……Page 221
Web Technologies Used in the Environment……Page 223
Instantiating an Application……Page 224
Contextual User Interface to the Application Resources……Page 225
Underlying Distributed System Architecture……Page 226
Organizing Resources for Compositional Applications……Page 228
References……Page 230
Introduction……Page 231
Related Works……Page 232
A Survivable Distributed Sensor Networks Model……Page 233
Semi-markov Process for a Cluster Based Sensor Network Model……Page 234
Discrete Time Markov Chain of SMP……Page 235
Evaluation and Analysis……Page 237
References……Page 239
Introduction……Page 241
The Point of View of a Processor……Page 243
A Problem of Centered Load……Page 244
A Graduate Presentation of Our Solution……Page 245
The Most Interesting Processor and the Pair Processor……Page 246
The Decision of a Processor……Page 247
The GAE Algorithm with the M2LL Policy……Page 248
Conclusion……Page 249
Introductions……Page 251
Edge Parameter Probability Model and User Satisfaction Degree Function……Page 252
Edge and Path Evaluation Function……Page 254
Gaming Analysis……Page 255
Solution Expression and Generation……Page 257
Artificial Fish Behavior and Its Selection……Page 258
Conclusion……Page 259
Introduction……Page 261
Preliminaries……Page 262
Parallel Branch-and-Bound Algorithm with 3PR……Page 263
Experimental Results……Page 264
Conclusions……Page 265
References……Page 266
Introduction……Page 267
Background and Related Work in Option Pricing……Page 268
Cyclops-64 Architecture……Page 269
Monte Carlo Experiment Design……Page 270
Monte Carlo Simulation on C64……Page 272
Conclusions……Page 274
Introduction……Page 277
The Evolutionary Technique and Distributed Implementation……Page 278
Results and Discussion……Page 281
Conclusions……Page 284
References……Page 285
Introduction……Page 287
Monitoring Tools: Off the Shelf Software Analysis……Page 288
Testing Features……Page 289
Architecture……Page 290
Regression Test……Page 291
Intrusiveness……Page 292
Process and Thread Monitoring……Page 293
Comparative Analysis……Page 294
References……Page 295
Introduction……Page 297
Experimental Results……Page 298
Reference Patterns……Page 299
Test on Highly Unbalanced Systems……Page 300
Proposed Approach……Page 302
Conclusions and Future Work……Page 304
Introduction……Page 306
On Thermo-elasticity……Page 307
Parallel Implementation……Page 309
The KBS Model……Page 310
Computations……Page 311
Conclusion……Page 313
Introduction……Page 315
Linux Scheduler Analytical Model……Page 316
Reservation Model……Page 318
Performance Study……Page 321
Final Remarks……Page 323
Introduction……Page 325
Load……Page 326
Global Table(GT)……Page 328
Algorithm for TA Using A*……Page 329
The Fitness Function……Page 330
Description of SELECT……Page 331
Comparative Observations……Page 332
Experimental Results……Page 334
Conclusion and Future Work……Page 335
Introduction……Page 337
Panconnectivity of G0 G1……Page 340
Pancyclicity of G0 G1……Page 342
Panconnectivity of Restricted HL-Graphs……Page 344
Pancyclicity of Restricted HL-Graphs……Page 345
Introduction……Page 347
Proof of Theorem 1……Page 349
Path Partitions……Page 351
1 k1 k-2 (k0 2)……Page 352
k1 = k-1 (k0 = 1)……Page 354
k1 = 0 (k0 = k)……Page 355
Introduction……Page 357
Reconfiguration in Interprocessor Networks……Page 358
Scheduling of Processes and Threads, and Temporal Patterns……Page 359
Simulation Environment……Page 360
Context Switch Communication Patterns……Page 361
Context-Switch Triggered Reconfiguration……Page 364
References……Page 366
Introduction……Page 368
IEEE 802.11 DCF……Page 369
Rate Adaptation……Page 370
Multi-user Diversity……Page 371
IEEE 802.11 DCF……Page 372
Simulation Parameters……Page 373
Numerical Results……Page 374
Conclusion……Page 376
Introduction……Page 378
Sleep Mode……Page 380
Idle Mode……Page 381
Cost Equations……Page 383
Simulation……Page 384
Result and Discussion……Page 385
Conclusions……Page 386
Introduction……Page 387
Related Work……Page 388
Basic Mechanism……Page 389
Extended AODV……Page 390
Performance Evaluation……Page 392
Conclusion and Future Work……Page 395
Introduction……Page 397
Data Set……Page 398
Anomalous Behavior Detection Methodology for Name Servers……Page 399
Anomalous Behavior Detection Based on Associative Feature Analysis……Page 400
Experimental Results……Page 401
References……Page 403
Introduction……Page 404
Preliminaries and Motivation……Page 405
New Proposed Protocol Based on Spanning Trees……Page 407
Performance Analysis……Page 408
Conclusion……Page 412
Introduction……Page 414
Protection Switching Strategies and Choices……Page 416
Outline of the Protection Path Selection Algorithm……Page 418
Implementation and Complexity Analysis……Page 420
References……Page 421
Introduction……Page 423
Related Works……Page 424
Virtual Coordinate Generation and Selection……Page 425
Sensors Failure……Page 426
WR-Grid Replication……Page 427
Application Scenarios and Experimental Results……Page 428
Experimental Results……Page 429
Conclusions and Future Work……Page 431
Introduction……Page 433
Requirements……Page 434
Components of the Prototype Virtual Cluster……Page 435
Experimental Setups……Page 436
Network Benchmark Results on the Overlay Network Testbeds……Page 438
MPI Benchmark Results on the Overlay Network Testbeds……Page 439
Overlay Networks for MPI Execution……Page 440
Conclusion……Page 441
Introduction……Page 443
Computing Requirements of a Typical HEP Institute……Page 445
General Concepts of Batch System Virtualization……Page 446
Choice of Virtualization Technique……Page 447
Preparation of the Worker Nodes……Page 448
Integration into a Batch Queuing System……Page 449
Conclusions and Outlook……Page 450
Introduction……Page 453
CVS — Coordinated Voltage Scaling……Page 454
Virtual Machines……Page 455
Our Solution……Page 456
The Decision Agent……Page 457
Evaluation……Page 458
Conclusion and Future Work……Page 461
Introduction……Page 463
Integration with Production Grids……Page 464
Describing Execution Environments……Page 465
Efficient Initiation of VWNs……Page 466
Specification and Requirements……Page 467
VM Management……Page 468
VM Management……Page 469
Information System……Page 470
Conclusion……Page 471
Introduction……Page 473
Performance Models……Page 474
Xen Architecture……Page 476
Experimental Setup……Page 477
Performance Evaluation……Page 478
Performance Models for Xen-Based Applications……Page 479
Queuing Network Model……Page 480
Conclusions and Future Work……Page 484
Introduction……Page 486
Dynamic Virtual Clustering……Page 487
Design Decision 1: Assigning Network Addresses……Page 490
Design Decision 2: Resource Management and Creation……Page 491
Parallel Preemption and Restart……Page 492
Initial Implementation……Page 493
Test Plan……Page 494
Analysis……Page 495
Conclusions and Future Work……Page 496
Introduction……Page 498
Background……Page 500
Multiple Network Interface Configurations……Page 501
Modifying Xen for domain0 Bypass……Page 502
Benchmark Programs……Page 503
Results……Page 504
Baseline Performance……Page 505
Multiple Interface Performance……Page 506
Conclusions and Future Work……Page 507
Introduction……Page 510
Overview of Virtualization……Page 511
Platform Configuration……Page 512
VM Scaling Performance……Page 513
Virtualization Overheads……Page 514
VM Scheduling Policies……Page 515
Inferences on VM Modeling Approach……Page 516
Summary and Future Work……Page 517
References……Page 518
Introduction……Page 520
Background and Motivation……Page 521
Methodology and Hardware Platform……Page 522
HPC Linux Operating System Comparison……Page 523
Micro-benchmarks……Page 524
Disk I/O Performance……Page 525
Macro-benchmarks……Page 526
NAS Parallel Benchmarks (NPB)……Page 527
MIT GCM……Page 528
Conclusions and Future Work……Page 529
Introduction……Page 533
Cluster Virtualization……Page 534
OSCAR Overview……Page 535
Xen-OSCAR: Tool for Cluster Virtualization……Page 536
Development of Applications Using a Virtual Cluster……Page 540
Execution of Parallel Applications……Page 541
Conclusion……Page 543
Introduction……Page 545
Data Envelopment Analysis……Page 546
Banker, Charnes and Cooper (BCC) Model……Page 548
Target Choice……Page 549
Experimental Factor Determination……Page 551
References……Page 553
Introduction……Page 555
Grid Learning Services Semantic Description……Page 557
A Model for Semantic Description of Grid Based Learning Services……Page 558
An Example Scenario……Page 561
References……Page 563
Introduction……Page 565
Web Service Selection……Page 566
Problem Domain……Page 567
Use Case Diagram……Page 569
Class Diagram……Page 571
Sequence Diagram……Page 572
Service Selection Method……Page 573
Comparative Evaluation……Page 575
Conclusion……Page 576
Introduction……Page 578
Mediator-Wrapper Based Semantic Data Grid Service……Page 579
Communication Mechanism with Semantic Grid……Page 581
Semantic Fusion Atom……Page 582
The Extension of XML Algebra with Semantic Query Enhanced……Page 584
XML Query Rewriting and Planning……Page 585
Discussion and Conclusion……Page 586
Introduction……Page 588
Memory-Based Storage Model Definition……Page 589
Target Systems and Experiment Environment……Page 591
Comparative Item……Page 592
Evaluation Results and Discussions……Page 593
References……Page 594
Introduction……Page 596
Ontology Matching Approaches……Page 597
Semantic Web Service Discovery Based on Ontology Matching……Page 598
Conclusions……Page 602
References……Page 603
Introduction……Page 605
Requirements……Page 606
Ontology Construction……Page 607
Web Service Domain……Page 608
C-Mediator and D-Mediator for Composition……Page 609
Environment……Page 610
Example……Page 611
Conclusions……Page 613
References……Page 614
Introduction……Page 615
Related Work……Page 616
WSRF, WS-Resource and MPI Resource……Page 617
Overall Framework of MPI Service……Page 618
MPI Resource……Page 619
Running Context Resource……Page 620
The Roles of MPI Resources in VOs……Page 621
Evaluation……Page 622
Conclusion……Page 623
References……Page 624
Introduction……Page 625
TIGER Grid Testbed……Page 626
Ongoing Teaching Courses and Research Projects on Grid Computing……Page 628
Network Information Model……Page 629
Data Grid Applications……Page 630
Hybrid Parallel Loop Scheduling……Page 631
References……Page 633
Introduction……Page 635
Motivation……Page 636
COMPOSITOR: A Plug-In Tool for the Composition of Multiple Web Services for an Application……Page 637
Web Services Methods Selection……Page 638
Generation of the Template in the Client Code……Page 639
Conclusions……Page 641
References……Page 642
Introduction……Page 644
Data Manage Model Based on Catalogue (CDM)……Page 645
Data Manage Model Based on Broker (BDM)……Page 646
Comparison and Analyses……Page 647
References……Page 648
Introduction……Page 649
Methods……Page 650
Results and Discussion……Page 651
Conclusions……Page 653
References……Page 654
Introduction……Page 656
Architecture of Grid-Based Special Remotely Sensed Data Processing Node……Page 658
Node Management and Tasks Scheduling……Page 659
Concept of Grid-Based Remote Sensing Meta-module……Page 660
Grid-Based Remotely Sensed Meta-module Service Registry……Page 661
Conclusions……Page 662
References……Page 663
Introduction……Page 664
Linguistic Scenario……Page 665
Data Management in Geographic Information Systems……Page 666
Basic Operations in the Use Cases……Page 667
Scalability Properties……Page 668
Consistency and Versioning……Page 669
Conclusion……Page 671
Introduction……Page 674
Architecture Design……Page 675
Principle of System Deployment on Grid Computing Platform……Page 677
Grid GIS System Management and Schedule Flow Design……Page 678
Grid Spatial Data Description Criterion……Page 680
Conclusion……Page 681
References……Page 682
Introduction……Page 683
Model and Steps of the Hybrid Algorithm……Page 684
Least Square Support Vector Machine……Page 685
Improved Genetic Algorithm……Page 686
Data Acquisition and Preprocessing……Page 688
Results of Experiments and Analysis……Page 689
References……Page 692
Introduction……Page 694
Formalizing and Solving the Problem……Page 697
Computational Complexity……Page 698
Conclusions……Page 701
References……Page 702
Introduction……Page 704
Mass Spectrometry Data……Page 705
Suffix Trees……Page 706
The Longest Common Spectra Substring Algorithm……Page 707
Extracting Patterns from Mass Spectrometry Proteomics Data……Page 708
The Proteomic Spectra Dataset……Page 709
Pattern Extraction Evaluation……Page 710
Grid Service Evaluation……Page 711
Conclusions and Future Work……Page 712
Introduction……Page 714
BLAST Programs……Page 716
Overall Structure of blastall Program……Page 717
Testing Environment……Page 718
Performance Evaluation Results……Page 719
Discussion and Conclusion……Page 721
Introduction……Page 723
Background and Related Work……Page 725
Components, Parallelization, and Usage of compPknots……Page 726
Evaluation……Page 728
Conclusions and Future Work……Page 731
References……Page 732
Introduction……Page 733
Cluster Computing……Page 734
High-Performance Computing Environment……Page 735
User Portal……Page 736
Performance Evaluation……Page 739
References……Page 741
Introduction……Page 743
Locality Measures Supporting Spatial Locality……Page 744
Benchmark Results……Page 746
Multiplication of Two Square Matrices……Page 747
Iterated Runge-Kutta Methods……Page 749
Related Work……Page 751
Conclusion and Future Research……Page 752
Introduction……Page 753
Numeric Model……Page 754
The Parallel Program Application……Page 756
The Front-End……Page 757
The Back-End……Page 758
Case Study……Page 759
Results and Discussion……Page 760
Conclusion……Page 761
References……Page 762
Introduction……Page 763
Domain Decomposition……Page 764
Motivation……Page 765
Algorithms……Page 766
Master Algorithm……Page 767
Varying Size of Overlap……Page 768
Varying Number of Domains……Page 769
Inexact vs. Exact Subdomain Solver……Page 770
Conclusions……Page 772
Introduction……Page 774
Image Segmentation……Page 775
Related Works……Page 776
Architecture……Page 777
Implementation……Page 778
Experimental Results……Page 779
Conclusions and Future Works……Page 782
References……Page 783
Introduction……Page 784
Related Researches……Page 785
Problems and Suggested Solution……Page 786
Real-Time Frame……Page 787
The Processing of Real-Time Frames……Page 788
Experiments……Page 790
Conclusion……Page 792
References……Page 793
Introduction……Page 794
Mathematical Model……Page 795
Numerical Method and Sequential Implementation……Page 796
Parallel Implementation……Page 797
Results……Page 798
Validation of the Parallel Implementation……Page 799
Conclusions……Page 802
References……Page 803
Introduction……Page 804
The Discrete Cosine Transform……Page 805
Related Works Concerning the 1D-DCT……Page 806
The DCT-Kernel Architecture……Page 808
The Parametric 2D-DCT Architecture……Page 809
An Architecture That Attends SDTV Purposes……Page 810
An Architecture That Attends HDTV Purposes……Page 811
Verification Results……Page 812
Conclusion……Page 813
Introduction……Page 815
System Overview……Page 817
Resource Selection Method……Page 818
Detection of Idle Resources……Page 819
Selection of Idle Resources……Page 820
Evaluating Definition of Idle Resources……Page 821
Evaluating Overhead of Resource Selection……Page 823
Related Work……Page 824
Conclusion……Page 825
Introduction……Page 827
Parallel High-Dimensional Index Structure……Page 828
Data Insertion……Page 830
Range Query Search……Page 831
k-Nearest Neighbor (k-NN) Search……Page 832
Experimental Performance Analysis……Page 833
Conclusions and Future Work……Page 835
References……Page 836
Introduction……Page 837
Throughput Optimization……Page 839
Power Estimation……Page 841
Proposed Topologies……Page 842
Tree-Based Topologies for H.264 Decoder……Page 843
Simulation and Analysis……Page 845
Conclusion……Page 847
Introduction……Page 849
Problem Definition……Page 851
Delivery Methods……Page 852
Algorithm to Derive Optimal Set of Videos for Broadcasting……Page 854
Greedy Algorithm……Page 855
Evaluation……Page 856
Conclusion……Page 858
Introduction……Page 859
Related Works……Page 860
VML……Page 861
Implementation and Comparison……Page 864
Conclusion and Future Works……Page 867
Introduction……Page 869
Design Considerations……Page 871
Overview of the Distributed Processing Framework……Page 872
Processing Tiles……Page 873
Processing Graph Control……Page 874
Network Transfer……Page 875
Distributed Processing Graph……Page 876
Example Application……Page 877
Conclusions……Page 878
Introduction……Page 879
Grid Replication Background……Page 880
Evaluation Methodology……Page 883
Uncyclical Graph Stage……Page 884
Cyclical Graph Stage……Page 885
Uncyclical Graph Stage……Page 886
Cyclical Graph Stage……Page 887
References……Page 888
Introduction……Page 890
Linux Scheduler……Page 891
Analytical Model……Page 892
Reservation Model……Page 894
Performance Study……Page 896
Final Remarks……Page 898
Introduction……Page 900
Desirable Characteristics in a Modeling Tool……Page 901
Selected Tools……Page 902
SUMA……Page 903
LQNM of SUMA Applications……Page 904
GridSim Model of SUMA Applications……Page 905
Model Development, Parameterization and Validation……Page 907
Comparison of Tools……Page 908
Conclusions……Page 909
Introduction……Page 910
Overview of AJAX Technology……Page 911
AJAX Web Chat……Page 914
Web Chat Evaluation……Page 915
Conclusions……Page 917
Introduction……Page 919
Background and Related Work……Page 921
ARTÌS……Page 922
The Heuristic Load-Balancing Policy Definition……Page 923
Experimental Results……Page 925
Conclusions and Future Work……Page 928
Introduction……Page 930
Related Work……Page 931
Performance Issues of the Web Services……Page 932
Applying the PUMA Approach……Page 933
Impact of XML Parsers……Page 937
Impact of SOAP Implementations……Page 938
Impact of the CDSS Processing Time……Page 939
Conclusion……Page 940
Introduction……Page 943
The Model……Page 944
The IP/M/n Queue……Page 945
Dynamic Heuristics……Page 947
Results……Page 948
Conclusions……Page 951
Introduction……Page 953
Context-Broker Architecture……Page 955
Agent Recognition……Page 957
Context-Broker Ontology……Page 958
Context-Broker Services……Page 959
Upload Presentation……Page 960
Conclusions and Future Work……Page 961
Introduction……Page 963
Routing Registry System……Page 964
Network Forensics……Page 965
RIS(Routing Information System)……Page 966
HOIDS(Honeynet Intrusion Detection System)……Page 967
The Improved Safety Structure with RIS and HOIDS……Page 968
Analysis Environment……Page 969
Analysis Result……Page 970
Conclusions and Future Works……Page 971
References……Page 972
Introduction……Page 973
Related Researches……Page 974
IPBio……Page 975
Exchanging a Session Key……Page 976
Packet Authentication……Page 977
Experiments……Page 982
References……Page 983
Introduction……Page 985
Hash Based Peer-to-Peer Network……Page 986
A Proposed Framework for Efficient Distributed Scheduling……Page 987
Clustering of Grid Resource……Page 988
Message Routing……Page 989
Background……Page 990
Scheduling Performance……Page 991
Conclusion and Future Works……Page 992
References……Page 993
Introduction……Page 995
Vulnerabilities in Mobile IP Networks……Page 996
Design of Vulnerability Diagnosis Systems……Page 997
References……Page 1000
Limitations of Existing ITS Centers……Page 1001
Relationship Between Telematics and ITS……Page 1003
Conceptual Framework of the Virtual Center……Page 1004
Architecture Flow……Page 1005
References……Page 1008
Introduction……Page 1010
Routing Registry System……Page 1011
Forensics Lifecycle Model……Page 1012
Resilience……Page 1013
Service Level Agreement (SLA)……Page 1014
References……Page 1015
Introduction……Page 1017
Cyber Attack Strategy Process……Page 1018
The Mechanism of Cyber Attack Model……Page 1020
Information Analysis and Target Decision……Page 1022
Attack Scenario Analysis……Page 1023
Attack Action……Page 1024
Conclusions……Page 1025
Introduction……Page 1027
Related Works……Page 1028
Proposed Approach……Page 1029
Evaluation Dataset and Environments……Page 1030
Evaluation Results and Analysis……Page 1031
References……Page 1034
Introduction……Page 1036
Framework of the RNG in the Embedded Crypto System……Page 1037
The Filter Algorithm in Random Number Generation Component……Page 1038
Combined Model of Random Number Generation Component and Chaos Function……Page 1039
Experimental results……Page 1042
Conclusions……Page 1045
Introduction……Page 1046
Analysis of Correlation……Page 1047
Overall Structure of Traffic Analysis and Monitoring System……Page 1048
Administrator Program Configuration……Page 1049
Simulation Results……Page 1050
References……Page 1051
Introduction……Page 1052
An Overview……Page 1054
Structure and Functions……Page 1055
Formatted Event-Data Analysis Flow……Page 1057
Validation of the Efficiency……Page 1059
The Result of Experiment……Page 1060
Further Required Research……Page 1062
References……Page 1063
Introduction……Page 1064
Packet Capture and Count……Page 1065
Operation of Host Infected by Worm Virus……Page 1067
Conclusion……Page 1069
Introduction……Page 1071
Energy-Efficient Routing Protocol Depending on Dynamic Message Communication (DyMC)……Page 1072
Setting Up Path to Make Good Use of Energy Level and Direction Information……Page 1073
Performance Analysis……Page 1076
Conclusion and Further Works……Page 1078
References……Page 1079
Introduction……Page 1080
FMIPv6 (Fast Mobile IPv6)……Page 1081
PANA CTP……Page 1082
A Handover Scheme in FMIPv6……Page 1083
Local Authentication with PANA-CTP……Page 1084
Local Authentication……Page 1085
Distribute Security Parameters……Page 1086
Modeling the Average Delivery Delay……Page 1087
Conclusion……Page 1088
References……Page 1089
Introduction……Page 1090
A Simple Tight Bound……Page 1092
Truncated Union Bounds……Page 1094
Upper Bounds for Particular LDPC Codes and Turbo Codes with Particular Interleavers……Page 1095
Conclusion……Page 1098
Introduction……Page 1099
IEEE 802.11 DCF Channel Access Method……Page 1100
Frame Transmission Probability of DCF+……Page 1101
Throughput Analysis Under the Saturation Condition……Page 1103
Throughput Analysis Under the Unsaturation Condition……Page 1104
Simulation Results and Performance Evaluation……Page 1105
Conclusion……Page 1107
References……Page 1108
Introduction……Page 1109
Problems of the IEEE 802.11 DCF in Ad Hoc Networks……Page 1111
Design of the A-DCF Algorithm……Page 1112
Simulation Results and Performance Evaluation……Page 1113
References……Page 1118
Introduction……Page 1119
QRcode……Page 1120
Requirement for Wireless Internet……Page 1121
Icon-URI Structure Based on ENUM System……Page 1122
Conclusion……Page 1124
References……Page 1125
Introduction……Page 1126
Preliminaries……Page 1127
Public Key Certificate(PKC)……Page 1128
Attribute Certificate(AC)……Page 1129
Assumptions and Requirements……Page 1130
Service Model……Page 1131
Conclusion……Page 1134
Introduction……Page 1136
Group Key Agreement Protocol Among Mobile Devices in Different Cells……Page 1138
Protocol Description……Page 1139
Security Analysis……Page 1140
Efficiency……Page 1142
Conclusion and Future Work……Page 1143
Introduction……Page 1144
Single Hop Delay Model……Page 1146
Link Utilization Statistic Algorithm……Page 1147
Simulation and Analysis……Page 1149
Analysis of the Simulation Result……Page 1150
References……Page 1152
Introduction……Page 1153
Hierarchical Ad Hoc Network Archite……Page 1154
Discovery Protocol……Page 1155
Discovery Metric……Page 1156
Routing Protocol……Page 1157
Performance Evaluation……Page 1159
Conclusion……Page 1161
References……Page 1162
AODV (Ad Hoc On-demand Distance Vector) Routing Protocol……Page 1163
Routing Table Format……Page 1164
Changed Massage Formats……Page 1165
Parameters Defined in RFC……Page 1166
Delay Time……Page 1167
The Number of Flooded RREQ Massages……Page 1169
References……Page 1170
Introduction……Page 1172
BGP Routing……Page 1173
BGP Table and Flow Data……Page 1174
Relationship between Flow Data and AS Path Length…….Page 1175
Relationship Between Flow Data and AS Path Length……Page 1176
CDF of Destinations……Page 1178
Conclusion……Page 1180
Author Index……Page 1182
Reviews
There are no reviews yet.