{"id":"https://openalex.org/W2164501624","doi":"https://doi.org/10.1137/0210053","title":"Some Complexity Results in the Design of Deadlock-Free Packet Switching Networks","display_name":"Some Complexity Results in the Design of Deadlock-Free Packet Switching Networks","publication_year":1981,"publication_date":"1981-11-01","ids":{"openalex":"https://openalex.org/W2164501624","doi":"https://doi.org/10.1137/0210053","mag":"2164501624"},"language":"en","primary_location":{"id":"doi:10.1137/0210053","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0210053","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","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/A5000539327","display_name":"Sam Toueg","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Sam Toueg","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5109830496","display_name":"Kenneth Steiglitz","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kenneth Steiglitz","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5000539327"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.2736,"has_fulltext":false,"cited_by_count":31,"citation_normalized_percentile":{"value":0.83954219,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"10","issue":"4","first_page":"702","last_page":"712"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"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/T10829","display_name":"Interconnection Networks and Systems","score":0.9998999834060669,"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.996999979019165,"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/T11032","display_name":"VLSI and Analog Circuit Testing","score":0.9962999820709229,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/deadlock","display_name":"Deadlock","score":0.6925674676895142},{"id":"https://openalex.org/keywords/time-complexity","display_name":"Time complexity","score":0.6456496119499207},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6422738432884216},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.6064579486846924},{"id":"https://openalex.org/keywords/deadlock-prevention-algorithms","display_name":"Deadlock prevention algorithms","score":0.48500654101371765},{"id":"https://openalex.org/keywords/circuit-switching","display_name":"Circuit switching","score":0.48003947734832764},{"id":"https://openalex.org/keywords/computational-complexity-theory","display_name":"Computational complexity theory","score":0.4688352644443512},{"id":"https://openalex.org/keywords/packet-switching","display_name":"Packet switching","score":0.4611871838569641},{"id":"https://openalex.org/keywords/polynomial","display_name":"Polynomial","score":0.44722050428390503},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.43430641293525696},{"id":"https://openalex.org/keywords/np-complete","display_name":"NP-complete","score":0.4264029860496521},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.3892025649547577},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.34762537479400635},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.3309047818183899},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3013622462749481},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.233850359916687}],"concepts":[{"id":"https://openalex.org/C159023740","wikidata":"https://www.wikidata.org/wiki/Q623276","display_name":"Deadlock","level":2,"score":0.6925674676895142},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.6456496119499207},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6422738432884216},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.6064579486846924},{"id":"https://openalex.org/C113429609","wikidata":"https://www.wikidata.org/wiki/Q4060699","display_name":"Deadlock prevention algorithms","level":3,"score":0.48500654101371765},{"id":"https://openalex.org/C74294265","wikidata":"https://www.wikidata.org/wiki/Q506273","display_name":"Circuit switching","level":2,"score":0.48003947734832764},{"id":"https://openalex.org/C179799912","wikidata":"https://www.wikidata.org/wiki/Q205084","display_name":"Computational complexity theory","level":2,"score":0.4688352644443512},{"id":"https://openalex.org/C113508815","wikidata":"https://www.wikidata.org/wiki/Q193446","display_name":"Packet switching","level":3,"score":0.4611871838569641},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.44722050428390503},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.43430641293525696},{"id":"https://openalex.org/C122749075","wikidata":"https://www.wikidata.org/wiki/Q215206","display_name":"NP-complete","level":3,"score":0.4264029860496521},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.3892025649547577},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.34762537479400635},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.3309047818183899},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3013622462749481},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.233850359916687},{"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.1137/0210053","is_oa":false,"landing_page_url":"https://doi.org/10.1137/0210053","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.139.650","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.139.650","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.cs.princeton.edu/~ken/deadlock81.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":10,"referenced_works":["https://openalex.org/W152101237","https://openalex.org/W1655990431","https://openalex.org/W1978932379","https://openalex.org/W2068208021","https://openalex.org/W2072941982","https://openalex.org/W2112582868","https://openalex.org/W2113249552","https://openalex.org/W2135613090","https://openalex.org/W2226925554","https://openalex.org/W4232411576"],"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":{"Deadlocks":[0],"are":[1,25,30,41,52],"very":[2],"serious":[3],"system":[4],"failures":[5],"and":[6,48],"have":[7],"been":[8],"observed":[9],"in":[10],"existing":[11],"packet":[12],"switching":[13],"networks":[14],"(PSN\u2019s).":[15],"Several":[16],"problems":[17],"related":[18],"to":[19,43,55],"the":[20],"design":[21],"of":[22,34,39],"deadlock-free":[23],"PSN\u2019s":[24],"investigated":[26],"here.":[27],"Polynomial-time":[28],"algorithms":[29,51],"given":[31],"for":[32],"some":[33],"these":[35],"problems,":[36],"but":[37],"most":[38],"them":[40],"shown":[42],"be":[44,56],"NP-complete":[45],"or":[46],"NP-hard,":[47],"therefore":[49],"polynomial-time":[50],"not":[53],"likely":[54],"found.":[57]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":2},{"year":2014,"cited_by_count":1}],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}