Deterministic algorithm for VP assignment in ATM networks

Aydemir, Metin; Viniotis, Yannis

doi:10.1016/s0140-3664(97)84934-1

Cited by 7 publications

(3 citation statements)

References 17 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Lee and Yee [11] study the reconfiguration capability in ATM networks and its ability to reduce ATM cell losses. Aydemir and Viniotis [4] consider designing the virtual path network that minimizes the cost of network design subject to a set of quality of service constraints given a network topology, link capacities and traffic demands.…”

Section: Literature Reviewmentioning

confidence: 99%

ATM network design for corporate networks

Narasimhan

Soni

Song³

2006

European Journal of Operational Research

View full text Add to dashboard Cite

Section: Literature Reviewmentioning

confidence: 99%

ATM network design for corporate networks

Narasimhan

Soni

Song³

2006

European Journal of Operational Research

View full text Add to dashboard Cite

“…In the hierarchical approach, the route of each VC in a physical network is determined in advance, based on which the VP assignment is then made without modifying any physical route of the VC. Using this hierarchical approach, Ahn et al, 8 Aydemir and Viniotis, 9 Gerstel et al, 7,10 and Panicker et al 11 have developed their solution algorithms. Another hierarchical approach is that a VP-based network (VP network) is initially established and then the VC routing problem is solved based on the established VP network instead of the original physical network.…”

Section: Introductionmentioning

confidence: 99%

Branch-and-price algorithm for a combined problem of virtual path establishment and traffic packet routing in a layered communication network

Sung

Song

2003

Journal of the Operational Research Society

View full text Add to dashboard Cite

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.

show abstract

“…In the network design phase, the LSP capacity allocation is an NP-hard optimization problem (Aneroussis and Lazar, 1996;Aydemir and Viniotis, 1996;Fayek, 2001;Gerstel et al, 1996;Lim and Chae, 2001). A variety of approaches that aim to find the near-optimal LSP configuration in MPLS networks is found in the literature.…”

mentioning

confidence: 99%

Non-linear game models for large-scale network bandwidth management

2006

View full text Add to dashboard Cite

The design of dynamic Label-Switched Paths (LSP's) in MultiProtocol Label Switched (MPLS) networks is an NP-hard optimization problem. An LSP is a logical path between two nodes in the network. This path has a pre-reserved amount of bandwidth that defines its size. The LSP design problem consists of determining the number of these logical links and configuring the physical path and the size of each LSP. This paper presents an optimization model based on game theory. In this approach, connection requests are modeled as competitive players in a noncooperative game context. The transport network bandwidth constitutes the resource for which optimization is sought. The outcome of this optimization is a set of LSPs upon which the competing connections are routed.

show abstract

Deterministic algorithm for VP assignment in ATM networks

Cited by 7 publications

References 17 publications

ATM network design for corporate networks

ATM network design for corporate networks

Branch-and-price algorithm for a combined problem of virtual path establishment and traffic packet routing in a layered communication network

Non-linear game models for large-scale network bandwidth management

Contact Info

Product

Resources

About