Presentation 2004/1/19
Network Structure Optimal for the Shortest Path Routing of Packets (Neurocomputing)
Chiaki YAMAGUCHI, Tsuyoshi HORIGUCHI,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) Network structure is responsible for efficient communication through the network. In order to investigate the network structure for optimal communication, we introduce a cost function for the efficiency of packet communication in a routing control model for packet flow and optimize the cost function by reconnecting links in the network. We apply this method to a simple routing control model for the packet flow which packets move only to their nearest nodes toward their destination. It turns out that the obtained network has a different structure from Erdos and Renyi's random graph or the real Internet.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) Network / Neural Network / Packet Flow / Statistical Physics / Graph Theory
Paper # NC2003-108
Date of Issue

Conference Information
Committee NC
Conference Date 2004/1/19(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 Neurocomputing (NC)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Network Structure Optimal for the Shortest Path Routing of Packets (Neurocomputing)
Sub Title (in English)
Keyword(1) Network
Keyword(2) Neural Network
Keyword(3) Packet Flow
Keyword(4) Statistical Physics
Keyword(5) Graph Theory
1st Author's Name Chiaki YAMAGUCHI
1st Author's Affiliation Graduate School of Information Sciences, Tohoku University()
2nd Author's Name Tsuyoshi HORIGUCHI
2nd Author's Affiliation Graduate School of Information Sciences, Tohoku University
Date 2004/1/19
Paper # NC2003-108
Volume (vol) vol.103
Number (no) 601
Page pp.pp.-
#Pages 6
Date of Issue