| Presentation | 2004-10-15 A Flooding Method for Routing Information Exchange in Power-Law Networks Nobutaka MAKINO, Shin'ichi ARAKAWA, Masayuki MURATA, |
|---|---|
| PDF Download Page |  PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | In the Internet, a flooding method is used to exchange routing information. For example, in OSPF (Open Shortest Path First) protocol, each node distributes messages that include link state information to its neighbor nodes, when the link status changes. Each of the negihbor node that recieves the link state information again distributes the information to the corresponding neighbor nodes. BGP (Border Gateway Protocol) also uses flooding mechanism to exchange routing infomation: each node establishes TCP connection to each neighbor node and then transfers the routing table. In either protocol, as the number of nodes increases, the amount of traffic for the routing information becomes large. Furthermore, if a node fails, the flooding starts from all of the neighbor nodes, which causes a sudden traffic congestion in the network. In this paper, we propose an efficient flooding method to reduce the traffic in power-law networks. Our method uses probabilistic flooding where each node relays routing information with a certain probability. Routing information is also exchanged periodically to prevent the information mismatch between nodes. The simulation results show that, compared to the traditional flooding approaches, our method reduces the amount of the traffic by 50 %. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | flooding / routing / scale-free / power-law / percolation theory |
| Paper # | IN2004-91 |
| Date of Issue |
| Conference Information | |
| Committee | IN |
|---|---|
| Conference Date | 2004/10/8(1days) |
| Place (in Japanese) | (See Japanese page) |
| Place (in English) | |
| Topics (in Japanese) | (See Japanese page) |
| Topics (in English) | |
| Chair | |
| Vice Chair | |
| Secretary | |
| Assistant | |
| Paper Information | |
| Registration To | Information Networks (IN) |
|---|---|
| Language | JPN |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | A Flooding Method for Routing Information Exchange in Power-Law Networks |
| Sub Title (in English) | |
| Keyword(1) | flooding |
| Keyword(2) | routing |
| Keyword(3) | scale-free |
| Keyword(4) | power-law |
| Keyword(5) | percolation theory |
| 1st Author's Name | Nobutaka MAKINO |
| 1st Author's Affiliation | Graduate School of Information Science and Technology, Osaka University() |
| 2nd Author's Name | Shin'ichi ARAKAWA |
| 2nd Author's Affiliation | Graduate School of Economics, Osaka University |
| 3rd Author's Name | Masayuki MURATA |
| 3rd Author's Affiliation | Graduate School of Information Science and Technology, Osaka University |
| Date | 2004-10-15 |
| Paper # | IN2004-91 |
| Volume (vol) | vol.104 |
| Number (no) | 340 |
| Page | pp.pp.- |
| #Pages | 6 |
| Date of Issue | |