Distributed Computing and Networking: 9th International Conference, ICDCN 2008, Kolkata, India, January 5-8, 2008, Proceedings

Overview

This book constitutes the fully refereed proceedings of the 9th International Conference on Distributed Computing and Networking, ICDCN 2008 - formerly known as IWDC (International Workshop on Distributed Computing), held in Kolkata, India, in January 2008. The 30 revised full papers and 27 revised short papers presented together with 3 keynote talks and 1 invited lecture were carefully reviewed and selected from 185 submissions. The papers are organized in topical sections.

...
See more details below
Paperback (2008)
$149.00
BN.com price
Other sellers (Paperback)
  • All (12) from $20.57   
  • New (8) from $95.96   
  • Used (4) from $20.57   
Sending request ...

Overview

This book constitutes the fully refereed proceedings of the 9th International Conference on Distributed Computing and Networking, ICDCN 2008 - formerly known as IWDC (International Workshop on Distributed Computing), held in Kolkata, India, in January 2008. The 30 revised full papers and 27 revised short papers presented together with 3 keynote talks and 1 invited lecture were carefully reviewed and selected from 185 submissions. The papers are organized in topical sections.

Read More Show Less

Product Details

Table of Contents

A.K. Choudhury Memorial Lecture.- Rough-Fuzzy Knowledge Encoding and Uncertainty Analysis: Relevance in Data Mining.- Keynote Talks.- Utility-Based Data-Gathering in Wireless Sensor Networks with Unstable Links.- Sensor Networks Continue to Puzzle: Selected Open Problems.- Distributed Coordination of Workflows over Web Services and Their Handheld-Based Execution.- Distributed Computing Track Papers.- The Building Blocks of Consensus.- Continuous Consensus with Ambiguous Failures.- On Optimal Probabilistic Asynchronous Byzantine Agreement.- Narrowing Power vs. Efficiency in Synchronous Set Agreement.- Fault Tolerance and Synchronization.- Highly-Concurrent Multi-word Synchronization.- Fault Tolerance in Finite State Machines Using Fusion.- Wait-Free Dining Under Eventual Weak Exclusion.- On the Inherent Cost of Atomic Broadcast and Multicast in Wide Area Networks.- Detection of Disjunctive Normal Form Predicate in Distributed Systems.- Solving Classic Problems in Distributed Systems: The Smart-Message Paradigm.- Design of Concurrent Utilities in Jackal: A Software DSM Implementation.- Self-stabilization.- Anonymous Daemon Conversion in Self-stabilizing Algorithms by Randomization in Constant Space.- Snap-Stabilizing Waves in Anonymous Networks.- Self-stabilizing Distributed Prool Switching.- A Self-stabilizing Algorithm for the Minimum Color Sum of a Graph.- Scheduling, Clustering, and Data Mining.- Global Fixed-Priority Scheduling of Arbitrary-Deadline Sporadic Task Systems.- Scalable and Distributed Mechanisms for Integrated Scheduling and Replication in Data Grids.- DGDCT: A Distributed Grid-Density Based Algorithm for Intrinsic Cluster Detection over Massive Spatial Data.- An Abstraction Based Communication Efficient Distributed Association Rule Mining.- List Heuristic Scheduling Algorithms for Distributed Memory Systems with Improved Time Complexity.- Parallel Architectures and Algorithms.- CG-Cell: An NPB Benchmark Implementation on Cell Broadband Engine.- Parallel Algorithm for Conflict Graph on OTIS-Triangular Array.- A Deadlock Free Shortest Path Routing Algorithm for WK-Recursive Meshes.- Mobile Agents and Cryptography.- Proving Distributed Algorithms for Mobile Agents: Examples of Spanning Tree Computation in Anonymous Networks.- Mobile Agent Rendezvous in a Ring Using Faulty Tokens.- A New Key-Predistribution Scheme for Highly Mobile Sensor Networks.- Alternative Prools for Generalized Oblivious Transfer.- Networking Track Papers.- The Crossroads Approach to Information Discovery in Wireless Sensor Networks.- Tree-Based Anycast for Wireless Sensor/Actuator Networks.- A Distributed Algorithm for Load-Balanced Routing in Multihop Wireless Sensor Networks.- Using Learned Data Patterns to Detect Malicious Nodes in Sensor Networks.- An Efficient Key Establishment Scheme for Self-organizing Sensor Networks.- Internet and Security.- SuperTrust – A Secure and Efficient Framework for Handling Trust in Super Peer Networks.- A Highly Flexible Data Structure for Multi-level Visibility of P2P Communities.- Mathematical Performance Modelling of Stretched Hypercubes.- A Family of Collusion Resistant Symmetric Key Prools for Authentication.- An Escalated Approach to Ant Colony Clustering Algorithm for Intrusion Detection System.- Sensor Networks II.- Interplay of Processing and Routing in Aggregate Query Optimization for Sensor Networks.- Exploiting Resource-Rich Actors for Bridging Network Partitions in Wireless Sensor and Actor Networks.- A New Top-Down Hierarchical Multi-hop Routing Prool for Wireless Sensor Networks.- PROBESYNC: Platform Based Synchronization for Enhanced Life of Large Scale Wireless Sensor Networks.- Optical Networks.- An Adaptive Split Reservation Prool (SRP) for Dynamically Reserving Wavelengths in WDM Optical Networks.- Routing and Wavelength Assignment in All Optical Networks Based on Clique Partitioning.- Fault Detection and Localization Scheme for Multiple Failures in Optical Network.- A Heuristic Search for Routing and Wavelength Assignment in Distributed WDM Optical Networks with Limited Range Wavelength Conversion.- QoS and Multimedia.- An Efficient Storage Mechanism to Distribute Disk Load in a VoD Server.- Multi Level Pricing for Service Differentiation and Congestion Control in Communication Networks.- Revenue-Driven Bandwidth Management for End-to-End Connectivity over IP Networks.- Modeling and Predicting Point-to-Point Communication Delay of Circuit Switching in the Mesh-Connected Networks.- Wireless Networks.- Maximizing Aggregate Saturation Throughput in IEEE 802.11 Wireless LAN with Service Differentiation.- Overloading Cellular DS-CDMA: A Bandwidth-Efficient Scheme for Capacity Enhancement.- Enhancing DHCP for Address Auonfiguration in Multi-hop WLANs.- Channel Assignment in Multimedia Cellular Networks.- Ad Hoc Networks.- On Routing with Guaranteed Delivery in Three-Dimensional Ad Hoc Wireless Networks.- Energy-Efficient Dominating Tree Construction in Wireless Ad Hoc and Sensor Networks.- A Location-Aided Content Searching Mechanism for Large Mobile Ad Hoc Network Using Geographic Clusters.- A Centralized Algorithm for Topology Management in Mobile Ad-Hoc Networks through Multiple Coordinators.

