AN ALGORITHM FOR CONFIGURING EMBEDDED NETWORKS IN RECONFIGURABLE TELECOMMUNICATION NETWORKS

Cited 4 time in webofscience Cited 0 time in scopus
  • Hit : 266
  • Download : 0
This paper considers a problem of configuring logical networks by employing a self-planning facility in a telecommunication network carrying voice-grade calls to make the least-cost configuration where the involved system cost includes hop cost and lost-call traffic cost. The hop cost depends on the number of self-planning facilities included on routing path connecting the associated node pairs, while the lost-call traffic cost is incurred due to link capacities. The configuration problem is analyzed through dimensioning and routing on a reconfigurable network in a mixed 0/1 nonlinear programming approach for which lower bounds are found by Lagrangian relaxation embedded in a hybrid search procedure for the associated dual problem. Heuristic solution procedures are exploited and their efficiencies are tested with various numerical examples.
Publisher
BALTZER SCI PUBL BV
Issue Date
1995
Language
English
Article Type
Article
Keywords

ERLANG

Citation

TELECOMMUNICATION SYSTEMS, v.4, no.3-4, pp.241 - 271

ISSN
1018-4864
DOI
10.1007/BF02110089
URI
http://hdl.handle.net/10203/69721
Appears in Collection
IE-Journal Papers(저널논문)
Files in This Item
There are no files associated with this item.
This item is cited by other documents in WoS
⊙ Detail Information in WoSⓡ Click to see webofscience_button
⊙ Cited 4 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0