A reusable, distributed repository for configurati

AReusable,DistributedRepositoryforCongurationManagementPoliyProgrammingbyAdriaanW.vanderHoekM.S.&B.S.,ErasmusUniversityRotterdam,1994AthesissubmittedtotheFaultyoftheGraduateShooloftheUniversityofColoradoinpartialfulllmentoftherequirementsforthedegreeofDotorofPhilosophyDepartmentofComputerSiene2000Thisthesisentitled:AReusable,DistributedRepositoryforCongurationManagementPoliyProgrammingwrittenbyAdriaanW.vanderHoekhasbeenapprovedfortheDepartmentofComputerSieneAlexanderL.WolfDennisM.HeimbignerDateThenalopyofthisthesishasbeenexaminedbythesignatories,andwendthatboththeontentandtheformmeetaeptablepresentationstandardsofsholarlyworkintheabovementioneddisipline.vanderHoek,AdriaanW.(Ph.D.,ComputerSiene)AReusable,DistributedRepositoryforCongurationManagementPoliyProgrammingThesisdiretedbyProf.AlexanderL.WolfAlthoughthenumberandvarietyofavailableongurationmanagement(CM)systemshasgrownrapidlyinthepastfewyears,theneedtoonstrutnewCMsystemsremains.Thedesiretomanagedierentkindsofartifatsotherthansoureode,situationsdemandinghighlyspeializedsolutions,andtheexplorationofnewresearhquestionsallmayrequiretheonstrutionofanovelCMsystem.Unfortunately,inthefaeoftoday’smovetowardsdistributedprojets,thisisbeominganinreasinglydauntingtaskforwhihexistingCMtehnologyprovideslittletonosupport.Thisdissertationontributesanovelreusabletestbedthatsupportstherapiddevelopmentof|potentiallydistributed|prototypeCMsystems.Thetestbedsepa-ratesCMrepositoriesfromCMpoliiesbyprovidingagenerimodelofadistributedrepositoryandanassoiatedprogrammatiinterfae.Together,therepositorymodelandprogrammatiinterfaestipulateapreiselydenedabstrationlayeruponwhihspeiCMpoliiesarebuilt.Inpartiular,CMpoliiesareprogrammedasuniqueextensionstotheinterfae,whiletheunderlyingdistributedrepositoryisreusedarossdierentpoliies.Withintheabstrationlayer,distributionisisolated.Low-levelde-tailsofdistributedprogrammingareplaedwithintheimplementationoftherepositorymodelwhereasdistributionaspetsthatareontrolledatthepoliyprogramminglevelareplaedinaseparate,orthogonalfuntionalategorywithintheprogrammatiinter-fae.Twotangiblebenetsresultfromtheuseofthereusabletestbed.First,theeortrequiredinonstrutingprototypeCMsystemsisreduedsigniantlybeausethegenerirepositoryisreusedandtheCMpoliyiseasilyimplemented.Seond,theivrapidexplorationofnewCMpoliiesisenabled,leadingtothereationofuniqueCMpoliiesthataretailoredtospeisituations.Thetestbedisevaluatedabstratly,bymappingtenCMpoliiesontothereposi-torymodelandprogrammatiinterfae.Additionally,itisevaluatedonretelythroughtheuseofaprototype,alledNUCM,uponwhihthreenovelCMpoliiesareim-plemented.Demonstratingtheexpressiveness,feasibility,utility,andvalidityofthetestbed,thesepoliiesareharaterizedbytheirrapiddevelopment,easeofhange,inrementalevolution,andseamlessdistributedoperation.Tomyfamily.viAknowledgementsThroughoutthisendeavor,theguidaneofmyadvisorAlexanderWolfhasbeenoftremendousimportane.Withouthim,IwouldnotbewhereIamnow.Thankyouforputtingupwithsomebodywholikestorivalyouinhealthystubbornness,ithasbeenagreatexperiene.ThemembersofSERLhavemademystayattheUniversityofColoradomorethanworthwhile.SpeialthanksgoestoDennisHeimbigner,forquietlysharpeningmyresearhskills,andAntonioCarzaniga,forthelongdisussionsthatshapedtheeventualinarnationofNUCM.Withoutfriends,itwouldbeimpossibletoundertakealongandompliatedjourneysuhasthisone.ThankyouJonCook,fortheountlessnumberofepiDOOMbattlesjustwhenIneededthem;MartinandEsthervanWijngaarden,foralwayspop-pingtheirheadsupattherighttimeandaskingmehowIamdoing;theSiottes,forbeingmyfamilyawayfromhome;CorryShippers,forallthoselettersandpostards;RemovanderKuijp,forthee-mailsandvisits;andLauraVidal,forbeingwhoyouare:abestfriendIanalwaysounton.Finally,speialthanksandutmostrespetgoestomyparentsandsister.Their\GroteSmurfwouldnothavemadeitthisfarwithouttheirundeniableloveandsupport.ContentsChapter1Introdution11.1Problem....................................11.2Approah...................................41.3Evaluation...................................81.4Benets....................................101.5Roadmap...................................102Bakground132.1BasiTerminology..............................142.2SpetrumofFuntionality..........................152.3RepresentativeWorkinCongurationManagement............182.4Sope.....................................203GeneriRepositoryModel253.1StorageModel................................263.2DistributionModel..............................313.3NamingModel................................353.4AessModel.................................393.5AttributeModel...............................45viii4ProgrammatiInterfae484.1AessFuntions...............................504.2VersioningFuntions.............................524.3ColletionFuntions.............................544.4DistributionFuntions............................584.5DeletionFuntion...............................624.6QueryFuntions...............................644.7AttributeFuntions.............................685ModelingExampleCongurationManagementP