{"id":"https://openalex.org/W2156747588","doi":"https://doi.org/10.1109/icccn.2007.4317996","title":"Analysis of Discrete Time Queueing Networks under Buffer Threshold Scheme","display_name":"Analysis of Discrete Time Queueing Networks under Buffer Threshold Scheme","publication_year":2007,"publication_date":"2007-08-01","ids":{"openalex":"https://openalex.org/W2156747588","doi":"https://doi.org/10.1109/icccn.2007.4317996","mag":"2156747588"},"language":"en","primary_location":{"id":"doi:10.1109/icccn.2007.4317996","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2007.4317996","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 16th International Conference on Computer Communications and Networks","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/A5062402324","display_name":"Irfan Awan","orcid":"https://orcid.org/0000-0002-3180-1025"},"institutions":[{"id":"https://openalex.org/I139894009","display_name":"University of Bradford","ror":"https://ror.org/00vs8d940","country_code":"GB","type":"education","lineage":["https://openalex.org/I139894009"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Irfan Awan","raw_affiliation_strings":["Department of Computing, University of Bradford, Bradford, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing, University of Bradford, Bradford, UK","institution_ids":["https://openalex.org/I139894009"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5074231405","display_name":"Lin Guan","orcid":"https://orcid.org/0000-0003-4781-7168"},"institutions":[{"id":"https://openalex.org/I143804889","display_name":"Loughborough University","ror":"https://ror.org/04vg4w365","country_code":"GB","type":"education","lineage":["https://openalex.org/I143804889"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Lin Guan","raw_affiliation_strings":["Department of Computing Science, Loughborough University RSI, Loughborough, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"Department of Computing Science, Loughborough University RSI, Loughborough, UK","institution_ids":["https://openalex.org/I143804889"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5076823785","display_name":"Xingang Wang","orcid":"https://orcid.org/0000-0002-8665-7024"},"institutions":[{"id":"https://openalex.org/I897542642","display_name":"University of Plymouth","ror":"https://ror.org/008n7pv89","country_code":"GB","type":"education","lineage":["https://openalex.org/I897542642"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Xingang Wang","raw_affiliation_strings":["School of Computing, Communication and Electronics, University of Plymouth, Plymouth, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"School of Computing, Communication and Electronics, University of Plymouth, Plymouth, UK","institution_ids":["https://openalex.org/I897542642"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.451,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":{"value":0.65903214,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"1273","last_page":"1278"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9993000030517578,"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.9993000030517578,"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.9988999962806702,"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.9840999841690063,"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/queueing-theory","display_name":"Queueing theory","score":0.7351435422897339},{"id":"https://openalex.org/keywords/queue","display_name":"Queue","score":0.6036247611045837},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.5559982061386108},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.4342972934246063},{"id":"https://openalex.org/keywords/discrete-mathematics","display_name":"Discrete mathematics","score":0.4114542603492737},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.31799811124801636},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.2943902611732483}],"concepts":[{"id":"https://openalex.org/C22684755","wikidata":"https://www.wikidata.org/wiki/Q847526","display_name":"Queueing theory","level":2,"score":0.7351435422897339},{"id":"https://openalex.org/C160403385","wikidata":"https://www.wikidata.org/wiki/Q220543","display_name":"Queue","level":2,"score":0.6036247611045837},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5559982061386108},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4342972934246063},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.4114542603492737},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.31799811124801636},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2943902611732483}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1109/icccn.2007.4317996","is_oa":false,"landing_page_url":"https://doi.org/10.1109/icccn.2007.4317996","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2007 16th International Conference on Computer Communications and Networks","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":28,"referenced_works":["https://openalex.org/W38391305","https://openalex.org/W119107052","https://openalex.org/W1531336019","https://openalex.org/W1532277235","https://openalex.org/W1886164657","https://openalex.org/W2005210959","https://openalex.org/W2027230364","https://openalex.org/W2032558547","https://openalex.org/W2051393033","https://openalex.org/W2053491613","https://openalex.org/W2076851459","https://openalex.org/W2092791094","https://openalex.org/W2094055697","https://openalex.org/W2108158190","https://openalex.org/W2109574448","https://openalex.org/W2129348840","https://openalex.org/W2142579743","https://openalex.org/W2145942024","https://openalex.org/W2158733823","https://openalex.org/W2296187085","https://openalex.org/W3015969044","https://openalex.org/W4252028749","https://openalex.org/W4285719527","https://openalex.org/W6601560527","https://openalex.org/W6604806456","https://openalex.org/W6631782332","https://openalex.org/W6657282143","https://openalex.org/W7005582718"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2051487156","https://openalex.org/W2073681303","https://openalex.org/W2053286651","https://openalex.org/W2181743346","https://openalex.org/W2187401768","https://openalex.org/W2181413294","https://openalex.org/W2989452537","https://openalex.org/W2052122378","https://openalex.org/W2544423928"],"abstract_inverted_index":{"This":[0],"paper":[1],"presents":[2],"a":[3,22,32,86],"framework":[4],"for":[5,90],"the":[6,47,65,68,76,101,109,121,129,149,152],"performance":[7],"analysis":[8,18],"of":[9,62,67,82,112,128,151],"queueing":[10],"networks":[11],"under":[12,55],"active":[13],"queue":[14,28,35,83],"management":[15],"scheme.":[16],"The":[17,80,95,115,126],"is":[19,29,85,98,118],"based":[20],"on":[21],"queue-by-queue":[23],"decomposition":[24],"technique":[25,89],"where":[26],"each":[27],"modelled":[30,99],"as":[31],"GGeo/GGeo/1/{N1,":[33],"N2}":[34],"with":[36],"single":[37,69],"server,":[38],"R":[39],"(R":[40],"=":[41],"2)":[42],"distinct":[43],"traffic":[44,63,72,92,97],"classes,":[45],"N1as":[46],"buffer":[48,53],"threshold":[49,77],"and":[50,74,132],"N2as":[51],"full":[52],"capacity":[54],"first-come-first-serve":[56],"(FCFS)":[57],"service":[58],"rule.":[59],"Two":[60],"classes":[61],"represent":[64],"arrival":[66],"class":[70],"Internet":[71],"before":[73],"after":[75],"N1,":[78],"respectively.":[79],"use":[81],"thresholds":[84],"well":[87],"known":[88],"network":[91,113],"congestion":[93],"control.":[94],"external":[96],"using":[100,120],"Generalised":[102],"Geometric":[103],"(GGeo)":[104],"distribution":[105],"which":[106],"can":[107],"capture":[108],"bursty":[110],"property":[111],"traffic.":[114],"analytical":[116,154],"solution":[117],"obtained":[119],"Maximum":[122],"Entropy":[123],"(ME)":[124],"principle.":[125],"forms":[127],"state":[130],"probabilities":[131,134],"blocking":[133],"are":[135],"analytically":[136],"established":[137],"at":[138],"equilibrium":[139],"via":[140],"appropriate":[141],"mean":[142],"value":[143],"constraints.":[144],"Initial":[145],"numerical":[146],"results":[147],"demonstrate":[148],"credibility":[150],"proposed":[153],"solution.":[155]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2025-10-10T00:00:00"}