| Presentation | 2003/2/11 Reward-Maximized CAC and Routing for Multi-Point Connections VAN Tien PHAM, Yoshiaki TANAKA, |
|---|---|
| PDF Download Page | PDF download Page Link |
| Abstract(in Japanese) | (See Japanese page) |
| Abstract(in English) | This study introduces Reinforcement Learning (RL) to solve call admission control and routing problem for multi-point connections in networks serving multiple service classes. It presents a model formulating the CAC (Call Admission Control) and Routing as a problem of control, then decomposition is implemented to make the solution manageable. Finally, simulation results demonstrate the prominence of RL-based routing in comparison to MOSPF (Multicast extension to Open Shortest Path First) protocol. |
| Keyword(in Japanese) | (See Japanese page) |
| Keyword(in English) | CAC / Routing / Multi-point Connection / Reinforcement Learning / Reward |
| Paper # | OCS2002-115,NS2002-225 |
| Date of Issue |
| Conference Information | |
| Committee | OCS |
|---|---|
| Conference Date | 2003/2/11(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 | Optical Communication Systems (OCS) |
|---|---|
| Language | ENG |
| Title (in Japanese) | (See Japanese page) |
| Sub Title (in Japanese) | (See Japanese page) |
| Title (in English) | Reward-Maximized CAC and Routing for Multi-Point Connections |
| Sub Title (in English) | |
| Keyword(1) | CAC |
| Keyword(2) | Routing |
| Keyword(3) | Multi-point Connection |
| Keyword(4) | Reinforcement Learning |
| Keyword(5) | Reward |
| 1st Author's Name | VAN Tien PHAM |
| 1st Author's Affiliation | Global Information and Telecommunication Institute, Waseda University() |
| 2nd Author's Name | Yoshiaki TANAKA |
| 2nd Author's Affiliation | Global Information and Telecommunication Institute, Waseda University:Advanced Research Institute for Science and Engineering, Waseda University |
| Date | 2003/2/11 |
| Paper # | OCS2002-115,NS2002-225 |
| Volume (vol) | vol.102 |
| Number (no) | 649 |
| Page | pp.pp.- |
| #Pages | 4 |
| Date of Issue | |