Distributed Computing and Networking: 10th International Conference, ICDCN 2009, Hyderabad, India, January 3-6, 2009, ProceedingsVijay Garg, Roger Wattenhofer, Kishore Kothapalli people volunteer their time and energy and work in a dedicated fashion to pull everything together each year, including our very supportive Steering Comm- tee members led by Sukumar Ghosh. However, the success of ICDCN is mainly due to the hard work of all those people who submit papers and/or attend the conference. We thank you all. January 2009 Prasad Jayanti Andrew T. Campbell Message from the Technical Program Chairs Welcome to the proceedings of the 10thInternationalConferenceon Distributed Computing and Networking (ICDCN) 2009. As ICDCN celebrates its 10th - niversary,ithasbecomeanimportantforumfordisseminatingthelatestresearch results in distributed computing and networking. We received 179 submissions from all over the world, including Algeria, A- tralia, Canada, China, Egypt, France, Germany, Hong Kong, Iran, Italy, Japan, Malaysia, The Netherlands, Poland, Singapore, South Korea, Taiwan, and the USA, besides India, the host country. The submissions were read and evaluated by the Program Committee, which consisted of 25 members for the Distributed Computing Track and 28 members for the Networking Track, with the ad- tional help of external reviewers. The Program Committee selected 20 regular papers and 32 short papers for inclusion in the proceedings and presentation at the conference. We were fortunate to have several distinguished scientists as keynote speakers. Andrew Campbell (Dartmouth College, USA), Maurice Herlihy (Brown University, USA), and P. R. Kumar (University of of Illinois, Urbana-Champaign) delivered the keynote address. Krithi Ramamritham from IIT Bombay, India, delivered the A. K. Choudhury Memorial talk. |
Other editions - View all
Common terms and phrases
Abstract agents AODV applications approach assume Berlin Heidelberg 2009 broker nodes checkpoint cluster communication concept concurrency connected coordinate cost data replication data replication schemes defined Delaunay triangulation denoted distributed algorithm Distributed Computing dynamic edge execution function G-Nets Garg Gnutella graph Grid guard zone Heidelberg hypernym ICDCN IEEE IIIT Hyderabad implementation initial Interleaver Kothapalli Eds label Lemma linearizable LNCS message complexity mobile neighbors number of nodes optimal overlay network P-replica packet paper parameters path performance polygon port numbers problem proposed protocol query queue quorum random received registers request response-time robots round router routing scheme scheduling Section self-similar sends sensor nodes simple polygon simulation sink nodes solution Springer-Verlag Berlin Heidelberg synchronization Theorem token topology transaction transmission tree ultra-peer underlay update USMT vector Wattenhofer wireless sensor networks wires WLAN write operations ZigBee