锐客网

  1. 首页 > it技术 > >

代写|代写 Link State RoutingJava作业、Matlab语言程序代做留学生、代做Python作业、C/C++课程设计代写

【代写|代写 Link State RoutingJava作业、Matlab语言程序代做留学生、代做Python作业、C/C++课程设计代写】7/9/2018 Link State Routinghttps://sit.instructure.com/courses/20718/assignments/85261?module_item_id=459967 1/4Link& State& Rou?ngDue& Dec& 10,& 2017& by& 11:59pm & Points& 100 & Submitting& a& file& uploadAvailable& until& Dec& 10,& 2017& at& 11:59pmThis& assignment& was& locked& Dec& 10,& 2017& at& 11:59pm.The& goal& of& this& assignment& is& to& create& a& virtual& network& of& routers& that& send& routing& data& to& one& another.This& assignment& models& the& way& that& actual& dynamic& network& routing& is& performed.Routers& should& be& represented& by& an& appropriately& designed& class& or& data& type.& Each& router& should& maintaina& data& structure& that& stores& references& to& other& &"directly&"& connected& routers,& which& can& be& referenced& by& id,along& with& the& cost& of& the& link.& These& routers& will& exchange& information& necessary& to& build& a& routing& table.Each& router& will& be& advertising& access& to& a& particular& named& network,& which& is& a& string& that& should& be& storedin& the& router& class.& You& will& need& to& store& other& information& in& the& router& class& to& enable& the& remainder& of& thealgorithm& to& work,& such& as& an& undirected& graph& representing& the& network& of& routers& as& that& router& currentlyunderstands& it.You& will& be& implementing& a& &"link& state& routing&"& algorithm.& Link& state& routing& algorithms& work& on& real& networksby& sending& a& &"link& state& packet&"& around& the& network,& with& routers& forwarding& the& packet& as& appropriate.& Wewill& be& simulating& this& packet& with& instances& of& another& class,& that& will& contain& the& following& information:ID& of& the& router& that& originates& the& LSP.A& sequence& number& indicating& how& many& LSPs& have& been& sent& by& the& originating& router?& i.e.,& each& newlyoriginated& LSP& has& a& higher& sequence& number& than& all& previous& LSPs.& The& first& sequence& numbershould& be& 1?& ignore& the& possibility& of& wraparound.Time& to& live,& decremented& each& time& the& LSP& is& forwarded?& with& an& initial& value& of& 10.Either& of& the& following& at& your& option:A& list& that& indicates& each& reachable& network& (indicated& by& the& network& name& stored& in& the& routersstring).A& list& that& indicates& each& directly& connected& router,& the& network& behind& each& one,& and& the& cost& to& getto& that& router.The& router& class& should& contain& a& function/method& named& something& similar& to& receivePacket& that& shouldtake& as& its& only& arguments& -& (1)& an& instance& of& the& link& state& packet& class,& (2)& ID& of& the& router& that& forwardedthe& LSP.& A& router& that& receives& an& LSP& should& first& decrement& the& LSPs& TTL.& Next,& the& receiving& routershould& discard& the& LSP& and& not& use& its& information& if& either& (1)& the& TTL& has& reached& zero,& or& (2)& the& receivingrouter& has& already& seen& an& LSP& from& the& same& originating& router& with& a& sequence& number& higher& than& orequal& to& the& sequence& number& in& the& received& LSP.& If& the& LSP& is& not& discarded,& its& information& should& becompared& to& the& receiving& router’s& connectivity& graph& and& the& LSP& should& be& sent& out& (in& the& form.& of& functioncalls)& to& all& directly& connected& routers& except& the& one& on& which& it& was& received.The& router& class& should& also& contain& a& function& named& something& similar& to& originatePacket& that& takes& noarguments.& This& function& will& perform.& two& functions.& It& should& cause& the& router& to& generate& an& LSP& packetbased& on& the& current& state& of& the& network& as& it& understands& it,& and& send& it& to& all& directly& connected& routers.Before& it& sends& the& packet,& however,& it& should& also& increment& a& &"tick&"& counter& and& consider& if& there& are& anydirectly& connected& routers& from& which& it& has& not& received& a& packet& in& 2& ticks.& If& that& occurs,& the& router& should7/9/2018 Link State Routinghttps://sit.instructure.com/courses/20718/assignments/85261?module_item_id=459967 2/4alter& its& graph& to& reflect& that& the& cost& of& the& link& to& the& other& router& is& now& infinity& (or& some& arbitrarily& hugenumber& that& you& choose& to& represent& infinity,& if& your& language& does& not& have& a& special& infinity& value.).Each& router& should& maintain& a& &"routing& table&"& consisting& of& & triples.& Ifconnectivity& has& changed& (as& indicated& by& a& received& link& state& packet),& the& receiving& router& should& runDijkstra’s& all-pairs& shortest-path& algorithm& on& its& updated& connectivity& graph& to& re-compute& its& routing& table& of& triples.& Outgoing& link& means& the& directly& connected& router& to& which& this& routerwould& send& data& in& order& to& route& the& data& using& the& shortest& path.& It& does& not& mean& the& destination& router.(Consider& the& advantages& and& disadvantages& of& implementing& the& graph& using& an& adjacency& matrix& or& usingan& adjacency& list.)The& initial& network& will& be& set& up& by& reading& in& a& file,& infile.dat,& that& has& the& following& format:[router-id] [network-name] [directly-linked-router-id] [link-cost] [directly-linked-router-id] [link-cost] [directly-linked-router-id] [link-cost] etc... [router-id] [network-name] [directly-linked-router-id] [link-cost] [directly-linked-router-id] [link-cost] [directly-linked-router-id] [link-cost] etc... etc...Each& [bracketed]& text& above& represents& the& name& of& a& bit& of& data,& and& will& not& appear& with& brackets& around& itin& the& file.& &"etc...&"& represents& that& the& pattern& above& it& will& be& repeated.& link-cost& is& optional& and& should& beassumed& to& be& 1& if& missing& An& example& network,& and& picture& representing& that& network,& follows:7/9/2018 Link State Routinghttps://sit.instructure.com/courses/20718/assignments/85261?module_item_id=459967 3/40 155.246.80 1 3 1 155.246.81 0 2 4 2 155.246.82 1 3 5 3 155.246.83 0 2 4 6 4 155.246.84 1 3 5 5 155.246.85 2 4 6 6 155.246.86 3 5Note,& there& is& no& guarantee& that& the& router& id& numbers& will& be& sequential& as& they& were& in& the& aboveexample.& There& could& be,& for& example,& a& two-router& setup& with& id& 123& and& 84719.7/9/2018 Link State Routinghttps://sit.instructure.com/courses/20718/assignments/85261?module_item_id=459967 4/4Write& a& main& function& that& proceeds& as& follows:At& the& beginning& of& the& program,& create& routers& and& initialize& their& direct& links& by& reading& in& infile.dat.Prompt& the& user& if& they& would& like& to& continue& (enter& &"C&"),& quit& (enter& &"Q&"),& print& the& routing& table& of& arouter& (&"P&"& followed& by& the& routers& id& number),& shut& down& a& router& (enter& &"S&"& followed& by& the& id& number),or& start& up& a& router& (enter& &"T&"& followed& by& the& id).If& the& user& chooses& to& continue,& you& should& call& the& originatePacket()& function& on& every& router& inwhatever& order& you& choose.& Then& prompt& again.If& the& user& shuts& down& a& router,& change& the& router& object& so& that& it& does& not& send& out& any& LSP& or& doanything& in& response& to& originatePacket& or& receivePacket& function& calls.If& the& user& starts& up& a& router,& change& the& router& object& so& it& once& again& behaves& normally.& (Routersinitially& are& started,& not& stopped.)If& the& user& chooses& to& print& the& routing& table,& display& the& table& in& the& following& format,& and& then& promptagain:network, outgoing link network, outgoing link network, outgoing link network, outgoing link etc...If& the& user& chooses& to& quit,& exit& the& program.In& any& of& the& above& file& formats,& all& non-newline& whitespace& may& be& represented& by& one& or& more& tab& orspace& characters.This& final& project& cannot& be& extended& and& no& late& submissions& are& permitted& for& any& reason& at& anytime& without& first& filing& a& petition& for& incomplete& in& the& course.& This& rule& will& be& followed& strictly,& andsubmissions& will& be& blocked& by& Canvas& at& the& due& date.& If& you& want& to& avoid& potential& technology-related& issues& such& as& internet& connectivity& or& your& clock& and& Canvass& clock& not& being& in& sync,please& plan& on& submitting& the& assignment& early.本团队核心人员组成主要包括BAT一线工程师，精通德英语！我们主要业务范围是代做编程大作业、课程设计等等。我们的方向领域：window编程 数值算法 AI人工智能 金融统计 计量分析 大数据 网络编程 WEB编程 通讯编程 游戏编程多媒体linux 外挂编程 程序API图像处理 嵌入式/单片机 数据库编程 控制台 进程与线程 网络安全 汇编语言 硬件编程 软件设计 工程标准规等。其中代写编程、代写程序、代写留学生程序作业语言或工具包括但不限于以下范围:C/C++/C#代写Java代写IT代写Python代写辅导编程作业Matlab代写Haskell代写Processing代写Linux环境搭建Rust代写Data Structure Assginment 数据结构代写MIPS代写Machine Learning 作业 代写Oracle/SQL/PostgreSQL/Pig 数据库代写/代做/辅导Web开发、网站开发、网站作业ASP.NET网站开发Finance Insurace Statistics统计、回归、迭代Prolog代写Computer Computational method代做因为专业，所以值得信赖。如有需要，请加QQ：99515681 或邮箱：99515681@qq.com 微信：codehelp

    推荐阅读


    上一篇：沐风图文集二

    下一篇：【原创新诗】威威中国龙