{"id":"https://openalex.org/W4415367682","doi":"https://doi.org/10.1109/isit63088.2025.11195643","title":"On the Capacity of Undirected Multiple Unicast Layered Networks with Asymmetric Demands","display_name":"On the Capacity of Undirected Multiple Unicast Layered Networks with Asymmetric Demands","publication_year":2025,"publication_date":"2025-06-22","ids":{"openalex":"https://openalex.org/W4415367682","doi":"https://doi.org/10.1109/isit63088.2025.11195643"},"language":null,"primary_location":{"id":"doi:10.1109/isit63088.2025.11195643","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195643","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"},"type":"conference-paper","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/A5120072409","display_name":"M Surya Vamsi","orcid":null},"institutions":[{"id":"https://openalex.org/I9579091","display_name":"Indian Institute of Technology Mandi","ror":"https://ror.org/05r9r2f34","country_code":"IN","type":"education","lineage":["https://openalex.org/I9579091"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"M Surya Vamsi","raw_affiliation_strings":["School of Computing and Electrical Engineering, Indian Institute of Technology Mandi,Himachal Pradesh,India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing and Electrical Engineering, Indian Institute of Technology Mandi,Himachal Pradesh,India","institution_ids":["https://openalex.org/I9579091"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5052643871","display_name":"Satyajit Thakor","orcid":"https://orcid.org/0000-0001-9527-0975"},"institutions":[{"id":"https://openalex.org/I9579091","display_name":"Indian Institute of Technology Mandi","ror":"https://ror.org/05r9r2f34","country_code":"IN","type":"education","lineage":["https://openalex.org/I9579091"]}],"countries":["IN"],"is_corresponding":false,"raw_author_name":"Satyajit Thakor","raw_affiliation_strings":["School of Computing and Electrical Engineering, Indian Institute of Technology Mandi,Himachal Pradesh,India"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing and Electrical Engineering, Indian Institute of Technology Mandi,Himachal Pradesh,India","institution_ids":["https://openalex.org/I9579091"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I9579091"],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.35911151,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1","last_page":"6"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","score":0.9912999868392944,"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/T10138","display_name":"Network Traffic and Congestion Control","score":0.9912999868392944,"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.9912999868392944,"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/unicast","display_name":"Unicast","score":0.7502999901771545},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.6850000023841858},{"id":"https://openalex.org/keywords/linear-network-coding","display_name":"Linear network coding","score":0.6796000003814697},{"id":"https://openalex.org/keywords/counterexample","display_name":"Counterexample","score":0.6323000192642212},{"id":"https://openalex.org/keywords/bipartite-graph","display_name":"Bipartite graph","score":0.5206999778747559},{"id":"https://openalex.org/keywords/conjecture","display_name":"Conjecture","score":0.4632999897003174},{"id":"https://openalex.org/keywords/partition","display_name":"Partition (number theory)","score":0.44769999384880066},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.4318000078201294}],"concepts":[{"id":"https://openalex.org/C11704745","wikidata":"https://www.wikidata.org/wiki/Q918337","display_name":"Unicast","level":3,"score":0.7502999901771545},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.6850000023841858},{"id":"https://openalex.org/C138293262","wikidata":"https://www.wikidata.org/wiki/Q1089578","display_name":"Linear network coding","level":3,"score":0.6796000003814697},{"id":"https://openalex.org/C162838799","wikidata":"https://www.wikidata.org/wiki/Q596077","display_name":"Counterexample","level":2,"score":0.6323000192642212},{"id":"https://openalex.org/C197657726","wikidata":"https://www.wikidata.org/wiki/Q174733","display_name":"Bipartite graph","level":3,"score":0.5206999778747559},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.4758000075817108},{"id":"https://openalex.org/C2780990831","wikidata":"https://www.wikidata.org/wiki/Q319141","display_name":"Conjecture","level":2,"score":0.4632999897003174},{"id":"https://openalex.org/C42812","wikidata":"https://www.wikidata.org/wiki/Q1082910","display_name":"Partition (number theory)","level":2,"score":0.44769999384880066},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.4318000078201294},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.42899999022483826},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.4212000072002411},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.3605000078678131},{"id":"https://openalex.org/C184720557","wikidata":"https://www.wikidata.org/wiki/Q7825049","display_name":"Topology (electrical circuits)","level":2,"score":0.352400004863739},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.3465999960899353},{"id":"https://openalex.org/C179518139","wikidata":"https://www.wikidata.org/wiki/Q5140297","display_name":"Coding (social sciences)","level":2,"score":0.3440999984741211},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.3158999979496002},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.2978000044822693},{"id":"https://openalex.org/C3018234147","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Undirected graph","level":3,"score":0.29010000824928284},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.28600001335144043},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.2793000042438507},{"id":"https://openalex.org/C112680207","wikidata":"https://www.wikidata.org/wiki/Q714886","display_name":"Regular polygon","level":2,"score":0.26980000734329224},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.26179999113082886},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.2517000138759613}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/isit63088.2025.11195643","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit63088.2025.11195643","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2025 IEEE International Symposium on Information Theory (ISIT)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4602694415","display_name":null,"funder_award_id":"DST/INT/RUS/RSF/P-41/2020","funder_id":"https://openalex.org/F4320325376","funder_display_name":"Department of Science and Technology, Government of West Bengal"},{"id":"https://openalex.org/G6546609331","display_name":null,"funder_award_id":"CRG/2020/003331","funder_id":"https://openalex.org/F4320334771","funder_display_name":"Science and Engineering Research Board"}],"funders":[{"id":"https://openalex.org/F4320325376","display_name":"Department of Science and Technology, Government of West Bengal","ror":"https://ror.org/0101xrq71"},{"id":"https://openalex.org/F4320334771","display_name":"Science and Engineering Research Board","ror":"https://ror.org/03ffdsr55"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":19,"referenced_works":["https://openalex.org/W1978601678","https://openalex.org/W2017713020","https://openalex.org/W2062185918","https://openalex.org/W2095127695","https://openalex.org/W2105831729","https://openalex.org/W2106403318","https://openalex.org/W2121205191","https://openalex.org/W2137690813","https://openalex.org/W2150148016","https://openalex.org/W2154501376","https://openalex.org/W2164808802","https://openalex.org/W2170789099","https://openalex.org/W2767454305","https://openalex.org/W3081547918","https://openalex.org/W4213060883","https://openalex.org/W4214681728","https://openalex.org/W4226271765","https://openalex.org/W4244424643","https://openalex.org/W4401692534"],"related_works":[],"abstract_inverted_index":{"The":[0],"undirected":[1,21],"multiple":[2,22],"unicast":[3,23],"network":[4,9,38],"coding":[5,10],"conjecture":[6,28],"states":[7],"that":[8,96,141],"is":[11,29,90,94,105,119,138,145],"equivalent":[12],"to":[13,121],"routing":[14,67,109,163],"in":[15,20],"terms":[16],"of":[17,35,80,117,135],"rate":[18],"benefit":[19],"networks.":[24],"So":[25],"far,":[26],"the":[27,42,63,66,101,142,156,159],"confirmed":[30],"only":[31],"for":[32,44,73,86,97,127],"a":[33,45,49,77,108,114,123,133,148,152],"handful":[34],"networks":[36,89],"and":[37,48,61,69,92,165],"classes.":[39],"Motivated":[40],"by":[41,107,147,161],"quest":[43],"possible":[46],"counterexample":[47],"tighter":[50],"information-theoretic":[51],"upper":[52,71,103,167],"bound,":[53],"this":[54],"paper":[55],"focuses":[56],"on":[57],"asymmetric":[58,81],"demand":[59,136],"vectors":[60,137],"examines":[62],"gap":[64],"between":[65,158],"rates":[68,160],"known":[70,166],"bounds":[72,168],"information":[74],"flow.":[75],"Specifically,":[76],"particular":[78],"case":[79],"demands":[82,85],"called":[83,113],"partition-symmetric":[84],"Type-I":[87,98,130],"layered":[88],"introduced,":[91],"it":[93],"shown":[95],"bipartite":[99],"networks,":[100,132],"partition":[102,143],"bound":[104,144],"achievable":[106,146],"solution.":[110],"A":[111],"scheme":[112],"parallel":[115,149],"combination":[116],"solutions":[118,126,164],"introduced":[120],"obtain":[122],"solution":[124],"from":[125],"sub-networks.":[128],"For":[129],"3-layer":[131],"set":[134],"characterized":[139],"such":[140],"combination.":[150],"With":[151],"linear":[153],"programming":[154],"formulation,":[155],"gaps":[157],"proposed":[162],"are":[169],"analyzed.":[170]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-21T00:00:00"}