Usage characteristics of detour routes in store-and-forward switching networks
Abstract
This paper discusses characteristics of detour routes in store-and-forward switching networks for the traffic route assignments one of which is obtained by the optimum route assignment theorem and the other the equal delay principle when message length is generally distributed. The optimum route assignment theorem gives necessary and sufficient conditions for the route assignment to have minimum average message or packet delay-time over a whole network. The equal-delay-principle, which is widely employed in traffic control, can be considered as a theoretical base for determination of an adaptive route using estimated delay-time. Both traffic assignments obtained by the optimum route assignment and equal delay principle use detour routes to reduce the delay caused by increase of traffic rate. This paper shows that regardless of line capacities and message (or packet) length distribution, the case of the optimum route assignment employs detour route at the smaller traffic rate than equal delay principle. Furthermore, this paper chooses one-stage parallel route model to show how line capacities and coefficients of variation of message length influences usage of detour routes for these two methods.
- Publication:
-
Electronics Communications of Japan
- Pub Date:
- January 1983
- Bibcode:
- 1983JElCo..66...78K
- Keywords:
-
- Communication Networks;
- Network Control;
- Optimal Control;
- Switching Circuits;
- Traffic Control;
- Adaptive Control;
- Algorithms;
- Data Storage;
- Data Transmission;
- Message Processing;
- Packet Switching;
- Time Lag;
- Transmission Efficiency;
- Communications and Radar