Library

feed icon rss

Your email was sent successfully. Check your inbox.

An error occurred while sending the email. Please try again.

Proceed reservation?

Export
  • 1
    Electronic Resource
    Electronic Resource
    Springer
    Journal of network and systems management 5 (1997), S. 131-157 
    ISSN: 1573-7705
    Source: Springer Online Journal Archives 1860-2000
    Topics: Computer Science
    Notes: Abstract This paper presents a scenario-orientedoptimization model and solution algorithm to solve thejoint routing/capacity assignment problem for computernetworks. The advantage of this model is that failures are directly dealt with at the design stage.The model helps to find a suitable trade-off betweencapacity assignment and performance in the event offailures. As accounting for major failures can be very time consuming, we introduce parallelism as atool to solve this type of problem. Two parallelversions of the algorithm were implemented. Bothparallel versions were found to be extremely efficientin reducing computational time, the one presentingtwo levels of parallelization was found more suitablefor larger networks.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 2
    Electronic Resource
    Electronic Resource
    Springer
    Telecommunication systems 1 (1993), S. 133-148 
    ISSN: 1572-9451
    Source: Springer Online Journal Archives 1860-2000
    Topics: Electrical Engineering, Measurement and Control Technology
    Notes: Abstract With the advent of non-hierarchical routing in circuit-switched telecommunication networks, on-line routing policies have been developed with the objective of optimizing some measure of gain or performance. These policies are decentralized. However, traditional planning models are centralized models. We present a decentralized routing model to be used in network planning. We compare it theoretically and empirically with a centralized multicommodity flow model previously presented. The two models are solved by the same type of algorithm, a convex simplex implementation, adapted differently according to the model. Comparative results between planning models reproducing the two policies are discussed.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 3
    Electronic Resource
    Electronic Resource
    Springer
    Annals of operations research 36 (1992), S. 263-274 
    ISSN: 1572-9338
    Keywords: Network dimensioning ; telecommunications ; reliability ; circuit switching ; routing
    Source: Springer Online Journal Archives 1860-2000
    Topics: Mathematics , Economics
    Notes: Abstract In this paper we introduce a new methodology to adjust link capacities in circuit switched networks taking into account the costing policy and reliability considerations. This methodology, which is an extension of previous work on reliability evaluation using routing models, is based on a cyclic decomposition algorithm which alternates between a routing subproblem and a link capacity adjustment subproblem. The proposed procedure, which is shown to converge to a global optimum for the dimensioning/routing problem, has been tested on a 14 undirected arc problem for various levels of link failure probability. The numerical results are extremely satisfactory and they demonstrate the usefulness of the proposed method for proper network dimensioning.
    Type of Medium: Electronic Resource
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
  • 4
    Title: Telecommunications network planning
    Contributer: Sanso, Brunilde , Soriano, Patrick
    Publisher: Dordrecht u.a. :Kluwer,
    Year of publication: 1999
    Pages: 270 S.
    Series Statement: Centre for Research on Transportation 25th anniversary series 1971-1996
    Type of Medium: Book
    Library Location Call Number Volume/Issue/Year Availability
    BibTip Others were also interested in ...
Close ⊗
This website uses cookies and the analysis tool Matomo. More information can be found here...