Fr. 70.00

Network and Parallel Computing - IFIP International Conference, NPC 2008, Shanghai, China, October 18-20, 2008, Proceedings

English · Paperback / Softback

Shipping usually within 6 to 7 weeks

Description

Read more

Welcome to the proceedings of the 2008 IFIP International Conference on Network and Parallel Computing (NPC 2008) held in Shanghai, China. NPC has been a premier conference that has brought together researchers and pr- titioners from academia, industry and governments around the world to advance the theories and technologies of network and parallel computing. The goal of NPC is to establish an international forum for researchers and practitioners to present their - cellent ideas and experiences in all system fields of network and parallel computing. The main focus of NPC 2008 was on the most critical areas of network and parallel computing, network technologies, network applications, network and parallel archit- tures, and parallel and distributed software. In total, the conference received more than 140 papers from researchers and prac- tioners. Each paper was reviewed by at least two internationally renowned referees and selected based on its originality, significance, correctness, relevance, and clarity of presentation. Among the high-quality submissions, only 32 regular papers were accepted by the conferences. All of the selected conference papers are included in the conference proceedings. After the conference, some high-quality papers will be r- ommended to be published in the special issue of international journals. We were delighted to host three well-known international scholars offering the k- note speeches, Sajal K. Das from University Texas at Arlington USA, Matt Mutka from Michigan State University and David Hung-Chang Du from University of M- nesota University of Minnesota.

List of contents

Network Technologies.- An AIAD-Based Adaptive Routing Protocol in Ad-Hoc Wireless Networks.- Adaptive Neighbor Selection for Service Discovery in Mobile Ad Hoc Networks.- A Formal Approach to Robustness Testing of Network Protocol.- Deadline Probing: Towards Timely Cognitive Wireless Network.- SRDFA: A Kind of Session Reconstruction DFA.- Measuring the Normality of Web Proxies' Behavior Based on Locality Principles.- Network Applications.- Feedback Control-Based Database Connection Management for Proportional Delay Differentiation-Enabled Web Application Servers.- Research on the Detection of Distributed Denial of Service Attacks Based on the Characteristics of IP Flow.- Password-Authenticated Key Exchange between Clients in a Cross-Realm Setting.- Forward Secure Password-Based Authenticated Key Distribution in the Three-Party Setting.- Key Management Using Certificateless Public Key Cryptography in Ad Hoc Networks.- A Data Storage Mechanism for P2P VoD Based on Multi-channel Overlay.- HTL: A Locality Bounded Flat Hash Location Service.- Accelerating the Propagation of Active Worms by Employing Multiple Target Discovery Techniques.- Online Accumulation: Reconstruction of Worm Propagation Path.- HRS: A Hybrid Replication Strategy for Exhaustive P2P Search.- ResourceDog: A Trusted Resource Discovery and Automatic Invocation P2P Framework.- Network and Parallel Architectures.- A Novel Approach to Manage Asymmetric Traffic Flows for Secure Network Proxies.- Automatic Transformation for Overlapping Communication and Computation.- Cooperative Communication System for Parallel Computing Agents in Multi-cluster Grid.- CPI: A Novel Three-Phase Algorithm for QoS-Aware Replica Placement Problem.- Online Balancing Two Independent Criteria.- Procrastination Scheduling forFixed-Priority Tasks with Preemption Thresholds.- Parallel and Distributed Software.- Survey on Parallel Programming Model.- An Integrated Framework for Wireless Sensor Web Service and Its Performance Analysis Based on Queue Theory.- Grid Computing: A Case Study in Hybrid GMRES Method.- Towards Resource Reliability Support for Grid Workflows.- A SyncML Middleware-Based Solution for Pervasive Relational Data Synchronization.- An Efficient Authentication and Key Agreement Protocol in RFID System.- Grid Service Discovery Based on Cross-VO Service Domain Model.- Ontology-Based Semantic Method for Service Modeling in Grid.- A Scalable and Adaptive Distributed Service Discovery Mechanism in SOC Environments.

Product details

Assisted by Jian Cao (Editor), Jinjun Chen (Editor), Jinjun Chen (Editor), Mingl Li (Editor), Minglu Li (Editor), Min-You Wu (Editor), Min-You Wu (Editor), Min-You Wu et al (Editor)
Publisher Springer, Berlin
 
Languages English
Product format Paperback / Softback
Released 27.09.2012
 
EAN 9783540881391
ISBN 978-3-540-88139-1
No. of pages 366
Dimensions 155 mm x 20 mm x 235 mm
Weight 580 g
Illustrations XIII, 366 p.
Series Lecture Notes in Computer Science
Theoretical Computer Science and General Issues
Lecture Notes in Computer Science / Theoretical Computer Science and General Issues
Lecture Notes in Computer Science
Theoretical Computer Science and General Issues
Subjects Natural sciences, medicine, IT, technology > IT, data processing > Data communication, networks

C, Computerhardware, Algorithmen und Datenstrukturen, Kodierungstheorie und Verschlüsselung (Kryptologie), Kryptografie, Verschlüsselungstechnologie, Informationstheorie, Theoretische Informatik, computer science, Data Structures and Information Theory, Computer Communication Networks, Computer Engineering, Computers, Algorithms & data structures, Information theory, Coding theory & cryptology, Computer Engineering and Networks, Computer Systems Organization and Communication Networks, Computer organization, Data structures (Computer science), Data encryption, Data encryption (Computer science), Cryptology, Computer communication systems, Computer networking & communications, Models and Principles, Models of Computation

Customer reviews

No reviews have been written for this item yet. Write the first review and be helpful to other users when they decide on a purchase.

Write a review

Thumbs up or thumbs down? Write your own review.

For messages to CeDe.ch please use the contact form.

The input fields marked * are obligatory

By submitting this form you agree to our data privacy statement.