Sie befinden Sich nicht im Netzwerk der Universität Paderborn. Der Zugriff auf elektronische Ressourcen ist gegebenenfalls nur via VPN oder Shibboleth (DFN-AAI) möglich. mehr Informationen...
A model and algorithm for interconnecting two WANs
Ist Teil von
1990 IEEE International Conference on Systems, Man, and Cybernetics Conference Proceedings, 1990, p.301-306
Ort / Verlag
IEEE
Erscheinungsjahr
1990
Quelle
IEEE Xplore
Beschreibungen/Notizen
The authors consider the problem of determining which gateways to use to interconnect existing wide area networks (WANs) to minimize a linear combination of the average internet and intranet packet delays subject to a cost constraint on the amount to be spent to establish the gateways. This problem is formulated as a nonlinear combinational optimization problem. When the gateway locations are fixed, the resulting routing problem is not a convex programming problem. An algorithm to solve this problem is developed, and computational experience is reported. For light intranet traffic, the algorithm computed solutions that were within 6% of an optimal solution. For medium intranet traffic, the algorithm did not perform as well (error ranging from 5.7% to 16%). In addition, the CPU time used was higher for medium intranet traffic than for light intranet traffic.< >