The design of store-and-forward (s/f) networks for computer communications
The design of store-and-forward (s/f) networks for computer communications
Communication nets; stochastic message flow and delay
Communication nets; stochastic message flow and delay
Emulation of computer networks by microprogrammable microcomputers
MICRO 7 Conference record of the 7th annual workshop on Microprogramming
Bifurcated routing in computer networks
ACM SIGCOMM Computer Communication Review
Problems in the design of control procedures for computer networks
ACM SIGCOMM Computer Communication Review
Coupling small computers for performance enhancement
AFIPS '76 Proceedings of the June 7-10, 1976, national computer conference and exposition
Computer communication networks: the parts make up the whole
AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
Issues in packet switching network design
AFIPS '75 Proceedings of the May 19-22, 1975, national computer conference and exposition
Research: Routing in packet-switched communication networks
Computer Communications
A system for the design of packet-switched communication networks with economic tradeoffs
Computer Communications
| Hi-index | 0.00 |
Efficient routing policies are required for both design and operation of distributed, packet-switched computer networks. In the network design process, deterministic policies, which are time invariant, easy to analyze and simple to represent, are generally used. For the routing of packets in a real network, on the other hand, adaptive policies, which can adjust to traffic fluctuations and component failures are implemented. Therefore, a computer network is typically optimized with respect to a deterministic policy and then operated with an adaptive policy. In the first part of this paper the two policies are compared using analytical and simulation methods, and it is shown that, in uniform traffic situations, the flow patterns generated are very similar. This result justifies the use of deterministic policy in the design phase. In the second part of the paper, the inadequacy of traditional adaptive policies in handling particular traffic situations is pointed out. As a solution, a new centralized adaptive policy is proposed, which combines the positive features of both deterministic and adaptive routing. The feasibility of such centralized policy implementation on a real network, and its efficiency with respect to the traditional implementation is discussed.