{"id":"https://openalex.org/W2143060309","doi":"https://doi.org/10.1109/isit.2009.5205274","title":"To code or not to code: Rate optimality in node-capacitated networks","display_name":"To code or not to code: Rate optimality in node-capacitated networks","publication_year":2009,"publication_date":"2009-06-01","ids":{"openalex":"https://openalex.org/W2143060309","doi":"https://doi.org/10.1109/isit.2009.5205274","mag":"2143060309"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2009.5205274","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205274","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","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/A5025859650","display_name":"Ziyu Shao","orcid":"https://orcid.org/0000-0002-8774-1391"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Ziyu Shao","raw_affiliation_strings":["Department of Information Engineering, Chinese University of Hong Kong, New Territories, Hong Kong, China","Department of Information Engineering, The Chinese University of Hong Kong, Shatin, N. T., Hong Kong#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Information Engineering, Chinese University of Hong Kong, New Territories, Hong Kong, China","institution_ids":["https://openalex.org/I177725633"]},{"raw_affiliation_string":"Department of Information Engineering, The Chinese University of Hong Kong, Shatin, N. T., Hong Kong#TAB#","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5108615688","display_name":"Sidharth Jaggi","orcid":null},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Sidharth Jaggi","raw_affiliation_strings":["Department of Information Engineering, Chinese University of Hong Kong, New Territories, Hong Kong, China","Department of Information Engineering, The Chinese University of Hong Kong, Shatin, N. T., Hong Kong#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Information Engineering, Chinese University of Hong Kong, New Territories, Hong Kong, China","institution_ids":["https://openalex.org/I177725633"]},{"raw_affiliation_string":"Department of Information Engineering, The Chinese University of Hong Kong, Shatin, N. T., Hong Kong#TAB#","institution_ids":["https://openalex.org/I177725633"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5100386630","display_name":"Shuo Li","orcid":"https://orcid.org/0000-0002-5184-3230"},"institutions":[{"id":"https://openalex.org/I177725633","display_name":"Chinese University of Hong Kong","ror":"https://ror.org/00t33hh48","country_code":"CN","type":"education","lineage":["https://openalex.org/I177725633"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Shuo-Yen Robert Li","raw_affiliation_strings":["Department of Information Engineering, Chinese University of Hong Kong, New Territories, Hong Kong, China","Department of Information Engineering, The Chinese University of Hong Kong, Shatin, N. T., Hong Kong#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Information Engineering, Chinese University of Hong Kong, New Territories, Hong Kong, China","institution_ids":["https://openalex.org/I177725633"]},{"raw_affiliation_string":"Department of Information Engineering, The Chinese University of Hong Kong, Shatin, N. T., Hong Kong#TAB#","institution_ids":["https://openalex.org/I177725633"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5025859650"],"corresponding_institution_ids":["https://openalex.org/I177725633"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.19926929,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1779","last_page":"1783"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10796","display_name":"Cooperative Communication and Network Coding","score":1.0,"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/T10796","display_name":"Cooperative Communication and Network Coding","score":1.0,"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/T10246","display_name":"Mobile Ad Hoc Networks","score":0.9965000152587891,"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/T11409","display_name":"Advanced Wireless Network Optimization","score":0.991100013256073,"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/upload","display_name":"Upload","score":0.8041094541549683},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7714663743972778},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.7378137707710266},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.6752384305000305},{"id":"https://openalex.org/keywords/node","display_name":"Node (physics)","score":0.6407873034477234},{"id":"https://openalex.org/keywords/overlay-network","display_name":"Overlay network","score":0.5860639214515686},{"id":"https://openalex.org/keywords/overlay","display_name":"Overlay","score":0.456923246383667},{"id":"https://openalex.org/keywords/geographic-routing","display_name":"Geographic routing","score":0.4559590816497803},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.4500737488269806},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4460938572883606},{"id":"https://openalex.org/keywords/coding","display_name":"Coding (social sciences)","score":0.4364365041255951},{"id":"https://openalex.org/keywords/download","display_name":"Download","score":0.4256709814071655},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.4189116358757019},{"id":"https://openalex.org/keywords/routing-protocol","display_name":"Routing protocol","score":0.34784945845603943},{"id":"https://openalex.org/keywords/dynamic-source-routing","display_name":"Dynamic Source Routing","score":0.27977681159973145},{"id":"https://openalex.org/keywords/the-internet","display_name":"The Internet","score":0.14849266409873962},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.10881814360618591},{"id":"https://openalex.org/keywords/engineering","display_name":"Engineering","score":0.07794666290283203}],"concepts":[{"id":"https://openalex.org/C71901391","wikidata":"https://www.wikidata.org/wiki/Q7126699","display_name":"Upload","level":2,"score":0.8041094541549683},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7714663743972778},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.7378137707710266},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.6752384305000305},{"id":"https://openalex.org/C62611344","wikidata":"https://www.wikidata.org/wiki/Q1062658","display_name":"Node (physics)","level":2,"score":0.6407873034477234},{"id":"https://openalex.org/C169851745","wikidata":"https://www.wikidata.org/wiki/Q1331985","display_name":"Overlay network","level":3,"score":0.5860639214515686},{"id":"https://openalex.org/C136085584","wikidata":"https://www.wikidata.org/wiki/Q910289","display_name":"Overlay","level":2,"score":0.456923246383667},{"id":"https://openalex.org/C50558702","wikidata":"https://www.wikidata.org/wiki/Q5535067","display_name":"Geographic routing","level":5,"score":0.4559590816497803},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.4500737488269806},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4460938572883606},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.4364365041255951},{"id":"https://openalex.org/C2780154274","wikidata":"https://www.wikidata.org/wiki/Q7126717","display_name":"Download","level":2,"score":0.4256709814071655},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.4189116358757019},{"id":"https://openalex.org/C104954878","wikidata":"https://www.wikidata.org/wiki/Q1648707","display_name":"Routing protocol","level":3,"score":0.34784945845603943},{"id":"https://openalex.org/C9659607","wikidata":"https://www.wikidata.org/wiki/Q1268903","display_name":"Dynamic Source Routing","level":4,"score":0.27977681159973145},{"id":"https://openalex.org/C110875604","wikidata":"https://www.wikidata.org/wiki/Q75","display_name":"The Internet","level":2,"score":0.14849266409873962},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.10881814360618591},{"id":"https://openalex.org/C127413603","wikidata":"https://www.wikidata.org/wiki/Q11023","display_name":"Engineering","level":0,"score":0.07794666290283203},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0},{"id":"https://openalex.org/C66938386","wikidata":"https://www.wikidata.org/wiki/Q633538","display_name":"Structural engineering","level":1,"score":0.0},{"id":"https://openalex.org/C136764020","wikidata":"https://www.wikidata.org/wiki/Q466","display_name":"World Wide Web","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/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.0},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.0},{"id":"https://openalex.org/C111919701","wikidata":"https://www.wikidata.org/wiki/Q9135","display_name":"Operating system","level":1,"score":0.0}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/isit.2009.5205274","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2009.5205274","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2009 IEEE International Symposium on Information Theory","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.701.5336","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.701.5336","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://personal.ie.cuhk.edu.hk/%7Esjaggi/files/5205274.pdf","raw_type":"text"},{"id":"pmh:oai:research-information.bris.ac.uk:openaire_cris_publications/825fc4f5-bf64-4dc5-8dd2-a9190f2e8541","is_oa":false,"landing_page_url":"https://research-information.bris.ac.uk/en/publications/825fc4f5-bf64-4dc5-8dd2-a9190f2e8541","pdf_url":null,"source":{"id":"https://openalex.org/S7407055359","display_name":"Explore Bristol Research","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"Shao, Z, Jaggi, S & Li, S-Y R 2009, To code or not to code: rate optimality In node-capacitated networks. in Proceedings of the 2009 IEEE international conference on Symposium on Information Theory-Volume 3. pp. 1779-1783.","raw_type":"contributionToPeriodical"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W1898800882","https://openalex.org/W1964119857","https://openalex.org/W1992965804","https://openalex.org/W2087816994","https://openalex.org/W2097029192","https://openalex.org/W2105831729","https://openalex.org/W2106403318","https://openalex.org/W2117801121","https://openalex.org/W2123562143","https://openalex.org/W2133365683","https://openalex.org/W2155638714","https://openalex.org/W2165109979","https://openalex.org/W2167341738","https://openalex.org/W3044238769","https://openalex.org/W6674451247","https://openalex.org/W6684328160"],"related_works":["https://openalex.org/W89955905","https://openalex.org/W2126533264","https://openalex.org/W2042060105","https://openalex.org/W1637847238","https://openalex.org/W2122565901","https://openalex.org/W2041341978","https://openalex.org/W2134691083","https://openalex.org/W2563260350","https://openalex.org/W2084992752","https://openalex.org/W4210965064"],"abstract_inverted_index":{"Node-capacitated":[0],"networks":[1,3,33,45],"are":[2],"in":[4],"which":[5],"the":[6,61,88],"capacity":[7],"constraint":[8],"is":[9],"put":[10],"on":[11,32,48],"every":[12],"node.":[13],"They":[14],"have":[15],"recently":[16],"attract":[17],"attention":[18],"as":[19,92],"a":[20,74],"good":[21],"model":[22],"for":[23,81],"Peer-to-Peer":[24],"(P2P)":[25],"overlay":[26],"networks.":[27],"Existing":[28],"work":[29],"gives":[30],"results":[31],"with":[34,46],"constraints":[35,47],"of":[36,64],"node":[37,50,53],"upload":[38,51],"capacities.":[39],"In":[40,69],"this":[41],"paper,":[42],"we":[43,59],"consider":[44],"both":[49],"and":[52],"download":[54],"capacity.":[55],"For":[56],"such":[57],"networks,":[58],"investigate":[60],"rate":[62,76,90],"optimality":[63],"routing":[65,86],"versus":[66],"network":[67,71,93],"coding.":[68,94],"general,":[70],"coding":[72],"achieves":[73,87],"larger":[75],"region":[77,91],"than":[78],"routing.":[79],"However,":[80],"some":[82],"important":[83],"communication":[84],"scenarios,":[85],"same":[89]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-10-10T00:00:00"}