DATA COMMUNICATIONS NETWORK DESIGN WITH PRIORITIES: CAPACITY ALOCATION AND ROUTING / PROJETO DE REDES PARA COMUNICAÇÃO DE DADOS COM PRIORIDADES: ALOCAÇÃO DE CAPACIDADES E ENCAMINHAMENTO

AUTOR(ES)
DATA DE PUBLICAÇÃO

1980

RESUMO

The work begins with a rewiew of some Project techniques for packet switching data communication networks. Two aspects of the project are studied: the capacity assignment and the traffic routing. It has already been shown by means of heuristic methods used in the project of this kind of network that it is possible to decrease the cost of the network by dividing the packet traffic into priority classes. In this work we present an optimal method to establish the capacity assignment of networks which are designed to fulfill a priority phylosophy. This method allows evaluation of several heuristic techniques. The traffic routing divided in priority classes is also studied, but in a superficial way. Finally, an algorithm with the aim of attaining the simultaneous capacity and flow assignment is proposed. This algorithm is tested in a sample with only one priority.

ACESSO AO ARTIGO

Documentos Relacionados