Networked Systems: First International Conference, NETYS 2013, Marrakech, Morocco, May 2-4, 2013, Revised Selected Papers

340 Pages·2013·7.531 MB·English

by  Armando Castañeda, Michel Raynal (auth.), Vincent Gramoli, Rachid Guerraoui (eds.)

Vincent Gramoli
Rachid Guerraoui (Eds.)
3
5
8
7

S
Networked Systems
C
N
L
First International Conference, NETYS 2013
Marrakech, Morocco, May 2013
Revised Selected Papers
123
Lecture Notes in Computer Science 7853
CommencedPublicationin1973
FoundingandFormerSeriesEditors:
GerhardGoos,JurisHartmanis,andJanvanLeeuwen
EditorialBoard
DavidHutchison
LancasterUniversity,UK
TakeoKanade
CarnegieMellonUniversity,Pittsburgh,PA,USA
JosefKittler
UniversityofSurrey,Guildford,UK
JonM.Kleinberg
CornellUniversity,Ithaca,NY,USA
AlfredKobsa
UniversityofCalifornia,Irvine,CA,USA
FriedemannMattern
ETHZurich,Switzerland
JohnC.Mitchell
StanfordUniversity,CA,USA
MoniNaor
WeizmannInstituteofScience,Rehovot,Israel
OscarNierstrasz
UniversityofBern,Switzerland
C.PanduRangan
IndianInstituteofTechnology,Madras,India
BernhardSteffen
TUDortmundUniversity,Germany
MadhuSudan
MicrosoftResearch,Cambridge,MA,USA
DemetriTerzopoulos
UniversityofCalifornia,LosAngeles,CA,USA
DougTygar
UniversityofCalifornia,Berkeley,CA,USA
GerhardWeikum
MaxPlanckInstituteforInformatics,Saarbruecken,Germany
Vincent Gramoli Rachid Guerraoui (Eds.)
Networked Systems
First International Conference, NETYS 2013
Marrakech, Morocco, May 2-4, 2013
Revised Selected Papers
1 3
VolumeEditors
VincentGramoli
NICTAandUniversityofSydney,NSW,Australia
E-mail:[email protected]
RachidGuerraoui
EPFL,Lausanne,Switzerland
E-mail:rachid.guerraoui@epfl.ch
ISSN0302-9743 e-ISSN1611-3349
ISBN978-3-642-40147-3 e-ISBN978-3-642-40148-0
DOI10.1007/978-3-642-40148-0
SpringerHeidelbergDordrechtLondonNewYork
LibraryofCongressControlNumber:2013944639
CRSubjectClassification(1998):C.2,F.2,E.5,K.4
LNCSSublibrary:SL5–ComputerCommunicationNetworksand
Telecommunications
©Springer-VerlagBerlinHeidelberg2013
Thisworkissubjecttocopyright.AllrightsarereservedbythePublisher,whetherthewholeorpartof
thematerialisconcerned,specificallytherightsoftranslation,reprinting,reuseofillustrations,recitation,
broadcasting,reproductiononmicrofilmsorinanyotherphysicalway,andtransmissionorinformation
storageandretrieval,electronicadaptation,computersoftware,orbysimilarordissimilarmethodology
nowknownorhereafterdeveloped.Exemptedfromthislegalreservationarebriefexcerptsinconnection
withreviewsorscholarlyanalysisormaterialsuppliedspecificallyforthepurposeofbeingenteredand
executedonacomputersystem,forexclusiveusebythepurchaserofthework.Duplicationofthispublication
orpartsthereofispermittedonlyundertheprovisionsoftheCopyrightLawofthePublisher’slocation,
initscurrentversion,andpermissionforusemustalwaysbeobtainedfromSpringer.Permissionsforuse
maybeobtainedthroughRightsLinkattheCopyrightClearanceCenter.Violationsareliabletoprosecution
undertherespectiveCopyrightLaw.
Theuseofgeneraldescriptivenames,registerednames,trademarks,servicemarks,etc.inthispublication
doesnotimply,evenintheabsenceofaspecificstatement,thatsuchnamesareexemptfromtherelevant
protectivelawsandregulationsandthereforefreeforgeneraluse.
Whiletheadviceandinformationinthisbookarebelievedtobetrueandaccurateatthedateofpublication,
neithertheauthorsnortheeditorsnorthepublishercanacceptanylegalresponsibilityforanyerrorsor
omissionsthatmaybemade.Thepublishermakesnowarranty,expressorimplied,withrespecttothe
materialcontainedherein.
Typesetting:Camera-readybyauthor,dataconversionbyScientificPublishingServices,Chennai,India
Printedonacid-freepaper
SpringerispartofSpringerScience+BusinessMedia(www.springer.com)
Preface
NETYS, the International Conference on Networked Systems, provides a fo-
rum to report on best practices and novel algorithms, results and techniques in
networked systems. It brings together researchers and engineers from both the
theory and practice of networked systems: multi-core architectures, middleware
environments, storage clusters, as well as social, peer-to-peer, sensor, wireless,
and mobile networks.
This volume contains the papers selected for NETYS 2013, the First Inter-
nationalConferenceonNetworkedSystems, heldin Marrakech,Marocco.There
were 74 papers submitted to the conference among which the Program Com-
mittee selected 17 contributions for regular presentations (23%). Each regular
presentation is accompanied by a 15-page paper in this volume. Every submit-
ted paper was read and carefully evaluated by the Program Committee in 198
reviews with 20 of them written by external reviewers. Revised and expanded
versionsof severalselectedpapers will be consideredfor publication in a special
issue of the Computing Journal.
TheprogramalsoincludedthreeinvitedlecturesbyWillyZwaenepoel(EPFL,
Switzerland), Jonathan Ledgard (EPFL, Switzerland), and Mira Mezini (Tech-
nische Universita¨t Darmstadt, Germany).
TheBestPaperAwardwasgiventoDiegoDidona,PascalFelber,DerinHar-
manci,PaoloRomano,andJoergSchenkerfor“IdentifyingtheOptimalLevelof
ParallelisminTransactionalMemorySystems.”TheBestStudent PaperAward
was given to Yahya Benkaouz and Mohammed Erradi for “A Distributed Pro-
tocol for Privacy Preserving Aggregation.”
The Program Committee also considered 16 papers for short presentations
among the papers that generated substantial interest from the members of the
committee but that could not be accepted as regular presentations. Each short
presentation is accompanied by a five-page paper in this volume and presents
ongoing work or recent results. It is expected that these results will appear as
full papers in other conference proceedings or journals.
WewouldliketothanktheGeneralCo-chairs,MohammedErradiandBernd
Freisleben,fortheirhelp,andthe numeroussponsorsoftheevent:DAAD, IBM,
Technicolor, INRIA, Telefonica, Google, Microsoft Research, Thinline, Univer-
sity Mohammed V, and ENSIAS.
May 2013 Vincent Gramoli
Rachid Guerraoui
Table of Contents
On the Consensus Number of Non-adaptive Perfect Renaming ......... 1
Armando Castan˜eda and Michel Raynal
Set Agreement and the Loneliness Failure Detector in Crash-Recovery
Systems ........................................................ 13
Sergio Ar´evalo, Ernesto Jim´enez, and Jian Tang
Black Art: Obstruction-Free k-set Agreement
with |MWMR registers|< |proccesses| ........................... 28
Carole Delporte-Gallet, Hugues Fauconnier, Eli Gafni, and
Sergio Rajsbaum
Self-stabilizing Byzantine Resilient Topology Discovery and Message
Delivery (Extended Abstract) ..................................... 42
Shlomi Dolev, Omri Liba, and Elad M. Schiller
FreeRec: An Anonymous and Distributed Personalization
Architecture..................................................... 58
Antoine Boutet, Davide Frey, Arnaud J´egou,
Anne-Marie Kermarrec, and Heverson B. Ribeiro
Establishing Efficient Routes between Personal Clouds................ 74
Ercan Ucan and Timothy Roscoe
Developing, Deploying and Evaluating Protocols with ManetLab....... 89
Franc¸ois Vessaz, Benoˆıt Garbinato, Arielle Moro, and Adrian Holzer
Airtime Ping-Pong Effect in IEEE 802.11s Wireless Mesh Networks .... 105
Mohamed Riduan Abid and Saaˆd Biaz
Planning UMTS Base Station Location Using Genetic Algorithm
with a Dynamic Trade-Off Parameter............................... 120
Mohammed Gabli, El Miloud Jaara, and El Bekkaye Mermri
Video Encryption Based on the Permutation of the (Z/pZ) Fields...... 135
Younes Benlcouiri, Mohammed Benabdellah,
Moulay Chrif Ismaili, and Abdelmalek Azizi
Improving Resource Location with Locally Precomputed Partial
Random Walks .................................................. 144
V´ıctor M. L´opez Milla´n, Vicent Cholvi, Luis L´opez, and
Antonio Fern´andez Anta
VIII Table of Contents
Distributed B-Tree with Weak Consistency.......................... 159
Gregor V. Bochmann and Shah Asaduzzaman
Consistency in Distributed Storage Systems: An Overview of Models,
Metrics and Measurement Approaches .............................. 175
David Bermbach and Jo¨rn Kuhlenkamp
Request Complexity of VNet Topology Extraction: Dictionary-Based
Attacks......................................................... 190
Yvonne-Anne Pignolet, Stefan Schmid, and Gilles Tredan
Stability of Adversarial Routing with Feedback ...................... 206
Bogdan S. Chlebus, Vicent Cholvi, and Dariusz R. Kowalski
A Distributed Protocol for Privacy Preserving Aggregation............ 221
Yahya Benkaouz and Mohammed Erradi
Identifying the Optimal Level of Parallelism in Transactional Memory
Applications..................................................... 233
Diego Didona, Pascal Felber, Derin Harmanci, Paolo Romano, and
J¨org Schenker
Biologically Sound Neural Networks for Embedded Systems Using
OpenCL ........................................................ 248
Istv´an Feh´erv´ari, Anita Sobe, and Wilfried Elmenreich
FStream: A Decentralized and Social Music Streamer................. 253
Antoine Boutet, Konstantinos Kloudas, and Anne-Marie Kermarrec
BFT Selection................................................... 258
Ali Shoker and Jean-Paul Bahsoun
Modeling of Human Head Interaction with Planar Antenna for Multi
Standard Cellular Phones ......................................... 263
Ahmed Zakaria Manouare, Abdelilah Ghammaz,
Abdelaziz El idrissi, and Saida Ibnyaich
Modeling the Cut-off Frequency of Acoustic Signal with a Fuzzy Logic
System ......................................................... 268
Youssef Nahraoui, Elhoucein H. Aassif, Rachid Latif, and
G´erard Maze
Bitbox: Eventually Consistent File Sharing.......................... 274
Erwan Le Merrer, Nicolas Le Scouarnec, and Gilles Straub
Improving Miller’s Algorithm Using the NAF and the Window NAF.... 279
Siham Ezzouak, Mohammed El Amrani, and Abdelmalek Azizi
Runtime Adaptation of Component Based Systems................... 284
Sihem Loukil, Slim Kallel, and Mohamed Jmaiel
Table of Contents IX
ComparativePerformanceAnalysisofAODVandAOMDVtoTransmit
H.264 Traffic .................................................... 289
Adel Echchaachoui, Ali Choukri, Ahmed Habbani, and
Mohammed Elkoutbi
Large Scale 3D Shape Retrieval Based on Multi-core Architectures ..... 295
El Wardani Dadi and El Mostafa Daoudi
New Forwarding Strategy for PROPHET Routing in Delay Tolerant
Networks ....................................................... 300
Ahmed El Ouadrhiri, Mohamed El Kamili,
Mohammed Raiss El Fenni, and Lahcen Omari
New Validation Approach Based on Group MADM for Network
Selection........................................................ 306
Mohamed Lahby, Leghris Cherkaoui, and Abdellah Adib
Secured Geographic Routing Protocol for Vehicular Ad Hoc Networks
(VANETs) ...................................................... 311
Mohammed Erritali, Bouabid El Ouahidi, and Daniel Bourget
Enhanced AntNet Protocol for Wireless Multimedia Sensor Networks... 316
Ismail Bennis, Ouadoudi Zytoune, and Driss Aboutajdine
Forest Fire Detection and Localization with Wireless Sensor
Networks ....................................................... 321
Yassine Sabri and Najib El Kamoun
On Ensuring End-to-End Quality of Service in Inter-Domain
Environment .................................................... 326
Sara Bakkali, Hafssa Benaboud, and Mouad Ben Mamoun
Author Index.................................................. 331
On the Consensus Number
of Non-adaptive Perfect Renaming
ArmandoCastan˜eda1andMichelRaynal2,3
1 DepartmentofComputerScience,Technion,Haifa32000,Israel
2 IRISA,CampusdeBeaulieu,35042RennesCedex,France
3 InstitutUniversitairedeFrance
Abstract. Inthe(n,M)-renamingproblem,therearenprocesses,eachwithan
initial name known only fromitself, and theseprocesses havetocompute new
namesfromtheset{1,...,M}, despiteasynchrony and anynumber ofprocess
crashes, such that no two processes have the same new name. If M = n, the
renamingissaidtobeperfect.IfM isonlyonfunctiononthenumbernofthe
processesinthesystem,therenamingissaidtobenon-adaptive. Incontrast,if
M isonfunctiononthenumberofprocessesthatactuallyparticipateinagiven
execution,renamingisadaptive.Theconsensusnumberofaconcurrentobjectis
anintegerwhichmeasuresitssynchronizationpowerinpresenceofanynumber
ofprocesscrashes.
Thispaperinvestigatestheconsensusnumberofnon-adaptiveperfectrenam-
ingobjects.Itshowsthat,whileanon-adaptiveperfectrenamingobjectfortwo
processes(ports)hasconsensusnumber2,itsconsensusnumberdecreasesto1
whenthenumberofprocesseswhichcanaccessitincreasesbeyond2.
Keywords: Common2, Computability power, Concurrent object, Consensus
number, Consensus object, Object port, Process failure, Renaming, Task,
Wait-freedom.
1 Introduction
Wait-freedomandtheconsensusnumberhierarchy. Thenotionsofwait-freedomanda
consensusnumberhavebeenintroducedbyM.Herlihy[11].Theimplementationofa
concurrentobjectiswait-freeifanyinvocationofanobjectoperationdoesterminateif
theinvokingprocessdoesnotcrash,whateverthebehavioroftheotherprocesses(which
meansthattheseprocessescanbeconcurrentlyaccessingtheinternalrepresentationof
theobject,canbeveryslow,orcanevencrashinthemiddleofanoperation).
Aconsensusobjectfornprocesses(i.e.,anobjectwithnports),sometimesdenoted
n-consensus,providesthe processeswith a single one-shotoperationpropose() (one-
shot means that a process invokes the operation at most once). A process p invokes
i
propose(v ),wherev isthevalueitproposestotheconsensusobject.Thisinvocation
i i
returnsita valuev, andwe say thatthe invokingprocessdecidesv. Theobjectis de-
finedbythefollowingproperties:adecidedvalueisaproposedvalue(validity),notwo
differentvalue are decided (agreement),and if a process invokes propose() and does
notcrashwhileexecutingthisoperationitdecidesavalue(termination).
V.GramoliandR.Guerraoui(Eds.):NETYS2013,LNCS7853,pp.1–12,2013.
(cid:2)c Springer-VerlagBerlinHeidelberg2013
2 A.Castan˜edaandM.Raynal
A main result of [11] is the design of an algorithm(called universal construction)
thatbuilds,fromatomicread/writeregistersandconsensusobjects,await-freeimple-
mentationofanyobjectdefinedfromasequentialspecification.Thissteersthedesign
ofwait-freeobjectimplementationsbackto theimplementationofconsensusobjects.
The notionofa consensusnumber ofa class of objectsX, denotedCN(X), hasbeen
introducedtothatend.Itisdefinedasfollowsin[11]:
“The consensus numberfor X is the largestn for which X solves n-process
consensus.Ifnolargestnexists,theconsensusnumberissaidtobeinfinite.”
This means that, in a read/write system of n processes, enriched with objects whose
consensus number is greater than or equal to n, it is possible to wait-free implement
anyobjectdefinedbyasequentialspecification.
It is shown in [11] that consensus numbers define an infinite hierarchy: CN(read/
write registers) = 1, CN(test&set) = CN(queue) = 2, ..., CN(compare&swap) =
CN(LL/SC)=+∞.
Therenamingproblem. AnM-renaming [3]objectfornprocesses(i.e.,anobjectwith
nports),sometimesdenoted(n,M)-renaming,providestheprocesseswithaone-shot
operation, denoted rename(), that allows them to obtain distinct names from a name
space whose size is M. It is assumed that processes invoke rename() with distinct
inputs(theirinitialnames)takenfromaninputspaceofsizeN >M.
Ithasbeenshownthat(n,M)-renamingobjectscanbewait-freeimplementedusing
only read/write register if and only if M ≥ 2n−1 [4,12], except for some specific
valuesofnforwhich(n,M)-renamingobjectscanbeimplementedwithM =2n−2
[5]. If follows that for M ≥ 2n−1 (or M ≥ 2n −2 for the specific values of n)
theconsensusnumberof(n,M)-renamingisthesameastheoneread/writeregisters,
namely,itis1.
Letusobservethatarenamingobjectcanoutputlargenames(aslongastheybelong
totheconstrainedoutputspace)inexecutionsinwhichfewprocessesinvoketheobject.
Forexample,itcanbethecasethatasingleprocessinvokesan(n,M)-renamingobject
andreceivesM,the largestnameoftheoutputspace.Thatis tosay,theoutputspace
doesnot“adapt”tothenumberofprocessesthatactuallyinvokearenamingobject,it
doesdependonlyonthetotalnumberofprocesses.Thus,ifthe sizeofthenewname
spacedependsonlyonn,renamingissaidtobenon-adaptive,denotedNA renaming.
Theadaptiveversionofrenamingisdefinedasfollows.Letp,1≤p≤n,denotethe
numberofprocessesthatinvokethe operationrename(). Adaptiverenaming,denoted
A renaming,requiresthat the size of the new name space be a functionof p. Several
algorithmsimplementing(n,2p−1)-A renamingobjectshavebeenproposed([6]sur-
veyssomeofthem).M = 2p−1isthelowerboundforthesizeofnewnamespace,
foreveryvalueofn.
Itisknownthat,foranyn,(n,p)-A renaming,alsocalledadaptiveperfectrenaming,
can be solved from n-port test&set objects (i.e., objects which can be accessed by n
processes)andvice-versa,and consequentlyadaptiveperfectrenaminghasconsensus
number2[6].