Presentation 2001/11/9
Analysis of Probabilistic Routing Algorithm in Computer Network
Kensuke FUKUDA, Satoshi KURIHARA, Toshio HIROTSU, Osamu AKASHI, Shin-ya SATO, Toshiharu SUGAWARA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) We analyze efficiency of probabilistic routing algorithms in computer network. From the simulation, we found that the routing algorithm based on the number of transfered packet achieves better performance than both the random algorithms and the cooperative algorithm based on the mean queue length in the neighbor routers.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) computer network / routing algorithm / phase transition
Paper # AI2001-51
Date of Issue

Conference Information
Committee AI
Conference Date 2001/11/9(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 Artificial Intelligence and Knowledge-Based Processing (AI)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Analysis of Probabilistic Routing Algorithm in Computer Network
Sub Title (in English)
Keyword(1) computer network
Keyword(2) routing algorithm
Keyword(3) phase transition
1st Author's Name Kensuke FUKUDA
1st Author's Affiliation NTT Network Innovation Laboratories()
2nd Author's Name Satoshi KURIHARA
2nd Author's Affiliation NTT Network Innovation Laboratories
3rd Author's Name Toshio HIROTSU
3rd Author's Affiliation NTT Network Innovation Laboratories
4th Author's Name Osamu AKASHI
4th Author's Affiliation NTT Network Innovation Laboratories
5th Author's Name Shin-ya SATO
5th Author's Affiliation NTT Network Innovation Laboratories
6th Author's Name Toshiharu SUGAWARA
6th Author's Affiliation NTT Network Innovation Laboratories
Date 2001/11/9
Paper # AI2001-51
Volume (vol) vol.101
Number (no) 420
Page pp.pp.-
#Pages 8
Date of Issue