{"id":"https://openalex.org/W2937881148","doi":"https://doi.org/10.1109/ciss.2019.8692817","title":"Tail-Limited Phase-Type Burstiness Bounds for Network Traffic","display_name":"Tail-Limited Phase-Type Burstiness Bounds for Network Traffic","publication_year":2019,"publication_date":"2019-03-01","ids":{"openalex":"https://openalex.org/W2937881148","doi":"https://doi.org/10.1109/ciss.2019.8692817","mag":"2937881148"},"language":"en","primary_location":{"id":"doi:10.1109/ciss.2019.8692817","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ciss.2019.8692817","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 53rd Annual Conference on Information Sciences and Systems (CISS)","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/A5010624325","display_name":"Massieh Kordi Boroujeny","orcid":"https://orcid.org/0000-0002-6169-3539"},"institutions":[{"id":"https://openalex.org/I162714631","display_name":"George Mason University","ror":"https://ror.org/02jqj7156","country_code":"US","type":"education","lineage":["https://openalex.org/I162714631"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Massieh Kordi Boroujeny","raw_affiliation_strings":["Dept. of Electrical and Computer Engineering, George Mason University, Fairfax, Virginia, U.S.A"],"affiliations":[{"raw_affiliation_string":"Dept. of Electrical and Computer Engineering, George Mason University, Fairfax, Virginia, U.S.A","institution_ids":["https://openalex.org/I162714631"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074618910","display_name":"Brian L. Mark","orcid":"https://orcid.org/0000-0002-4030-5592"},"institutions":[{"id":"https://openalex.org/I162714631","display_name":"George Mason University","ror":"https://ror.org/02jqj7156","country_code":"US","type":"education","lineage":["https://openalex.org/I162714631"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Brian L. Mark","raw_affiliation_strings":["Dept. of Electrical and Computer Engineering, George Mason University, Fairfax, Virginia, U.S.A"],"affiliations":[{"raw_affiliation_string":"Dept. of Electrical and Computer Engineering, George Mason University, Fairfax, Virginia, U.S.A","institution_ids":["https://openalex.org/I162714631"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5077675980","display_name":"Y. Ephraim","orcid":null},"institutions":[{"id":"https://openalex.org/I162714631","display_name":"George Mason University","ror":"https://ror.org/02jqj7156","country_code":"US","type":"education","lineage":["https://openalex.org/I162714631"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"Yariv Ephraim","raw_affiliation_strings":["Dept. of Electrical and Computer Engineering, George Mason University, Fairfax, Virginia, U.S.A"],"affiliations":[{"raw_affiliation_string":"Dept. of Electrical and Computer Engineering, George Mason University, Fairfax, Virginia, U.S.A","institution_ids":["https://openalex.org/I162714631"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5010624325"],"corresponding_institution_ids":["https://openalex.org/I162714631"],"apc_list":null,"apc_paid":null,"fwci":1.4845,"has_fulltext":false,"cited_by_count":5,"citation_normalized_percentile":{"value":0.84914549,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":"23","issue":null,"first_page":"1","last_page":"6"},"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.9952999949455261,"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.9728999733924866,"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/burstiness","display_name":"Burstiness","score":0.9982275366783142},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6596646904945374},{"id":"https://openalex.org/keywords/network-calculus","display_name":"Network calculus","score":0.5822166204452515},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.5740221738815308},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5353496670722961},{"id":"https://openalex.org/keywords/queueing-theory","display_name":"Queueing theory","score":0.4949735999107361},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.49378952383995056},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.46819719672203064},{"id":"https://openalex.org/keywords/type","display_name":"Type (biology)","score":0.42936980724334717},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.3453141748905182},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.28124290704727173},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.16680380702018738},{"id":"https://openalex.org/keywords/network-packet","display_name":"Network packet","score":0.11308616399765015},{"id":"https://openalex.org/keywords/quality-of-service","display_name":"Quality of service","score":0.08314183354377747}],"concepts":[{"id":"https://openalex.org/C2781023610","wikidata":"https://www.wikidata.org/wiki/Q17006304","display_name":"Burstiness","level":3,"score":0.9982275366783142},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6596646904945374},{"id":"https://openalex.org/C2778693205","wikidata":"https://www.wikidata.org/wiki/Q7000967","display_name":"Network calculus","level":3,"score":0.5822166204452515},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.5740221738815308},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5353496670722961},{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.4949735999107361},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.49378952383995056},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.46819719672203064},{"id":"https://openalex.org/C2777299769","wikidata":"https://www.wikidata.org/wiki/Q3707858","display_name":"Type (biology)","level":2,"score":0.42936980724334717},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3453141748905182},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.28124290704727173},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.16680380702018738},{"id":"https://openalex.org/C158379750","wikidata":"https://www.wikidata.org/wiki/Q214111","display_name":"Network packet","level":2,"score":0.11308616399765015},{"id":"https://openalex.org/C5119721","wikidata":"https://www.wikidata.org/wiki/Q220501","display_name":"Quality of service","level":2,"score":0.08314183354377747},{"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/C86803240","wikidata":"https://www.wikidata.org/wiki/Q420","display_name":"Biology","level":0,"score":0.0},{"id":"https://openalex.org/C18903297","wikidata":"https://www.wikidata.org/wiki/Q7150","display_name":"Ecology","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/ciss.2019.8692817","is_oa":false,"landing_page_url":"https://doi.org/10.1109/ciss.2019.8692817","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2019 53rd Annual Conference on Information Sciences and Systems (CISS)","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/11","score":0.44999998807907104,"display_name":"Sustainable cities and communities"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W1570713732","https://openalex.org/W1980746611","https://openalex.org/W1986632072","https://openalex.org/W2022940918","https://openalex.org/W2037119287","https://openalex.org/W2068689212","https://openalex.org/W2109745615","https://openalex.org/W2111764355","https://openalex.org/W2121768315","https://openalex.org/W2126986183","https://openalex.org/W2132498682","https://openalex.org/W2142917009","https://openalex.org/W2146625955","https://openalex.org/W2153919611","https://openalex.org/W2155303087","https://openalex.org/W2167395111","https://openalex.org/W2616761010","https://openalex.org/W2803506006","https://openalex.org/W4206809386","https://openalex.org/W6634057643","https://openalex.org/W6681037670"],"related_works":["https://openalex.org/W1963560109","https://openalex.org/W2132443825","https://openalex.org/W2252546159","https://openalex.org/W4297780700","https://openalex.org/W1606800778","https://openalex.org/W2106928005","https://openalex.org/W1986632072","https://openalex.org/W2089687005","https://openalex.org/W2155303087","https://openalex.org/W2983058136"],"abstract_inverted_index":{"The":[0,84],"bursty":[1],"nature":[2],"of":[3,40,51,63,73,108],"network":[4,29,96],"traffic":[5,33],"makes":[6],"it":[7],"difficult":[8],"to":[9,16,47,77],"characterize":[10],"accurately,":[11],"and":[12,43],"may":[13],"give":[14],"rise":[15],"heavy-tailed":[17,82,118],"queue":[18],"distributions":[19,42],"within":[20,91],"the":[21,38,49,55,61,64,74,78,92,106,109],"network.":[22],"Building":[23],"on":[24,37,99],"prior":[25],"work":[26],"in":[27],"stochastic":[28,95],"calculus,":[30],"we":[31],"propose":[32],"burstiness":[34,65,88],"bounds":[35,53,89],"based":[36,98],"class":[39],"phase-type":[41,75,87],"develop":[44],"an":[45],"approach":[46,68],"estimate":[48],"parameter":[50],"such":[52],"using":[54],"expectation-maximization":[56],"(EM)":[57],"algorithm.":[58],"By":[59],"limiting":[60],"tail":[62],"bound,":[66],"our":[67],"achieves":[69],"a":[70,113,117],"better":[71],"fit":[72],"distribution":[76],"empirical":[79],"data":[80],"from":[81],"traffic.":[83],"proposed":[85,110],"tail-limited":[86],"fall":[90],"framework":[93],"for":[94],"calculus":[97],"generalized":[100],"stochastically":[101],"bounded":[102],"burstiness.":[103],"We":[104],"demonstrate":[105],"effectiveness":[107],"methodology":[111],"with":[112],"numerical":[114],"example":[115],"involving":[116],"M/G/1":[119],"queue.":[120]},"counts_by_year":[{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2020,"cited_by_count":2}],"updated_date":"2025-11-06T03:46:38.306776","created_date":"2025-10-10T00:00:00"}