简介:Thestablemulticastflowaggregation(MFA)problemininternetprotocol(IP)overopticalnetworkunderthedynamicalscenarioisstudied.Givenanopticalnetworktopology,thereisasetofheadendsandaccessroutersattachedtotheopticalnetwork,inwhicheachheadendcanprovideasetofprograms(IPmulticastingflows)andeachaccessrouterrequestsasetofprograms,wefindasetofstablelight-treestoaccommodatetheoptimallyaggregatedmulticastIPflowsiftherequestsofaccessrouterschangeddynamically.Weintroduceaprogramcorrelationmatrixtodescribethepreferenceofendusers'requests.AstheoriginalMFAproblemisNP-complete,aheuristicapproach,namedmostcorrelatedprogramfirst(MCPF),ispresentedandcomparedwiththeextendedleasttreefirst(ELTF)algorithmwhichistopology-aware.SimulationresultsshowthatMCPFcanachievebetterperformancethanELTFintermsofstabilitywithnegligibleincrementofnetworkresourceusage.