{"id":"https://openalex.org/W377470535","doi":null,"title":"Optimal Randomized Algorithms for Multipacket and Wormhole Routing on the Mesh","display_name":"Optimal Randomized Algorithms for Multipacket and Wormhole Routing on the Mesh","publication_year":1991,"publication_date":"1991-01-01","ids":{"openalex":"https://openalex.org/W377470535","mag":"377470535"},"language":"en","primary_location":{"id":"pmh:oai:repository.upenn.edu:cis_reports-1348","doi":null,"is_oa":false,"landing_page_url":"https://repository.upenn.edu/cgi/viewcontent.cgi?article=1348&context=cis_reports","pdf_url":null,"source":{"id":"https://openalex.org/S4306402083","display_name":"ScholarlyCommons (University of Pennsylvania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I79576946","host_organization_name":"University of Pennsylvania","host_organization_lineage":["https://openalex.org/I79576946"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Technical Reports (CIS)","raw_type":"text"},"volume":null,"type":"article","indexed_in":[],"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/A5034177039","display_name":"Sanguthevar Rajasekaran","orcid":"https://orcid.org/0000-0002-0137-4843","observed_orcids":["https://orcid.org/0000-0002-0137-4843"]},"institutions":[{"id":"https://openalex.org/I79576946","display_name":"University of Pennsylvania","ror":"https://ror.org/00b30xv10","country_code":"US","type":"education","lineage":["https://openalex.org/I79576946"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Sanguthevar Rajasekaran","raw_affiliation_strings":["#N#               * University of Pennsylvania"],"raw_orcid":"https://orcid.org/0000-0002-0137-4843","affiliations":[{"raw_affiliation_string":"#N#               * University of Pennsylvania","institution_ids":["https://openalex.org/I79576946"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5079678086","display_name":"Mukund Raghavachari","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mukund Raghavachari","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.06883956,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":93},"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10829","display_name":"Interconnection Networks and Systems","score":0.9984999895095825,"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.9984999895095825,"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.000699999975040555,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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.0003000000142492354,"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/wormhole-routing","display_name":"wormhole routing","score":0.9639999866485596},{"id":"https://openalex.org/keywords/mesh-interconnection-networks","display_name":"mesh interconnection networks","score":0.703000009059906},{"id":"https://openalex.org/keywords/permutation-routing","display_name":"permutation routing","score":0.9049999713897705},{"id":"https://openalex.org/keywords/queue-length","display_name":"queue length","score":0.6589999794960022},{"id":"https://openalex.org/keywords/time-complexity-bounds","display_name":"time complexity bounds","score":0.4410000145435333}],"concepts":[{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5403255820274353},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.539446234703064},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.5208121538162231},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.5063294172286987},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.47203102707862854},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4585336148738861},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.45272213220596313},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.448669970035553},{"id":"https://openalex.org/C63553672","wikidata":"https://www.wikidata.org/wiki/Q581168","display_name":"Binary logarithm","level":2,"score":0.4276730716228485},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.41810932755470276},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.3670048415660858},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.16124498844146729},{"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":"pmh:oai:repository.upenn.edu:cis_reports-1348","doi":null,"is_oa":false,"landing_page_url":"https://repository.upenn.edu/cgi/viewcontent.cgi?article=1348&context=cis_reports","pdf_url":null,"source":{"id":"https://openalex.org/S4306402083","display_name":"ScholarlyCommons (University of Pennsylvania)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I79576946","host_organization_name":"University of Pennsylvania","host_organization_lineage":["https://openalex.org/I79576946"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Technical Reports (CIS)","raw_type":"text"},{"id":"mag:377470535","doi":null,"is_oa":false,"landing_page_url":"https://repository.upenn.edu/cgi/viewcontent.cgi?article=1348&context=cis_reports","pdf_url":null,"source":null,"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":null}],"best_oa_location":null,"sustainable_development_goals":[],"sustainable_development_goals_aurora":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":13,"referenced_works":["https://openalex.org/W1524866429","https://openalex.org/W1566007376","https://openalex.org/W1826472919","https://openalex.org/W1968312484","https://openalex.org/W1968358793","https://openalex.org/W1968606388","https://openalex.org/W2012216209","https://openalex.org/W2066104460","https://openalex.org/W2088356200","https://openalex.org/W2091030714","https://openalex.org/W2107997203","https://openalex.org/W2150586297","https://openalex.org/W2159614322"],"related_works":["https://openalex.org/W7097315381","https://openalex.org/W1986832044","https://openalex.org/W2101315187","https://openalex.org/W1513522415","https://openalex.org/W1524866429","https://openalex.org/W2043038847","https://openalex.org/W1515437436","https://openalex.org/W7096615458","https://openalex.org/W1970684463","https://openalex.org/W1826472919"],"abstract_inverted_index":{"In":[0],"this":[1],"paper,":[2],"we":[3,157],"present":[4,77,159],"a":[5,41,60,78,104,133,142,172],"randomized":[6,79,130],"algorithm":[7,24,51,80],"for":[8,81,88,148],"the":[9,82,89,95,113,177],"multipacket":[10],"(i.e.,":[11],"k":[12,111],"-":[13],"k)":[14],"routing":[15,86],"problem":[16,87],"on":[17],"an":[18],"n":[19,21],"x":[20],"mesh.":[22],"The":[23,47,123,153,167],"competes":[25],"with":[26,40,59,103,141,162],"high":[27],"probability":[28],"in":[29,93],"at":[30,94],"most":[31,96],"kn":[32,55,97,137],"+":[33,56,98,138],"O(k":[34,64,99,146],"log":[35,100],"n)":[36,101],"parallel":[37],"communication":[38],"steps,":[39,102],"constant":[42,105],"queue":[43,61,106,143,165],"size":[44,62,107,144],"of":[45,63,108,115,136,145,174,176],"O(k).":[46],"previous":[48,124],"best":[49,125],"known":[50,179],"[4]":[52],"takes":[53],"[5/4]":[54],"O([kn/f(n)])":[57],"steps":[58],"f(n))":[65,147],"(for":[66],"any":[67,149],"1":[68,150],"\u2264":[69,72,151],"f":[70],"(n)":[71],"n).":[73],"We":[74],"will":[75,158],"also":[76,129],"wormhole":[83],"model":[84],"permutation":[85],"mesh":[90],"that":[91,117,156],"completes":[92],"O(k),":[109],"where":[110],"is":[112,120],"number":[114],"flits":[116],"each":[118],"packet":[119],"divided":[121],"into.":[122],"result":[126],"[6]":[127],"was":[128],"and":[131],"had":[132],"time":[134,168],"bound":[135],"O":[139],"([kn/f(n)])":[140],"f(n).":[152],"two":[154,175],"algorithms":[155],"are":[160,170],"optimal":[161],"respect":[163],"to":[164],"size.":[166],"bounds":[169],"within":[171],"factor":[173],"only":[178],"lower":[180],"bound.":[181]},"counts_by_year":[{"year":2022,"cited_by_count":1}],"updated_date":"2026-09-21T07:43:02.447757","created_date":"2016-06-24T00:00:00"}