Distributed Computing and Networking

Name: Distributed Computing and Networking | 13th International Conference, ICDCN 2012, Hong Kong, China, January 3-6, 2012, Proceedings
Brand: Springer
Price: 53.49 EUR
Availability: OnlineOnly

13th International Conference, ICDCN 2012, Hong Kong, China, January 3-6, 2012, Proceedings

Luciano Bononi AJOY DATTA Stéphane Devismes Archan Misra(Herausgeber*in)

Springer (Verlag)

1. Auflage

Erschienen am 3. Januar 2012

XIV, 550 Seiten

E-Book

PDF mit Wasserzeichen-DRM

Systemvoraussetzungen

978-3-642-25959-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

Title
Preface
Organization
Table of Contents
A Protocol for the Atomic Capture of Multiple Molecules on Large Scale Platforms
Introduction
Preliminaries
Chemical Programming Model
System Model
Protocol
Pessimistic Sub-protocol
Optimistic Sub-protocol
Sub-protocol Mixing
Sketch of Proof for Correctness and Liveness
Evaluation
Related Works
Conclusion
References
Lifting the Barriers - Reducing Latencies with Transparent Transactional Memory
Introduction
Multi-versioned Objects in Distributed Transactional Memory
Thread Synchronization in Java
Mapping Java Synchronization to Transactions
Correctness
Implementation Overview
What about I/O?
Related Work
Conclusion
References
Application of Automated Revision for UML Models: A Case Study
Introduction
Motivating Scenario
Need for Model Revision for Tolerating Sensor Failure
Modeling
Program Design in UML State Diagram
Underlying Computational Model(UCM)
Framework Description
Step A: Automatically Translate from Program Design Modeled in UML State Diagram to UCM.
Step B: Generate Fault Actions, Specification and Invariants from Parameters specified by Designer
Step C: Generate Fault Tolerant Program Modeled in UCM-Automatically Revise the Fault-Intolerant Program into the Fault-Tolerant One
Step D: Translate FT Program Modeled in UCM to FT Program Design in UML State Diagram
Related Work
Conclusion
References
Snap-Stabilizing Message Forwarding Algorithm on Tree Topologies
Introduction
Model and Definitions
Message Forwarding
Overview of the Solution
Formal Description of the Solution
Proof of Correctness
Conclusion
References
Towards a Universal Construction for Transaction-Based Multiprocess Programs
Introduction
Computation Models
The User Programming Model
The Underlying System Model
A Universal Construction for STM Systems
Control Variables Shared by the Processors
How the t-Objects and nt-Objects Are Represented
Behavior of a Processor
A Short Discussion to Conclude
References
Byzantine Agreement with Homonyms in Synchronous Systems
Introduction
Model and Definitions
Main Results
Impossibility Result
Byzantine Agreement
Propose/Accept Primitive
Byzantine Agreement Algorithm
Conclusion and Future Work
References
Facilitating the Design of Fault Tolerance in Transaction Level SystemC Programs
Introduction
Background: SystemC and Transaction Level Modeling
SystemC
Simulation Kernel and Scheduler
Transaction Level Modeling
Model Extraction and Fault Modeling
Model Extraction
Property Specification and Functional Correctness
Model in the Presence of Faults
Fault-Tolerant Model and Refinement
Fault-Tolerant Promela Model
Refinement
Discussion
Conclusions and Future Work
References
Competitive and Deterministic Embeddings of Virtual Networks
Introduction
VNet Specification and Service Models
Previous Work
Our Contribution
Problem Definition and Main Result
A Framework for Online Embeddings
LP Formulation
Generic Algorithm
A Reduction of Requests with Durations
Approximate Oracles
Application to VNet Service Models
Router Loads
Discussion
References
Solving the At-Most-Once Problem with Nearly Optimal Effectiveness
Introduction
Model, Definitions, and Efficiency
Model and Adversary
At-Most-Once Problem, Effectiveness and Complexity
Algorithm KK
Correctness and Effectiveness Analysis
Work Complexity Analysis
An Asymptotically Work Optimal Algorithm
An Asymptotically Optimal Algorithm for the Write-All Problem
References
Interplay between (Im)perfectness, Synchrony and Connectivity: The Case of Reliable Message Transmission
Introduction
Related Work
Model and Definitions
Reliability
Preliminaries
Characterizing Synchronous Networks for URMTLV
Sufficiency
Necessity
Characterizing Asynchronous Networks for URMTMC
Sufficiency
Necessity
Characterizing Asynchronous Networks for URMTLV
References
Tuning Paxos for High-Throughput with Batching and Pipelining
Introduction
Related Work
Background
Analytical Model of Paxos Performance
Quantitative Analysis of Phase 2 of Paxos
Maximizing Resource Utilization
Experimental Study
Discussion
References
Hybrid Approach for Experimental Networking Research
Introduction
Hybrid Experimental Environment
The ns-3 Network Simulator
The Grid-5000 Grid Environment
Hybrid Experimentation Setup
Configuration of the Simulation Scenario
Time Synchronization
Operating Limits and Mapping Algorithm
Study of the Operating Limit
Performance Study
Mapping Algorithm
Conclusion
References
Towards Optimal Event Detection and Localization in Acyclic Flow Networks
Introduction
Preliminaries and Problem Formulation
Definitions
Formulations of Problems
Node Placement for Optimal Sensing Coverage
Optimal Sensing CoverageAlgorithm
Beacon Placement for Optimal Event Localization
Beacon Placement Algorithm
Event Localization Algorithm
Performance Evaluation
Impact of and Dc on Sensing Coverage
Impact of Pd and Dc on Event Localization
Related Work
Conclusions
References
Virtual Tree: A Robust Overlay Network for Ensuring Interval Valid Queries in Dynamic Distributed Systems
References
Distributed Coverage-Enhancing Algorithms in Directional Sensor Networks with Rotatable Sensors
Introduction
Related Work
Rotatable Sensors for Coverage Problem
Rotatable Directional Sensing Model
Problem Definition
Solutions to MCRS Problem
Distributed Maximal Rotatable Angle algorithm
Distributed Maximal Coverage First Algorithm
Simulation Results
Conclusions
References
Finding the Quality of Line Coverage of a Sensor Network
Introduction
Finding the Smallest k-Covered Axis-Parallel Line Segment
Finding the Longest k-Uncovered Axis-Parallel Line Segment
References
Preserving Query Privacy in Urban Sensing Systems
Introduction and Motivation
Related Work
Preliminaries
Building Blocks
Components
Settings
Adversarial Strategies
Non-resident Adversary
Dissemination Strategy (Non-resident Adversary)
Privacy Analysis (Non-resident Adversary)
Overhead Analysis (Non-Resident Adversary)
Resident Adversary
Dissemination (Resident Adversary)
Privacy Analysis (Resident Adversary)
Overhead Analysis (Resident Adversary)
Discussion
Conclusion
References
Adaptive Velocity Based Guided Navigation in Wireless Sensor Networks
Introduction
Related Work
Target Tracking System
Network Architecture
Target Tracking Framework
Guided Navigation of FMO
Current Location Based Guidance Algorithm (CLG)
- Predicted Proportional Based Guidance Algorithm (ABG)
Adaptive Velocity Based Guidance Algorithm (AVG)
Performance Evaluation
Conclusions
References
Wireless Sensor Replica Detection in Mobile Environments
Introduction
Related Work
System Assumptions
Our Solution
Overview
Protocol Description
Overhead
Simulations and Discussion
Detection Capabilities
Tuning System Parameters
Concluding Remarks
References
Achieving Reliable and Timely Event Dissemination over WAN
Introduction
Related Work
Protocol Analysis under Ideal Conditions
Success Rate, F=1
Success Probability, F&1
Results and Discussion
Experimental Evaluation
Success Rate
Overhead
Performance
Dependance on Network Dynamics
Final Remarks
References
Postorder Based Routing and Transport Protocol for WSNs
Introduction
Solution Approaches for Downstream Routing
PN Routing and Transport Design
Upstream Communication
Formation and Maintenance of WSN Tree
Downstream Communication
Design Issues and Solutions
Simulation
Methodology
Results
Stabilizing Time of Network
Number of Transmissions
Performance of PN Routing
Observations
Conclusion and Future Work
References
An ID Based Secure Distributed Dynamic IP Configuration Scheme for Mobile Ad Hoc Networks
Introduction
The IDSDDIP Algorithm
The IDSDDIP Address Allocation
Authentication
Unique IP Address Generation
Graceful Departure
Graceless Departure
Network Partitioning and Merging
Performance Evaluation
Conclusions
References
Using Data Mules to Preserve Source Location Privacy in Wireless Sensor Networks
Introduction
System Model
Preliminaries
Attack Model
Linear-Regression Based Traffic Analysis
-Angle Anonymity
Mules-Saving-Source Protocol
Protocol Analysis
Buffering Delay at Data Source
Carrying Delay At Data Mules
Simulation and Results
Delay And Data Mules
Delay And Privacy Preservation
MSS And Direct Delivery
Related Work
Conclusion
References
Performance of MIMO over SUI Channels for IEEE 802.16 Networks
Introduction
Related Work
SUI Channel Model
Channel Model
Space-Time Block Code
Spatial Multiplexing
Simulation
Conclusion and Future Scope
References
A Localized Link Removal and Addition Based Planarization Algorithm
Introduction
Network Model
Related Work
Algorithm
Local Cross Link Detection and Removal
Local Link Addition
Theoretical Analysis
Planarity
Connectivity
Weak Spanner
Empirical Analysis
Conclusion and Future Work
References
iTrust: Trustworthy Information Publication, Search and Retrieval
Introduction
The iTrust Strategy
The iTrust Messaging Protocol
The iTrust Membership Protocol
Joining the Membership
Leaving the Membership
The iTrust Implementation
Web Server Foundation
Application Infrastructure
Public Interface
Evaluation of iTrust
Related Work
Conclusions and Future Work
References
wnPUT Testbed Experimentation Framework
Introduction
Related Work
Experimentation Methodology
The Purpose of the wnPUT Testbed
Research and Experimentation Cycles
Testbed Development Cycles
wnPUT Infrastructure
Experiment Execution Phases
Experimentation Process
Experiment Preparation
Experiment Execution
Experiment Results Processing
Analysis of Experimentation Effectiveness
Conclusions
References
Economic Models for Cloud Service Markets
Introduction
Problem Setup
Game 1 - Price Game
Game 2 - Price-QoS Game
Conclusion and Future Work
References
MIMO Enabled Efficient Mapping of Data in WiMAX Networks
Introduction
Proposed Technique
Assumptions
Proposed Technique at the Transmitter
Proposed Technique at the Receiver
Evaluating the Proposed Technique
Conclusion
References
An Efficient Scheduler for Closed Nested Transactions that Satisfies All-Reads-Consistency and Non-interference
Introduction
Background and System Model
Notations
LastWrites for Read Operations and OptConf Conflict Notion
Abort-Shielded Consistency
CP-ASC-Sched: An Online Scheduler Based on CP-ASC
Reasoning about Safety and Liveness
Conclusion
References
Logical Topology Design for WDM Networks Using Tabu Search
Introduction
Proposed Algorithm Using Tabu Search
Experimental Results
Conclusions
References
DTL: Dynamic Transport Library for Peer-to-Peer Applications
Introduction
Related Work
Contribution
Dynamic Transport Library (DTL)
Polite Mode
Variable Mode
Evaluation
Polite Mode Results
Variable Mode Results
Conclusion
References
DTLS Mobility
Introduction
Datagram Transport Layer Security
Base Protocol
Heartbeat Extension
Related Work
General Considerations
Concept
DTLS Mobility
Path MTU Discovery
ICMP Considerations
Implementation
Tests
Applications
Conclusion and Outlook
References
PreeN: Improving Steady-State Performance of ISP-Friendly P2P Applications
Introduction
Background
Bittorrent
ISP-Friendly P2P Applications
Flash Crowd (FC) and Steady State (SS) Scenarios
A Simple Illustration: Performance Difference in Different Scenarios
FC vs SS
Uniform vs Zipf Peer Distribution
Proposed PreeN Application
Modification to the Application Tracker
Modification in the Client Side
What Is the Value of k
Evaluation of the Proposal
Simulator Details
Performance Metrics.
Simulation Setup
Simulation Results
Discussion
Conclusion
References
Decentralized Information Dissemination in Multidimensional Semantic Social Overlays
Introduction
Related Work
Approach
System Model
Concepts
Problem Statement
Multi-dimensional Social Network Model
Propagation Using Swarm Particle
Evaluation
Dataset
Results
Conclusion and Future Work
References
Multi-path OLSR Performance Analysis in a Large Testbed Environment
Introduction
DES-Testbed
Multi-path OLSR
Experiments
Experiment Setup
Experiment Scenario
Evaluation of Results
Related Work
Conclusions
References
Buffer Dimensioning of Delay-Tolerant Network Nodes - A Large Deviations Approach
Introduction
Motivation
Related Work
System Model
Queueing Theory Approximation
Buffer Dimensioning Framework
Analytical and Simulation Results
Performance Metrics Used
Simulation Setup
Simulation Results
Conclusion and Future Work
References
Impact of Persistent Storage on the DTN Routing Performance
Introduction
Related Work
Motivation
System Model
Persistent Storage Framework
Time in Primary Scheduling (TiPS)
Conclusion
Future Work
References
A Simple and Efficient Input Selection Function for Networks-on-Chip
Introduction
Related Work
Proposed Selection Functions
Motivation of the Novel ISF
Priorities of the Proposed Input Selection Strategies
The Proposed ISF Algorithm
Design and Implementation
Experiments
Traffic Scenarios and Evaluation Metrics
Experiment Results and Discussion
Conclusion
References
Efficient Semi-supervised Learning BitTorrent Traffic Detection - An Extended Summary
Introduction
Proposed System: Intelligent Combination
Performance Evaluation
Conclusion
References
Cryptanalysis of a Certificateless Multi-Proxy Signature Scheme
Introduction
Security of CLMPS Schemes
Attack on a CLMPS Scheme
Bilinear Maps
Jin and Wen's CLMPS Scheme
The Attack
Conclusion
References
Author Index

Systemvoraussetzungen

Als PDF speichern Als Link merken