Generalization of the ECCS method to the multihour case

Author

Girard, André ; Lansard, Pierre-Dominique ; Liau, Bernard

Author_Institution

INRS-Telecommun., Ile des Soeurs, Que., Canada

Volume

39

Issue

1

fYear

1991

fDate

1/1/1991 12:00:00 AM

Firstpage

76

Lastpage

84

Abstract

The classical ECCS method for dimensioning hierarchical telephone networks is extended to the multihour case. The problem is reformulated as a nonlinear optimization method, and the Kuhn-Tucker equations are derived. It is shown why the ECCS method cannot solve this multihour case. The ECCS method is presented as a solution technique for the Lagrangian relaxation of the multihour problem in which subgradient techniques are used for the solution of the dual. A numerical algorithm implementing these ideas is described that can handle networks with arbitrary hierarchies and allows time-of-day routing changes. Preliminary numerical results of the method are presented, showing that the multihour algorithm can reduce a network´s cost when compared to currently used methods

Keywords

switching networks; telephone networks; ECCS method; Kuhn-Tucker equations; Lagrangian relaxation; arbitrary hierarchies; dimensioning method; hierarchical telephone networks; multihour case; nonlinear optimization method; numerical algorithm; time-of-day routing changes; Cities and towns; Computer aided software engineering; Costs; Lagrangian functions; Nonlinear equations; North America; Optimization methods; Routing; Telecommunication traffic; Telephony;

fLanguage

English

Journal_Title

Communications, IEEE Transactions on

Publisher

ieee

ISSN

0090-6778

Type

jour

DOI

10.1109/26.68278

Filename

68278