Lecture Notes in Computer Science 7730

18
Lecture Notes in Computer Science 7730 Commenced Publication in 1973 Founding and Former Series Editors: Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen Editorial Board David Hutchison Lancaster University, UK Takeo Kanade Carnegie Mellon University, Pittsburgh, PA, USA Josef Kittler University of Surrey, Guildford, UK Jon M. Kleinberg Cornell University, Ithaca, NY, USA Alfred Kobsa University of California, Irvine, CA, USA Friedemann Mattern ETH Zurich, Switzerland John C. Mitchell Stanford University, CA, USA Moni Naor Weizmann Institute of Science, Rehovot, Israel Oscar Nierstrasz University of Bern, Switzerland C. Pandu Rangan Indian Institute of Technology, Madras, India Bernhard Steffen TU Dortmund University, Germany Madhu Sudan Microsoft Research, Cambridge, MA, USA Demetri Terzopoulos University of California, Los Angeles, CA, USA Doug Tygar University of California, Berkeley, CA, USA Gerhard Weikum Max Planck Institute for Informatics, Saarbruecken, Germany

Transcript of Lecture Notes in Computer Science 7730

Page 1: Lecture Notes in Computer Science 7730

Lecture Notes in Computer Science 7730Commenced Publication in 1973Founding and Former Series Editors:Gerhard Goos, Juris Hartmanis, and Jan van Leeuwen

Editorial Board

David HutchisonLancaster University, UK

Takeo KanadeCarnegie Mellon University, Pittsburgh, PA, USA

Josef KittlerUniversity of Surrey, Guildford, UK

Jon M. KleinbergCornell University, Ithaca, NY, USA

Alfred KobsaUniversity of California, Irvine, CA, USA

Friedemann MatternETH Zurich, Switzerland

John C. MitchellStanford University, CA, USA

Moni NaorWeizmann Institute of Science, Rehovot, Israel

Oscar NierstraszUniversity of Bern, Switzerland

C. Pandu RanganIndian Institute of Technology, Madras, India

Bernhard SteffenTU Dortmund University, Germany

Madhu SudanMicrosoft Research, Cambridge, MA, USA

Demetri TerzopoulosUniversity of California, Los Angeles, CA, USA

Doug TygarUniversity of California, Berkeley, CA, USA

Gerhard WeikumMax Planck Institute for Informatics, Saarbruecken, Germany

Page 2: Lecture Notes in Computer Science 7730

Davide Frey Michel RaynalSaswati Sarkar Rudrapatna K. ShyamasundarPrasun Sinha (Eds.)

Distributed Computingand Networking

14th International Conference, ICDCN 2013Mumbai, India, January 3-6, 2013Proceedings

13

Page 3: Lecture Notes in Computer Science 7730

Volume Editors

Davide FreyIRISA/INRIA-Rennes35042 Rennes Cedex, FranceE-mail: [email protected]

Michel RaynalInstitut Universitaire de FranceIRISA-ISTIC Université de Rennes 135042 Rennes Cedex, FranceE-mail: [email protected]

Saswati SarkarUniversity of PennsylvaniaPhiladelphia, PA 19104, USAE-mail: [email protected]

Rudrapatna K. ShyamasundarFaculty of Technology and Computer ScienceTata Institute of Fundamental ResearchMumbai 400005, IndiaE-mail: [email protected]

Prasun SinhaOhio State UniversityColumbus, OH 43210-1277, USAE-mail: [email protected]

ISSN 0302-9743 e-ISSN 1611-3349ISBN 978-3-642-35667-4 e-ISBN 978-3-642-35668-1DOI 10.1007/978-3-642-35668-1Springer Heidelberg Dordrecht London New York

Library of Congress Control Number: 2012953914

CR Subject Classification (1998): C.2, D.1.3, D.2.12, C.2.4, D.4, F.2, F.1.2, H.4

LNCS Sublibrary: SL 1 – Theoretical Computer Science and General Issues

© Springer-Verlag Berlin Heidelberg 2013This work is subject to copyright. All rights are reserved, whether the whole or part of the material isconcerned, specifically the rights of translation, reprinting, re-use of illustrations, recitation, broadcasting,reproduction on microfilms or in any other way, and storage in data banks. Duplication of this publicationor parts thereof is permitted only under the provisions of the German Copyright Law of September 9, 1965,in its current version, and permission for use must always be obtained from Springer. Violations are liableto prosecution under the German Copyright Law.The use of general descriptive names, registered names, trademarks, etc. in this publication does not imply,even in the absence of a specific statement, that such names are exempt from the relevant protective lawsand regulations and therefore free for general use.

