{"id":"https://openalex.org/W2061453155","doi":"https://doi.org/10.1137/s0097539794268637","title":"Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times","display_name":"Processor-Ring Communication: A Tight Asymptotic Bound on Packet Waiting Times","publication_year":1998,"publication_date":"1998-10-01","ids":{"openalex":"https://openalex.org/W2061453155","doi":"https://doi.org/10.1137/s0097539794268637","mag":"2061453155"},"language":"en","primary_location":{"id":"doi:10.1137/s0097539794268637","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539794268637","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/A5110463438","display_name":"E. G. Coffman","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"E. G. Coffman","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5003810931","display_name":"Nabil Kahal\u00e9","orcid":"https://orcid.org/0000-0002-4009-6815"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nabil Kahale","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5110453378","display_name":"Frank Thomson Leighton","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"F. T. Leighton","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3504,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.81915076,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":94},"biblio":{"volume":"27","issue":"5","first_page":"1221","last_page":"1236"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},"topics":[{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9984999895095825,"subfield":{"id":"https://openalex.org/subfields/1404","display_name":"Management Information Systems"},"field":{"id":"https://openalex.org/fields/14","display_name":"Business, Management and Accounting"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}},{"id":"https://openalex.org/T12056","display_name":"Markov Chains and Monte Carlo Methods","score":0.9983999729156494,"subfield":{"id":"https://openalex.org/subfields/2613","display_name":"Statistics and Probability"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":0.9929999709129333,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.7329423427581787},{"id":"https://openalex.org/keywords/independent-and-identically-distributed-random-variables","display_name":"Independent and identically distributed random variables","score":0.5570731163024902},{"id":"https://openalex.org/keywords/constant","display_name":"Constant (computer programming)","score":0.5032007098197937},{"id":"https://openalex.org/keywords/ring","display_name":"Ring (chemistry)","score":0.5010230541229248},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.43952837586402893},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.4148060381412506},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.4121028780937195},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.4099521040916443},{"id":"https://openalex.org/keywords/random-variable","display_name":"Random variable","score":0.3626854419708252},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.35972845554351807},{"id":"https://openalex.org/keywords/combinatorics","display_name":"Combinatorics","score":0.35178738832473755},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.2049371898174286},{"id":"https://openalex.org/keywords/statistics","display_name":"Statistics","score":0.1024937629699707}],"concepts":[{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.7329423427581787},{"id":"https://openalex.org/C141513077","wikidata":"https://www.wikidata.org/wiki/Q378542","display_name":"Independent and identically distributed random variables","level":3,"score":0.5570731163024902},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.5032007098197937},{"id":"https://openalex.org/C2780378348","wikidata":"https://www.wikidata.org/wiki/Q25351438","display_name":"Ring (chemistry)","level":2,"score":0.5010230541229248},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.43952837586402893},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.4148060381412506},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.4121028780937195},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4099521040916443},{"id":"https://openalex.org/C122123141","wikidata":"https://www.wikidata.org/wiki/Q176623","display_name":"Random variable","level":2,"score":0.3626854419708252},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.35972845554351807},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.35178738832473755},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.2049371898174286},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.1024937629699707},{"id":"https://openalex.org/C178790620","wikidata":"https://www.wikidata.org/wiki/Q11351","display_name":"Organic chemistry","level":1,"score":0.0},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.0},{"id":"https://openalex.org/C185592680","wikidata":"https://www.wikidata.org/wiki/Q2329","display_name":"Chemistry","level":0,"score":0.0},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1137/s0097539794268637","is_oa":false,"landing_page_url":"https://doi.org/10.1137/s0097539794268637","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"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":8,"referenced_works":["https://openalex.org/W1985036679","https://openalex.org/W1997468228","https://openalex.org/W2020797856","https://openalex.org/W2041069481","https://openalex.org/W2056099894","https://openalex.org/W2068127830","https://openalex.org/W2068871408","https://openalex.org/W2105976144"],"related_works":["https://openalex.org/W2347733609","https://openalex.org/W2066502241","https://openalex.org/W2605475288","https://openalex.org/W2292976891","https://openalex.org/W4240383795","https://openalex.org/W4245457074","https://openalex.org/W2128683635","https://openalex.org/W2008809748","https://openalex.org/W2140857733","https://openalex.org/W2951620698"],"abstract_inverted_index":{"We":[0],"consider":[1],"N":[2],"processors":[3],"communicating":[4],"unidirectionally":[5],"over":[6,57],"a":[7,18,72,76,86,174,186,202],"closed":[8],"transmission":[9],"channel,":[10],"or":[11],"ring.":[12],"Each":[13],"message":[14,105,175],"is":[15,65,90,125,156,183,200],"assembled":[16],"into":[17],"fixed-length":[19],"packet.":[20],"Packets":[21,46],"to":[22,66,177],"be":[23,98,178],"sent":[24],"are":[25,43],"generated":[26],"at":[27,107,158],"random":[28,117],"times":[29,36,70],"by":[30,38,185],"the":[31,34,41,53,82,108,120,135,140,153,171,181,192,197],"processors,":[32,109],"and":[33,110,112,144],"transit":[35,121],"spent":[37],"packets":[39,50],"on":[40,52,126,180],"ring":[42,131,182],"also":[44],"random.":[45],"being":[47],"forwarded,":[48],"i.e.,":[49],"already":[51],"ring,":[54],"have":[55,139],"priority":[56],"waiting":[58,69,194],"packets.":[59],"The":[60],"objective":[61],"of":[62,85,205],"this":[63],"paper":[64],"analyze":[67],"packet":[68],"under":[71,196,207],"greedy":[73,198],"policy":[74,199],"within":[75,201],"discrete":[77],"Markov":[78],"model":[79,104,119],"that":[80,94,191,206],"retains":[81],"overall":[83],"structure":[84],"practical":[87],"system":[88],"but":[89],"simple":[91],"enough":[92],"so":[93],"explicit":[95],"results":[96],"can":[97],"proved.":[99],"Independent,":[100],"identical":[101],"Bernoulli":[102],"processes":[103],"generation":[106],"independently":[111],"identically":[113],"distributed":[114],"(i.i.d.)":[115],"geometric":[116],"variables":[118],"times.":[122],"Our":[123,147],"emphasis":[124],"asymptotic":[127],"behavior":[128],"for":[129],"large":[130],"sizes,":[132],"N,":[133],"when":[134],"respective":[136],"rate":[137],"parameters":[138],"scaling":[141],"$\\lambda":[142],"/N$":[143],"$\\mu":[145],"/N$.":[146],"main":[148],"result":[149,189],"shows":[150],"that,":[151],"if":[152],"traffic":[154],"intensity":[155],"fixed":[157],"$\\rho":[159],"=":[160],"\\lambda":[161],"/":[162],"\\mu":[163],"<":[164],"1$,":[165],"then":[166],"as":[167],"$N":[168],"\\to":[169],"\\infty$":[170],"expected":[172,193],"time":[173,195],"waits":[176],"put":[179],"bounded":[184],"constant.":[187],"This":[188],"verifies":[190],"constant":[203],"factor":[204],"an":[208],"optimal":[209],"policy.":[210]},"counts_by_year":[{"year":2023,"cited_by_count":1},{"year":2014,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}