{"id":"https://openalex.org/W2098498605","doi":"https://doi.org/10.1109/iscc.2003.1214207","title":"AMCA: an active-based multicast congestion avoidance algorithm","display_name":"AMCA: an active-based multicast congestion avoidance algorithm","publication_year":2004,"publication_date":"2004-03-30","ids":{"openalex":"https://openalex.org/W2098498605","doi":"https://doi.org/10.1109/iscc.2003.1214207","mag":"2098498605"},"language":"en","primary_location":{"id":"doi:10.1109/iscc.2003.1214207","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc.2003.1214207","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","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/A5023478889","display_name":"Moufida Maimour","orcid":"https://orcid.org/0000-0002-0057-6128"},"institutions":[{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I4210144566","display_name":"Laboratoire de l'Informatique du Parall\u00e9lisme","ror":"https://ror.org/04msnz457","country_code":"FR","type":"facility","lineage":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I203339264","https://openalex.org/I203339264","https://openalex.org/I4210144566"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"M. Maimour","raw_affiliation_strings":["RESO/LIP-ENS, Lyon, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"RESO/LIP-ENS, Lyon, France","institution_ids":["https://openalex.org/I113428412","https://openalex.org/I4210144566"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5068880132","display_name":"Congduc Pham","orcid":"https://orcid.org/0000-0002-1936-8476"},"institutions":[{"id":"https://openalex.org/I113428412","display_name":"\u00c9cole Normale Sup\u00e9rieure de Lyon","ror":"https://ror.org/04zmssz18","country_code":"FR","type":"education","lineage":["https://openalex.org/I113428412","https://openalex.org/I203339264"]},{"id":"https://openalex.org/I4210144566","display_name":"Laboratoire de l'Informatique du Parall\u00e9lisme","ror":"https://ror.org/04msnz457","country_code":"FR","type":"facility","lineage":["https://openalex.org/I100532134","https://openalex.org/I113428412","https://openalex.org/I1294671590","https://openalex.org/I1326498283","https://openalex.org/I203339264","https://openalex.org/I203339264","https://openalex.org/I4210144566"]}],"countries":["FR"],"is_corresponding":false,"raw_author_name":"C.D. Pham","raw_affiliation_strings":["RESO/LIP-ENS, Lyon, France"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"RESO/LIP-ENS, Lyon, France","institution_ids":["https://openalex.org/I113428412","https://openalex.org/I4210144566"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.8042,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.73307664,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"747","last_page":"754"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10138","display_name":"Network Traffic and Congestion Control","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/T10138","display_name":"Network Traffic and Congestion Control","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/T10714","display_name":"Software-Defined Networks and 5G","score":0.9995999932289124,"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/T11158","display_name":"Wireless Networks and Protocols","score":0.9991999864578247,"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.9602640867233276},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.7819714546203613},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7691686153411865},{"id":"https://openalex.org/keywords/xcast","display_name":"Xcast","score":0.7555087804794312},{"id":"https://openalex.org/keywords/protocol-independent-multicast","display_name":"Protocol Independent Multicast","score":0.7189504504203796},{"id":"https://openalex.org/keywords/source-specific-multicast","display_name":"Source-specific multicast","score":0.7145829200744629},{"id":"https://openalex.org/keywords/pragmatic-general-multicast","display_name":"Pragmatic General Multicast","score":0.6700820326805115},{"id":"https://openalex.org/keywords/network-congestion","display_name":"Network congestion","score":0.6184035539627075},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.5668460130691528},{"id":"https://openalex.org/keywords/distance-vector-multicast-routing-protocol","display_name":"Distance Vector Multicast Routing Protocol","score":0.5149906277656555},{"id":"https://openalex.org/keywords/bandwidth","display_name":"Bandwidth (computing)","score":0.4868316054344177},{"id":"https://openalex.org/keywords/ip-multicast","display_name":"IP multicast","score":0.48352861404418945},{"id":"https://openalex.org/keywords/reliable-multicast","display_name":"Reliable multicast","score":0.4808662533760071},{"id":"https://openalex.org/keywords/scalability","display_name":"Scalability","score":0.4721928834915161},{"id":"https://openalex.org/keywords/tree","display_name":"Tree (set theory)","score":0.4109354019165039},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.36224690079689026},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08322259783744812}],"concepts":[{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.9602640867233276},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.7819714546203613},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7691686153411865},{"id":"https://openalex.org/C192059732","wikidata":"https://www.wikidata.org/wiki/Q3823050","display_name":"Xcast","level":3,"score":0.7555087804794312},{"id":"https://openalex.org/C44892269","wikidata":"https://www.wikidata.org/wiki/Q782752","display_name":"Protocol Independent Multicast","level":3,"score":0.7189504504203796},{"id":"https://openalex.org/C18787934","wikidata":"https://www.wikidata.org/wiki/Q7565105","display_name":"Source-specific multicast","level":3,"score":0.7145829200744629},{"id":"https://openalex.org/C112037812","wikidata":"https://www.wikidata.org/wiki/Q2107523","display_name":"Pragmatic General Multicast","level":4,"score":0.6700820326805115},{"id":"https://openalex.org/C195563490","wikidata":"https://www.wikidata.org/wiki/Q180368","display_name":"Network congestion","level":3,"score":0.6184035539627075},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.5668460130691528},{"id":"https://openalex.org/C42272142","wikidata":"https://www.wikidata.org/wiki/Q1229379","display_name":"Distance Vector Multicast Routing Protocol","level":4,"score":0.5149906277656555},{"id":"https://openalex.org/C2776257435","wikidata":"https://www.wikidata.org/wiki/Q1576430","display_name":"Bandwidth (computing)","level":2,"score":0.4868316054344177},{"id":"https://openalex.org/C150329594","wikidata":"https://www.wikidata.org/wiki/Q2711392","display_name":"IP multicast","level":3,"score":0.48352861404418945},{"id":"https://openalex.org/C174174714","wikidata":"https://www.wikidata.org/wiki/Q7310997","display_name":"Reliable multicast","level":4,"score":0.4808662533760071},{"id":"https://openalex.org/C48044578","wikidata":"https://www.wikidata.org/wiki/Q727490","display_name":"Scalability","level":2,"score":0.4721928834915161},{"id":"https://openalex.org/C113174947","wikidata":"https://www.wikidata.org/wiki/Q2859736","display_name":"Tree (set theory)","level":2,"score":0.4109354019165039},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36224690079689026},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08322259783744812},{"id":"https://openalex.org/C134306372","wikidata":"https://www.wikidata.org/wiki/Q7754","display_name":"Mathematical analysis","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/C77088390","wikidata":"https://www.wikidata.org/wiki/Q8513","display_name":"Database","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/iscc.2003.1214207","is_oa":false,"landing_page_url":"https://doi.org/10.1109/iscc.2003.1214207","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the Eighth IEEE Symposium on Computers and Communications. ISCC 2003","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":27,"referenced_works":["https://openalex.org/W155955835","https://openalex.org/W1522478601","https://openalex.org/W1523453631","https://openalex.org/W1811195033","https://openalex.org/W1990920914","https://openalex.org/W2004729876","https://openalex.org/W2040853384","https://openalex.org/W2060950877","https://openalex.org/W2101182788","https://openalex.org/W2124478678","https://openalex.org/W2132142698","https://openalex.org/W2143564130","https://openalex.org/W2146032936","https://openalex.org/W2148520774","https://openalex.org/W2152178735","https://openalex.org/W2158255839","https://openalex.org/W2159105483","https://openalex.org/W2164407688","https://openalex.org/W2167444237","https://openalex.org/W2753542457","https://openalex.org/W3001942212","https://openalex.org/W4231918747","https://openalex.org/W4238143691","https://openalex.org/W4244470962","https://openalex.org/W6638273717","https://openalex.org/W6660446228","https://openalex.org/W6683322975"],"related_works":["https://openalex.org/W80466176","https://openalex.org/W3142539034","https://openalex.org/W2546879687","https://openalex.org/W4321384965","https://openalex.org/W2362357250","https://openalex.org/W2062706226","https://openalex.org/W1766239798","https://openalex.org/W2185546413","https://openalex.org/W2388612496","https://openalex.org/W2115913321"],"abstract_inverted_index":{"Many":[0],"works":[1],"have":[2],"addressed":[3],"the":[4,13,31,62,84,93,97,110,119,129],"issue":[5],"of":[6,30,128],"congestion":[7,40,51,94],"control":[8],"for":[9,43,74],"multicast":[10,50,79,98,102],"communications":[11],"and":[12,24,132],"problem":[14],"is":[15,104],"known":[16],"to":[17,56,66,72,91,107,135],"be":[18],"highly":[19],"complex.":[20],"Scalability,":[21],"responsiveness,":[22],"stability":[23],"fairness":[25],"with":[26],"TCP":[27],"are":[28],"some":[29],"required":[32],"properties.":[33,59],"In":[34],"this":[35],"paper,":[36],"we":[37],"present":[38],"a":[39,69,78],"avoidance":[41,52],"scheme":[42],"bulk":[44],"data":[45],"distribution":[46],"called":[47],"AMCA":[48,124],"(active-based":[49],"algorithm)":[53],"that":[54,123],"tries":[55],"meet":[57],"these":[58],"We":[60],"use":[61,127],"active":[63],"networking":[64],"technology":[65],"perform":[67],"on":[68],"per-section":[70],"dialogue":[71],"probe":[73],"available":[75,130],"bandwidth":[76,131],"along":[77],"tree.":[80,99],"The":[81,100],"solution":[82],"uses":[83],"RTT":[85,111],"variations":[86,112],"experienced":[87],"by":[88],"every":[89],"branch":[90],"estimate":[92],"situation":[95],"in":[96],"physical":[101],"tree":[103],"also":[105],"used":[106],"appropriately":[108],"aggregate":[109],"at":[113],"intermediate":[114],"nodes":[115],"before":[116],"they":[117],"reach":[118],"source.":[120],"Simulations":[121],"show":[122],"converges,":[125],"makes":[126],"reacts":[133],"rapidly":[134],"dynamic":[136],"changes":[137],"while":[138],"being":[139],"TCP-fair.":[140]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}