Typesetting: Camera-ready by author, data conversion by Scientific Publishing Services, Chennai, India

Printed on acid-free paper

Springer is part of Springer Science+Business Media (www.springer.com)

Page 4: Lecture Notes in Computer Science 7730

Preface

The International Conference on Distributed Computing and Networking(ICDCN) was launched 14 years ago, initially as an International Workshop(IWDC), and within a few years it gained visibility as one of the leading in-ternational conferences in this area. ICDCN is one of the very few conferenceswhere researchers in distributed computing get to meet their networking coun-terparts on the same scientific platform. In addition to presenting scientific re-search, ICDCN organizes various forums such as specific workshops, tutorials,and panels of current importance, and it encourages strong participation fromindustry.

The current edition of ICDCN 2013 was the 14th edition of the series. Thisvolume contains papers presented at ICDCN 2013 held at Tata Institute of Fun-damental Research, Mumbai, during January 3–6, 2013. The conference consistedof two tracks,“Distributed Computing”and“Networking”, and received in all 149submissions.

The Distributed Track consisted of 67 submissions, each of which received atleast three reviews by the track’s Program Committee (PC) members as well asby selected external reviewers. Based on these reviews and discussions amongPC members, 18 regular and 3 short papers were selected for inclusion in theproceedings. The Networking Track consisted of 72 papers, each of which wasreviewed by at least three PC members and a few selected external referees.Based on the reviews, and the PC discussions spead over two weeks, the PCselected 9 regular papers, 2 short papers, and 7 poster papers.

The ICDCN 2013 program included five keynote speakers: Leslie Lamport(Microsoft Research), Hari Balakrishnan (CSAIL, MIT), David Culler (UC,Berkeley), Yoram Moses (Technion), and the R. Narasimhan Memorial keynotelecture by Sanjit Seshia (UC, Berkeley). On behalf of the entire PC, we wouldlike to take this opportunity to thank them for accepting our invitation and con-tributing to the success of the conference. We are confident that the conferenceattendees enjoyed and were enlightened by the various keynote addresses andbenefited further from productive discussions with them.

On behalf of the PC and conference organizers, we would like to express ourgratitude to the PC members and the external reviwers who took part in thereview process: their hard work and responsiveness made it possible to stick toour tight review schedule and arrive at a quality programme. We are sure thereviews would enable authors to further refine their works and arrive at newopenings/initiatives.

It is our pleasure to thank ACM SIGCOMM for according us ACM In-cooperation status and IEEE CS TCDP for according us “Technical cooperationstatus.”

Page 5: Lecture Notes in Computer Science 7730

VI Preface

We are grealy indebted to Tata Institute of Fundamental Research both forthe generous financial and organizational support. Thanks go the faculty of theSchool of Technology and Computer Science (STCS) for the support in organiz-ing the conference. We thank the staff of STCS, in particular John Barretto, RaviNaik, and Kishore Menon (Public Relation Officer) for their efforts in makingthe organization and running of the conference smooth.

