Routing protocol

Computer network

Mathematics

Evolutionary biology

Biology

Knapsack problem

Algorithm

Mathematical optimization

Function (biology)

Blocking (statistics)

Static routing

Path (computing)

Computer science

Routing (electronic design automation)

Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE

This paper presents an analytical framework for evaluating and optimizing routing and path establishment strategies for multimedia communication in an integrated services network. Based on a given routing strategy, we show how to determine the probability of success for the establishment phase by using a stochastic knapsack approximation. Our method can be used to optimize the assignment routing paths in a manner which maximizes the probability of the network being able to support multimedia connection requests. This is done through the use of a new cost function called the marginal blocking cost of a link.

&lt;title&gt;Real-time multistream routing over integrated services networks&lt;/title&gt;

&lt;title&gt;Real-time multistream routing over integrated services networks&lt;/title&gt;

<title>Real-time multistream routing over integrated services networks</title>