简介：在为轮船主人的一个机载的决定支持/指导系统的框架的线路优化方法论在这份报纸被开发了并且被介绍。方法瞄准与经得起海上风浪的性能期望在航行持续时间的可接受的限制以内的轮船有关的燃料航行费用和风险的最小化。这方法论的部分被连接其他的概率评价方法实现，例如蒙特卡罗，第一个顺序可靠性方法(形式)和秒顺序可靠性方法(SORM)，和3-D经得起海上风浪的代码，包括为在NTUA-SDL的波浪的增加的抵抗的计算的一个软件工具。全部系统在概率的分析软件PROBAN以内是综合的。为为关于预定义的阀值价值的exceedance层次的考虑经得起海上风浪的危险的增加的抵抗和概率的评价的计算的二个主要模块此处被详细描述，鉴于他们的实现，确认研究证明了他们的效率进一个机载的优化系统。

简介：

简介：Militarytacticalnetworkisoneofthemostimportantapplicationsofadhocnetwork.Currentlytheexistingroutingprotocolsareputforwardbasedonthesimpleanduniversalnetworkmodelwhichhastheabilityofmulti-hoproutingbutcannotworkefficientlyinthespecialmilitaryapplications.Thenarrowbandwidthandlimitedenergyofthewirelessnetworkmakegeneralroutingprotocolsseemtobemoreredundant.Inordertosatisfymilitaryneedsproperly,thislettermakesadetailedanalysisofphysicalnodesandtrafficdistributioninmilitarynetwork,usescross-layerdesignconceptforreference,combinestrafficcharacteristicofapplicationlayerwithroutingprotocoldesign.Itcategorizedroutingproblemascrucialroutesandnon-crucialrouteswhichadoptedseparatemaintenancemethods.Itnotonlyrealizesbasictransmissionfunctionbutalsoworksefficiently.Itisquitefitformilitaryapplication.

简介：Routingpoliciesspecificationlanguage(RPSL)allowsanetworkoperatortospecifyroutingpoliciesatvariouslevelsintheInternethierarchy,forexampleattheautonomoussystem(AS)level.Atthesametime,policiescanbespecifiedwithsufficientdetailinRPSLsothatthelowlevelrouterconfigurationscanbegeneratedfromthem.ThispaperisadiscussiononusingtheRPSLtodescriberoutingpoliciesofrelativeASintheInternetroutingregistry(IRR).WefirstanalyzetherelationshipsbetweenapairofASes,andthenexplainhowtospecifyvariousrelativeASroutingpoliciesinRPSL.Atlast,weshowanexampleofconfiguringroutingpoliciesusingRtConfigthatisatooldevelopedbytheRoutingArbiterProject(RAP).

简介：

简介：

简介：摘要：随着网络规模的不断扩大和业务需求的多样化，传统的网络路由技术在高效性、可扩展性和灵活性等方面面临挑战。Segment Routing（SR）作为一种新型的网络路由技术，能够在满足不同业务需求的同时，保持网络架构的简单和高效。本文主要对Segment Routing技术进行了全面的分析与研究，包括其概念、原理、架构设计以及应用场景。

简介：Inthispaper,basedonant-algorithm,weproposeaQoSmulticastroutingschemeinInternet.Wefirstdescribeant-algorithmmodelandgiveant-networkmodel,thenpresentanapproachusingant-algorithmtooptimizethemulticastrouteswithQoSconstaints.Finally,simulationshasbeenmadetoshowtheefficiencyoftheapproachintheenvironmentofOPNETsimulationsoftware,andthesimulationresultsshowthattheproposedapproachcanfindthebestoptimalmulticastrouteswhichcansatisfythedelay-boundedrequirementandavoidcongestednodesassoonaspossible.

简介：Tosolvetheproblemoflowefficiencyinpiperoutingdesign,animprovedgeneticalgorithmbasedapproachisproposed.Topresentthisapproach,thepapermainlydescribesagenerationmethodofnodesconsideringthesafetydistanceofpipesandthedirectionalconstraintsatterminals,thedefinitionofadoublecodingtechnique,thecollisiondetectionmethod,theconceptofenergyandthedefinitionoffitnessfunctions.Thesimilaritydetectionisintroducedtopreventclosebreedinginthecrossoveroperator,theselectionpressureiscontrolledaccordingtotheevolutionsituationandaheuristicmutationmethodisusedtoboosttheevolution.Simulationcaseshowsthatthisapproachismorepracticalandcansatisfydifferentdesignrequirementsbychangingalgorithmparameters.

简介：

简介：

简介：我们与限制并且联系的连接学习网络路由问题。有有可能不同的速度的平行连接，在来源和一个水池之间。另外有用户，并且每个用户有一些重量的交通从所有连接的一个子集分到连接之一，说出其许可的集合。选择一样的连接的用户承受一样的延期，它等于在它的速度上分到那个连接的全部的重量。如果没有用户能减少，系统的一个状态被称为纳什平衡由单方地改变其连接的其延期。为了由于所有用户，Koutsoupias和Papadimitriou的自私行为测量系统的性能降级，建议了混乱的观点普里斯(由PoA表示了)，它是在最坏的纳什平衡并且在一个最佳的解决方案的最大的延期的比率。为这个限制相关模型的PoA被学习了，并且线性更低的界限被获得。然而在他们的坏例子，一些用户能仅仅使用极其慢的连接。这有点人工、不大可能出现在一个真实世界上。那么当模特儿以便更好理解这，我们为系统介绍一个参数，并且证明以参数的混乱的更好的价格。我们也为安排游戏的任务在协作机制设计显示出我们的结果的一个重要应用程序。我们建议新协作机制，Group-Makespan，为与混乱的改进价格安排比赛的无关的自私任务。

