{"id":"https://openalex.org/W1965366935","doi":"https://doi.org/10.1109/icumt.2010.5676509","title":"Recursive computation for a multi-rate model with elastic traffic and minimum rate guarantees","display_name":"Recursive computation for a multi-rate model with elastic traffic and minimum rate guarantees","publication_year":2010,"publication_date":"2010-10-01","ids":{"openalex":"https://openalex.org/W1965366935","doi":"https://doi.org/10.1109/icumt.2010.5676509","mag":"1965366935"},"language":"en","primary_location":{"id":"doi:10.1109/icumt.2010.5676509","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icumt.2010.5676509","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Congress on Ultra Modern Telecommunications and Control Systems","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/A5090121708","display_name":"Konstantin Samouylov","orcid":"https://orcid.org/0000-0002-6368-9680"},"institutions":[{"id":"https://openalex.org/I126527374","display_name":"Peoples' Friendship University of Russia","ror":"https://ror.org/02dn9h927","country_code":"RU","type":"education","lineage":["https://openalex.org/I126527374"]}],"countries":["RU"],"is_corresponding":true,"raw_author_name":"Konstantin E. Samouylov","raw_affiliation_strings":["Telecommunication Systems Department, Peoples Friendship University of Russia, Moscow, Russia","Telecommunication Systems Department, Peoples\u2019 Friendship University of Russia, Moscow, Russia"],"affiliations":[{"raw_affiliation_string":"Telecommunication Systems Department, Peoples Friendship University of Russia, Moscow, Russia","institution_ids":["https://openalex.org/I126527374"]},{"raw_affiliation_string":"Telecommunication Systems Department, Peoples\u2019 Friendship University of Russia, Moscow, Russia","institution_ids":["https://openalex.org/I126527374"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5108674623","display_name":"Irina Gudkova","orcid":null},"institutions":[{"id":"https://openalex.org/I126527374","display_name":"Peoples' Friendship University of Russia","ror":"https://ror.org/02dn9h927","country_code":"RU","type":"education","lineage":["https://openalex.org/I126527374"]}],"countries":["RU"],"is_corresponding":false,"raw_author_name":"Irina A. Gudkova","raw_affiliation_strings":["Telecommunication Systems Department, Peoples Friendship University of Russia, Moscow, Russia","Telecommunication Systems Department, Peoples\u2019 Friendship University of Russia, Moscow, Russia"],"affiliations":[{"raw_affiliation_string":"Telecommunication Systems Department, Peoples Friendship University of Russia, Moscow, Russia","institution_ids":["https://openalex.org/I126527374"]},{"raw_affiliation_string":"Telecommunication Systems Department, Peoples\u2019 Friendship University of Russia, Moscow, Russia","institution_ids":["https://openalex.org/I126527374"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5090121708"],"corresponding_institution_ids":["https://openalex.org/I126527374"],"apc_list":null,"apc_paid":null,"fwci":1.0311,"has_fulltext":false,"cited_by_count":8,"citation_normalized_percentile":{"value":0.80221732,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":null,"issue":null,"first_page":"1065","last_page":"1072"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9998999834060669,"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.9998999834060669,"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/T10138","display_name":"Network Traffic and Congestion Control","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"}},{"id":"https://openalex.org/T11125","display_name":"Petri Nets in System Modeling","score":0.9958000183105469,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/unicast","display_name":"Unicast","score":0.7929647564888},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7345854043960571},{"id":"https://openalex.org/keywords/processor-sharing","display_name":"Processor sharing","score":0.6978906989097595},{"id":"https://openalex.org/keywords/computation","display_name":"Computation","score":0.6348044276237488},{"id":"https://openalex.org/keywords/transmission","display_name":"Transmission (telecommunications)","score":0.5235716700553894},{"id":"https://openalex.org/keywords/state-space","display_name":"State space","score":0.4880308210849762},{"id":"https://openalex.org/keywords/transfer","display_name":"Transfer (computing)","score":0.47803956270217896},{"id":"https://openalex.org/keywords/blocking","display_name":"Blocking (statistics)","score":0.46576952934265137},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.4536657929420471},{"id":"https://openalex.org/keywords/state","display_name":"State (computer science)","score":0.4444804787635803},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.34204596281051636},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.28160083293914795},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.24988994002342224},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.230075865983963},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.22965633869171143},{"id":"https://openalex.org/keywords/multicast","display_name":"Multicast","score":0.12788164615631104},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.08319169282913208}],"concepts":[{"id":"https://openalex.org/C11704745","wikidata":"https://www.wikidata.org/wiki/Q918337","display_name":"Unicast","level":3,"score":0.7929647564888},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7345854043960571},{"id":"https://openalex.org/C2779084733","wikidata":"https://www.wikidata.org/wiki/Q17097343","display_name":"Processor sharing","level":3,"score":0.6978906989097595},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.6348044276237488},{"id":"https://openalex.org/C761482","wikidata":"https://www.wikidata.org/wiki/Q118093","display_name":"Transmission (telecommunications)","level":2,"score":0.5235716700553894},{"id":"https://openalex.org/C72434380","wikidata":"https://www.wikidata.org/wiki/Q230930","display_name":"State space","level":2,"score":0.4880308210849762},{"id":"https://openalex.org/C2776175482","wikidata":"https://www.wikidata.org/wiki/Q1195816","display_name":"Transfer (computing)","level":2,"score":0.47803956270217896},{"id":"https://openalex.org/C144745244","wikidata":"https://www.wikidata.org/wiki/Q4927286","display_name":"Blocking (statistics)","level":2,"score":0.46576952934265137},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.4536657929420471},{"id":"https://openalex.org/C48103436","wikidata":"https://www.wikidata.org/wiki/Q599031","display_name":"State (computer science)","level":2,"score":0.4444804787635803},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34204596281051636},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.28160083293914795},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.24988994002342224},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.230075865983963},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.22965633869171143},{"id":"https://openalex.org/C32295351","wikidata":"https://www.wikidata.org/wiki/Q899288","display_name":"Multicast","level":2,"score":0.12788164615631104},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.08319169282913208},{"id":"https://openalex.org/C76155785","wikidata":"https://www.wikidata.org/wiki/Q418","display_name":"Telecommunications","level":1,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icumt.2010.5676509","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icumt.2010.5676509","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"International Congress on Ultra Modern Telecommunications and Control Systems","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":6,"referenced_works":["https://openalex.org/W1533609295","https://openalex.org/W1976211375","https://openalex.org/W2026802566","https://openalex.org/W2093631014","https://openalex.org/W2109109839","https://openalex.org/W2158650824"],"related_works":["https://openalex.org/W2508558984","https://openalex.org/W4288633135","https://openalex.org/W3008817519","https://openalex.org/W2952300997","https://openalex.org/W2794998165","https://openalex.org/W2910872135","https://openalex.org/W2378130666","https://openalex.org/W2615656263","https://openalex.org/W1675048170","https://openalex.org/W2052662459"],"abstract_inverted_index":{"The":[0],"main":[1,135],"objective":[2],"of":[3,73,79,92,111],"the":[4,15,28,71,90,93,106,112,124,134],"present":[5],"paper":[6],"is":[7,89],"to":[8,13,43,83,132],"develop":[9],"an":[10,48],"effective":[11],"algorithm":[12],"calculate":[14,133],"performance":[16,137],"measures":[17],"for":[18,70,97,123],"best-effort":[19],"traffic":[20],"transmitting":[21],"over":[22],"a":[23,32,85,98,130],"multi-service":[24],"network.":[25],"We":[26,65,128],"define":[27,109],"single":[29],"link":[30,45],"as":[31],"multi-rate":[33,99],"loss":[34],"model":[35,136],"with":[36,101],"elastic":[37,75],"traffic.":[38,104],"Elastic":[39],"flows":[40,76],"are":[41,63,121],"assumed":[42],"share":[44],"capacity":[46],"in":[47],"egalitarian":[49],"processor":[50],"sharing":[51],"(EPS)":[52],"manner.":[53],"To":[54],"ensure":[55],"flows'":[56],"minimum":[57,60],"transmission":[58],"rate":[59,61,81],"guarantees":[62,82],"introduced.":[64],"apply":[66],"state":[67,113],"space":[68,114],"partitioning":[69],"number":[72],"ongoing":[74],"and":[77,116,143],"maximum":[78],"their":[80],"obtain":[84],"recursive":[86,125],"formula,":[87],"which":[88,120],"analogue":[91],"well-known":[94],"Kaufman-Roberts":[95],"formula":[96,126],"system":[100],"streaming":[102],"unicast":[103],"In":[105],"paper,":[107],"we":[108],"properties":[110],"subsets":[115],"corresponding":[117],"unnormalized":[118],"probabilities,":[119],"used":[122],"derivation.":[127],"propose":[129],"method":[131],"measures,":[138],"i.":[139],"e.":[140],"blocking":[141],"probabilities":[142],"mean":[144],"transfer":[145],"time.":[146]},"counts_by_year":[{"year":2020,"cited_by_count":1},{"year":2019,"cited_by_count":1},{"year":2016,"cited_by_count":3},{"year":2015,"cited_by_count":1},{"year":2013,"cited_by_count":1}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}