Read More Show Less

Customer Reviews

Be the first to write a review
( 0 )
Rating Distribution

5 Star

(0)

4 Star

(0)

3 Star

(0)

2 Star

(0)

1 Star

(0)

Your Rating:

Your Name: Create a Pen Name or

Barnes & Noble.com Review Rules

Our reader reviews allow you to share your comments on titles you liked, or didn't, with others. By submitting an online review, you are representing to Barnes & Noble.com that all information contained in your review is original and accurate in all respects, and that the submission of such content by you and the posting of such content by Barnes & Noble.com does not and will not violate the rights of any third party. Please follow the rules below to help ensure that your review can be posted.

Reviews by Our Customers Under the Age of 13

We highly value and respect everyone's opinion concerning the titles we offer. However, we cannot allow persons under the age of 13 to have accounts at BN.com or to post customer reviews. Please see our Terms of Use for more details.

What to exclude from your review:

Please do not write about reviews, commentary, or information posted on the product page. If you see any errors in the information on the product page, please send us an email.

Reviews should not contain any of the following:

  • - HTML tags, profanity, obscenities, vulgarities, or comments that defame anyone
  • - Time-sensitive information such as tour dates, signings, lectures, etc.
  • - Single-word reviews. Other people will read your review to discover why you liked or didn't like the title. Be descriptive.
  • - Comments focusing on the author or that may ruin the ending for others
  • - Phone numbers, addresses, URLs
  • - Pricing and availability information or alternative ordering information
  • - Advertisements or commercial solicitation

Reminder:

  • - By submitting a review, you grant to Barnes & Noble.com and its sublicensees the royalty-free, perpetual, irrevocable right and license to use the review in accordance with the Barnes & Noble.com Terms of Use.
  • - Barnes & Noble.com reserves the right not to post any review -- particularly those that do not follow the terms and conditions of these Rules. Barnes & Noble.com also reserves the right to remove any review at any time without notice.
  • - See Terms of Use for other conditions and disclaimers.
Search for Products You'd Like to Recommend

Recommend other products that relate to your review. Just search for them below and share!

Create a Pen Name

Your Pen Name is your unique identity on BN.com. It will appear on the reviews you write and other website activities. Your Pen Name cannot be edited, changed or deleted once submitted.

 
Your Pen Name can be any combination of alphanumeric characters (plus - and _), and must be at least two characters long.

Continue Anonymously

    If you find inappropriate content, please report it to Barnes & Noble
    Why is this product inappropriate?
    Comments (optional)