The Two-Criteria Gateways Location and Topology Assignment Problem in Hierarchical WANs: An Exact Algorithm and Computational Results

Ryba, Przemyslaw; Kasprzak, Andrzej

doi:10.1007/978-3-540-69848-7_71

Cited by 2 publications

(2 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Flow deviation, proposed in (Fratta et al, 1973), has been applied to a wide range of optimization problems (Burns et al, 2003;Fratta et al, 1973;Kasprzak, 2001;Markowski and Kasprzak, 2005;Piro and Medhi, 2004;Ryba and Kasprzak, 2006;Walkowiak, 2004;. Below we present a heuristic algorithm called CFD (uniCast and anyCast Flow Deviation) based on the original FD method proposed for non-bifurcated flows.…”

Section: Algorithm Based On the Flow Deviation Methodmentioning

confidence: 99%

Anycasting in connection-oriented computer networks: Models, algorithms and results

Walkowiak

2010

International Journal of Applied Mathematics and Computer Science

View full text Add to dashboard Cite

Our discussion in this article centers around various issues related to the use of anycasting in connection-oriented computer networks. Anycast is defined as a one-to-one-of-many transmission to deliver a packet to one of many hosts. Anycasting can be applied if the same content is replicated over many locations in the network. Examples of network techniques that apply anycasting are Content Delivery Networks (CDNs), Domain Name Service (DNS), Peer-to-Peer (P2P) systems. The role of anycasting is growing concurrently with the popularity of electronic music, movies, and other content required by Internet users. In this work we focus on the optimization of anycast flows in connection-oriented networks. We formulate a model of anycast connections and next propose a heuristic algorithm based on the Lagrangean relaxation aimed to optimize jointly routes for anycast and unicast connections. Results of numerical experiments are presented and evaluated. Finally, we analyze briefly problems related to anycasting in dynamic routing and multi-layer networks.

show abstract

Section: Algorithm Based On the Flow Deviation Methodmentioning

confidence: 99%

Anycasting in connection-oriented computer networks: Models, algorithms and results

Walkowiak

2010

International Journal of Applied Mathematics and Computer Science

View full text Add to dashboard Cite

show abstract

“…The LRH algorithm with mFDP applied in step 2b is called in the rest of the paper as LRH_FD. Note that algorithms based on Flow Deviation were applied to a wide range of optimization problems [2,19,20,25,29]. For more details on FD and FDP please refer to [5,30,32].…”

Section: Lagrangean Relaxation Heuristic (Lrh) Algorithmmentioning

confidence: 99%

Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks

Walkowiak

2007

Comput Optim Appl

View full text Add to dashboard Cite

Our discussion in this article centers on the application of a Lagrangean relaxation and a subgradient optimization technique to the problem of primary route assignment (PRA) in survivable connection-oriented networks. The PRA problem consists in a static optimization of primary routes minimizing the Lost Flow in Node (LFN) function. The major contribution of this work is a combination of the Lagrangean relaxation with other heuristic algorithms. We evaluate the performance of the proposed Lagrangean-based heuristic by making a comparison with their counterparts including evolutionary algorithm and GRASP using various network topologies and demand patterns. The results of simulation tests show that the new algorithm provides sub-optimal results, which are better than other heuristics.

show abstract

The Two-Criteria Gateways Location and Topology Assignment Problem in Hierarchical WANs: An Exact Algorithm and Computational Results

Cited by 2 publications

References 9 publications

Anycasting in connection-oriented computer networks: Models, algorithms and results

Anycasting in connection-oriented computer networks: Models, algorithms and results

Lagrangean heuristic for primary routes assignment in survivable connection-oriented networks

Contact Info

Product

Resources

About