| Presentation | 2018-01-19 A New Approximation Method for Probability of Graph being Connected Yuta Kiuchi, Masahiro Hayashi, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | This paper proposes a new approach for approximating K-terminal reliability of Probability Graph, where K-terminal reliability is the probability of communication possibility among specified nodes on telecommunications networks. Our proposal is a combined technique of Truth Table Approximation Method and Partial Factoring Method. Truth Table Approximation Method is not so accurate but widely applicable. Partial Factoring Method is surely accurate with high speed computation but its application is very limited. Now our combined technique realizes much higher accuracy, higher speed, and wider applications. Our combined technique can output both of lower and upper bounds of K-terminal reliability. Therefore, we can estimate error caused by this technique. A numerical example is demonstrated to show our method being really useful from the views of accuracy and computational speed. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Telecommunications Networks / Probability Graph / K-terminal reliability / Truth Table Approximation Method / Partial Factoring |
| Paper # | CQ2017-100 |
| Date of Issue | 2018-01-11 (CQ) |
| Conference Information | |
| Committee | CQ |
|---|---|
| Conference Date | 2018/1/18(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | NII |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | Video/Voice Services Quality, Media Quality, Network Quality and QoS Control, Networks and Communications at Disaster, User Behavior, Machine Learning, etc. |
| Chair | Takanori Hayashi(Hiroshima Inst. of Tech.) |
| Vice Chair | Hideyuki Shimonishi(NEC) / Jun Okamoto(NTT) |
| Secretary | Hideyuki Shimonishi(NTT) / Jun Okamoto(Keio Univ.) |
| Assistant | Kenko Ota(Nippon Inst. of Tech.) / Norihiro Fukumoto(KDDI Research) / Ryo Yamamoto(UEC) |
| Paper Information | |
| Registration To | Technical Committee on Communication Quality |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | A New Approximation Method for Probability of Graph being Connected |
| Sub Title (in English) | |
| Keyword(1) | Telecommunications Networks |
| Keyword(2) | Probability Graph |
| Keyword(3) | K-terminal reliability |
| Keyword(4) | Truth Table Approximation Method |
| Keyword(5) | Partial Factoring |
| 1st Author's Name | Yuta Kiuchi |
| 1st Author's Affiliation | Tokyo City University(Tokyo City Univ.) |
| 2nd Author's Name | Masahiro Hayashi |
| 2nd Author's Affiliation | Tokyo City University(Tokyo City Univ.) |
| Date | 2018-01-19 |
| Paper # | CQ2017-100 |
| Volume (vol) | vol.117 |
| Number (no) | CQ-386 |
| Page | pp.pp.87-92(CQ), |
| #Pages | 6 |
| Date of Issue | 2018-01-11 (CQ) |