| Project/Area Number |
04650355
|
|---|
| Research Category |
Grant-in-Aid for General Scientific Research (C)
|
| Allocation Type | Single-year Grants |
|---|
| Research Field |
計測・制御工学
|
|---|
| Research Institution | Tohoku University |
|---|
Principal Investigator |
SATO Mitsuo (1993) Tohoku University, GSIS, Assistant Professor, 大学院・情報科学研究科, 助教授 (80111251)
竹田 宏 (1992) 東北大学, 工学部, 教授 (60005220)
|
|---|
| Co-Investigator(Kenkyū-buntansha) |
SATO Mituo Tohoku University, GSIS, Assistant Professor (80111251)
|
|---|
| Project Period (FY) |
1992 – 1993
|
| Project Status |
Completed (Fiscal Year 1993)
|
| Budget Amount *help |
¥1,700,000 (Direct Cost: ¥1,700,000)
Fiscal Year 1993: ¥700,000 (Direct Cost: ¥700,000)
Fiscal Year 1992: ¥1,000,000 (Direct Cost: ¥1,000,000)
|
|---|
| Keywords | Telephone Network / Routing / Learning Control / Load Equalization / Blicking / Routing Domain / 迂回候補路 |
|---|
| Research Abstract |
In 1992, by applying our previously presented learning control scheme to a telephone network we designed and presented a a routing scheme with aim at load equalization on the network. This scheme chooses a route which minimizeds a weighted blocking frequency from an appropriately determined set of routes. It was shown that this scheme achieves the load equalization in the sense that the blocking frequencies asymptotically become equal amoug the set of routes. According to computer simulation, it was ascertained that our scheme is superior in blocking count and average route length to the scheme using learning automata. However, it was found that the characteristic of load equalization greatly depends on determination of the set of routes.
Viewing recent rapid development of functions of network observation and control, we can expect that higher performance routing than that considered in 1992 is realizable. From this, in 1993, we presented a learning routing scheme which achieves more strict load equalization based on information about call generation at all stations. This scheme seeks blocking equalization among links by adaptively assigning overflow calls from main sources generating congestion to vacant routes. According to detailed computer simulation, it was ascertained that our new scheme is most superior compared with our previous one and the state-dependent scheme under various conditions in the case that we determined the set of routes using the design method of a routing domain presented by other investigators.
Significance of this research is that it was shown theoretically and practically that our schemes achieve load equalization which is not ensured by the present schemes. Our research results will be useful for development of available routing schemes in future.
|
