Distributed Computing – IWDC 2005: 7th International Workshop, Kharagpur, India, December 27-30, 2005, ProceedingsAjit Pal, Ajay D. Kshemkalyani, Rajeev Kumar, Arobinda Gupta Springer, 2005. gada 17. dec. - 590 lappuses This book constitutes the refereed proceedings of the 7th International Workshop on Distributed Computing, IWDC 2004, held in Kharagpur, India in December 2005. The 28 revised full papers and 33 revised short papers presented together with 5 invited keynote talks were carefully reviewed and selected from 253 submissions. The papers are organized in topical sections on theory of distributed computing, sensor networks, fault tolerance, optical networks, peer-to-peer networks, wireless networks, network security, grid and networks, middleware and data management, mobility management, and distributed artificial intelligence. |
Saturs
1 | |
25 | |
45 | |
Sensor Networks I | 63 |
CLURTree for Supporting Frequent Updates of Data Stream over | 87 |
Optimizing Lifetime and Routing Cost in Wireless Networks | 93 |
A K Choudhury Memorial Lecture | 111 |
Selfstabilizing PublishSubscribe Protocol for P2P Networks | 129 |
An Efficient Access Control Model for Highly Distributed Computing | 392 |
Cryptanalysis and Improvement of a Multisignature Scheme | 398 |
A LocationAdaptive KeyEstablishment Scheme | 404 |
New Anonymous User Identification and Key Establishment Protocol | 410 |
Grid and Networks | 416 |
Effective Static Task Scheduling for Realistic Heterogeneous | 428 |
Enhanced Congestion Control Algorithm of TCP over | 439 |
Keynote Talk IV | 451 |
Performance Comparison of Majority Voting with ROWA Replication | 147 |
Modeling and Evaluation of a Reconfiguration Framework in | 171 |
On the Implementation of Links in Multimesh Networks Using | 183 |
PeertoPeer Networks | 201 |
A Performance | 226 |
Wireless Networks I | 250 |
A Power Aware Routing Strategy for Ad Hoc Networks with Direc | 275 |
Power Aware Cluster Efficient Routing in Wireless Ad Hoc Networks | 281 |
Sensor Networks II | 306 |
Clique Size in Sensor Networks with Key Predistribution Based | 329 |
An Efficient Social NetworkMobility Model for MANETs | 349 |
Agglomerative Hierarchical Approach for Location Area Planning in | 362 |
Keynote Talk III | 368 |
Network Security | 380 |
Middleware and Data Management | 463 |
Fault Tolerant Routing in Star Graphs Using Fault Vector | 475 |
Optimistic Concurrency Control in Firm RealTime Databases | 487 |
Stochastic Modeling and Performance Analysis for VideoOnDemand | 493 |
A Memory Efficient Fast Distributed Real Time Commit Protocol | 500 |
A Model for the Distribution Design of Distributed Databases and | 506 |
Mobility Management | 512 |
A New Dynamic EndtoEnd Connection Management Scheme | 524 |
Efficient Mobility Management for Cache Invalidation in Wireless | 536 |
Analysis of Hierarchical Multicast Protocol in IP Micro Mobility | 542 |
Network Mobility Management Using Predictive Binding Update | 560 |
Privacy Preserving Decentralized Method for Computing | 578 |
Citi izdevumi - Skatīt visu
Distributed Computing – IWDC 2005: 7th International Workshop, Kharagpur ... Ajit Pal Ierobežota priekšskatīšana - 2005 |
Distributed Computing – IWDC 2005: 7th International Workshop, Kharagpur ... Ajit Pal,Ajay D. Kshemkalyani,Rajeev Kumar,Arobinda Gupta Priekšskatījums nav pieejams - 2005 |
Bieži izmantoti vārdi un frāzes
Ad Hoc Networks agents AODV assigned average bandwidth Berlin Heidelberg 2005 block cache cell channel checkpoint cluster clusterhead communication congestion connected cost crosstalk data items defined delay denote distance-2 clique Distributed Computing dynamic efficient execution fault function Gnutella graph greedy handoff handover Hoc Networks host HSTCP IEEE IWDC latency layer lightpath LNCS metric mobile modules multicast neighbors number of nodes ontology optimal overlay overlay network paper parameters path peer Peer-to-Peer performance problem Proc processors proposed protocol query R-Tree random received reconfiguration request robots router RTSP scalability scheduling scheme Section selected sensor networks sensor nodes sequence number simulation slots solution Springer-Verlag Berlin Heidelberg STCP strategy synchronization task TCP Vegas Theorem topology total number traffic transaction transmission tree Uinta update vertical handoff wavelength wireless sensor networks