{"id":"https://openalex.org/W4247772122","doi":"https://doi.org/10.1145/1035237.1035245","title":"Path assignment for virtual circuit routing","display_name":"Path assignment for virtual circuit routing","publication_year":1983,"publication_date":"1983-01-01","ids":{"openalex":"https://openalex.org/W4247772122","doi":"https://doi.org/10.1145/1035237.1035245"},"language":"en","primary_location":{"id":"doi:10.1145/1035237.1035245","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1035237.1035245","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the symposium on Communications Architectures & Protocols  - COMM '83","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/A5062397834","display_name":"E. M. Gafni","orcid":null},"institutions":[{"id":"https://openalex.org/I161318765","display_name":"University of California, Los Angeles","ror":"https://ror.org/046rm7j60","country_code":"US","type":"education","lineage":["https://openalex.org/I161318765"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"E. M. Gafni","raw_affiliation_strings":["Univ. of California, Los Angeles, CA"],"affiliations":[{"raw_affiliation_string":"Univ. of California, Los Angeles, CA","institution_ids":["https://openalex.org/I161318765"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5039911471","display_name":"Dimitri P. Bertsekas","orcid":"https://orcid.org/0000-0001-6909-7208"},"institutions":[{"id":"https://openalex.org/I4210110987","display_name":"IIT@MIT","ror":"https://ror.org/01wp8zh54","country_code":"US","type":"facility","lineage":["https://openalex.org/I30771326","https://openalex.org/I4210110987"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"D. P. Bertsekas","raw_affiliation_strings":["MIT, Cambridge, MA"],"affiliations":[{"raw_affiliation_string":"MIT, Cambridge, MA","institution_ids":["https://openalex.org/I4210110987"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5062397834"],"corresponding_institution_ids":["https://openalex.org/I161318765"],"apc_list":null,"apc_paid":null,"fwci":0.68232341,"has_fulltext":false,"cited_by_count":6,"citation_normalized_percentile":{"value":0.77894528,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"21","last_page":"21"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10714","display_name":"Software-Defined Networks and 5G","score":0.9980000257492065,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9980000257492065,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9940999746322632,"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/T11522","display_name":"VLSI and FPGA Design Techniques","score":0.9865000247955322,"subfield":{"id":"https://openalex.org/subfields/2208","display_name":"Electrical and Electronic Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/session","display_name":"Session (web analytics)","score":0.8599547147750854},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7438173294067383},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.6877188682556152},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.6739249229431152},{"id":"https://openalex.org/keywords/path","display_name":"Path (computing)","score":0.5580134987831116},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.42895767092704773},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.41287341713905334},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.32967913150787354},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2025226652622223},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.1159713864326477}],"concepts":[{"id":"https://openalex.org/C2779182362","wikidata":"https://www.wikidata.org/wiki/Q17126187","display_name":"Session (web analytics)","level":2,"score":0.8599547147750854},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7438173294067383},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.6877188682556152},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.6739249229431152},{"id":"https://openalex.org/C2777735758","wikidata":"https://www.wikidata.org/wiki/Q817765","display_name":"Path (computing)","level":2,"score":0.5580134987831116},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.42895767092704773},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.41287341713905334},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.32967913150787354},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2025226652622223},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.1159713864326477},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/1035237.1035245","is_oa":false,"landing_page_url":"https://doi.org/10.1145/1035237.1035245","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the symposium on Communications Architectures & Protocols  - COMM '83","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W4296749040","https://openalex.org/W4230197055","https://openalex.org/W621808327","https://openalex.org/W644007644","https://openalex.org/W3012257603","https://openalex.org/W3177475962","https://openalex.org/W4292264782","https://openalex.org/W3016450995","https://openalex.org/W2141646567","https://openalex.org/W4296748749"],"abstract_inverted_index":{"We":[0,29,42,59],"consider":[1],"a":[2,7,14,20],"network":[3],"which":[4,50],"routes":[5],"on":[6,74],"virtual-circuit.":[8],"Each":[9],"virtual-circuit":[10,51],"is":[11,17,27,80],"associated":[12],"with":[13],"session.":[15],"Virtual-circuit":[16],"assigned":[18,57],"to":[19,48,64,82],"session":[21,26,54],"at":[22],"the":[23,25,31,65,70,75],"time":[24],"initiated.":[28],"address":[30],"dynamic":[32],"case":[33],"where":[34],"new":[35],"sessions":[36,40],"arrive":[37],"and":[38,67],"old":[39],"terminate.":[41],"formulate":[43],"an":[44,52,85],"optimal":[45,83],"control":[46],"problem":[47,66],"deduce":[49],"incoming":[53],"will":[55],"be":[56],"to.":[58],"then":[60],"discuss":[61],"various":[62],"approximations":[63],"show":[68],"that":[69],"heuristic":[71],"rule,":[72],"\"route":[73],"shortest":[76],"marginal":[77],"delay":[78],"path\",":[79],"close":[81],"in":[84],"asympotic":[86],"sense.":[87]},"counts_by_year":[{"year":2012,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}