简介：

简介：ThispaperpresentsadaptivehybridprotocolsbasedonthedeclarativenetworkandmainlydiscussestheprincipleandrealizationoftheBayesian-estimationbasedadaptivehybridprotocolinthedeclarativenetwork,whichiswelladaptedtotheMobileAdhocNETwork(MANET).Theadaptivehybridprotocolisdesignedforadhocnetworkswhichhavecharacteristicslikeself-organizing,notrustedparty,flexibility,etc.Thenodesthatrunthehybridprotocolcanautomaticallyselectoneroutingprotocolthatissuitablefordifferentnetworkenvironment.TheBayesian-estimationbasedadaptivestrategy,thatimprovestheadaptabilityandstabilityoftheprotocol,succeedsintheRapidnet,adeclarativenetworkengine.TheresultintheRapidnetprovesthatthehybridprotocolandtheadaptivestrategyarefeasible.Theexperimentonthens-3simulator,anemergingdiscrete-eventnetworksimulator,validatesthatthisprotocolperformswellandreducescommunicationoverheads.

简介：Opportunisticnetworksarederivedfromdelaytolerantnetworks,wheremobilenodeshavenoend-to-endconnections.Nodesarerepresentedbypeople,whichmeansthatopportunisticnetworkscanberegardedassocialnetworks.Humanmobilityplaysanimportantroleinaffectingtheperformanceofforwardingprotocolsinsocialnetworks,furthermore,thetrajectoryofpeople'smovementsaredrivenbysocialcharacteristics.However,currentroutingprotocolsrelyonsimplemobilitymodels,andrarelyconsidersocialcharacteristics.Consideringtwoheterogeneousnetworkmodels,ansocialopportunisticnetworksrouting(SONR)wasproposedwhichbringsanadapteddiscreteMarkovchainintonodes'mobilitymodelandcalculatesthetransitionprobabilitybetweensuccessivestatus.ComparisonwasmadebetweenSpray,WaitandEpidemicprotocol.SimulationshowthatSONRcanimproveperformanceondeliveryratio,deliverylatencyandnetworkoverhead,meanwhile.SONRapproachestheperformanceofEpidemicrouting.

简介：Astate-dependentroutingalgorithmbasedontheneuralnetworkmodel,whichtakesadvantageofotherdynamicroutingalgorithmforcircuit-switchednetwork,isgivenin[1].ButtheAlgorthmin[1]isacentralizedcontrolmodelwithcomplexO(N^7),therefore,isdiffculttorealizebyhardware.Asimplifiedalgorithmisputforwardinthispaper,inwhichroutingcanbecontrolleddecentralizekly,anditscomplexityisreducedtoO(10N^3).Computersimulationsaremadeinafullyconnectedtestnetworkwitheightnodes.TheresultsshowthatthecentralizedcontrolmodelhasveryeffectiveperformancethatcanmatchRTNR,andthecentralizedcontrolmodelisnotasgoodasthecentralizedonebutbetterthanDAR-1.

简介：

简介：Aroutingtreeforasetoftasksisadecisiontreewhichassignsthetaskstotheirdestinationsaccordingtothefeaturesofthetasks.Aweightedroutingtreeisonewithcostsattachedtoeachlinkofthetree.Linksofthesamefeaturehavethesamecost.Itisprovedthattheproblemoffinding?routingtreeoftheminimumcostforagivensetoftasksoftwofeaturesisNP-complete.

简介：OccurrenceoffaultsinNetworkonChip(NoC)isinevitableasthefeaturesizeiscon-tinuouslydecreasingandprocessingelementsareincreasinginnumbers.Faultscanberevocableifitistransient.Transientfaultmayoccurinsiderouter,orinthecoreorincommunicationwires.Examplesoftransientfaultsareoverflowofbuffersinrouter,clockskew,crosstalk,etc..Revocationoftransientfaultscanbedonebyretransmissionoffaultypacketsusingobliviousoradaptiveroutingalgorithms.Irrevocablefaultscausesnon-functionalityofsegmentandmainlyoccursduringfabricationprocess.NoCreliabilityincreaseswiththeefficientroutingalgorithms,whichcanhandlethemaximumfaultswithoutdeadlockinnetwork.Astransientfaultsaretemporaryandcanbeeasilyrevokedusingre-transmissionofpacket,permanentfaultsrequireefficientroutingtoroutethepacketbybypassingthenonfunctionalsegments.Thus,ourfocusisontheanalysisofadaptiveminimalpathfaulttolerantroutingtohandlethepermanentfaults.ComparativeanalysisbetweenpartialadaptivefaulttoleranceroutingWest-First,North-Last,Negative-First,OddEven,andMinimalpathFaultTolerantrouting(MinFT)algorithmswiththenodesandlinksfailureisperformedusingNoCInterconnectRoutinGandApplicationModelingsimulator(NIRGAM)forthe2DMeshtopology.ResultsuggeststhatMinFTensuresdatatransmissionunderworstconditionsascomparedtootheradaptiveroutingalgorithms.

简介：ThemaingoalofroutingsolutionsistosatisfytherequirementsoftheQualityofService(QoS)foreveryadmittedconnectionaswellastoachieveaglobalefficiencyinresourceutilization.InthispaperproposesasolutionbasedonHopfieldneuralnetwork(HNN)todealwithoneofrepresentativeroutingproblemsinuni-castrouting,i.e.themulti-constrained(MC)routingproblem.ComputersimulationshowsthatwecanobtaintheoptimalpathveryrapidlywithournewLyapunovenergyfunctions.