We express our gratitude to our sponsors C-DAC (Centre for Advanced com-puting, DeITY (Department of Electronics and Information Technology of theGovernment of India), Quallcomm, Microsoft Research, HP Research, IBM Re-search, Tata Consultancy Services (TCS) as well as other organizations likeIARCS and DRDO (GOI) that supported the conference in various ways.

From the practical perspective of conference management, we would like toacknowledge that the whole process of paper submission, selection, and com-pilation in the proceedings was greatly simplified by the friendly interface ofthe EasyChair conference system (http://www.easychair.org). We owe a lot tothe EasyChair creators and maintainers for their commitment to the scientificcommunity.

To conclude, we are confident that the 14th edition of ICDCN will contributeto enhancing knowledge in the broad areas of distributed computing and net-working and will further add to the prestige and reputation of ICDCN. We aresure that the readers will find the proceedings informative and they will assistthem in their upcoming research and development activities.

23 October 2012 Rudrapatna ShyamasundarMichel Raynal

Davide FreySaswati SarkarPrasun Sinha

Page 6: Lecture Notes in Computer Science 7730

Conference Organization

General Chair

R.K. Shyamasundar Tata Institute of Fundamental Research(TIFR)

Technical Program Committee Chairs

Distributed Computing Track Co-chairs

Michel Raynal IRISADavide Frey INRIA

Networking Track Co-chairs

Saswati Sarkar University of PennsylvaniaPrasun Sinha Ohio State University

Workshop Chairs

R.K. Ghosh IIT KanpurMohan J. Kumar UTAMaitreya Natu TRDDC Pune

Tutorial Co-chairs

N.V. Krishna IIT MadrasMainak Chatterjee University of Central Florida

Doctoral Forum Chair

Santonu Sarkar Infosys

Publicity Co-chairs

Santonu Sarkar InfosysYong Cui Tsinghua University, BeijingMario Di Francesco Aalto University and University of Texas

at ArlingtonNirmalya Roy Wichita State University

Industry Track Chair

Ankur Narang IBM Research

Page 7: Lecture Notes in Computer Science 7730

VIII Conference Organization

Steering Committee Co-chairs

Sajal K. Das University of Texas at ArlingtonSukumar Ghosh University of Iowa

Webmaster

Ravikumar J. Naik TIFR

Conference Secretary

John Barretto TIFR

Technical Program Committee

Distributed Computing Track

Yehuda Afek University of Tel AvivMustaque Ahamad Georgia TechAnish Arora Ohio State UniversityRoberto Baldoni University of Rome La SapienzaJiannong Cao Polytechnic University of Hong KongGregory Chockler IBM, HaifaAjoy K. Datta University of Las VegasXavier Defago JAIST, KanazawaShlomi Dolev Ben-Gurion UniversityPanagiota Fatourou University of CreteHugues Fauconnier LIAFA, Universite de Paris 7Christof Fetzer Dresden University of TechnologyVijay K. Garg University of Texas at AustinChryssis Georgiou University of CyprusPrasad Jayanti Dartmouth CollegePetr Kuznetsov Technical University of BerlinAjay Kshemkalyani University of ChicagoToshimitsu Masuzawa University of OsakaYoram Moses The Technion, HaifaGilles Muller INRIA/LIP6, ParisParitosh K. Pandya TIFRSergio Rajsbaum Universidad Nacional Autonama de MexicoR. Ramanujam IMSc, ChennaiMatthieu Roy LAAS-CNRS, ToulouseAlex A. Shvartsman University of Connecticut and MITUlrich Schmidt University of ViennaGadi Taubenfeld Interdisciplinary Center at HerzliyaPaulo Verissimo University of LisbonKrishnamurthy Vidyasankar University of Newfoundland

Page 8: Lecture Notes in Computer Science 7730

Conference Organization IX

Networking Track

Alexandre Proutiere KTH Royal Institute of TechnologyAmarjeet Singh IIIT DelhiAnurag Kumar Indian Institute of ScienceArunabha Sen Arizona State UniversityArup Acharya IBM T.J. Watson Research CenterBenyuan Liu University of Massachusetts at LowellCormac J. Sreenan University College of CorkDirk Pesch Cork Institute of TechnologyGeorge Kesidis National Science Foundation and Penn

State UniversityHwangnam Kim Korea UniversityJoy Kuri Indian Institute of ScienceKoushik Kar Rensselaer Polytechnic InstituteKrishna Sivalingam IIT MadrasKyu-Han Kim HP Labs, Palo AltoMani Srivastava University of California at Los AngelesMunchoon Chan National University of SingaporeNess Shroff Ohio State UniversityNiloy Ganguli IIT KharagpurPaolo Bellavista University of BolognaPaolo Santi IIT, CNRPrasanna Chaporkar IIT, BombayPrithwish Basu BBN TechnologiesR. Srikant University of Illinois at Urbana-ChampaignSamir Das SUNY at Stony BrookSanjay Jha University of New South WalesSotiris Nikoletseas CTI, PatrasSrinivas Shakkotai Texas A&M UniversitySubir Biswas Michigan State UniversitySudip Misra IIT, KharagpurTara Javidi University of California at San DiegoThyagarajan Nandagopal National Science FoundationTomasso Melodia SUNY at BuffaloTracy Camp Colorado School of MinesVartika Bhandari Google, New YorkVikram Srinivasan Bell Labs IndiaVinod Prabhakaran TIFRVinod Sharma Indian Institute of ScienceXinbing Wang Shanghai Jiao Tong UniversityYoung-Bae Ko Ajou UniversityZizhan Zheng Ohio State University

Page 9: Lecture Notes in Computer Science 7730

X Conference Organization

Technical Co-sponsors

Premium Sponsors

Platinum Sponsors

Gold Sponsors

Silverplus Sponsors

Silver Sponsors

Supporting Organizations

DRDO

Page 10: Lecture Notes in Computer Science 7730

Who Builds a House without Drawing

Blueprints?(Invited Keynote Talk)

Leslie Lamport

Microsoft Research

Abstract. Architects draw detailed plans before a brick is laid or a nailis hammered. Programmers and software engineers don’t. Can this bewhy houses seldom collapse and programs often crash?

Page 11: Lecture Notes in Computer Science 7730

Sense and Sensibility for Wireless Networks(Invited Talk)

Hari Balakrishnan

M.I.T.Computer Science and Artificial Intelligence Laboratory

Cambridge, MA [email protected]

Abstract. Truly mobile devices such as smartphones and tablets arefast becoming the dominant mode of Internet access. People use thesedevices while moving through wide range of locations, often in quicksuccession. The rapid variations in network conditions experienced posesa significant challenge for wireless network protocols, degrading perfor-mance, and making users unhappy. This talk will describe two techniquesto overcome this challenge: (1) spinal codes, a new class of rateless codes,and (2) a system to use sensors on mobile devices to improve networkperformance.

Page 12: Lecture Notes in Computer Science 7730

On Using Knowledge and Timing Information

for Distributed Coordination(Invited Talk)*

Yoram Moses

EE Dept., Technion [email protected]

This talk will illustrate the interplay between knowledge, action and commu-nication in a distributed setting. Fundamental to distributed an multi-agentsystems is the fact that an agent can base her actions only on her locally avail-able information, or knowledge. Some of the actions, resulting in communicationbetween the agents, modify agents’ knowledge. Consequently, there is a subtleinter-dependence between knowledge and action in a distributed setting. A for-mal theory of knowledge in multi-agent systems has been slowly emerging overthe course of the last three decades [4, 3]. The talk will focus on three aspects:

– From specifications to knowledge: If preconditions for Bob performing action bare specified, the Bob must know that they hold before performing b. More-over, if Alice should perform a only after Bob does b, then Alice must haveknowledge about Bob’s knowledge before she can act. Thus, specificationsinduce sometimes subtle knowledge preconditions.

– The role of time in the emergence of knowledge: In the absence of timing infor-mation, the evolution of knowledge is governed by Lamport’s happened beforerelation [5]. The presence of clocks and timing information allows the pas-sage of time to be used in conjunction with communication in coordinatingnontrivial tasks. The generalisation of Lamport’s relation will be discussed,along the lines of [1].

– An example: Depending on available time, an example of how knowledge andtime can be used to obtain an optimal protocol for computing spontaneousglobal snapshots in a setting with synchronous clocks will be discussed. Thisis a synchronous counterpart of [2].

References

1. Ben-Zvi, I., Moses, Y.: Beyond Lamport’s Happened-Before: On the Role of TimeBounds in Synchronous Systems. In: Lynch, N.A., Shvartsman, A.A. (eds.) DISC2010. LNCS, vol. 6343, pp. 421–436. Springer, Heidelberg (2010)

* This work was supported in part by Grant 1520/11 of the Israel Science Foundation.

Page 13: Lecture Notes in Computer Science 7730

XIV On Using Knowledge and Timing Information for Distributed Coordination

2. Chandy, K.M., Lamport, L.: Distributed snapshots: determining global states ofdistributed systems. ACM Trans. on Computer Systems 3(1), 63–75 (1985)

3. Fagin, R., Halpern, J.Y., Moses, Y., Vardi, M.Y.: Reasoning about Knowledge. MITPress, Cambridge (2003)

4. Halpern, J.Y., Moses, Y.: Knowledge and common knowledge in a distributed envi-ronment. Journal of the ACM 37(3), 549–587 (1990)

5. Lamport, L.: Time, clocks, and the ordering of events in a distributed system. Com-munications of the ACM 21(7), 558–565 (1978)

Page 14: Lecture Notes in Computer Science 7730

Sustainable Energy Networks - The Distributed

Computing and Networking Challengeof the Real World

(Invited Talk)

David E. Culler

Department of Electrical Engineering and Computer SciencesUniversity of California at Berkeley

[email protected]

After 150 years of industrial (r)evolution, we must ask how we can bring In-formation Technology, which has brought such advances in productivity andperformance, to bear on efficiency and sustainability. The problems of energy,climate, and sustainability are not crisp, clean technology challenges; they arecomplex Cyber-Physical Systems challenges and fundamentally distributed. Inthis talk, we explore how to apply lessons of the Internet, i.e., design principlesfor building distributed and robust communications infrastructures, to developan architecture for a cooperative energy network that promotes reduction in useand penetration of renewable sources. We explore how pervasive information canimprove energy production, distribution and use. We investigate how design tech-niques for scalable, power proportional computing infrastructures can translateto the design of a more scalable and flexible electric infrastructure, encouragingefficient use, integrating local or non-dispatchable generation, and managing de-mand through awareness of energy availability and use over time. Our approachis to develop a cyber overlay on the energy distribution system in its physicalmanifestations: machine rooms, buildings, neighborhoods and regional grids. Ascaled series of experimental energy networks demonstrate monitoring, negotia-tion protocols, and control algorithms can eb designed to integrate informationand energy flows in various settings, e.g., datacenter, building, and campus. Weseek to understand broadly how information enables energy efficiencies: throughintelligent matching of loads to sources, via various levels of aggregation, powerproportional design, and by managing how and when energy is delivered to de-mand, adapted in time and form to available supply. Together these offer a pathto a consumer-centric grid with supply-following loads.

Page 15: Lecture Notes in Computer Science 7730

Table of Contents

Verifying High-Confidence Interactive Systems: Electronic Voting andBeyond (Invited Paper) . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 1

Sanjit A. Seshia

Fast Distributed PageRank Computation . . . . . . . . . . . . . . . . . . . . . . . . . . . 11Atish Das Sarma, Anisur Rahaman Molla, Gopal Pandurangan, andEli Upfal

Dealing with Undependable Workers in Decentralized NetworkSupercomputing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 27

Seda Davtyan, Kishori Konwar, Alexander Russell, andAlexander Shvartsman

Decentralized Erasure Coding for Efficient Data Archival in DistributedStorage Systems . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 42

Lluis Pamies-Juarez, Frederique Oggier, and Anwitaman Datta

Transport Protocol with Acknowledgement-Assisted StorageManagement for Intermittently Connected Wireless Sensor Networks . . . 57

Ying Li, Radim Bartos, and James Swan

Iterative Approximate Byzantine Consensus under a Generalized FaultModel . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 72

Lewis Tseng and Nitin Vaidya

A Scalable Byzantine Grid . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 87Alexandre Maurer and Sebastien Tixeuil

Collaborative Detection of Coordinated Port Scans . . . . . . . . . . . . . . . . . . . 102Roberto Baldoni, Giuseppe Antonio Di Luna, and Leonardo Querzoni

Exploiting Partial-Packet Information for Reactive Jamming Detection:Studies in UWSN Environment . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 118

Manas Khatua and Sudip Misra, Senior Member, IEEE

Fault-Tolerant Design of Wireless Sensor Networks with DirectionalAntennas . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 133

Shahrzad Shirazipourazad, Arunabha Sen, and Subir Bandyopadhyay

Self-stabilizing Silent Disjunction in an Anonymous Network . . . . . . . . . . 148Ajoy K. Datta, Stephane Devismes, and Lawrence L. Larmore

Page 16: Lecture Notes in Computer Science 7730

XVIII Table of Contents

Uniform Consensus with Homonyms and Omission Failures . . . . . . . . . . . . 161Carole Delporte-Gallet, Hugues Fauconnier, and Hung Tran-The

Democratic Elections in Faulty Distributed Systems . . . . . . . . . . . . . . . . . . 176Himanshu Chauhan and Vijay K. Garg

Robust Deployment of Wireless Sensor Networks Using GeneRegulatory Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 192

Azade Nazi, Mayank Raj, Mario Di Francesco, Preetam Ghosh, andSajal K. Das

Cellular Pulse Switching: An Architecture for Event Sensing andLocalization in Sensor Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 208

Qiong Huo, Bo Dong, and Subir Biswas

Asynchrony from Synchrony . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 225Yehuda Afek and Eli Gafni

Maximal Antichain Lattice Algorithms for Distributed Computations . . . 240Vijay K. Garg

On the Analysis of a Label Propagation Algorithm for CommunityDetection . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 255

Kishore Kothapalli, Sriram V. Pemmaraju, and Vivek Sardeshmukh

How to Survive and Thrive in a Private BitTorrent Community . . . . . . . . 270Adele Lu Jia, Xiaowei Chen, Xiaowen Chu, Johan A. Pouwelse, andDick H.J. Epema

Optimal Migration Contracts in Virtual Networks: Pay-as-You-Comevs Pay-as-You-Go Pricing . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 285

Xinhui Hu, Stefan Schmid, Andrea Richa, and Anja Feldmann

Parallel Scalar Multiplication on Elliptic Curves in Wireless SensorNetworks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 300

Yanbo Shou, Herve Guyennet, and Mohamed Lehsaini

PeerVault: A Distributed Peer-to-Peer Platform for Reliable DataBackup . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 315

Adnan Khan, Mehrab Shahriar, Sk Kajal Arefin Imon,Mario Di Francesco, and Sajal K. Das

Distributed Verification Using Mobile Agents . . . . . . . . . . . . . . . . . . . . . . . . 330Shantanu Das, Shay Kutten, and Zvi Lotker

Sublinear Bounds for Randomized Leader Election . . . . . . . . . . . . . . . . . . . 348Shay Kutten, Gopal Pandurangan, David Peleg,Peter Robinson, and Amitabh Trehan

Page 17: Lecture Notes in Computer Science 7730

Table of Contents XIX

Linear Space Bootstrap Communication Schemes . . . . . . . . . . . . . . . . . . . . 363Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, andSergio Rajsbaum

An Analysis Framework for Distributed Hierarchical Directories . . . . . . . . 378Gokarna Sharma and Costas Busch

SMT-Based Model Checking for Stabilizing Programs . . . . . . . . . . . . . . . . . 393Jingshu Chen and Sandeep Kulkarni

Deployment and Evaluation of a Decentralised Runtime for ConcurrentRule-Based Programming Models . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 408

Marko Obrovac and Cedric Tedeschi

Weak Read/Write Registers . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 423Gadi Taubenfeld

Fast Leader (Full) Recovery Despite Dynamic Faults . . . . . . . . . . . . . . . . . 428Ajoy K. Datta, Stephane Devismes, Lawrence L. Larmore, andSebastien Tixeuil

Addressing the ZooKeeper Synchronization Inefficiency . . . . . . . . . . . . . . . 434Babak Kalantari and Andre Schiper

Compact TCAM: Flow Entry Compaction in TCAM for Power AwareSDN . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 439

Kalapriya Kannan and Subhasis Banerjee

A Media Access and Feedback Protocol for Reliable Multicast overWireless Channel . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 445

Ashutosh Bhatia and R.C. Hansdah

POSTER: Distributed Lagrangean Clustering Protocol . . . . . . . . . . . . . . . 450Ravi Tandon, Biswanath Dey, and Sukumar Nandi

POSTER: Broadcasting in Delay Tolerant Networks Using PeriodicContacts . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 452

Prosenjit Dhole, Arobinda Gupta, and Arindam Sharma

POSTER: Cryptanalysis and Security Enhancement of Anil K Sarje’sAuthentication Scheme Using Smart Cards . . . . . . . . . . . . . . . . . . . . . . . . . . 454

Chandra Sekhar Vorugunti and Mrudula Sarvabhatla

POSTER: A New Approach to Impairment-Aware Static RWA inOptical WDM Networks . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 456

Sebastian Zawada, Shrestharth Ghosh, Fangyun Luo,Sriharsha Varanasi, Arunita Jaekel, and Subir Bandyopadhyay

POSTER: Using Directional Antennas for Epidemic Routing in DTNsin Practice . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 458

Rajib Ranjan Maiti, Niloy Ganguly, and Arobinda Gupta

Page 18: Lecture Notes in Computer Science 7730

XX Table of Contents

POSTER: A Secure and Efficient Cross Authentication Protocol inVANET Hierarchical Model . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 461

Chandra Sekhar Vorugunti and Mrudula Sarvabhatla

POSTER: Approximation Algorithm for Minimizing the Size ofCoverage Hole in Wireless Sensor Networks . . . . . . . . . . . . . . . . . . . . . . . . . . 463

Barun Gorain, Partha Sarathi Mandal, and Sandip Das

Author Index . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 465