{"id":"https://openalex.org/W2085940326","doi":"https://doi.org/10.1142/s012905419000014x","title":"DEADLOCK PREDICTION IN THE CASE OF DYNAMIC ROUTING","display_name":"DEADLOCK PREDICTION IN THE CASE OF DYNAMIC ROUTING","publication_year":1990,"publication_date":"1990-09-01","ids":{"openalex":"https://openalex.org/W2085940326","doi":"https://doi.org/10.1142/s012905419000014x","mag":"2085940326"},"language":"en","primary_location":{"id":"doi:10.1142/s012905419000014x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905419000014x","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-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/A5108435532","display_name":"Daniel P. Bovet","orcid":null},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":true,"raw_author_name":"DANIEL P. BOVET","raw_affiliation_strings":["Dipartimento di Matematica, Universit\u00e0 di Roma \u201cLa Sapienza\u201d, 00185 Roma, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica, Universit\u00e0 di Roma \u201cLa Sapienza\u201d, 00185 Roma, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5014515479","display_name":"Miriam Di Ianni","orcid":"https://orcid.org/0000-0002-1699-5802"},"institutions":[{"id":"https://openalex.org/I861853513","display_name":"Sapienza University of Rome","ror":"https://ror.org/02be6w209","country_code":"IT","type":"education","lineage":["https://openalex.org/I861853513"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"MIRIAM DI IANNI","raw_affiliation_strings":["Dipartimento di Matematica, Universit\u00e0 di Roma \u201cLa Sapienza\u201d, 00185 Roma, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica, Universit\u00e0 di Roma \u201cLa Sapienza\u201d, 00185 Roma, Italy","institution_ids":["https://openalex.org/I861853513"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5012362492","display_name":"Pierluigi Crescenzi","orcid":"https://orcid.org/0000-0001-8789-3195"},"institutions":[{"id":"https://openalex.org/I26415053","display_name":"University of L'Aquila","ror":"https://ror.org/01j9p1r26","country_code":"IT","type":"education","lineage":["https://openalex.org/I26415053"]}],"countries":["IT"],"is_corresponding":false,"raw_author_name":"PIERLUIGI CRESCENZI","raw_affiliation_strings":["Dipartimento di Matematica, Universit\u00e0 de L\u2019Aquila, 67010 L\u2019Aquila, Italy"],"affiliations":[{"raw_affiliation_string":"Dipartimento di Matematica, Universit\u00e0 de L\u2019Aquila, 67010 L\u2019Aquila, Italy","institution_ids":["https://openalex.org/I26415053"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5108435532"],"corresponding_institution_ids":["https://openalex.org/I861853513"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":3,"citation_normalized_percentile":{"value":0.25815523,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":91,"max":95},"biblio":{"volume":"01","issue":"03","first_page":"185","last_page":"199"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9987999796867371,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9987999796867371,"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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9983000159263611,"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/T10847","display_name":"Advanced Optical Network Technologies","score":0.9957000017166138,"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/deadlock","display_name":"Deadlock","score":0.7286508083343506},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7282123565673828},{"id":"https://openalex.org/keywords/deadlock-prevention-algorithms","display_name":"Deadlock prevention algorithms","score":0.659125566482544},{"id":"https://openalex.org/keywords/adaptive-routing","display_name":"Adaptive routing","score":0.5758640766143799},{"id":"https://openalex.org/keywords/vertex","display_name":"Vertex (graph theory)","score":0.5670052170753479},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.49755576252937317},{"id":"https://openalex.org/keywords/completeness","display_name":"Completeness (order theory)","score":0.4480772018432617},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.41911059617996216},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.37129780650138855},{"id":"https://openalex.org/keywords/static-routing","display_name":"Static routing","score":0.33304551243782043},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2945426106452942},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2388196587562561},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17582273483276367},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.12374210357666016}],"concepts":[{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.7286508083343506},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7282123565673828},{"id":"https://openalex.org/C113429609","wikidata":"https://www.wikidata.org/wiki/Q4060699","display_name":"Deadlock prevention algorithms","level":3,"score":0.659125566482544},{"id":"https://openalex.org/C24856439","wikidata":"https://www.wikidata.org/wiki/Q352483","display_name":"Adaptive routing","level":5,"score":0.5758640766143799},{"id":"https://openalex.org/C80899671","wikidata":"https://www.wikidata.org/wiki/Q1304193","display_name":"Vertex (graph theory)","level":3,"score":0.5670052170753479},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.49755576252937317},{"id":"https://openalex.org/C17231256","wikidata":"https://www.wikidata.org/wiki/Q5156540","display_name":"Completeness (order theory)","level":2,"score":0.4480772018432617},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.41911059617996216},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.37129780650138855},{"id":"https://openalex.org/C204948658","wikidata":"https://www.wikidata.org/wiki/Q1119410","display_name":"Static routing","level":4,"score":0.33304551243782043},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2945426106452942},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2388196587562561},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17582273483276367},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.12374210357666016},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1142/s012905419000014x","is_oa":false,"landing_page_url":"https://doi.org/10.1142/s012905419000014x","pdf_url":null,"source":{"id":"https://openalex.org/S68047077","display_name":"International Journal of Foundations of Computer Science","issn_l":"0129-0541","issn":["0129-0541","1793-6373"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310319815","host_organization_name":"World Scientific","host_organization_lineage":["https://openalex.org/P4310319815"],"host_organization_lineage_names":["World Scientific"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Journal of Foundations of Computer Science","raw_type":"journal-article"},{"id":"pmh:oai:flore.unifi.it:2158/205977","is_oa":false,"landing_page_url":"http://hdl.handle.net/2158/205977","pdf_url":null,"source":{"id":"https://openalex.org/S4306402033","display_name":"Florence Research (University of Florence)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I45084792","host_organization_name":"University of Florence","host_organization_lineage":["https://openalex.org/I45084792"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"info:eu-repo/semantics/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/W2050076411","https://openalex.org/W4226119751","https://openalex.org/W1542183432","https://openalex.org/W2360686363","https://openalex.org/W2001478969","https://openalex.org/W1900787600","https://openalex.org/W2136552483","https://openalex.org/W2166954426","https://openalex.org/W4383684213","https://openalex.org/W2045082154"],"abstract_inverted_index":{"One":[0],"of":[1,11,18,25,45],"the":[2,23,43,48,68,78],"main":[3],"issues":[4],"in":[5,33,42,55,71,77],"flow":[6],"control":[7],"problems":[8],"is":[9,37],"deadlock":[10,29,49],"messages":[12],"caused":[13],"by":[14],"a":[15,28,34],"limited":[16],"amount":[17],"resources.":[19],"In":[20],"this":[21],"paper,":[22],"problem":[24,51],"predicting":[26],"whether":[27],"will":[30],"necessarily":[31],"occur":[32],"Store-and-Forward":[35],"Network":[36],"analyzed.":[38],"We":[39],"show":[40],"that,":[41],"case":[44,79],"dynamic":[46],"routing,":[47],"prediction":[50],"can":[52],"be":[53],"decided":[54],"polynomial":[56],"time":[57],"if":[58],"tokens":[59],"are":[60,82],"allowed":[61,83],"to":[62,84],"transit":[63,85],"more":[64],"than":[65],"once":[66],"through":[67],"same":[69],"vertex,":[70],"contrast":[72],"with":[73],"an":[74],"NP-completeness":[75],"result":[76],"where":[80],"they":[81],"at":[86],"most":[87],"once.":[88]},"counts_by_year":[{"year":2025,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}