故障超立方体中的最佳广播

[1991] Digest of Papers. Fault-Tolerant Computing: The Twenty-First International Symposium Pub Date : 1991-06-25 DOI:10.1109/FTCS.1991.146672

Bogdan S. Chlebus, K. Diks, A. Pelc

{"title":"故障超立方体中的最佳广播","authors":"Bogdan S. Chlebus, K. Diks, A. Pelc","doi":"10.1109/FTCS.1991.146672","DOIUrl":null,"url":null,"abstract":"The problem of broadcasting information in an n-node hypercube in which links fail independently with fixed probability 0<p<1 is considered. Information originally held by one node has to be disseminated throughout the network. Messages can be transmitted along links, and in a unit of time every node can transmit to at most one neighbor. Transmissions via faulty links do not succeed. A broadcasting algorithm that disseminates information throughout the whole network in time a log n with probability exceeding 1-bn/sup -c/ with positive constants a, b, c depending on p, provided that p<or=9%, is developed. The algorithm works in expected time O(log n) using an expected number of transmissions O(n), and the probability of disseminating information throughout the network converges to 1 as n grows.<<ETX>>","PeriodicalId":300397,"journal":{"name":"[1991] Digest of Papers. Fault-Tolerant Computing: The Twenty-First International Symposium","volume":"10 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1991-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"39","resultStr":"{\"title\":\"Optimal broadcasting in faulty hypercubes\",\"authors\":\"Bogdan S. Chlebus, K. Diks, A. Pelc\",\"doi\":\"10.1109/FTCS.1991.146672\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of broadcasting information in an n-node hypercube in which links fail independently with fixed probability 0<p<1 is considered. Information originally held by one node has to be disseminated throughout the network. Messages can be transmitted along links, and in a unit of time every node can transmit to at most one neighbor. Transmissions via faulty links do not succeed. A broadcasting algorithm that disseminates information throughout the whole network in time a log n with probability exceeding 1-bn/sup -c/ with positive constants a, b, c depending on p, provided that p<or=9%, is developed. The algorithm works in expected time O(log n) using an expected number of transmissions O(n), and the probability of disseminating information throughout the network converges to 1 as n grows.<<ETX>>\",\"PeriodicalId\":300397,\"journal\":{\"name\":\"[1991] Digest of Papers. Fault-Tolerant Computing: The Twenty-First International Symposium\",\"volume\":\"10 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1991-06-25\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"39\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"[1991] Digest of Papers. Fault-Tolerant Computing: The Twenty-First International Symposium\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/FTCS.1991.146672\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"[1991] Digest of Papers. Fault-Tolerant Computing: The Twenty-First International Symposium","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/FTCS.1991.146672","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}