{"id":"https://openalex.org/W2060936159","doi":"https://doi.org/10.1109/isit.2005.1523399","title":"Calculating blocking probabilities for loss networks based on probabilistic graphical models","display_name":"Calculating blocking probabilities for loss networks based on probabilistic graphical models","publication_year":2005,"publication_date":"2005-01-01","ids":{"openalex":"https://openalex.org/W2060936159","doi":"https://doi.org/10.1109/isit.2005.1523399","mag":"2060936159"},"language":"en","primary_location":{"id":"doi:10.1109/isit.2005.1523399","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523399","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","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/A5110275221","display_name":"Jian Ni","orcid":"https://orcid.org/0009-0008-4981-1994"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":true,"raw_author_name":"Jian Ni","raw_affiliation_strings":["Department of Electrical Engineering, Yale University, New Heaven, CT, USA","Dept. of Electr. Eng., Yale Univ., New Haven, CT#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Yale University, New Heaven, CT, USA","institution_ids":["https://openalex.org/I32971472"]},{"raw_affiliation_string":"Dept. of Electr. Eng., Yale Univ., New Haven, CT#TAB#","institution_ids":["https://openalex.org/I32971472"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5072765803","display_name":"Sekhar Tatikonda","orcid":"https://orcid.org/0000-0002-8956-6208"},"institutions":[{"id":"https://openalex.org/I32971472","display_name":"Yale University","ror":"https://ror.org/03v76x132","country_code":"US","type":"education","lineage":["https://openalex.org/I32971472"]}],"countries":["US"],"is_corresponding":false,"raw_author_name":"S. Tatikonda","raw_affiliation_strings":["Department of Electrical Engineering, Yale University, New Heaven, CT, USA","Dept. of Electr. Eng., Yale Univ., New Haven, CT#TAB#"],"affiliations":[{"raw_affiliation_string":"Department of Electrical Engineering, Yale University, New Heaven, CT, USA","institution_ids":["https://openalex.org/I32971472"]},{"raw_affiliation_string":"Dept. of Electr. Eng., Yale Univ., New Haven, CT#TAB#","institution_ids":["https://openalex.org/I32971472"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5110275221"],"corresponding_institution_ids":["https://openalex.org/I32971472"],"apc_list":null,"apc_paid":null,"fwci":0.4207,"has_fulltext":false,"cited_by_count":2,"citation_normalized_percentile":{"value":0.60914806,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":90,"max":94},"biblio":{"volume":null,"issue":null,"first_page":"568","last_page":"572"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11476","display_name":"Graph theory and applications","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"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/T11476","display_name":"Graph theory and applications","score":0.9951000213623047,"subfield":{"id":"https://openalex.org/subfields/2608","display_name":"Geometry and Topology"},"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/T10974","display_name":"Advanced Queuing Theory Analysis","score":0.9919000267982483,"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/T10575","display_name":"Wireless Communication Networks Research","score":0.95169997215271,"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/blocking","display_name":"Blocking (statistics)","score":0.7849699258804321},{"id":"https://openalex.org/keywords/probabilistic-logic","display_name":"Probabilistic logic","score":0.7608740329742432},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7399918437004089},{"id":"https://openalex.org/keywords/graphical-model","display_name":"Graphical model","score":0.7087815999984741},{"id":"https://openalex.org/keywords/network-topology","display_name":"Network topology","score":0.5054938793182373},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.49372825026512146},{"id":"https://openalex.org/keywords/variety","display_name":"Variety (cybernetics)","score":0.49045559763908386},{"id":"https://openalex.org/keywords/task","display_name":"Task (project management)","score":0.46688809990882874},{"id":"https://openalex.org/keywords/distributed-computing","display_name":"Distributed computing","score":0.37095680832862854},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.34820303320884705},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.17599207162857056},{"id":"https://openalex.org/keywords/machine-learning","display_name":"Machine learning","score":0.15115222334861755},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.14798370003700256},{"id":"https://openalex.org/keywords/computer-network","display_name":"Computer network","score":0.12591350078582764}],"concepts":[{"id":"https://openalex.org/C144745244","wikidata":"https://www.wikidata.org/wiki/Q4927286","display_name":"Blocking (statistics)","level":2,"score":0.7849699258804321},{"id":"https://openalex.org/C49937458","wikidata":"https://www.wikidata.org/wiki/Q2599292","display_name":"Probabilistic logic","level":2,"score":0.7608740329742432},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7399918437004089},{"id":"https://openalex.org/C155846161","wikidata":"https://www.wikidata.org/wiki/Q1143367","display_name":"Graphical model","level":2,"score":0.7087815999984741},{"id":"https://openalex.org/C199845137","wikidata":"https://www.wikidata.org/wiki/Q145490","display_name":"Network topology","level":2,"score":0.5054938793182373},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.49372825026512146},{"id":"https://openalex.org/C136197465","wikidata":"https://www.wikidata.org/wiki/Q1729295","display_name":"Variety (cybernetics)","level":2,"score":0.49045559763908386},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.46688809990882874},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.37095680832862854},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.34820303320884705},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.17599207162857056},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.15115222334861755},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.14798370003700256},{"id":"https://openalex.org/C31258907","wikidata":"https://www.wikidata.org/wiki/Q1301371","display_name":"Computer network","level":1,"score":0.12591350078582764},{"id":"https://openalex.org/C2524010","wikidata":"https://www.wikidata.org/wiki/Q8087","display_name":"Geometry","level":1,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1109/isit.2005.1523399","is_oa":false,"landing_page_url":"https://doi.org/10.1109/isit.2005.1523399","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings. International Symposium on Information Theory, 2005. ISIT 2005.","raw_type":"proceedings-article"},{"id":"pmh:oai:CiteSeerX.psu:10.1.1.333.8238","is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.333.8238","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.ifp.illinois.edu/~jianni/publication/isit05-loss networks.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[{"display_name":"Decent work and economic growth","id":"https://metadata.un.org/sdg/8","score":0.49000000953674316}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":14,"referenced_works":["https://openalex.org/W1512866443","https://openalex.org/W2025553036","https://openalex.org/W2048074087","https://openalex.org/W2054426547","https://openalex.org/W2076609386","https://openalex.org/W2104130711","https://openalex.org/W2132443901","https://openalex.org/W2134693785","https://openalex.org/W2137813581","https://openalex.org/W2159079944","https://openalex.org/W2807232057","https://openalex.org/W4232461091","https://openalex.org/W4388323202","https://openalex.org/W6752562311"],"related_works":["https://openalex.org/W2392835431","https://openalex.org/W2126932387","https://openalex.org/W1965371215","https://openalex.org/W2032233321","https://openalex.org/W2353762239","https://openalex.org/W3121970507","https://openalex.org/W2185938410","https://openalex.org/W2110028391","https://openalex.org/W54497855","https://openalex.org/W4286900141"],"abstract_inverted_index":{"Loss":[0],"networks":[1,27,122],"are":[2],"a":[3,10,37,45,124,141],"class":[4],"of":[5,18,28,69,90,126],"resource-sharing":[6],"models":[7,52],"which":[8],"provide":[9],"powerful":[11],"tool":[12],"to":[13,53,60,64,76,81],"the":[14,32,66,78,83,87,101,112,130],"analysis":[15],"and":[16,21,86,109,119,136],"design":[17],"many":[19],"communications":[20],"networking":[22],"systems.":[23],"For":[24],"most":[25],"loss":[26,71,121],"practical":[29],"interest":[30],"calculating":[31],"exact":[33],"blocking":[34,88,107],"probabilities":[35,89,108],"is":[36],"difficult":[38],"task.":[39,56],"In":[40,128],"this":[41,55],"paper":[42],"we":[43,58,98],"present":[44],"new":[46],"framework":[47],"based":[48],"on":[49],"probabilistic":[50],"graphical":[51],"tackle":[54],"Specifically,":[57],"propose":[59,75],"use":[61,77],"factor":[62],"graphs":[63],"model":[65],"stationary":[67],"distribution":[68],"product-form":[70],"networks.":[72],"We":[73],"also":[74],"sum-product":[79,102,131],"algorithm":[80,103,132],"compute":[82],"marginal":[84],"distributions":[85],"all":[91],"call":[92],"classes.":[93],"Through":[94],"extensive":[95],"numerical":[96],"experiments":[97],"show":[99],"that":[100],"returns":[104],"very":[105,134],"accurate":[106],"greatly":[110],"outperforms":[111],"reduced":[113],"load":[114],"approximation":[115],"for":[116],"both":[117],"single-service":[118],"multiservice":[120],"with":[123],"variety":[125],"topologies.":[127],"addition,":[129],"converges":[133],"fast":[135],"can":[137],"be":[138],"implemented":[139],"in":[140],"distributed":[142],"way":[143]},"counts_by_year":[{"year":2018,"cited_by_count":1}],"updated_date":"2026-04-05T17:49:38.594831","created_date":"2025-10-10T00:00:00"}