Distributed Computing and Networking 11th International Conference, ICDCN 2010, Kolkata, India, January 3-6, 2010, Proceedings
This book constitutes the refereed proceedings of the 11th International Conference on Distributed Computing and Networking, ICDCN 2010, held in Kolkata, India, during January 3-6, 2010. There were 169 submissions, 96 to the networking track and 73 to the distributed computing track. After review th...
Saved in:
| Main Authors | , , , |
|---|---|
| Format | eBook |
| Language | English |
| Published |
Netherlands
Springer Nature
2010
Springer Berlin / Heidelberg Springer |
| Edition | 1 |
| Series | Lecture notes in computer science |
| Subjects | |
| Online Access | Get full text |
| ISBN | 9783642113222 3642113222 9783642113215 3642113214 |
Cover
Table of Contents:
- Limitations of the Credit Based System -- The Credit Reputation Propagation Strategy(CRPS) -- Critical Issues of the Strategy -- Metrics -- Experimental Results -- Conclusion -- References -- Formal Understanding of the Emergence of Superpeer Networks: A Complex Network Approach -- Introduction -- Bootstrapping Protocol -- Development of Analytical Framework: Peers Joining with Fixed Cutoff Degree -- Simulation Results -- Impact of Node Weight w2 on pkc -- Impact of Fraction of High Weight Nodes (fw2) on pkc -- Development of Analytical Framework: Peers Joining with Variable Cutoff Degrees -- Simulation Results -- Impact of Peer Churn on the Topology of the Emerging Network -- Case Study with Gnutella Network -- Conclusion and Discussion -- References -- Parallel and Distributed Systems -- Parallelization of the Lanczos Algorithm on Multi-core Platforms -- Introduction -- The Lanczos Algorithm -- Sequential Implementation -- Representing the Matrix B -- The Structure of the Matrix B -- Parallel Implementation -- Load Balancing -- Load Balancing in Parallel -- Thread-Level vs. Process-Level Parallelism -- Experimental Results -- Conclusion -- References -- Supporting Malleability in Parallel Architectures with Dynamic CPUSETs Mapping and Dynamic MPI -- Introduction -- Related Works and Definitions -- Supporting Malleability with Dynamic CPUSETs Mapping and Dynamic MPI -- Dynamic CPUSETs Mapping Requirements -- Dynamic MPI Requirements -- Experimental Evaluation -- Malleability on Multicore Nodes with Dynamic CPUSETs Mapping -- Malleability on a Cluster with Dynamic MPI -- Improving Resource Utilization Using Malleability -- Conclusions and Future Works -- References -- Impact of Object Operations and Relationships on Concurrency Control in DOOS -- Introduction -- Review of Object Oriented Concepts -- Types and Properties of Object Operations
- Heuristic Algorithms for NP-complete Pipeline Mapping Problems -- General Task Graph Optimization -- Implementation and Evaluation -- Implementation and Experimental Settings -- Performance Evaluation for Linear Pipelines -- Performance Evaluation for DAG-Structured Workflows -- Conclusions and Future Work -- References -- Radio Network Distributed Algorithms in the Unknown Neighborhood Model -- Introduction -- From Scratch Approximation of Node Degrees -- Description of the Algorithm -- Analysis -- An Algorithm for Computing the Local Maximum Degree -- Applications -- On Simulating the Message Passing Model -- On Computing a Coloring in Unit Disk Graphs -- Conclusion -- References -- Probabilistic Self-stabilizing Vertex Coloring in Unidirectional Anonymous Networks -- Introduction -- Model -- Probabilistic Self-stabilizing Unidirectional Coloring -- Conclusion -- References -- A Token-Based Solution to the Group Mutual l-Exclusion Problem in Message Passing Distributed Systems -- Introduction -- Working of DRS_GMLE -- Correctness of DRS_GMLE -- Performance of DRS_GMLE -- Conclusions -- References -- Peer-to-Peer Networks and Network Tracing -- The Weak Network Tracing Problem -- Introduction -- Networks, Traces and Network Tracing -- Term Definitions -- Generable Trace Sets -- The Weak Network Tracing Problem -- The Impossibility of Weak Network Tracing -- Weak Tracing with One Irregular Node -- Weak Tracing in a General Network -- Size of the Solution Set -- Related Work -- Conclusion -- References -- Poisoning the Kad Network -- Introduction -- eMule and Kad -- Attacks -- Node Insertion Attack -- Publish Attack -- Eclipse Attack -- Discussion -- Related Work -- Conclusion -- References -- Credit Reputation Propagation: A Strategy to Curb Free-Riding in a Large BitTorrent Swarm -- Introduction -- Basics of BitTorrent
- Title Page -- Preface -- Organization -- Table of Contents -- Keynotes -- An Intelligent IT Infrastructure for the Future -- Heavy Tails and Models for the Web and Social Networks -- Data Structures and Algorithms for Packet Forwarding and Classification: Prof. A.K. Choudhury Memorial Lecture -- Spoken Web: A ParallelWeb for the Masses: Industry Keynote -- India's Mobile Revolution and the Unfinished Tasks: Invited Lecture -- Network Protocols and Applications -- Scheduling in Multi-Channel Wireless Networks -- Introduction -- Preliminaries -- Scheduling in Multi-Channel Networks -- Summary of Results -- Maximal Schedulers -- Centralized Greedy Maximal Scheduler -- Multiple Interfaces per Node -- Special Case: |C| Interfaces per Node -- A Rate-Proportional Maximal Multi-Channel (RPMMC) Scheduler -- Discussion -- Future Directions -- References -- Email Shape Analysis -- Introduction -- Email Shape -- Applications of E-Shape -- Spam Botnet Detection -- Hand labeling. -- Template Discussion. -- Future Work and Preliminary Results -- Spam Filtering -- Social Context-Based Finger Print Detection -- Limitations of the Study -- Conclusion -- References -- Maintaining Safety in Interdomain Routing with Hierarchical Path-Categories -- Introduction -- Stable-Path Problem and Path-Vector Protocols -- AS Graphs -- The Stable-Paths Problem and Its Solution -- Path-Vector Routing and Divergence -- Solving Divergence: Related Work -- Routing Policy Analysis -- Run-Time Divergence Detection -- Policy Restrictions -- Totally Ordered Categories -- Partially Ordered Categories -- Single Category-Path Per Node -- Concluding Remarks -- References -- Fault-tolerance and Security -- On Communication Complexity of Secure Message Transmission in Directed Networks -- Introduction -- Preliminaries -- Pseudo-basis and Pseudo-dimension -- Extracting Randomness
- Sensor Mobility for k-Coverage of a Region of Interest -- Centralized Approach for Mobile Sensor Selection (CAMSEL) -- Distributed Approach for Mobile Sensor Selection (DAMSEL) -- How to Ensure Network Connectivity? -- Performance Evaluation -- Conclusion -- References -- Lessons from the Sparse Sensor Network Deployment in Rural India -- Introduction and Issues with the Current Network -- Motivation and the New Deployment -- Related Work -- Methodology for Sparse Deployment -- Knowledge of Radiation Pattern -- Receiver Sensitivity -- Radio Data Rate -- Choice of MAC and Routing Protocol Stack -- GPRS Measurements -- Discussions -- Summary and Conclusion -- References -- A New Architecture for Hierarchical Sensor Networks with Mobile Data Collectors -- Introduction -- Review -- Network Design with Mobile Data Collector -- Network Model -- Notation Used -- ILP Formulation for Relay Node Placement and Trajectory Calculation -- Justification of the ILP Equations -- Computation of the Buffer Size -- Experimental Results -- Conclusions -- References -- Stability Analysis of Multi-hop Routing in Sensor Networks with Mobile Sinks -- Introduction -- Related Work -- Single-Hop (k = 1) -- Multi-hop (k > -- 1) -- Non-real-time Data Collection -- Application Model -- Practical Considerations -- Problem Formulation -- Model for the Hop-Bound Factor -- Trajectory Length -- Trip Collection-Time -- Experimental Evaluation of the Routing Thresholds -- Summary and Conclusions -- References -- Distributed Algorithms and Optimization -- Optimizing Distributed Computing Workflows in Heterogeneous Network Environments -- Introduction -- Mathematical Models and Objectives -- Analytical Models for Workflows and Networks -- Mapping Objective Functions -- Linear Pipeline Optimization -- Optimal Solution to MED-ANR -- NP-Completeness of MED/MFR-NNR/CNR and MFR-ANR
- Concurrency Control in DOOS
- PRMT with Constant Factor Overhead -- Lower Bound on Communication Complexity of Two Phase PSMT -- Lower Bounds for Three or More Phase PSMT -- Secret Sharing Schemes and MDS Codes -- The Lower Bound on Communication Complexity -- Upper Bounds for Three or More Phase PSMT -- Communication Optimal PSMT with 0< -- u< -- t/2 and n = 3t-2u+1 -- Communication Optimal PSMT When t/2 < -- u < -- t and n > -- 2t+1 -- Communication Optimal PSMT When u > -- t and n > -- 2t+1 -- Open Problems -- References -- On Composability of Reliable Unicast and Broadcast -- Introduction -- Motivation and Our Results -- Our Model -- Composability of Reliable Unicast -- Impossibility of Parallel Composability -- Sequential Composability -- Randomized Composable Reliable Unicast for Free -- Composability of Reliable Broadcast -- Parallel Composition -- Conclusion -- References -- A Leader-Free Byzantine Consensus Algorithm -- Introduction -- Definitions and System Model -- Byzantine Consensus -- System Model -- Basic Round Model -- From Synchrony to Partial Synchrony -- Leader-Free Consensus Algorithm for a Synchronous System -- Extending EIGByz for a Partially Synchronous Model -- Summary -- Optimizations -- Discussion and Future Work -- Conclusion -- References -- Authenticated Byzantine Generals in Dual Failure Model -- Introduction -- Motivation -- Our Contributions and Results -- Organization of the Paper -- Our Model -- Problem Definition -- Definitions -- Complete Characterization -- Protocol for n> -- 2tb+tp -- Conclusion -- References -- Sensor Networks -- Mission-Oriented k-Coverage in Mobile Wireless Sensor Networks -- Introduction -- Problem Statement -- Contributions -- Network Model -- Related Work -- Pseudo-random Sensor Placement for On-Demand k-Coverage -- Ensuring k-Coverage of a Region of Interest -- Where Would Mobile Sensors Be Located?