{"id":"https://openalex.org/W2000887551","doi":"https://doi.org/10.1109/iccnc.2012.6167536","title":"Solving Many to many multicast QoS routing problem using DCA and proximal decomposition technique","display_name":"Solving Many to many multicast QoS routing problem using DCA and proximal decomposition technique","publication_year":2012,"publication_date":"2012-01-01","ids":{"openalex":"https://openalex.org/W2000887551","doi":"https://doi.org/10.1109/iccnc.2012.6167536","mag":"2000887551"},"language":"en","primary_location":{"id":"doi:10.1109/iccnc.2012.6167536","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccnc.2012.6167536","pdf_url":null,"source":{"id":"https://openalex.org/S4306497804","display_name":"2012 International Conference on Computing, Networking and Communications (ICNC)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 International Conference on Computing, Networking and Communications (ICNC)","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/A5067594887","display_name":"Anh Son Ta","orcid":"https://orcid.org/0000-0001-6009-9741"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ta Anh Son","raw_affiliation_strings":["CRP Henri Tudor, Luxembourg, Luxembourg","CRP Henri Tudor, Luxembourg city, Luxembourg"],"affiliations":[{"raw_affiliation_string":"CRP Henri Tudor, Luxembourg, Luxembourg","institution_ids":[]},{"raw_affiliation_string":"CRP Henri Tudor, Luxembourg city, Luxembourg","institution_ids":[]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5110051598","display_name":"Pham Dinh Tao","orcid":null},"institutions":[{"id":"https://openalex.org/I196454796","display_name":"Institut National des Sciences Appliqu\u00e9es de Toulouse","ror":"https://ror.org/01h8pf755","country_code":"FR","type":"education","lineage":["https://openalex.org/I196454796","https://openalex.org/I4405258862"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Pham Dinh Tao","raw_affiliation_strings":["Laboratory of Theoretical and Applied Computer Science (LITA), Paul Verlaine, Metz University, France","Laboratory of Modelling, Optimization & Operations Research, National Institute for Applied Sciences - Rouen, France"],"affiliations":[{"raw_affiliation_string":"Laboratory of Theoretical and Applied Computer Science (LITA), Paul Verlaine, Metz University, France","institution_ids":[]},{"raw_affiliation_string":"Laboratory of Modelling, Optimization & Operations Research, National Institute for Applied Sciences - Rouen, France","institution_ids":["https://openalex.org/I196454796"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5042936176","display_name":"Hoai An Le Thi","orcid":"https://orcid.org/0000-0002-2239-2100"},"institutions":[{"id":"https://openalex.org/I196454796","display_name":"Institut National des Sciences Appliqu\u00e9es de Toulouse","ror":"https://ror.org/01h8pf755","country_code":"FR","type":"education","lineage":["https://openalex.org/I196454796","https://openalex.org/I4405258862"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"Le Thi Hoai An","raw_affiliation_strings":["Laboratory of Modelling, Optimization & Operations Research, National Institute for Applied Sciences-Rouen, France","Laboratory of Theoretical and Applied Computer Science (LITA), Paul Verlaine - Metz University, France"],"affiliations":[{"raw_affiliation_string":"Laboratory of Modelling, Optimization & Operations Research, National Institute for Applied Sciences-Rouen, France","institution_ids":["https://openalex.org/I196454796"]},{"raw_affiliation_string":"Laboratory of Theoretical and Applied Computer Science (LITA), Paul Verlaine - Metz University, France","institution_ids":[]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5106715487","display_name":"Djamel Khadraoui","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Djamel Khadraoui","raw_affiliation_strings":["CRP Henri Tudor, Luxembourg, Luxembourg","CRP Henri Tudor, Luxembourg city, Luxembourg"],"affiliations":[{"raw_affiliation_string":"CRP Henri Tudor, Luxembourg, Luxembourg","institution_ids":[]},{"raw_affiliation_string":"CRP Henri Tudor, Luxembourg city, Luxembourg","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":4,"corresponding_author_ids":["https://openalex.org/A5067594887"],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":1.3966,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.85,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"809","last_page":"814"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"field":{"id":"https://openalex.org/fields/26","display_name":"Mathematics"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T10963","display_name":"Advanced Optimization Algorithms Research","score":0.9991000294685364,"subfield":{"id":"https://openalex.org/subfields/2612","display_name":"Numerical Analysis"},"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/T10500","display_name":"Sparse and Compressive Sensing Techniques","score":0.9933000206947327,"subfield":{"id":"https://openalex.org/subfields/2206","display_name":"Computational Mechanics"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12288","display_name":"Optimization and Search Problems","score":0.9876999855041504,"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/multicast","display_name":"Multicast","score":0.9442341327667236},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7795972228050232},{"id":"https://openalex.org/keywords/xcast","display_name":"Xcast","score":0.7397322654724121},{"id":"https://openalex.org/keywords/protocol-independent-multicast","display_name":"Protocol Independent Multicast","score":0.7137206792831421},{"id":"https://openalex.org/keywords/source-specific-multicast","display_name":"Source-specific multicast","score":0.6716821193695068},{"id":"https://openalex.org/keywords/distance-vector-multicast-routing-protocol","display_name":"Distance Vector Multicast Routing Protocol","score":0.6617467403411865},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5989168882369995},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.5967562794685364},{"id":"https://openalex.org/keywords/pragmatic-general-multicast","display_name":"Pragmatic General Multicast","score":0.5548574924468994},{"id":"https://openalex.org/keywords/routing","display_name":"Routing (electronic design automation)","score":0.45876210927963257},{"id":"https://openalex.org/keywords/inter-domain","display_name":"Inter-domain","score":0.44118601083755493},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.4394736588001251}],"concepts":[{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.9442341327667236},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7795972228050232},{"id":"https://openalex.org/C192059732","wikidata":"https://www.wikidata.org/wiki/Q3823050","display_name":"Xcast","level":3,"score":0.7397322654724121},{"id":"https://openalex.org/C44892269","wikidata":"https://www.wikidata.org/wiki/Q782752","display_name":"Protocol Independent Multicast","level":3,"score":0.7137206792831421},{"id":"https://openalex.org/C18787934","wikidata":"https://www.wikidata.org/wiki/Q7565105","display_name":"Source-specific multicast","level":3,"score":0.6716821193695068},{"id":"https://openalex.org/C42272142","wikidata":"https://www.wikidata.org/wiki/Q1229379","display_name":"Distance Vector Multicast Routing Protocol","level":4,"score":0.6617467403411865},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5989168882369995},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.5967562794685364},{"id":"https://openalex.org/C112037812","wikidata":"https://www.wikidata.org/wiki/Q2107523","display_name":"Pragmatic General Multicast","level":4,"score":0.5548574924468994},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.45876210927963257},{"id":"https://openalex.org/C5111613","wikidata":"https://www.wikidata.org/wiki/Q3799443","display_name":"Inter-domain","level":4,"score":0.44118601083755493},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.4394736588001251}],"mesh":[],"locations_count":3,"locations":[{"id":"doi:10.1109/iccnc.2012.6167536","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iccnc.2012.6167536","pdf_url":null,"source":{"id":"https://openalex.org/S4306497804","display_name":"2012 International Conference on Computing, Networking and Communications (ICNC)","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":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2012 International Conference on Computing, Networking and Communications (ICNC)","raw_type":"proceedings-article"},{"id":"pmh:oai:HAL:hal-03214398v1","is_oa":false,"landing_page_url":"https://hal.univ-lorraine.fr/hal-03214398","pdf_url":null,"source":{"id":"https://openalex.org/S4306402512","display_name":"HAL (Le Centre pour la Communication Scientifique Directe)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I1294671590","host_organization_name":"Centre National de la Recherche Scientifique","host_organization_lineage":["https://openalex.org/I1294671590"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"2012 International Conference on Computing, Networking and Communications (ICNC)","raw_type":"info:eu-repo/semantics/conferenceObject"},{"id":"pmh:oai:oskar-bordeaux.fr:20.500.12278/34772","is_oa":false,"landing_page_url":"https://oskar-bordeaux.fr/handle/20.500.12278/34772","pdf_url":null,"source":{"id":"https://openalex.org/S4306402569","display_name":"Oskar-Bordeaux (Universite de Bordeaux)","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":"","raw_type":"Communication dans un congr\u00e8s avec actes"}],"best_oa_location":null,"sustainable_development_goals":[{"score":0.4099999964237213,"display_name":"Industry, innovation and infrastructure","id":"https://metadata.un.org/sdg/9"}],"awards":[],"funders":[{"id":"https://openalex.org/F4320321038","display_name":"Fonds National de la Recherche Luxembourg","ror":"https://ror.org/039z13y21"}],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":18,"referenced_works":["https://openalex.org/W1990494141","https://openalex.org/W2000881147","https://openalex.org/W2030731960","https://openalex.org/W2042492403","https://openalex.org/W2042532613","https://openalex.org/W2050227660","https://openalex.org/W2051664786","https://openalex.org/W2065119040","https://openalex.org/W2076500050","https://openalex.org/W2077371116","https://openalex.org/W2099546838","https://openalex.org/W2125401948","https://openalex.org/W2197355425","https://openalex.org/W2340859457","https://openalex.org/W3145128584","https://openalex.org/W4249667877","https://openalex.org/W6675122051","https://openalex.org/W6687469098"],"related_works":["https://openalex.org/W80466176","https://openalex.org/W2371847117","https://openalex.org/W2393131931","https://openalex.org/W1850815052","https://openalex.org/W2136818972","https://openalex.org/W4321384965","https://openalex.org/W2347553438","https://openalex.org/W2044503969","https://openalex.org/W3142539034","https://openalex.org/W2088771697"],"abstract_inverted_index":{"MULTICAST":[0],"gives":[1],"an":[2,65],"efficient":[3],"way":[4],"to":[5,11,38,74,88,144,152,173,185],"transfer":[6],"data":[7],"from":[8,34,85],"a":[9,16,30,35,98,102,146],"source":[10,36],"all":[12,110],"the":[13,43,53,93,160,167,187,194],"member":[14],"of":[15,22,32,52,67,105,133,163,189,196],"multicast":[17,40,154],"group.":[18],"The":[19],"Multicast":[20,68,76],"Quality":[21],"Service":[23],"(QoS)":[24],"routing":[25,70,78,84,156],"problem":[26,47,71,81],"consists":[27],"in":[28,56,171],"finding":[29],"set":[31],"paths":[33],"node":[37,90],"its":[39],"group":[41],"satisfying":[42,92],"QoS":[44,69,77,94,155],"requirements.":[45],"This":[46],"is":[48,97],"known":[49],"as":[50,116],"one":[51],"key":[54],"problems":[55],"network":[57],"optimization":[58],"field.":[59],"In":[60],"this":[61,141],"paper,":[62],"we":[63,165],"consider":[64],"extension":[66],"called":[72],"Many":[73,151],"many":[75,153],"problems,":[79],"which":[80],"deals":[82],"with":[83,101],"multi-source":[86],"nodes":[87],"multi-destination":[89],"sets":[91],"constraints.":[95],"It":[96],"nonconvex":[99],"program":[100],"huge":[103],"number":[104,162],"constraints":[106],"problem.":[107],"They":[108],"are":[109,183],"NP-complete.":[111],"We":[112],"first":[113],"formulate":[114],"it":[115],"Concave":[117],"Quadratic":[118],"Program":[119,125],"(CQP)":[120],"and":[121,127,137,193],"Binary":[122],"Integer":[123],"Linear":[124],"(BILP)":[126],"then":[128],"based":[129],"on":[130],"DC":[131],"(Difference":[132],"Convex":[134],"functions)":[135],"programming":[136],"DCA":[138,172,192],"(DC":[139],"Algorithms),":[140],"paper":[142],"aims":[143],"investigate":[145],"new":[147],"algorithm":[148],"for":[149],"solving":[150],"problems.":[157],"To":[158],"handle":[159],"large":[161],"constraints,":[164],"introduce":[166],"proximal":[168],"decomposition":[169],"technique":[170],"tackle":[174],"convex":[175],"subprograms":[176],"at":[177],"each":[178],"iteration.":[179],"Preliminary":[180],"numerical":[181],"simulations":[182],"reported":[184],"show":[186],"efficiency":[188],"our":[190],"customized":[191],"quality":[195],"computed":[197],"solutions.":[198]},"counts_by_year":[{"year":2026,"cited_by_count":1},{"year":2018,"cited_by_count":1},{"year":2017,"cited_by_count":1},{"year":2016,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2026-03-20T23:20:44.827607","created_date":"2025-10-10T00:00:00"}