Presentation 1997/10/6
A Packet Routing Method Based on a Hogg-Huberman Strategy
Tatsushi Yamasaki, Toshimitsu Ushio,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) This paper proposes a formulation of a packet routing problem as a resource allocation problem from the viewpoint of multi-agent systems, where we consider a packet as an agent and a link as a resource. Next, we propose a packet routing method based on a control strategy proposed by Hogg and Huberman. We use a reward mechanism to get a good resource allocation policy under incomplete information about computer networks. Finally, by simulation, we present efficiency of the proposed method.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) packet network / computaional ecology / distributed control / routing
Paper # NLP97-85-98
Date of Issue

Conference Information
Committee NLP
Conference Date 1997/10/6(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 Nonlinear Problems (NLP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) A Packet Routing Method Based on a Hogg-Huberman Strategy
Sub Title (in English)
Keyword(1) packet network
Keyword(2) computaional ecology
Keyword(3) distributed control
Keyword(4) routing
1st Author's Name Tatsushi Yamasaki
1st Author's Affiliation Graduate School of Engineering Science, Osaka University()
2nd Author's Name Toshimitsu Ushio
2nd Author's Affiliation Graduate School of Engineering Science, Osaka University
Date 1997/10/6
Paper # NLP97-85-98
Volume (vol) vol.97
Number (no) 300
Page pp.pp.-
#Pages 8
Date of Issue