{"title":"在一类可靠的网络上","authors":"A. Amin","doi":"10.1109/PCCC.1992.200587","DOIUrl":null,"url":null,"abstract":"A communication network N in which links are subject to failures is typically modeled by a probabilistic graph G in which each edge exists independently with a fixed probability p, 0<p<1. The pair-connected reliability of G is the expected number of connected pairs of vertices in G. The network N when link are overloaded and hence unavailable may be modeled by G with p approximately 0, while N subject to only link failures may be modeled by G with p approximately 1. Therefore, of interest are graphs which maximize the expected number of connected pairs of vertices for both p approximately 0 and p approximately 1. However, it is known that such graphs do not exist. Therefore, the author considers graphs which maximize the expected number of connected pairs of vertices for p approximately 0, among all graphs with specified edge connectivity and hence desired reliability for p approximately 1.<<ETX>>","PeriodicalId":250212,"journal":{"name":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","volume":"20 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1992-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"On a class of reliable networks\",\"authors\":\"A. Amin\",\"doi\":\"10.1109/PCCC.1992.200587\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"A communication network N in which links are subject to failures is typically modeled by a probabilistic graph G in which each edge exists independently with a fixed probability p, 0<p<1. The pair-connected reliability of G is the expected number of connected pairs of vertices in G. The network N when link are overloaded and hence unavailable may be modeled by G with p approximately 0, while N subject to only link failures may be modeled by G with p approximately 1. Therefore, of interest are graphs which maximize the expected number of connected pairs of vertices for both p approximately 0 and p approximately 1. However, it is known that such graphs do not exist. Therefore, the author considers graphs which maximize the expected number of connected pairs of vertices for p approximately 0, among all graphs with specified edge connectivity and hence desired reliability for p approximately 1.<<ETX>>\",\"PeriodicalId\":250212,\"journal\":{\"name\":\"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]\",\"volume\":\"20 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1992-04-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/PCCC.1992.200587\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PCCC.1992.200587","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A communication network N in which links are subject to failures is typically modeled by a probabilistic graph G in which each edge exists independently with a fixed probability p, 0>
![Eleventh Annual International Phoenix Conference on Computers and Communication [1992 Conference Proceedings]](/Content/css/sci/img/zetp.jpg)
求助内容：
应助结果提醒方式：
京公网安备 11010802042870号
