{"id":"https://openalex.org/W1964201290","doi":"https://doi.org/10.1109/glocom.2010.5683159","title":"Throughput of Reliable Networks with Load Balanced Shortest Path Routing","display_name":"Throughput of Reliable Networks with Load Balanced Shortest Path Routing","publication_year":2010,"publication_date":"2010-12-01","ids":{"openalex":"https://openalex.org/W1964201290","doi":"https://doi.org/10.1109/glocom.2010.5683159","mag":"1964201290"},"language":"en","primary_location":{"id":"doi:10.1109/glocom.2010.5683159","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2010.5683159","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","raw_type":"proceedings-article"},"type":"conference-paper","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/A5063192888","display_name":"Marija Anti\u0107","orcid":"https://orcid.org/0000-0001-6081-0548"},"institutions":[{"id":"https://openalex.org/I4068193","display_name":"University of Belgrade","ror":"https://ror.org/02qsmb048","country_code":"RS","type":"education","lineage":["https://openalex.org/I4068193"]}],"countries":["RS"],"is_corresponding":false,"raw_author_name":"Marija Antic","raw_affiliation_strings":["School of Electrical Engineering, Belgrade University, Serbia","Sch. of Electr. Eng., Belgrade Univ., Belgrade, Serbia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, Belgrade University, Serbia","institution_ids":["https://openalex.org/I4068193"]},{"raw_affiliation_string":"Sch. of Electr. Eng., Belgrade Univ., Belgrade, Serbia","institution_ids":["https://openalex.org/I4068193"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5022603134","display_name":"Aleksandra Smiljani\u0107","orcid":null},"institutions":[{"id":"https://openalex.org/I4068193","display_name":"University of Belgrade","ror":"https://ror.org/02qsmb048","country_code":"RS","type":"education","lineage":["https://openalex.org/I4068193"]}],"countries":["RS"],"is_corresponding":false,"raw_author_name":"Aleksandra Smiljanic","raw_affiliation_strings":["School of Electrical Engineering, Belgrade University, Serbia","Sch. of Electr. Eng., Belgrade Univ., Belgrade, Serbia"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Electrical Engineering, Belgrade University, Serbia","institution_ids":["https://openalex.org/I4068193"]},{"raw_affiliation_string":"Sch. of Electr. Eng., Belgrade Univ., Belgrade, Serbia","institution_ids":["https://openalex.org/I4068193"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I4068193"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.04791875,"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":"1","last_page":"5"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T12288","display_name":"Optimization and Search Problems","score":0.9970999956130981,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9950000047683716,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T11498","display_name":"Security in Wireless Sensor Networks","score":0.9937000274658203,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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.7515097856521606},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6844061613082886},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6330468058586121},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.607390284538269},{"id":"https://openalex.org/keywords/path-vector-protocol","display_name":"Path vector protocol","score":0.6047110557556152},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.588783860206604},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5574964284896851},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5361862778663635},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.5108373165130615},{"id":"https://openalex.org/keywords/private-network-to-network-interface","display_name":"Private Network-to-Network Interface","score":0.4953233301639557},{"id":"https://openalex.org/keywords/equal-cost-multi-path-routing","display_name":"Equal-cost multi-path routing","score":0.45977792143821716},{"id":"https://openalex.org/keywords/link-state-routing-protocol","display_name":"Link-state routing protocol","score":0.4556780457496643},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.425869882106781},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.4250182807445526},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.413917601108551},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.40975117683410645},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.12232524156570435},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.04693654179573059}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7515097856521606},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6844061613082886},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6330468058586121},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.607390284538269},{"id":"https://openalex.org/C128917274","wikidata":"https://www.wikidata.org/wiki/Q1666535","display_name":"Path vector protocol","level":5,"score":0.6047110557556152},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.588783860206604},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5574964284896851},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5361862778663635},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.5108373165130615},{"id":"https://openalex.org/C204348804","wikidata":"https://www.wikidata.org/wiki/Q3888133","display_name":"Private Network-to-Network Interface","level":5,"score":0.4953233301639557},{"id":"https://openalex.org/C115443555","wikidata":"https://www.wikidata.org/wiki/Q5367790","display_name":"Equal-cost multi-path routing","level":5,"score":0.45977792143821716},{"id":"https://openalex.org/C89305328","wikidata":"https://www.wikidata.org/wiki/Q1755411","display_name":"Link-state routing protocol","level":4,"score":0.4556780457496643},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.425869882106781},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.4250182807445526},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.413917601108551},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.40975117683410645},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.12232524156570435},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.04693654179573059},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/glocom.2010.5683159","is_oa":false,"landing_page_url":"https://doi.org/10.1109/glocom.2010.5683159","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2010 IEEE Global Telecommunications Conference GLOBECOM 2010","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W1971443646","https://openalex.org/W2078995479","https://openalex.org/W2095660971","https://openalex.org/W2111101244","https://openalex.org/W2114937765","https://openalex.org/W2122075105","https://openalex.org/W2136558412","https://openalex.org/W2141380973","https://openalex.org/W2145818650","https://openalex.org/W2146061215","https://openalex.org/W2148662748","https://openalex.org/W2177058407"],"related_works":["https://openalex.org/W1242343826","https://openalex.org/W2113362813","https://openalex.org/W2122302754","https://openalex.org/W2983572675","https://openalex.org/W2754318699","https://openalex.org/W2108305519","https://openalex.org/W2140700113","https://openalex.org/W2182195922","https://openalex.org/W1971663816","https://openalex.org/W4241849776"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"a":[3],"practical":[4],"routing":[5,52,80],"protocol":[6],"that":[7,141],"maximizes":[8],"the":[9,36,59,62,68,75,79,97,100,113,116,120,129,133,142,149],"guaranteed":[10,63,87],"node":[11,23,39,64,69],"traffic":[12,24,31,89],"loads":[13,25],"in":[14],"reliable":[15,101,117],"networks":[16,102,118],"is":[17,45,126,139],"designed":[18],"and":[19,33,132,137],"analyzed.":[20],"The":[21,107,124],"derived":[22],"can":[26,54,85,146],"be":[27,55,86],"routed":[28],"for":[29,78,128],"every":[30],"pattern,":[32],"regardless":[34],"of":[35,61,99,115,144],"possible":[37],"single":[38],"or":[40],"link":[41],"failures.":[42],"First,":[43],"it":[44,138],"described":[46],"how":[47],"load":[48],"balanced":[49],"shortest":[50],"path":[51],"(LB-SPR)":[53],"optimized":[56],"to":[57,92],"maximize":[58],"value":[60],"loads.":[65],"By":[66],"assigning":[67],"weights":[70],"which":[71],"are":[72,105,110],"fed":[73],"into":[74],"linear":[76],"program":[77],"optimization,":[81],"different":[82,88],"network":[83,135,150],"nodes":[84],"loads,":[90],"according":[91],"their":[93],"estimated":[94],"demands.":[95],"Then,":[96],"throughputs":[98,114],"using":[103,119],"LB-SPR":[104,145],"determined.":[106],"obtained":[108],"values":[109],"compared":[111],"with":[112],"regular":[121,134],"shortestpath":[122],"routing.":[123],"analysis":[125],"performed":[127],"real":[130],"networks,":[131],"topologies,":[136],"shown":[140],"use":[143],"significantly":[147],"increase":[148],"throughput.":[151]},"counts_by_year":[{"year":2019,"cited_by_count":1},{"year":2015,"cited_by_count":1}],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}