Branch-and -Price Algorithm for a Combined Problemof Virtual Path Establishment and Traffic Packet Routing in a Layered Communivation Network

Cited 7 time in webofscience Cited 0 time in scopus
  • Hit : 388
  • Download : 0
This paper considers a combined problem of establishing virtual paths (VPs) and routing traffic (packet) demands through the virtual paths in a layered communication network where each physical link is subject to its capacity constraints. The problem is modeled as a path-based formulation for which a branch-and-price solution algorithm is derived. The solution algorithm is composed of an efficient pricing algorithm, and also a branching rule based on a variable dichotomy, which does not destroy the structure of the associated pricing problems. Computational experiments are performed to test the efficiency of the algorithm, which show that the algorithm works quite well in finding optimal solutions (for the test instances) within reasonable time. Its immediate application may be made to a centralized network management on mid-term global reconfiguration and long-term VP planning.
Publisher
Palgrave Macmillan Ltd
Issue Date
2003
Language
English
Article Type
Article
Keywords

ATM NETWORKS; COLUMN GENERATION; DESIGN; SYSTEM

Citation

JOURNAL OF THE OPERATIONAL RESEARCH SOCIETY, v.54, no.1, pp.72 - 82

ISSN
0160-5682
URI
http://hdl.handle.net/10203/82190
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 7 items in WoS Click to see citing articles in records_button

qr_code

  • mendeley

    citeulike


rss_1.0 rss_2.0 atom_1.0