| Presentation | 2016-06-13 A study of a probabilistic routing method based on transmitting capacity. Sho Tagami, Takayuki Kimura, Kenya Jin'no, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | Recent years, the data packet flow increases on the Internet because of wide spread of mobile devices or high-speed wireless communications. The data packets are then often lost or delayed if the data packets in the communication networks are congested. It has been already reported that the communication networks have scale-free property. The networks then have the hub nodes. The shortest path protocol is not effective for routing the packets because the one transmits data packets using only the distance information of the communication network. Therefore, the packet congestion easily occurs at the hub nodes. Thus, an efficient routing method which effectively controls the data packets flow in the communication network is desired to propose to remove the packet congestion. From this view point, the effective routing method for the communication networks has been proposed. In this method, each node decides the transmitting nodes using probabilistic way based on the number of holding packets and degree of the adjacent nodes. However, this method doesn’t consider the transmission capacity. Therefore, the packets are transmitted to the nodes that have large amount of packets exceeding the transmission capacity. Thus, the packets are accumulated at the hub nodes and the packet congestion occurs at these nodes. From this view point, We proposed the probabilistic packet routing method using the transmission capacity in this report. From the results of numerical experiments, the proposed method effectively avoids the congestion as compared to theconventional method. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | Probabilistic routing strategy / Computer network / optimization |
| Paper # | NLP2016-22,CCS2016-5 |
| Date of Issue | 2016-06-06 (NLP, CCS) |
| Conference Information | |
| Committee | CCS / NLP |
|---|---|
| Conference Date | 2016/6/13(2days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | Kikai-Shinko-Kaikan Bldg. |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | Nonlinear Science, Complexity Science, etc. |
| Chair | Yasuhiro Tsubo(Ritsumeikan Univ.) / Hisato Fujisaka(Hiroshima City Univ.) |
| Vice Chair | Naoki Wakamiya(Osaka Univ.) / Mikio Hasegawa(Tokyo Univ. of Science) / Masaharu Adachi(Tokyo Denki Univ.) |
| Secretary | Naoki Wakamiya(Kyoto Sangyo Univ.) / Mikio Hasegawa(Osaka Univ.) / Masaharu Adachi(Konan Univ.) |
| Assistant | Takayuki Kimura(Nippon Inst. of Tech.) / Song-Ju Kim(NIMS) / Ryo Takahashi(Kyoto Univ.) / Hidehiro Nakano(Tokyo City Univ.) / Hiroyuki Asahara(Okayama Univ. of Science) / Toshihiro Tachibana(Shonan Inst. of Tech.) |
| Paper Information | |
| Registration To | Technical Committee on Complex Communication Sciences / Technical Committee on Nonlinear Problems |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | A study of a probabilistic routing method based on transmitting capacity. |
| Sub Title (in English) | |
| Keyword(1) | Probabilistic routing strategy |
| Keyword(2) | Computer network |
| Keyword(3) | optimization |
| 1st Author's Name | Sho Tagami |
| 1st Author's Affiliation | Nippon Institute of Technology(NIT) |
| 2nd Author's Name | Takayuki Kimura |
| 2nd Author's Affiliation | Nippon Institute of Technology(NIT) |
| 3rd Author's Name | Kenya Jin'no |
| 3rd Author's Affiliation | Nippon Institute of Technology(NIT) |
| Date | 2016-06-13 |
| Paper # | NLP2016-22,CCS2016-5 |
| Volume (vol) | vol.116 |
| Number (no) | NLP-86,CCS-87 |
| Page | pp.pp.15-20(NLP), pp.15-20(CCS), |
| #Pages | 6 |
| Date of Issue | 2016-06-06 (NLP, CCS) |