{"id":"https://openalex.org/W4283205555","doi":"https://doi.org/10.1109/infocom48880.2022.9796959","title":"Optimal Routing for Stream Learning Systems","display_name":"Optimal Routing for Stream Learning Systems","publication_year":2022,"publication_date":"2022-05-02","ids":{"openalex":"https://openalex.org/W4283205555","doi":"https://doi.org/10.1109/infocom48880.2022.9796959"},"language":"en","primary_location":{"id":"doi:10.1109/infocom48880.2022.9796959","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom48880.2022.9796959","pdf_url":null,"source":{"id":"https://openalex.org/S4363607980","display_name":"IEEE INFOCOM 2022 - IEEE Conference on Computer Communications","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2022 - IEEE Conference on Computer Communications","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5049286032","display_name":"Xinzhe Fu","orcid":"https://orcid.org/0000-0002-4425-3881"},"institutions":[{"id":"https://openalex.org/I4210143601","display_name":"Decision Systems (United States)","ror":"https://ror.org/0434dpa13","country_code":"US","type":"company","lineage":["https://openalex.org/I4210143601"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Xinzhe Fu","raw_affiliation_strings":["MIT,Lab for Information and Decision Systems","Lab for Information and Decision Systems, MIT"],"affiliations":[{"raw_affiliation_string":"MIT,Lab for Information and Decision Systems","institution_ids":["https://openalex.org/I4210143601"]},{"raw_affiliation_string":"Lab for Information and Decision Systems, MIT","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036587377","display_name":"Eytan Modiano","orcid":null},"institutions":[{"id":"https://openalex.org/I4210143601","display_name":"Decision Systems (United States)","ror":"https://ror.org/0434dpa13","country_code":"US","type":"company","lineage":["https://openalex.org/I4210143601"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Eytan Modiano","raw_affiliation_strings":["MIT,Lab for Information and Decision Systems","Lab for Information and Decision Systems, MIT"],"affiliations":[{"raw_affiliation_string":"MIT,Lab for Information and Decision Systems","institution_ids":["https://openalex.org/I4210143601"]},{"raw_affiliation_string":"Lab for Information and Decision Systems, MIT","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5049286032"],"corresponding_institution_ids":["https://openalex.org/I4210143601"],"apc_list":null,"apc_paid":null,"fwci":0.1039,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.25005387,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"500","last_page":"509"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10764","display_name":"Privacy-Preserving Technologies in Data","score":0.9993000030517578,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.9988999962806702,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12761","display_name":"Data Stream Mining Techniques","score":0.9976999759674072,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7534590363502502},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.5952414274215698},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5455392003059387},{"id":"https://openalex.org/keywords/multipath-routing","display_name":"Multipath routing","score":0.4990119934082031},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.4668009877204895},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4467082619667053},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.44579342007637024},{"id":"https://openalex.org/keywords/geographic-routing","display_name":"Geographic routing","score":0.4386499226093292},{"id":"https://openalex.org/keywords/data-stream","display_name":"Data stream","score":0.41325145959854126},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.3896333873271942},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.15884599089622498},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.15326568484306335},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.1430492401123047}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7534590363502502},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.5952414274215698},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5455392003059387},{"id":"https://openalex.org/C76522221","wikidata":"https://www.wikidata.org/wiki/Q5035396","display_name":"Multipath routing","level":5,"score":0.4990119934082031},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.4668009877204895},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4467082619667053},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.44579342007637024},{"id":"https://openalex.org/C50558702","wikidata":"https://www.wikidata.org/wiki/Q5535067","display_name":"Geographic routing","level":5,"score":0.4386499226093292},{"id":"https://openalex.org/C2778484313","wikidata":"https://www.wikidata.org/wiki/Q1172540","display_name":"Data stream","level":2,"score":0.41325145959854126},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.3896333873271942},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.15884599089622498},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.15326568484306335},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.1430492401123047},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom48880.2022.9796959","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom48880.2022.9796959","pdf_url":null,"source":{"id":"https://openalex.org/S4363607980","display_name":"IEEE INFOCOM 2022 - IEEE Conference on Computer Communications","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2022 - IEEE Conference on Computer Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4300000071525574,"id":"https://metadata.un.org/sdg/17","display_name":"Partnerships for the goals"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320337345","display_name":"Office of Naval Research","ror":"https://ror.org/00rk2pe57"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":45,"referenced_works":["https://openalex.org/W1505731132","https://openalex.org/W1516903196","https://openalex.org/W1588057731","https://openalex.org/W1957482736","https://openalex.org/W1985602045","https://openalex.org/W2008503861","https://openalex.org/W2075932300","https://openalex.org/W2112269233","https://openalex.org/W2119745055","https://openalex.org/W2166706236","https://openalex.org/W2554791272","https://openalex.org/W2566979091","https://openalex.org/W2751171528","https://openalex.org/W2796196168","https://openalex.org/W2803971899","https://openalex.org/W2891529989","https://openalex.org/W2920095265","https://openalex.org/W2950991820","https://openalex.org/W2955121143","https://openalex.org/W2962970367","https://openalex.org/W2963179579","https://openalex.org/W2963318081","https://openalex.org/W2963763345","https://openalex.org/W2975156709","https://openalex.org/W2997967197","https://openalex.org/W3035507578","https://openalex.org/W3041221479","https://openalex.org/W3047208416","https://openalex.org/W3111182214","https://openalex.org/W3175451640","https://openalex.org/W4247230948","https://openalex.org/W4249253882","https://openalex.org/W6630841318","https://openalex.org/W6635271509","https://openalex.org/W6640782186","https://openalex.org/W6676963778","https://openalex.org/W6684249991","https://openalex.org/W6697452822","https://openalex.org/W6731596640","https://openalex.org/W6750166180","https://openalex.org/W6751453669","https://openalex.org/W6752191696","https://openalex.org/W6773077378","https://openalex.org/W6773971411","https://openalex.org/W6789560579"],"related_works":["https://openalex.org/W2181601090","https://openalex.org/W3127002380","https://openalex.org/W2068473861","https://openalex.org/W2889464401","https://openalex.org/W757657516","https://openalex.org/W2351878639","https://openalex.org/W2539097916","https://openalex.org/W2136173851","https://openalex.org/W1655019438","https://openalex.org/W2029407480"],"abstract_inverted_index":{"Consider":[0],"a":[1,6,9,16,56,169,199,239,262,282],"stream":[2,155,207,228],"learning":[3,18,156,208,229,279],"system":[4,74],"with":[5,102,231,265],"source":[7,32,98,112],"and":[8,39,68,99,195,286,305],"set":[10],"of":[11,110,116,125,147,154,171,191,300],"computation":[12,46,84,104,121],"nodes":[13,47],"that":[14,179,222,242,288],"solves":[15],"machine":[17,278],"task":[19,280],"modeled":[20],"as":[21,168,276],"stochastic":[22,77,87,263,308],"convex":[23],"optimization":[24,130,166,193,303],"problem":[25],"over":[26],"an":[27,161,217],"unknown":[28,266],"distribution":[29],"D.":[30],"The":[31,50,73,175],"generates":[33],"i.i.d.":[34],"data":[35,42,51,61,93,117,233,256,284],"points":[36,43,52,118,257],"from":[37,96],"D":[38],"routes":[40],"the":[41,45,92,97,107,111,114,123,126,129,138,145,148,152,165,172,180,184,188,192,203,212,224,245,255,277,289,302,306,313],"to":[44,198,261],"for":[48,201,206,227,252],"processing.":[49,72],"are":[53,258],"processed":[54],"in":[55,298],"streaming":[57],"fashion,":[58],"i.e.,":[59,128],"each":[60,83,120],"point":[62],"can":[63,243],"be":[64],"accessed":[65],"only":[66],"once":[67],"is":[69],"discarded":[70],"after":[71],"employs":[75],"local":[76,134],"gradient":[78,88],"descent":[79,89],"(local":[80],"SGD),":[81],"where":[82,254],"node":[85],"performs":[86],"locally":[90],"using":[91,272],"it":[94],"receives":[95],"periodically":[100],"synchronizes":[101],"other":[103],"nodes.":[105],"Since":[106],"routing":[108,139,149,173,181,204,220,240,248,292,309,316],"policy":[109,150,182,205,221,241,249,293,310],"determines":[113],"availability":[115],"at":[119],"node,":[122],"performance":[124,153,185,297],"system,":[127],"error":[131,167,304],"obtained":[132],"by":[133],"SGD,":[135],"depends":[136],"on":[137,151,164,281],"policy.In":[140],"this":[141],"paper,":[142],"we":[143,215,269],"study":[144],"influence":[146],"systems.":[157,209],"We":[158,236],"first":[159],"derive":[160],"upper":[162,176,213],"bound":[163,177],"function":[170],"policy.":[174,317],"reveals":[178],"influences":[183],"through":[186],"tuning":[187],"bias-variance":[189],"trade-off":[190,226],"process,":[194],"gives":[196],"rise":[197],"framework":[200],"optimizing":[202],"By":[210],"minimizing":[211,301],"bound,":[214],"propose":[216,238],"optimal":[218,246,290,314],"static":[219,247,291,315],"achieves":[223],"best":[225],"systems":[230,253],"deterministic":[232],"generation":[234],"process.":[235],"then":[237],"approximate":[244],"arbitrarily":[250],"closely":[251,311],"generated":[259],"according":[260],"process":[264],"rate.":[267],"Finally,":[268],"conduct":[270],"simulations":[271],"Support":[273],"Vector":[274],"Machine":[275],"real":[283],"set,":[285],"show":[287],"has":[294],"excellent":[295],"empirical":[296],"terms":[299],"proposed":[307],"matches":[312]},"counts_by_year":[{"year":2024,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}