DocumentCode
291084
Title
On the design of communication networks using restricted message routing
Author
Poguntke, Werner
Author_Institution
Fachgebiet Kommunikationssysteme, Open Univ. Hagen, Germany
Volume
2
fYear
1993
fDate
23-26 May 1993
Firstpage
681
Abstract
Routing plans on graphs with a limited number of entries for each origination-destination pair are considered. For a given graph, the problem is to construct a routing plan satisfying several criteria. Some results concerning the criteria and their interrelationships are presented. There are graphs that do not allow certain criteria to be satisfied simultaneously. The aspect of graph design is also considered
Keywords
graph theory; message switching; telecommunication network routing; criteria; design of communication networks; graph design; restricted message routing; routing plan; Communication networks; Mathematical programming; Protocols; Routing; Telegraphy; Telephony;
fLanguage
English
Publisher
ieee
Conference_Titel
Communications, 1993. ICC '93 Geneva. Technical Program, Conference Record, IEEE International Conference on
Conference_Location
Geneva
Print_ISBN
0-7803-0950-2
Type
conf
DOI
10.1109/ICC.1993.397361
Filename
397361
Link To Document