Titel: Distributed Computing - IWDC 2005
7th International Workshop, Kharagpur, India, December 27-30, 2005, Proceedings.
'Lecture Notes in Computer Science'. 'Theoretical Computer Science and General Issues'.
Herausgegeben von Arobinda Gupta, Ajay D. Kshemkalyani, Rajeev Kumar
Springer Berlin Heidelberg
13. Dezember 2005 - kartoniert - 616 Seiten
We also thank all the members of the Organizing Committee, Arobinda Gupta,AjitPal,ShamikSural,IndranilSengupta,AbhijitDas,DipankarSarkar, Jayanta Mukhopadhyay, Pallab Dasgupta, Debasish Samanta, Soumya Ghosh, Arijit Bishnu, Pabitra Mitra, and Sudeshna Sarkar, for their e?orts. We are grateful to the Indian Institute of Technology Kharagpur, and in particular to Prof. S.C. De Sarkar, Head, School of Information Technology and Deputy - rector,IITKharagpur,forextendingthelogisticsupporttotheconference.Prof. DeSarkarisalsoamemberoftheSteeringCommitteeofIWDC.Lastbutnotthe least, we also thank Prof. Sukumar Ghosh, who is heading the IWDC Steering Committee, for his guidance and his continuous support and advice. No academic meeting can achieve its desired end without the contributions of the authors, reviewers, and the participants. We extend our heartfelt thanks to all of them for making the event a success. We sincerely hope that this event will be a valuable addition to the Distributed Computing research endeavor. December 2005 Anupam Basu Michel Raynal Program Chairs' Message On behalf of the Program Committee of the 7th International Workshop on Distributed Computing (IWDC) 2005, it is our great pleasure to welcome all of you to Kharagpur, India. Our goal has been to put together a rich technical program, including high-quality technical papers and state-of-the-art tutorials and invited talks. The conference received 253 submissions in response to the call for papers.
Keynote Talk I.- Distributed Coordination Algorithms for Mobile Robot Swarms: New Directions and Challenges.- Session I A: Theory.- Labeling Schemes for Tree Representation.- Single-Bit Messages Are Insufficient in the Presence of Duplication.- Safe Composition of Distributed Programs Communicating over Order-Preserving Imperfect Channels.- Efficiently Implementing LL/SC Objects Shared by an Unknown Number of Processes.- Placing a Given Number of Base Stations to Cover a Convex Region.- Session I B: Sensor Networks I.- A State-Space Search Approach for Optimizing Reliability and Cost of Execution in Distributed Sensor Networks.- Protocols for Sensor Networks Using COSMOS Model.- CLUR-Tree for Supporting Frequent Updates of Data Stream over Sensor Networks.- Optimizing Lifetime and Routing Cost in Wireless Networks.- Multipath Source Routing in Sensor Networks Based on Route Ranking.- Reliable Time Synchronization Protocol in Sensor Networks Considering Topology Changes.- A.K. Choudhury Memorial Lecture.- The Brain, Complex Networks, and Beyond.- Session II A: Fault Tolerance.- An Asynchronous Recovery Algorithm Based on a Staggered Quasi-Synchronous Checkpointing Algorithm.- Self-stabilizing Publish/Subscribe Protocol for P2P Networks.- Self-stabilizing Checkpointing Algorithm in Ring Topology.- Performance Comparison of Majority Voting with ROWA Replication Method over PlanetLab.- Self-refined Fault Tolerance in HPC Using Dynamic Dependent Process Groups.- Session II B: Optical Networks.- In-Band Crosstalk Performance of WDM Optical Networks Under Different Routing and Wavelength Assignment Algorithms.- Modeling and Evaluation of a Reconfiguration Framework in WDM Optical Networks.- On the Implementation of Links in Multi-mesh Networks Using WDM Optical Networks.- Distributed Dynamic Lightpath Allocation in Survivable WDM Networks.- Protecting Multicast Sessions from Link and Node Failures in Sparse-Splitting WDM Networks.- Session III A: Peer-to-Peer Networks.- Oasis: A Hierarchical EMST Based P2P Network.- GToS: Examining the Role of Overlay Topology on System Performance Improvement.- Churn Resilience of Peer-to-Peer Group Membership: A Performance Analysis.- Uinta: A P2P Routing Algorithm Based on the User's Interest and the Network Topology.- Session III B: Wireless Networks I.- Optimal Time Slot Assignment for Mobile Ad Hoc Networks.- Noncooperative Channel Contention in Ad Hoc Wireless LANs with Anonymous Stations.- A Power Aware Routing Strategy for Ad Hoc Networks with Directional Antenna Optimizing Control Traffic and Power Consumption.- Power Aware Cluster Efficient Routing in Wireless Ad Hoc Networks.- A New Routing Protocol in Ad Hoc Networks with Unidirectional Links.- Keynote Talk II.- Impact of the Columbia Supercomputer on NASA Science and Engineering Applications.- Session IV A: Sensor Networks II.- Hierarchical Routing in Sensor Networks Using k-Dominating Sets.- On Lightweight Node Scheduling Scheme for Wireless Sensor Networks.- Clique Size in Sensor Networks with Key Pre-distribution Based on Transversal Design.- Session IV B: Wireless Networks II.- Stochastic Rate-Control for Real-Time Video Transmission over Heterogeneous Network.- An Efficient Social Network-Mobility Model for MANETs.- Design of an Efficient Error Control Scheme for Time-Sensitive Application on the Wireless Sensor Network Based on IEEE 802.11 Standard.- Agglomerative Hierarchical Approach for Location Area Planning in a PCSN.- Keynote Talk III.- A Clustering-Based Selective Probing Framework to Support Internet Quality of Service Routing.- Session V A: Network Security.- A Fair and Reliable P2P E-Commerce Model Based on Collaboration with Distributed Peers.- An Efficient Access Control Model for Highly Distributed Computing Environment.- Cryptanalysis and Improvement of a Multisignature Scheme.- Key Forwarding: A Location-Adaptive Key-Establishment Scheme for Wireless Sensor Networks.- New Anonymous User Identification and Key Establishment Protocol in Distributed Networks.- Session V B: Grid and Networks.- Semantic Overlay Based Services Routing Between MPLS Domains.- Effective Static Task Scheduling for Realistic Heterogeneous Environment.- eHSTCP: Enhanced Congestion Control Algorithm of TCP over High-Speed Networks.- Keynote Talk IV.- Programming Paradigms for Networked Sensing: A Distributed Systems' Perspective.- Session VI A: Middleware and Data Management.- Deadlock-Free Distributed Relaxed Mutual-Exclusion Without Revoke-Messages.- Fault Tolerant Routing in Star Graphs Using Fault Vector.- Optimistic Concurrency Control in Firm Real-Time Databases.- Stochastic Modeling and Performance Analysis for Video-On-Demand Systems.- A Memory Efficient Fast Distributed Real Time Commit Protocol.- A Model for the Distribution Design of Distributed Databases and an Approach to Solve Large Instances.- Session VI B: Mobility Management.- Tracking of Mobile Terminals Using Subscriber Mobility Pattern with Time-Bound Self Purging Indicators and Regional Route Maps.- SEBAG: A New Dynamic End-to-End Connection Management Scheme for Multihomed Mobile Hosts.- Efficient Mobility Management for Cache Invalidation in Wireless Mobile Environment.- Analysis of Hierarchical Multicast Protocol in IP Micro Mobility Networks.- Efficient Passive Clustering and Gateway Selection in MANETs.- Mobile Agent Based Message Communication in Large Ad Hoc Networks Through Co-operative Routing Using Inter-agent Negotiation at Rendezvous Points.- Network Mobility Management Using Predictive Binding Update.- Session VII: Distributed Articial Intelligence.- Planning in a Distributed System.- Using Inertia and Referrals to Facilitate Satisficing Distributions.- Privacy Preserving Decentralized Method for Computing a Pareto-Optimal Solution.