{"id":"https://openalex.org/W2493933457","doi":"https://doi.org/10.1109/infocom.2016.7524595","title":"An antithetic coupling approach to multi-chain based CSMA scheduling algorithms","display_name":"An antithetic coupling approach to multi-chain based CSMA scheduling algorithms","publication_year":2016,"publication_date":"2016-04-01","ids":{"openalex":"https://openalex.org/W2493933457","doi":"https://doi.org/10.1109/infocom.2016.7524595","mag":"2493933457"},"language":"en","primary_location":{"id":"doi:10.1109/infocom.2016.7524595","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2016.7524595","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","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/A5013219764","display_name":"Jaewook Kwak","orcid":"https://orcid.org/0000-0003-1890-2910"},"institutions":[{"id":"https://openalex.org/I137902535","display_name":"North Carolina State University","ror":"https://ror.org/04tj63d06","country_code":"US","type":"education","lineage":["https://openalex.org/I137902535"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jaewook Kwak","raw_affiliation_strings":["Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC","institution_ids":["https://openalex.org/I137902535"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5050655327","display_name":"Do Young Eun","orcid":"https://orcid.org/0000-0002-1743-7482"},"institutions":[{"id":"https://openalex.org/I137902535","display_name":"North Carolina State University","ror":"https://ror.org/04tj63d06","country_code":"US","type":"education","lineage":["https://openalex.org/I137902535"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Do Young Eun","raw_affiliation_strings":["Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC"],"affiliations":[{"raw_affiliation_string":"Department of Electrical and Computer Engineering, North Carolina State University, Raleigh, NC","institution_ids":["https://openalex.org/I137902535"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5013219764"],"corresponding_institution_ids":["https://openalex.org/I137902535"],"apc_list":null,"apc_paid":null,"fwci":1.4083,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.84855928,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"28","issue":null,"first_page":"1","last_page":"9"},"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/T13553","display_name":"Age of Information Optimization","score":0.9962999820709229,"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/T10575","display_name":"Wireless Communication Networks Research","score":0.9962000250816345,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.8243492841720581},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.5558155179023743},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.5230284929275513},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.505031406879425},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5020191669464111},{"id":"https://openalex.org/keywords/markov-chain","display_name":"Markov chain","score":0.4816416800022125},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.44334715604782104},{"id":"https://openalex.org/keywords/throughput","display_name":"Throughput","score":0.4102970361709595},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.32301318645477295},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.26918917894363403},{"id":"https://openalex.org/keywords/wireless","display_name":"Wireless","score":0.1871928870677948},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.14993801712989807}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8243492841720581},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.5558155179023743},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.5230284929275513},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.505031406879425},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5020191669464111},{"id":"https://openalex.org/C98763669","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov chain","level":2,"score":0.4816416800022125},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.44334715604782104},{"id":"https://openalex.org/C157764524","wikidata":"https://www.wikidata.org/wiki/Q1383412","display_name":"Throughput","level":3,"score":0.4102970361709595},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.32301318645477295},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.26918917894363403},{"id":"https://openalex.org/C555944384","wikidata":"https://www.wikidata.org/wiki/Q249","display_name":"Wireless","level":2,"score":0.1871928870677948},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.14993801712989807},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.0},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/infocom.2016.7524595","is_oa":false,"landing_page_url":"https://doi.org/10.1109/infocom.2016.7524595","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"IEEE INFOCOM 2016 - The 35th Annual IEEE International Conference on Computer Communications","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":44,"referenced_works":["https://openalex.org/W105261775","https://openalex.org/W194118407","https://openalex.org/W1515461433","https://openalex.org/W1576140702","https://openalex.org/W1600293573","https://openalex.org/W1966695467","https://openalex.org/W1978512533","https://openalex.org/W1978654098","https://openalex.org/W1991247510","https://openalex.org/W2000911694","https://openalex.org/W2014208555","https://openalex.org/W2036954142","https://openalex.org/W2046185491","https://openalex.org/W2047087115","https://openalex.org/W2047109664","https://openalex.org/W2048971218","https://openalex.org/W2052547976","https://openalex.org/W2057190861","https://openalex.org/W2065193595","https://openalex.org/W2075397054","https://openalex.org/W2085962141","https://openalex.org/W2097058227","https://openalex.org/W2099797040","https://openalex.org/W2104045250","https://openalex.org/W2105177639","https://openalex.org/W2114202040","https://openalex.org/W2120024772","https://openalex.org/W2120078542","https://openalex.org/W2125141803","https://openalex.org/W2129337887","https://openalex.org/W2130956934","https://openalex.org/W2132432056","https://openalex.org/W2171677813","https://openalex.org/W2471517265","https://openalex.org/W2487202993","https://openalex.org/W2493933457","https://openalex.org/W2513007422","https://openalex.org/W2964165982","https://openalex.org/W4241426049","https://openalex.org/W4245558686","https://openalex.org/W4256363058","https://openalex.org/W4285719527","https://openalex.org/W4388328639","https://openalex.org/W6607882565"],"related_works":["https://openalex.org/W2136583354","https://openalex.org/W2111238207","https://openalex.org/W1660242800","https://openalex.org/W2760721665","https://openalex.org/W2077211377","https://openalex.org/W2107954672","https://openalex.org/W330130819","https://openalex.org/W1006270037","https://openalex.org/W2163664144","https://openalex.org/W1597107533"],"abstract_inverted_index":{"In":[0,67],"recent":[1],"years,":[2],"a":[3,44,52,72,124,154,195,216,239],"suite":[4],"of":[5,54,61,88,98,107,112,119,130,146,174,198,241],"Glauber":[6],"dynamics-based":[7],"CSMA":[8,55],"algorithms":[9,25,56,190],"have":[10],"attracted":[11],"great":[12],"attention":[13],"due":[14],"to":[15,39,137,160,178],"their":[16],"simple,":[17],"distributed":[18,218],"implementations":[19],"with":[20],"guaranteed":[21],"throughput-optimality.":[22],"However,":[23],"these":[24],"often":[26],"suffer":[27],"from":[28],"poor":[29],"delay":[30,42,86],"performance":[31,87,237],"and":[32,157,186,211],"the":[33,41,62,85,109,117,147,171,179,192],"starvation":[34],"problem.":[35],"Among":[36],"several":[37],"attempts":[38],"improve":[40,84],"performance,":[43],"remarkable":[45],"improvement":[46],"has":[47],"recently":[48],"been":[49],"made":[50],"in":[51,103,122,191,215],"class":[53],"that":[57,90,115,126,231],"utilize":[58],"multiple":[59,93,128],"instances":[60,129],"algorithm":[63,184,202],"(or":[64],"Markov":[65],"chains).":[66],"this":[68],"paper,":[69],"we":[70],"develop":[71],"new":[73],"approach":[74],"via":[75],"an":[76,167],"antithetic":[77],"coupling":[78],"(AC)":[79],"method,":[80],"which":[81],"can":[82,212],"further":[83],"those":[89,127],"virtually":[91],"emulate":[92],"chains.":[94],"The":[95,200],"key":[96],"enabler":[97],"utilizing":[99],"AC":[100],"method":[101],"lies":[102],"our":[104,182],"skilful":[105],"choice":[106],"manipulating":[108],"driving":[110],"sequences":[111],"random":[113],"variables":[114],"govern":[116],"evolution":[118],"schedule":[120],"instances,":[121],"such":[123],"way":[125],"chains":[131],"become":[132],"negatively":[133],"correlated":[134],"as":[135],"oppose":[136],"having":[138],"them":[139],"run":[140],"independently.":[141],"This":[142],"contributes":[143],"faster":[144],"change":[145],"link":[148],"state,":[149],"rendering":[150],"it":[151],"more":[152],"like":[153],"periodic":[155],"process":[156,177],"thus":[158],"leading":[159],"better":[161,235],"queueing":[162,236],"performance.":[163],"We":[164],"rigorously":[165],"establish":[166],"ordering":[168],"relationship":[169],"for":[170],"effective":[172],"bandwidth":[173],"each":[175],"net-input":[176],"queue,":[180],"between":[181],"proposed":[183,201],"(AC-CSMA)":[185],"other":[187],"state-of-the-art":[188],"existing":[189,208],"literature,":[193],"under":[194],"mild":[196],"set":[197],"assumptions.":[199],"involves":[203],"very":[204],"simple":[205],"modification":[206],"onto":[207],"CSMA-based":[209],"algorithms,":[210],"be":[213],"implemented":[214],"fully":[217],"manner":[219],"without":[220],"any":[221],"additional":[222],"message":[223],"overhead.":[224],"Our":[225],"extensive":[226],"simulation":[227],"results":[228],"also":[229],"confirm":[230],"AC-CSMA":[232],"always":[233],"delivers":[234],"over":[238],"variety":[240],"network":[242],"scenarios.":[243]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2016,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}