Networked Systems

Name: Networked Systems | 4th International Conference, NETYS 2016, Marrakech, Morocco, May 18-20, 2016, Revised Selected Papers
Brand: Springer
Price: 53.49 EUR
Availability: OnlineOnly

4th International Conference, NETYS 2016, Marrakech, Morocco, May 18-20, 2016, Revised Selected Papers

Parosh Aziz Abdulla Carole Delporte-Gallet(Herausgeber*in)

Springer (Verlag)

Erschienen am 14. September 2016

X, 396 Seiten

E-Book

PDF mit Wasserzeichen-DRM

Systemvoraussetzungen

978-3-319-46140-3 (ISBN)

53,49 €inkl. 7% MwSt.

Systemvoraussetzungen

für PDF mit Wasserzeichen-DRM

E-Book Einzellizenz

Als Download verfügbar

Beschreibung

Weitere Details

Weitere Ausgaben

Inhalt

Intro
Preface
Organization
Contents
Nonrepudiation Protocols Without a Trusted Party
1 Introduction
2 Related Work
3 Nonrepudiation Protocols
4 Necessary and Sufficient Conditions for Nonrepudiation Protocols
5 Nonrepudiation Protocols with Message Loss
6 Necessary and Sufficient Conditions for Nonrepudiation Protocols with Message Loss
7 An -Nonrepudiation Protocol
8 Concluding Remarks
References
Exploiting Concurrency in Domain-Specific Data Structures: A Concurrent Order Book and Workload Generator for Online Trading
1 Introduction
2 Online Trading and the Order Book
3 A Concurrent Order Book
3.1 Coarse-Grained Locking
3.2 Two-Level Fine-Grained Locking
3.3 Toward Lock-Free Algorithms
4 Generating Workloads
5 Evaluation
6 Related Work
7 Conclusion
References
Fault Tolerant P2P RIA Crawling
1 Introduction
2 Related Work
3 Fault Tolerant RIA Crawling
3.1 Assumptions
3.2 Protocol Description
4 Data Recovery Mechanisms
4.1 Retry Strategy
4.2 Redundancy Strategy
4.3 Combined Strategy
5 Evaluation
5.1 Retry Strategy
5.2 Redundancy Strategy
5.3 Comparison of the Retry and the Redundancy Strategies When Controllers Are Not Overloaded
5.4 Combined Strategy
6 Conclusion
References
Nearest Neighbors Graph Construction: Peer Sampling to the Rescue
1 Introduction
2 The KNN Peer Sampling Service
3 Experimental Setup
3.1 NNDescent Algorithm
3.2 Datasets Description
3.3 Similarity Metrics
3.4 Evaluation Metrics
4 Experimental Results
4.1 Recall Versus Cost
4.2 Quality Versus Cost
4.3 Utility Study
4.4 Recall at Equal Cost
4.5 Discussion
5 Related Work
6 Conclusion
References
Accurate Optimization Method for Allocation of Heterogeneous Resources in Embedded Systems
Abstract
1 Introduction
2 Model of Embedded System
2.1 Hardware Platform Model
2.2 Application Model
3 Proposed Formulation
3.1 Notation
3.2 Quadratic Formulation
4 Case Study
5 Conclusion
References
Understanding the Memory Consumption of the MiBench Embedded Benchmark
1 Introduction
2 Platform
2.1 Hardware
2.2 Software Stack
3 Memory Profiler
3.1 Profiler Overview
3.2 Profiler Design Choices
4 Origins of the Memory Spikes
4.1 Methodology
4.2 I/O Functions
4.3 Operating System
4.4 Applications
5 Related Work
6 Conclusion
References
Benchmarking Energy-Centric Broadcast Protocols in Wireless Sensor Networks
1 Introduction
2 Related Work
3 Our Model
4 Experimental Setup
5 Experimental Results and Discussion
5.1 Single Source Broadcast
5.2 Multiple Source Broadcast (Gossip)
5.3 Discussion
6 Conclusion
References
Transactional Pointers: Experiences with HTM-Based Reference Counting in C++
1 Introduction
2 Background and Related Work
2.1 C++ Smart Pointers
2.2 Hardware Transactional Memory
2.3 Related Work
3 Transactional Pointers
3.1 Algorithm
3.2 Implementation
4 Evaluation with Micro-Benchmarks
4.1 Mono-Threaded Scenario
4.2 Short-Lived Pointers
5 Evaluation with Shared Data Structures
5.1 Implementation
5.2 Evaluation
6 Conclusion and Future Work
References
A Multi-channel Energy Efficient Cooperative MIMO Routing Protocol for Clustered WSNs
Abstract
1 Introduction
2 Related Work
3 Energy Efficiency of MIMO Systems
3.1 System Model
3.2 Variable-Rate Systems
4 The Proposed Protocol
4.1 Clustering Algorithm
4.2 Medium Access Control and Channel Assignment
4.3 Energy Efficiency Analysis
5 Simulation Results
5.1 Simulation Environment
5.2 Performance Evaluation Discussion
6 Conclusion
References
Counting in Practical Anonymous Dynamic Networks is Polynomial
1 Introduction
2 The Anonymous Dynamic Network Model
3 Incremental Counting Protocol Simulator
4 Discussion
References
Internet Computing: Using Reputation to Select Workers from a Pool
1 Introduction
2 Model
3 Reputation-Based Mechanism
4 Analysis
5 Simulations
References
Asynchronous Consensus with Bounded Memory
1 Introduction
2 Model
3 Algorithm
4 Applications
4.1 Randomized Algorithm
4.2 SWMR Registers
4.3 Failure Detector
4.4 Message Passing
5 Extensions
6 Conclusion
References
A Fuzzy AHP Approach to Network Selection Improvement in Heterogeneous Wireless Networks
1 Introduction and Motivation
2 Related Works
3 AHP-SAW Network Selection
3.1 System Model
3.2 Analytic Hierarchy Process: AHP
3.3 Simple Additive Weighting: SAW
4 Fuzzy Approach to Network Selection Improvement
4.1 Fuzzy Logic and Fuzzy Set Theory
4.2 Fuzzy Analytic Hierarchy Process: FAHP
5 Simulation Model
5.1 Simulation Parameters
5.2 Evaluation Criteria
5.3 Simulation Results and Discussion
6 Conclusion
References
A Fault-Tolerant Sequentially Consistent DSM with a Compositional Correctness Proof
1 Introduction
2 Model and Definitions
2.1 Shared Memory
2.2 Causality and Logical Clocks
3 Algorithm
4 Correctness Proof
4.1 Linearizability
4.2 Logical-Time History
4.3 Compositional Reasoning
4.4 Reasoning About the Algorithm
5 Related Work
5.1 Consistency Conditions
5.2 Fault-Tolerant Shared Memory
6 Conclusion
References
Exploiting Crowd Sourced Reviews to Explain Movie Recommendation
1 Introduction
2 Method
2.1 Movie Similarity
2.2 Genre-Based Sub-grouping
2.3 Rating Prediction
3 Prototype
4 Results
5 Related Work
6 Conclusion and Future Work
References
A Formal Model for WebRTC Signaling Using SDL
Abstract
1 Introduction
2 Jingle
3 Jingle Signaling Model
3.1 Architectural Design for Jingle Using SDL
3.2 Behavioural Design for Jingle Using SDL
3.3 Data Representation in the Model
4 Conclusion and Future Work
References
An Incremental Proof-Based Process of the NetBill Electronic Commerce Protocol
1 Introduction
2 Background
3 Specifying NetBill Protocol Using Event-B
4 Results and Discussion
5 Conclusion
References
Securing NFC Credit Card Payments Against Malicious Retailers
1 Introduction
2 NFC Credit Card Payments
3 Defending Against Malicious Third Parties
4 Malicious Retailers
4.1 The Over-Charge Attack
4.2 The Transparent Bridge Attack
5 Defending Against Malicious Retailers
5.1 The Extended Secure CC Protocol
5.2 Defending Against the Over-Charge Attack
5.3 Defending Against the Transparent Bridge Attack
6 Related Work
7 Concluding Remarks
References
An Approach to Resolve NP-Hard Problems of Firewalls
1 Introduction
2 Related Work
3 Preliminaries
4 Synthesis Procedure
5 Resolution of FC, FA and SP
5.1 Resolution of Firewall Completeness (FC) Problem
5.2 Resolution of Firewall Adequacy Problems: FA-d, FA-a
5.3 Resolution of Slice Probing Problems: SP-d, SP-a
6 Resolution of FI, FV, FE and FR
6.1 Resolution of Firewall Implication Problems: FI-d, FI-a
6.2 Resolution of Firewall Verification Problems: FV-d, FV-a
6.3 Resolution of Firewall Equivalence Problems: FE-d, FE-a
6.4 Resolution of Firewall Redundancy Problems: FR-d, FR-a
7 Evaluation of Space and Time Complexities
8 Conclusion
References
Hybrid Encryption Approach Using Dynamic Key Generation and Symmetric Key Algorithm for RFID Systems
Abstract
1 Introduction and Literature Review
2 Proposed Approach
2.1 Overview
2.2 Key Generation
2.3 Encryption or (Decryption)
2.4 Integrity Check
3 Analysis and Discussion
3.1 Cryptanalysis
3.2 Performance Evaluation
4 Conclusions and Future Work
References
Time-Efficient Read/Write Register in Crash-Prone Asynchronous Message-Passing Systems
1 Introduction
2 System Model
3 Atomic Register and Time-Efficient Implementation
3.1 Atomic Register
3.2 Notion of a Time-Efficient Operation
4 An Algorithm with Time-Efficient Operations
5 Proof of the Algorithm
5.1 Termination and Atomicity
5.2 Time-Efficiency: The Bounded Delay assumption
5.3 Time-Efficient Implementation: The Round-Based Synchrony assumption
6 Conclusion
References
Traffic Lights Optimization with Distributed Ant Colony Optimization Based on Multi-agent System
Abstract
1 Introduction
2 Related Work
3 Traffic Flow Terminology
4 Traffic Signal Concepts
4.1 Vehicle Waiting Time
4.2 Waiting Time of Vehicles Initially in Queue
4.3 Waiting Time of Vehicles not Released on the Current Phase
4.4 Total Waiting Time for a Vehicle in a Signal Cycle
5 The Ant Colony Optimization Behavior
6 Distributed ACO Algorithm Applied to Traffic Signal Optimization
7 Simulation Results
8 Conclusion and Perspectives
References
A Mechanized Refinement Proof of the Chase-Lev Deque Using a Proof System
1 Introduction
2 The Chase-Lev Work Stealing Queue Algorithm
3 Overview of Proof Methodology
4 Mechanized Proof Steps
5 Related Work
6 Conclusions and Future Work
A Observations on the SC Executions of the Program
B Path Splitting and Loop Peeling
References
The Out-of-core KNN Awakens:
1 Introduction
2 Preliminaries
2.1 In-memory Approach
3 Pons
3.1 Overview
4 KNN Iteration
4.1 Phase 1: Partitioning
4.2 Phase 2: In-Edge Partition Files
4.3 Phase 3: Out-Edge Partition Files
4.4 Phase 4: Profile Partition Files
4.5 Phase 5: Distance Computation
5 Experimental Setup
6 Evaluation
6.1 Performance
6.2 Multithreading Performance
6.3 Performance for different memory availability
6.4 Evaluating the Number of Partitions
7 Related Work
8 Conclusion
References
The 4-Octahedron Abstract Domain
1 Introduction
2 4-Octahedron Representation
2.1 Linearly Dependent Vectors
2.2 4-Octahedra Definition
2.3 Hyper-paths and Hyper-cycles
3 4-Octahedron Abstract Domain
3.1 The Need for 4-Octahedron Abstract Domain
3.2 Emptiness Testing
3.3 Approximation of the Canonical Form
4 4-Octahedra Abstract Domains Implementation
4.1 2D-DBM Data-Structure
4.2 Galois Connections
4.3 Computation Canonical Form Algorithm
4.4 Definition of the Abstract Operators
5 Conclusion
References
Reversible Phase Transitions in a Structured Overlay Network with Churn
1 Introduction
2 Representative Overlays
3 Overlay Maintenance Strategies
4 Reversibility and Its Evaluation
5 Phase, Phase Transitions, API and Application
5.1 Definition of Phase, Phase Transition and Critical Point
5.2 Observation of Phase Transitions
5.3 API for Phases and Phase Transitions
6 Related Work
7 Conclusion
References
Verification of Common Business Rules in BPMN Process Models
1 Introduction
2 Background
2.1 Business Process Management Notation (BPMN)
2.2 Common Business Rules and Business Rule Language (BRL)
3 Our Approach for BPMN Model Analysis
3.1 Extracting a Process Schema from BPMN Model
3.2 Runing Business Rules Analysis Algorithm
4 Conclusion and Future Work
References
Is Youtube Popularity Prediction a Good Way to Improve Caching Efficiency?
1 Introduction
2 Popularity Prediction
2.1 The Dataset
2.2 Prediction Methodology
2.3 Mathematical Models for Prediction
3 Replacement Policies for Caching
3.1 LFU vs P-LFU
3.2 Virtual LRU
3.3 Results and Discussion
4 Conclusion
References
Waiting in Concurrent Algorithms
1 Introduction
2 The k-waiting Progress Conditions
3 Computational Model and Basic Observations
4 Consensus and Election
5 Adaptive Renaming
6 Mutual Exclusion
7 Fairness
8 Related Work
9 Discussion and Open Problems
References
Corona Product Complexity of Planar Graph and S-chain Graph
1 Introduction
2 Preliminary Notes
3 Results and Discussion
3.1 Corona Product Complexity of Gn and S -linear Chain Cm,s
3.2 Corona Product Complexity of G n and S -cycle Chain Cm,s
4 Conclusion
References
Vehicular Ad-Hoc Network: Evaluation of QoS and QoE for Multimedia Application
1 Introduction and Motivation
2 Performance Evaluation
3 Results and Analysis
3.1 QoS Metrics as Function of Data Traffic Load
3.2 QoE Metrics as Function of Data Traffic Load
4 Conclusion and Perspective
References
Abstracts of Posters
An Implementation of the Keccak Hash Function
A Secure Processor Using Homomorphic Encryption
An Ontology Based Social Search System
An Adaptive Routing Scheme in Scale-Free Networks
Communication Interface for Distributed SDN
Hybrid Homomorphic Encryption for Cloud Privacy
Static Hand Gesture Recognition Using RGB-D Data
Deep Neural Networks for Medical Images
IoT for Livestock Monitoring in the Desert
Dynamic Clustering Algorithm for Targets Tracking
ABAC Model for Collaborative Cloud Services
A Review on Big Data and Hadoop Security
Performance Analysis of Black Hole Attack in VANET
SNA: Detecting Influencers over Social Networks
Performance Evaluation of Smart Grid Infrastructures
Communities Detection in Social Networks
Keyframe Extraction Using Entropy Singular Values
Autonomous Vehicular Systems Based on Multi Agents
The Integration of Multi-homing in 5G Networks
Author Index

Systemvoraussetzungen

Als PDF speichern Als Link merken