Priorities and Pay Function Routing for a Packet Switching Network

Butrimenko, A. & Sichra, U. (1975). Priorities and Pay Function Routing for a Packet Switching Network. IIASA Working Paper. IIASA, Laxenburg, Austria: WP-75-117

Preview

Text WP-75-117.pdf Download (752kB) | Preview

Abstract

In every network there arises the problem of choosing a path for a message so that it reaches its destination. If there are many users requesting the same channel it could be occupied and another would have to be chosen, provided that it would also be a good path and free, otherwise the message would have to queue up.

The choice of an objective function for the selection procedure of a path is part of the decision process when constructing the routing algorithm. The selection is carried out with respect to an objective function which is maximized (or minimized). There exist some useful objective functions commonly used for routing in a computer network: minimization of distance, minimization of delay or cumulative costs, maximization of throughput or reliability, etc.

Actions (login required)

View Item